Journal Papers

Refereed Conference Papers

  • Maximizing the strong triadic closure in split graphs and proper interval graphs.
    Athanasios L. Konstantinidis, and Charis Papadopoulos.
    28th International Symposium on Algorithms and Computation, (ISAAC 2017), Phuket, Thailand, 2017. Leibniz-Zentrum fur Informatik, LIPIcs, to appear. (pdf).
  • Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs.
    Charis Papadopoulos and Spyridon Tzimas.
    21st International Symposium on Fundamentals of Computation Theory, (FCT 2017), Bordeaux, France, 2017. Springer Verlag, LNCS 10472: 381–394 (pdf).
  • 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 (pdf).
  • Sparse subgraphs for 2-connectivity in directed graphs.
    Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, and Nikos Parotsidis.
    15th International Symposium on Experimental Algorithms, (SEA 2016), St. Petersburg, Russia, 2016. Springer Verlag, LNCS 9685: 150-166 (pdf).
  • Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs.
    23rd European Symposium on Algorithms, (ESA 2015), Patras, Greece, 2015. Springer Verlag, LNCS 9294: 582-594 (pdf).
  • Untangling graphs representing spatial relationships.
    Charis Papadopoulos and Constantinos Voglis.
    17th Panhellenic Conference on Informatics, (PCI 2013), Thessaloniki, Greece, 2013. ACM Proceedings, pages 158-165 (pdf).
  • Enumerating minimal subset feedback vertex sets.
    Algorithms and Data Structures Symposium, (WADS 2011), New York, U.S.A, 2011. Springer Verlag, LNCS 6844: 399-410 (pdf).
  • Counting spanning trees in graphs using modular decomposition.
    Stavros D. Nikolopoulos, Leonidas Palios, and Charis Papadopoulos.
    Workshop on Algorithms and Computation, (WALCOM 2011), New Delhi, India, 2011. Springer Verlag, LNCS 6552: 202-213 (pdf).
  • A simple linear-time recognition algorithm for weakly quasi-threshold graphs.
    Stavros D. Nikolopoulos and Charis Papadopoulos.
    8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, (CTW 2009), Ecole Polytechnique and CNAM, Paris, France, pp. 23-27, 2009 (pdf).
  • Strongly chordal and chordal bipartite graphs are sandwich monotone.
    Pinar Heggernes, Federico Mancini, Charis Papadopoulos, and R. Sritharan.
    15th International Computing and Combinatorics Conference, (COCOON 2009), Niagara Falls, New York, U.S.A., 2009. Springer Verlag, LNCS 5609: 398-407 (pdf).
  • A complete characterisation of the linear clique-width of path powers.
    Pinar Heggernes, Daniel Meister, and Charis Papadopoulos.
    6th Annual Conf. on Theory and Applications of Models of Computation, (TAMC 2009), ChangSha, China, 2009. Springer Verlag, LNCS 5532: 241-250 (pdf).
  • A new representation of proper interval graphs with an application to clique-width.
    Pinar Heggernes, Daniel Meister, and Charis Papadopoulos.
    DIMAP Workshop on Algorithmic Graph Theory, (AGT 2009), Warwick, U.K., 2009. Elsevier, ENDM 32: 27-34, 2009.(pdf).
  • Clustering with partial information.
    Hans Bodlaender, Mike Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, and Fran Rosamond.
    33rd Int'l Symposium on Mathematical Foundations of Computer Science, (MFCS 2008), Torun, Poland, 2008. Springer Verlag, LNCS 5162: 144-155 (pdf).
  • Cutwidth of split graphs, threshold graphs, and proper interval graphs.
    Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, and Charis Papadopoulos.
    34th Workshop on Graph-Theoretic Concepts in Computer Science, (WG 2008), Durham, U.K., 2008. Springer Verlag LNCS 5344: 218-229 (pdf).
  • Characterizing and computing minimal cograph completions.
    Daniel Lokshtanov, Federico Mancini, and Charis Papadopoulos.
    The Second International Frontiers of Algorithmics Workshop, (FAW 2008), Changsha, China, 2008. Springer Verlag LNCS 5059: 147-158 (pdf).
  • Graphs of linear clique-width at most 3.
    Pinar Heggernes, Daniel Meister, and Charis Papadopoulos.
    5th Annual Conf. on Theory and Applications of Models of Computation, (TAMC 2008), Xi'an, China, 2008. Springer Verlag, LNCS 4978: 330-341 (pdf).
  • Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions.
    Pinar Heggernes and Charis Papadopoulos.
    13th Computing and Combinatorics Conference, (COCOON 2007), Banff, Alberta, Canada, 2007. Springer Verlag, LNCS 4598: 406 - 416 (pdf).
  • Making arbitrary graphs transitively orientable: Minimal comparability completions.
    Pinar Heggernes, Federico Mancini, and Charis Papadopoulos.
    17th Int'l Symposium on Algorithms and Computation, (ISAAC 2006), Kolkata, India, 2006. Springer Verlag, LNCS 4288: 419 - 428 (pdf).
  • A fully dynamic algorithm for the recognition of P4-sparse graphs.
    Stavros D. Nikolopoulos, Leonidas Palios, and Charis Papadopoulos.
    32nd Workshop on Graph-Theoretic Concepts in Computer Science, (WG 2006), Bergen, Norway, 2006. Springer Verlag, LNCS 4271: 256 - 268 (pdf).
  • Drawing graphs using modular decomposition.
    Charis Papadopoulos and Constantinos Voglis.
    13th Int'l Symposium on Graph Drawing, (GD 2005), Limerick, Irelend, 2005. Springer Verlag, LNCS 3843: 343 - 354 (pdf).
  • Optimal algorithms for the path cover problem on P4-sparse graphs.
    Katerina Asdre, Stavros D. Nikolopoulos, and Charis Papadopoulos.
    Cologne-Twente Workshop on Graphs and Combinatorial Optimization , (CTW 2005), Cologne, Germany, 2005. (pdf).
  • The number of spanning trees in P4-reducible graphs.
    Stavros D. Nikolopoulos and Charis Papadopoulos.
    3rd Int'l Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, (MathInfo III), Birkhauser, Vienna, 2004 (pdf).
  • Counting the number of spanning trees in cographs.
    Stavros D. Nikolopoulos and Charis Papadopoulos.
    Cologne-Twente Workshop on Graphs and Combinatorial Optimization , (CTW 2003), Enschede, The Netherlands, 2003. Elsevier, ENDM 13: 87 - 95, 2003 (pdf).
  • A formula for the number of spanning trees in quasi-threshold graphs.
    Stavros D. Nikolopoulos and Charis Papadopoulos.
    Balcan Conference on Informatics, (BCI 2003), Thessaloniki, Greece, 2003 (pdf).

Technical Reports