Athanasios L. Konstantinidis

Short bio

Athanasios Konstantinidis is an Assistant Professor at the Department of Mathematics, Aristotle University of Thessaloniki (AUTH). Before joining AUTH, he served as a Visiting Professor at the Department of Mathematics, University of Ioannina. During 2021–2024, he was a Postdoctoral Researcher at LUISS Guido Carli in Rome, working under the supervision of Professor Giuseppe F. Italiano.

He received his PhD in Mathematics from the University of Ioannina in 2021, supervised by Associate Professor Charis Papadopoulos. He also holds a B.Sc. (2014) and an M.Sc. (2016) in Mathematics from the same department.

e-mail: akonstantinidis@math.auth.gr, a.konstantinidis@uoi.gr

Curriculum Vitae

Google Scholar

DBLP

Research Interests

Algorithmic Graph Theory
Design and Analysis of Algorithms
Theoretical Computer Science

Publications

Journal Papers

Consistent tie-strength labeling for multilayer strong triadic closure.
Lutz Oettershagen, Athanasios L. Konstantinidis, Fariba Ranjbar, Giuseppe F. Italiano.
Data Mining Knowledge Discovery, Springer, 40, 46 (2026).
Structural Parameterization of Cluster Deletion.
Giuseppe F. Italiano, Athanasios L. Konstantinidis, and Charis Papadopoulos.
Algorithmica (2025). (Invited article)
Inferring tie strength in temporal networks.
Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano.
Data Mining and Knowledge Discovery, Springer, 2025.
Cluster deletion on interval graphs and split related graphs.
Athanasios L. Konstantinidis and Charis Papadopoulos.
Algorithmica 83, 2018–2046 (2021).
Maximizing the strong triadic closure in split graphs and proper interval graphs.
Athanasios L. Konstantinidis and Charis Papadopoulos.
Discrete Applied Mathematics 285: 79-95, 2020.
Parameterized aspects of strong subgraph closure.
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, and Charis Papadopoulos.
Algorithmica 82: 2006-2038, 2020.
Strong triadic closure in cographs and graphs of low maximum degree.
Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, and Charis Papadopoulos.
Theoretical Computer Science 740: 76 -84, 2018.

Refereed Conference Papers

Algorithms and Lower Bounds for Hedge Cluster Deletion Problems.
Athanasios L. Konstantinidis, Charis Papadopoulos, and Georgios Velissaris.
The 37th International Symposium on Algorithms and Computation (ISAAC 2026), Hangzhou, China, 2026. Leibniz-Zentrum fur Informatik, LIPIcs (Accepted).
On Graph Burning and Edge Burning.
Giuseppe F. Italiano, Athanasios L. Konstantinidis and Manas Jyoti Kashyop.
From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday, (Satellite workshop of SEA 2025) (2025).
An Edge-Based Decomposition Framework for Temporal Networks.
Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano.
ACM International Conference on Web Search and Data Mining (WSDM), 2025.
Online Drone Scheduling for Last-mile Delivery.
Saswata Jana, Giuseppe F. Italiano, Manas Jyoti Kashyop, Athanasios L. Konstantinidis, Evangelos Kosinas and Partha Sarathi Mandal.
31st International Colloquium On Structural Information and Communication Complexity, (SIROCCO 2024), Italy, 2024.
Structural Parameterization of Cluster Deletion.
Giuseppe F. Italiano, Athanasios L. Konstantinidis, and Charis Papadopoulos.
17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Hsinchu, Taiwan, 2023. Springer Verlag, LNCS 13973: 371--383.
Inferring Tie Strength in Temporal Networks.
Lutz Oettershagen, Athanasios L. Konstantinidis, and Giuseppe F. Italiano.
Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), 2022.
Cluster deletion on interval graphs and split related graphs.
Athanasios L. Konstantinidis and Charis Papadopoulos.
44th International Symposium on Mathematical Foundations of Computer Science, (MFCS 2019), Aachen, Germany, 2019. Leibniz-Zentrum fur Informatik, LIPIcs 138: 12(1)-12(14), 2019.
Parameterized aspects of strong subgraph closure.
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, and Charis Papadopoulos.
16th Scandinavian Symposium and Workshops on Algorithm Theory, (SWAT 2018), Malmo, Sweden, 2018. Leibniz-Zentrum fur Informatik, LIPIcs 101: 23(1)-23(13), 2018.
Maximizing the strong triadic closure in split graphs and proper interval graphs.
Athanasios L. Konstantinidis and Charis Papadopoulos.
In 28th International Symposium on Algorithms and Computation (ISAAC 2017), Leibniz International Proceedings in Informatics (LIPIcs), pages 53:1--53:12, 2017.
Strong triadic closure in cographs and graphs of low maximum degree.
Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, and Charis Papadopoulos.
23rd Annual International Computing and Combinatorics Conference, (COCOON 2017), Hong Kong, China, 2017. Springer Verlag, LNCS 10392: 346--358.

Teaching

Department of Mathematics, Aristotle University of Thessaloniki
- Fall 2026: Algorithms and Data Structure (Αλγόριθμοι και Δομές Δεδομένων)
- Fall 2026: Advance Topics in Computer Programming (Προχωρημένα Θέματα Προγραμματισμού Η/Υ)
Deptartment of Mathematics, University of Ioannina
- Spring 2025, 2026: Introduction to Symbolic Mathematics (644)
- Fall 2024, 2025: Graph Theory (746)
- Fall 2025: Programming for Data Science (544)
- Spring 2025: Object Oriented Programming (647)
- Fall 2024: Theory of Computation (745)

Labs Assistant

Department of Mathematics, University of Ioannina
- Spring 2011-2019: Introduction to Computers (242)
- Fall 2014-2018: Introduction to Programming (343)
- Fall 2014-2015: Data Structure (541)