| Enumerating minimal subset feedback vertex sets FV Fomin, P Heggernes, D Kratsch, C Papadopoulos, Y Villanger Algorithmica 69, 216-231, 2014 | 42 | 2014 |
| Graphs of linear clique-width at most 3 P Heggernes, D Meister, C Papadopoulos Theoretical Computer Science 412 (39), 5466-5486, 2011 | 40* | 2011 |
| Drawing graphs using modular decomposition C Papadopoulos, C Voglis Graph Drawing: 13th International Symposium, GD 2005, Limerick, Ireland …, 2006 | 40 | 2006 |
| The Number of Spanning Trees in K n -Complements of Quasi-Threshold Graphs SD Nikolopoulos, C Papadopoulos Graphs and Combinatorics 20, 383-397, 2004 | 40 | 2004 |
| A new representation of proper interval graphs with an application to clique-width P Heggernes, D Meister, C Papadopoulos Electronic Notes in Discrete Mathematics 32, 27-34, 2009 | 31 | 2009 |
| Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs P Heggernes, D Meister, C Papadopoulos Discrete Applied Mathematics 160 (6), 888-901, 2012 | 30 | 2012 |
| Clustering with partial information HL Bodlaender, MR Fellows, P Heggernes, F Mancini, C Papadopoulos, ... Theoretical Computer Science 411 (7-9), 1202-1211, 2010 | 24 | 2010 |
| Minimal comparability completions of arbitrary graphs P Heggernes, F Mancini, C Papadopoulos Discrete Applied Mathematics 156 (5), 705-718, 2008 | 22* | 2008 |
| Strong triadic closure in cographs and graphs of low maximum degree AL Konstantinidis, SD Nikolopoulos, C Papadopoulos Theoretical Computer Science 740, 76-84, 2018 | 21 | 2018 |
| Cutwidth of split graphs and threshold graphs P Heggernes, D Lokshtanov, R Mihai, C Papadopoulos SIAM Journal on Discrete Mathematics 25 (3), 1418-1437, 2011 | 21 | 2011 |
| Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs C Papadopoulos, S Tzimas Discrete Applied Mathematics 258, 204-221, 2019 | 19 | 2019 |
| A characterisation of clique-width through nested partitions B Courcelle, P Heggernes, D Meister, C Papadopoulos, U Rotics Discrete Applied Mathematics 187, 70-81, 2015 | 18 | 2015 |
| On the performance of the first-fit coloring algorithm on permutation graphs SD Nikolopoulos, C Papadopoulos Information Processing Letters 75 (6), 265-273, 2000 | 18 | 2000 |
| Parameterized aspects of strong subgraph closure PA Golovach, P Heggernes, AL Konstantinidis, PT Lima, C Papadopoulos Algorithmica 82 (7), 2006-2038, 2020 | 17 | 2020 |
| Subset feedback vertex set on graphs of bounded independent set size C Papadopoulos, S Tzimas Theoretical Computer Science 814, 177-188, 2020 | 17 | 2020 |
| Node multiway cut and subset feedback vertex set on graphs of bounded mim-width B Benjamin, C Papadopoulos, JA Telle Graph-Theoretic Concepts in Computer Science: 46th International Workshop …, 2020 | 17 | 2020 |
| Characterizing and computing minimal cograph completions D Lokshtanov, F Mancini, C Papadopoulos Discrete Applied Mathematics 158 (7), 755-764, 2010 | 16 | 2010 |
| Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions P Heggernes, C Papadopoulos Theoretical Computer Science 410 (1), 1-15, 2009 | 16 | 2009 |
| Node multiway cut and subset feedback vertex set on graphs of bounded mim-width B Bergougnoux, C Papadopoulos, JA Telle Algorithmica 84 (5), 1385-1417, 2022 | 15 | 2022 |
| Enumerating minimal subset feedback vertex sets FV Fomin, P Heggernes, D Kratsch, C Papadopoulos, Y Villanger Algorithms and Data Structures: 12th International Symposium, WADS 2011, New …, 2011 | 14 | 2011 |
