About Me

I am a Postdoc Researcher at LUISS Guido Carli in Rome.

I received my PhD degree from the Department of Mathematics, University of Ioannina in 2021 under the supervision of Associate Professor Charis Papadopoulos. I received my B.Sc and M.Sc degrees from the same department at 2014 and 2016 respectively.

e-mail: akonstantinidis@luiss.it

Curriculum Vitae

Research Interests

Algorithmic Graph Theory
Design and Analysis of Algorithms

Publications

Journal Papers

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

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 (Accepted).
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.

Labs Assistant

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