Dr Konstantinos Tsakalidis

Computer Science

Publications

2019

Dynamic Orthogonal Range Searching on the RAM, Revisited (Journal article)

Tsakalidis, K., & Chan, T. M. (2019). Dynamic Orthogonal Range Searching on the RAM, Revisited. Journal of Computational Geometry, 9(2), 45-66. doi:10.20382/jocg.v9i2a5

DOI: 10.20382/jocg.v9i2a5

External memory priority queues with decrease-key and applications to graph algorithms (Journal article)

Iacono, J., Jacob, R., & Tsakalidis, K. (n.d.). External memory priority queues with decrease-key and applications to graph algorithms. Retrieved from http://arxiv.org/abs/1903.03147v2

2018

Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges (Journal article)

Afshani, P., & Tsakalidis, K. (2018). Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges. ALGORITHMICA, 80(11), 3192-3206. doi:10.1007/s00453-017-0376-3

DOI: 10.1007/s00453-017-0376-3

Dynamic planar orthogonal point location in sublogarithmic time (Conference Paper)

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

DOI: 10.4230/LIPIcs.SoCG.2018.25

Orthogonal Point Location and Rectangle Stabbing Queries in 3-d (Journal article)

Chan, T. M., Nekrich, Y., Rahul, S., & Tsakalidis, K. (n.d.). Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. Retrieved from http://arxiv.org/abs/1805.08602v1

Dynamic Planar Orthogonal Point Location in Sublogarithmic Time. (Conference Paper)

Chan, T. M., & Tsakalidis, K. (2018). Dynamic Planar Orthogonal Point Location in Sublogarithmic Time.. In B. Speckmann, & C. D. Tóth (Eds.), Symposium on Computational Geometry Vol. 99 (pp. 25:1). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. Retrieved from http://www.dagstuhl.de/dagpub/978-3-95977-066-8

Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. (Journal article)

Chan, T. M., Nekrich, Y., Rahul, S., & Tsakalidis, K. (2018). Orthogonal Point Location and Rectangle Stabbing Queries in 3-d.. CoRR, abs/1805.08602.

2017

Dynamic orthogonal range searching on the RAM, Revisited (Conference Paper)

Chan, T. M., & Tsakalidis, K. (2017). Dynamic orthogonal range searching on the RAM, Revisited. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 77 (pp. 281-2813). doi:10.4230/LIPIcs.SoCG.2017.28

DOI: 10.4230/LIPIcs.SoCG.2017.28

Fuzzy Random Walkers with Second Order Bounds: An Asymmetric Analysis (Journal article)

Drakopoulos, G., Kanavos, A., & Tsakalidis, K. (n.d.). Fuzzy Random Walkers with Second Order Bounds: An Asymmetric Analysis. Algorithms, 10(2), 40. doi:10.3390/a10020040

DOI: 10.3390/a10020040

Dynamic Orthogonal Range Searching on the RAM, Revisited. (Conference Paper)

Chan, T. M., & Tsakalidis, K. (2017). Dynamic Orthogonal Range Searching on the RAM, Revisited.. In B. Aronov, & M. J. Katz (Eds.), Symposium on Computational Geometry Vol. 77 (pp. 28:1). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. Retrieved from http://www.dagstuhl.de/dagpub/978-3-95977-038-5

2016

Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings (Journal article)

Chan, T. M., & Tsakalidis, K. (2016). Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings. DISCRETE & COMPUTATIONAL GEOMETRY, 56(4), 866-881. doi:10.1007/s00454-016-9784-4

DOI: 10.1007/s00454-016-9784-4

2015

SMaRT: A novel framework for addressing range queries over nonlinear trajectories (Journal article)

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

DOI: 10.1016/j.jss.2015.03.068

Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings (Conference Paper)

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

DOI: 10.4230/LIPIcs.SOCG.2015.719

2014

Dynamic 3-sided planar range queries with expected doubly-logarithmic time (Journal article)

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

DOI: 10.1016/j.tcs.2014.01.014

Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM (Conference Paper)

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 http://gateway.webofknowledge.com/

Optimal deterministic shallow cuttings for 3D dominance ranges (Conference Paper)

Afshani, P., & Tsakalidis, K. (2014). Optimal deterministic shallow cuttings for 3D dominance ranges. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1389-1398).

2013

I/O-Efficient Planar Range Skyline and Attrition Priority Queues (Conference Paper)

Kejlberg-Rasmussen, C., Tao, Y., Tsakalidis, K., Tsichlas, K., & Yoon, J. (n.d.). I/O-Efficient Planar Range Skyline and Attrition Priority Queues. Retrieved from http://arxiv.org/abs/1306.2815v1

2012

I/O-Efficient Dynamic Planar Range Skyline Queries (Journal article)

Kejlberg-Rasmussen, C., Tsakalidis, K., & Tsichlas, K. (n.d.). I/O-Efficient Dynamic Planar Range Skyline Queries. Retrieved from http://arxiv.org/abs/1207.2341v1