Research outputs
2025
Context Informed Deep Convolutional Neural Networks for Image Denoising in STEM
Williams, A. E. D., Robinson, A. W., Wells, J., Tsakalidis, K., Shen, Y. -C., & Browning, N. D. (2025). Context Informed Deep Convolutional Neural Networks for Image Denoising in STEM. Microscopy and Microanalysis, 31(Supplement_1). doi:10.1093/mam/ozaf048.1085
Deep Convolutional Neural Network Based Image Denoising in STEM
Williams, A. E. D., Robinson, A. W., Wells, J., Tsakalidis, K., Shen, Y. -C., & Browning, N. D. (2025). Deep Convolutional Neural Network Based Image Denoising in STEM. In Deep Convolutional Neural Network Based Image Denoising in STEM. ScienceOpen. doi:10.14293/apmc13-2025-0250
2024
Certifying Induced Subgraphs in Large Graphs
Meyer, U., Tran, H., & Tsakalidis, K. (2024). Certifying Induced Subgraphs in Large Graphs. Journal of Graph Algorithms and Applications, 28(3), 49-68. doi:10.7155/jgaa.v28i3.2971
Improved STEM Imaging Using Deep Learning Based Compressed Sensing
Williams, A. E. D., Wells, J., Robinson, A. W., Nicholls, D., Moshtaghpour, A., Kirkland, A. I., . . . Browning, N. D. (2024). Improved STEM Imaging Using Deep Learning Based Compressed Sensing. Microscopy and Microanalysis, 30(Supplement_1). doi:10.1093/mam/ozae044.1024
Deep convolutional neural networks for atomic imaging in STEM
Williams, A., Wells, J., Robinson, A., Nicholls, D., Moshtaghpour, A., Kirkland, A., . . . Browning, N. (2024). Deep convolutional neural networks for atomic imaging in STEM. BIO Web of Conferences, 129, 10021. doi:10.1051/bioconf/202412910021
2023
Succinct Permutation Graphs
Tsakalidis, K., Wild, S., & Zamaraev, V. (2022). Succinct Permutation Graphs. Algorithmica. doi:10.1007/s00453-022-01039-2
Certifying Induced Subgraphs in Large Graphs
Meyer, U., Tran, H., & Tsakalidis, K. (2023). Certifying Induced Subgraphs in Large Graphs. In Unknown Conference (pp. 229-241). Springer Nature Switzerland. doi:10.1007/978-3-031-27051-2_20
2022
Weighted Reservoir Sampling On Evolving Streams: A Sampling Algorithmic Framework For Stream Event Identification
Karras, C., Karras, A., Drakopoulos, G., Tsakalidis, K., Mylonas, P., & Sioutas, S. (2022). Weighted Reservoir Sampling On Evolving Streams: A Sampling Algorithmic Framework For Stream Event Identification. In Proceedings of the 12th Hellenic Conference on Artificial Intelligence (pp. 1-9). ACM. doi:10.1145/3549737.3549767
ORTHOGONAL POINT LOCATION AND RECTANGLE STABBING QUERIES IN 3-D
Chan, T. M., Nekrich, Y., Rahul, S., & Tsakalidis, K. (2022). ORTHOGONAL POINT LOCATION AND RECTANGLE STABBING QUERIES IN 3-D. Journal of Computational Geometry, 13(1), 399-428. doi:10.20382/jocg.v13i1a15
2020
Fully persistent B-trees
Brodal, G. S., Sioutas, S., Tsakalidis, K., & Tsichlas, K. (2020). Fully persistent B-trees. Theoretical Computer Science. doi:10.1016/j.tcs.2020.06.027
Succinct Permutation Graphs
Tsakalidis, K., Wild, S., & Zamaraev, V. (2020). Succinct Permutation Graphs. Retrieved from http://dx.doi.org/10.1007/s00453-022-01039-2
Succinct Permutation Graphs
2019
Cache-Oblivious Priority Queues with Decrease-Key and Applications to Graph Algorithms
External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms
Iacono, J., Jacob, R., & Tsakalidis, K. (2019). External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms. 27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 144. doi:10.4230/LIPIcs.ESA.2019.60
External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms.
Iacono, J., Jacob, R., & Tsakalidis, K. (2019). External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms.. In M. A. Bender, O. Svensson, & G. Herman (Eds.), ESA Vol. 144 (pp. 60:1). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Retrieved from http://www.dagstuhl.de/dagpub/978-3-95977-124-5
2018
Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges
Afshani, P., & Tsakalidis, K. (2018). Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges. Algorithmica: an international journal in computer science, 80(11), 3192-3206. doi:10.1007/s00453-017-0376-3
Dynamic Orthogonal Range Searching on the RAM, Revisited
Tsakalidis, K., & Chan, T. M. (2018). Dynamic Orthogonal Range Searching on the RAM, Revisited. Journal of Computational Geometry, 9(2), 45-66. doi:10.20382/jocg.v9i2a5
Dynamic planar orthogonal point location in sublogarithmic time
Chan, T. M., & Tsakalidis, K. (2018). Dynamic planar orthogonal point location in sublogarithmic time. In Leibniz International Proceedings in Informatics Lipics Vol. 99 (pp. 251-2515). doi:10.4230/LIPIcs.SoCG.2018.25
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d
Chan, T. M., Nekrich, Y., Rahul, S., & Tsakalidis, K. (2018). Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. Retrieved from http://arxiv.org/abs/1805.08602v1
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d
Dynamic Orthogonal Range Searching on the RAM, Revisited.
Chan, T. M., & Tsakalidis, K. (2018). Dynamic Orthogonal Range Searching on the RAM, Revisited.. J. Comput. Geom., 9, 45-66. Retrieved from https://library.carleton.ca/services/open-journal-hosting-ojs
Dynamic Planar Orthogonal Point Location in Sublogarithmic Time.
Chan, T. M., & Tsakalidis, K. (2018). Dynamic Planar Orthogonal Point Location in Sublogarithmic Time.. In B. Speckmann, & C. D. Tóth (Eds.), SoCG Vol. 99 (pp. 25:1). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Retrieved from http://www.dagstuhl.de/dagpub/978-3-95977-066-8
2017
Dynamic Orthogonal Range Searching on the RAM, Revisited.
Chan, T. M., & Tsakalidis, K. (2017). Dynamic Orthogonal Range Searching on the RAM, Revisited.. In LIPIcs : Leibniz International Proceedings in Informatics Vol. 77 (pp. 28:1-28:13). Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik. doi:10.4230/LIPIcs.SoCG.2017.28
Fuzzy Random Walkers with Second Order Bounds: An Asymmetric Analysis
Drakopoulos, G., Kanavos, A., & Tsakalidis, K. (2017). Fuzzy Random Walkers with Second Order Bounds: An Asymmetric Analysis. ALGORITHMS, 10(2). doi:10.3390/a10020040
2016
Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
Chan, T. M., & Tsakalidis, K. (2016). Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings. Discrete and Computational Geometry: an international journal of mathematics and computer science, 56(4), 866-881. doi:10.1007/s00454-016-9784-4
2015
SMaRT: A novel framework for addressing range queries over nonlinear trajectories
Gerolymatos, P., Sioutas, S., Nodarakis, N., Panaretos, A., & Tsakalidis, K. (2015). SMaRT: A novel framework for addressing range queries over nonlinear trajectories. JOURNAL OF SYSTEMS AND SOFTWARE, 105, 79-90. doi:10.1016/j.jss.2015.03.068
Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
Chan, T. M., & Tsakalidis, K. (2015). Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings. In Leibniz International Proceedings in Informatics Lipics Vol. 34 (pp. 719-732). doi:10.4230/LIPIcs.SOCG.2015.719
2014
Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges
Afshani, P., & Tsakalidis, K. (2014). Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1389-1398). Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611973402.102
Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM
Afshani, P., Chan, T. M., & Tsakalidis, K. (2014). Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. In AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I Vol. 8572 (pp. 77-88). Retrieved from https://www.webofscience.com/
2013
Compressed Persistent Index for Efficient Rank/Select Queries
Hon, W. -K., Lee, L. -K., Sadakane, K., & Tsakalidis, K. (2013). Compressed Persistent Index for Efficient Rank/Select Queries. In Unknown Conference (pp. 402-414). Springer Berlin Heidelberg. doi:10.1007/978-3-642-40104-6_35
I/O-efficient planar range skyline and attrition priority queues
Kejlberg-Rasmussen, C., Tao, Y., Tsakalidis, K., Tsichlas, K., & Yoon, J. (2013). I/O-efficient planar range skyline and attrition priority queues. In Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems (pp. 103-114). ACM. doi:10.1145/2463664.2465225
I/O-Efficient Planar Range Skyline and Attrition Priority Queues
I/O-efficient 2-d orthogonal range skyline and attrition priority queues
Kejlberg-Rasmussen, C., Tao, Y., Tsakalidis, K., Tsichlas, K., & Yoon, J. (2020). I/O-efficient 2-d orthogonal range skyline and attrition priority queues. Computational Geometry. doi:10.1016/j.comgeo.2020.101689
2012
I/O-Efficient Dynamic Planar Range Skyline Queries
Kejlberg-Rasmussen, C., Tsakalidis, K., & Tsichlas, K. (2012). I/O-Efficient Dynamic Planar Range Skyline Queries. Retrieved from http://arxiv.org/abs/1207.2341v1
I/O-Efficient Dynamic Planar Range Skyline Queries
Fully Persistent B-Trees
Brodal, G. S., Tsakalidis, K., Sioutas, S., & Tsichlas, K. (2012). Fully Persistent B-Trees. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 602-614). Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611973099.51
Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time
Dynamic 3-sided planar range queries with expected doubly-logarithmic time
Brodal, G. S., Kaporis, A. C., Papadopoulos, A. N., Sioutas, S., Tsakalidis, K., & Tsichlas, K. (2014). Dynamic 3-sided planar range queries with expected doubly-logarithmic time. THEORETICAL COMPUTER SCIENCE, 526, 58-74. doi:10.1016/j.tcs.2014.01.014
An Improved Algorithm for Static 3D Dominance Reporting in the Pointer Machine
Makris, C., & Tsakalidis, K. (2012). An Improved Algorithm for Static 3D Dominance Reporting in the Pointer Machine. In Unknown Conference (pp. 568-577). Springer Berlin Heidelberg. doi:10.1007/978-3-642-35261-4_59
2011
Dynamic Planar Range Maxima Queries
Brodal, G. S., & Tsakalidis, K. (2011). Dynamic Planar Range Maxima Queries. In Unknown Conference (pp. 256-267). Springer Berlin Heidelberg. doi:10.1007/978-3-642-22006-7_22
2010
Efficient processing of 3-sided range queries with probabilistic guarantees
Kaporis, A., Papadopoulos, A. N., Sioutas, S., Tsakalidis, K., & Tsichlas, K. (2010). Efficient processing of 3-sided range queries with probabilistic guarantees. In Proceedings of the 13th International Conference on Database Theory (pp. 34-43). ACM. doi:10.1145/1804669.1804676
2009
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time
Brodal, G. S., Kaporis, A. C., Sioutas, S., Tsakalidis, K., & Tsichlas, K. (2009). Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time. In Unknown Conference (pp. 193-202). Springer Berlin Heidelberg. doi:10.1007/978-3-642-10631-6_21
2008
A new approach on indexing mobile objects on the plane
Sioutas, S., Tsakalidis, K., Tsichlas, K., Makris, C., & Manolopoulos, Y. (2008). A new approach on indexing mobile objects on the plane. Data & Knowledge Engineering, 67(3), 362-380. doi:10.1016/j.datak.2008.06.009
2007
Indexing Mobile Objects on the Plane Revisited
Sioutas, S., Tsakalidis, K., Tsihlas, K., Makris, C., & Manolopoulos, Y. (n.d.). Indexing Mobile Objects on the Plane Revisited. In Unknown Conference (pp. 189-204). Springer Berlin Heidelberg. doi:10.1007/978-3-540-75185-4_15