Journal Papers

Sparse certificates for 2connectivity in directed graphs.Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, and Nikos Parotsidis.Theoretical Computer Science, to appear (pdf).

Cliquewidth of path powers.Discrete Applied Mathematics 205: 6272, 2016 (pdf).

A characterisation of cliquewidth through nested partitions.Discrete Applied Mathematics 187: 7081, 2015 (pdf).

Counting spanning trees in graphs using modular decomposition.Stavros D. Nikolopoulos, Leonidas Palios, and Charis Papadopoulos.Theoretical Computer Science 526: 4157, 2014 (pdf).

Enumerating minimal subset feedback vertex sets.Algorithmica 69: 216231, 2014 (pdf).

A fully dynamic algorithm for the recognition of P4sparse graphs.Stavros D. Nikolopoulos, Leonidas Palios, and Charis Papadopoulos.Theoretical Computer Science 439: 4157, 2012 (pdf).

Restricted vertex multicut on permutation graphs.Charis Papadopoulos.Discrete Applied Mathematics 160: 17911797, 2012 (pdf).

Characterising the linear cliquewidth of a class of graphs by forbidden induced subgraphs.Pinar Heggernes, Daniel Meister, and Charis Papadopoulos.Discrete Applied Mathematics 160: 888901, 2012 (pdf).

Graphs of linear cliquewidth at most 3.Pinar Heggernes, Daniel Meister, and Charis Papadopoulos.Theoretical Computer Science 412: 54665486, 2011 (pdf).

Cutwidth of split graphs and threshold graphs.SIAM Journal on Discrete Mathematics 25: 14181437, 2011 (pdf).

Strongly chordal and chordal bipartite graphs are sandwich monotone.Journal of Combinatorial Optimization 22: 438456, 2011 (pdf).

A simple lineartime recognition algorithm for weakly quasithreshold graphs.Stavros D. Nikolopoulos and Charis Papadopoulos.Graphs and Combinatorics 27: 557565, 2011 (pdf).

Characterizing and computing minimal cograph completions.Daniel Lokshtanov, Federico Mancini, and Charis Papadopoulos.Discrete Applied Mathematics 158: 755764, 2010 (pdf).

Clustering with partial information.Hans Bodlaender, Mike Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, and Fran Rosamond.Theoretical Computer Science 411: 12021211, 2010 (pdf).

Maximizing the number of spanning trees in Kncomplements of asteroidal graphs.Stavros D. Nikolopoulos, Leonidas Palios, and Charis Papadopoulos.Discrete Mathematics 309: 30493060, 2009 (pdf).

Singleedge monotonic sequences of graphs and lineartime algorithms for minimal completions and deletions.Pinar Heggernes and Charis Papadopoulos.Theoretical Computer Science 410: 115, 2009 (pdf).

Counting spanning trees in cographs: An algorithmic approach.Stavros D. Nikolopoulos and Charis Papadopoulos.Ars Combinatoria 90: 257274, 2009 (pdf).

Minimal comparability completions of arbitrary graphs.Pinar Heggernes, Federico Mancini, and Charis Papadopoulos.Discrete Applied Mathematics 156: 705  718, 2008 (pdf).

Drawing graphs using modular decomposition.Charis Papadopoulos and Constantinos Voglis.Journal of Graph Algorithms and Applications 11: 481  511, 2007 (pdf).

An optimal parallel solution for the path cover problem on P4sparse graphs.Katerina Asdre, Stavros D. Nikolopoulos, and Charis Papadopoulos.Journal of Parallel and Distributed Computing 67: 63  76, 2007 (pdf).

On the number of spanning trees of K+/G graphs.Stavros D. Nikolopoulos and Charis Papadopoulos.Discrete Mathematics & Theoretical Computer Science 8: 235  248, 2006 (pdf).

The number of spanning trees in Kncomplements of quasithreshold graphs.Stavros D. Nikolopoulos and Charis Papadopoulos.Graphs and Combinatorics 20: 383  397, 2004 (pdf).

On the performance of the firstfit coloring algorithm on permutation graphs.Stavros D. Nikolopoulos and Charis Papadopoulos.Information Processing Letters 75: 265  273, 2000 (pdf).
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. LeibnizZentrum fur Informatik, LIPIcs, to appear. (pdf).

Polynomialtime 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 2connectivity 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: 150166 (pdf).

Approximating the smallest spanning subgraph for 2edgeconnectivity in directed graphs.23rd European Symposium on Algorithms, (ESA 2015), Patras, Greece, 2015. Springer Verlag, LNCS 9294: 582594 (pdf).

Untangling graphs representing spatial relationships.Charis Papadopoulos and Constantinos Voglis.17th Panhellenic Conference on Informatics, (PCI 2013), Thessaloniki, Greece, 2013. ACM Proceedings, pages 158165 (pdf).

Enumerating minimal subset feedback vertex sets.Algorithms and Data Structures Symposium, (WADS 2011), New York, U.S.A, 2011. Springer Verlag, LNCS 6844: 399410 (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: 202213 (pdf).

A simple lineartime recognition algorithm for weakly quasithreshold graphs.Stavros D. Nikolopoulos and Charis Papadopoulos.8th CologneTwente Workshop on Graphs and Combinatorial Optimization, (CTW 2009), Ecole Polytechnique and CNAM, Paris, France, pp. 2327, 2009 (pdf).

Strongly chordal and chordal bipartite graphs are sandwich monotone.15th International Computing and Combinatorics Conference, (COCOON 2009), Niagara Falls, New York, U.S.A., 2009. Springer Verlag, LNCS 5609: 398407 (pdf).

A complete characterisation of the linear cliquewidth 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: 241250 (pdf).

A new representation of proper interval graphs with an application to cliquewidth.Pinar Heggernes, Daniel Meister, and Charis Papadopoulos.DIMAP Workshop on Algorithmic Graph Theory, (AGT 2009), Warwick, U.K., 2009. Elsevier, ENDM 32: 2734, 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: 144155 (pdf).

Cutwidth of split graphs, threshold graphs, and proper interval graphs.34th Workshop on GraphTheoretic Concepts in Computer Science, (WG 2008), Durham, U.K., 2008. Springer Verlag LNCS 5344: 218229 (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: 147158 (pdf).

Graphs of linear cliquewidth 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: 330341 (pdf).

Singleedge monotonic sequences of graphs and lineartime 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 P4sparse graphs.Stavros D. Nikolopoulos, Leonidas Palios, and Charis Papadopoulos.32nd Workshop on GraphTheoretic 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 P4sparse graphs.Katerina Asdre, Stavros D. Nikolopoulos, and Charis Papadopoulos.CologneTwente Workshop on Graphs and Combinatorial Optimization , (CTW 2005), Cologne, Germany, 2005. (pdf).

The number of spanning trees in P4reducible 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.CologneTwente 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 quasithreshold graphs.Stavros D. Nikolopoulos and Charis Papadopoulos.Balcan Conference on Informatics, (BCI 2003), Thessaloniki, Greece, 2003 (pdf).