Drawing graphs using modular decomposition C Papadopoulos, C Voglis International Symposium on Graph Drawing, 343-354, 2005 | 45 | 2005 |

Graph modification problems related to graph classes F Mancini PhD degree dissertation, University of Bergen Norway, 2008 | 32 | 2008 |

The Number of Spanning Trees in *K*_{ n }-Complements of Quasi-Threshold GraphsSD Nikolopoulos, C Papadopoulos Graphs and Combinatorics 20 (3), 383-397, 2004 | 29 | 2004 |

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 | 28 | 2012 |

Graphs of linear clique-width at most 3 P Heggernes, D Meister, C Papadopoulos Theoretical Computer Science 412 (39), 5466-5486, 2011 | 28* | 2011 |

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 | 22 | 2009 |

Minimal comparability completions of arbitrary graphs P Heggernes, F Mancini, C Papadopoulos Discrete Applied Mathematics 156 (5), 705-718, 2008 | 22* | 2008 |

Enumerating minimal subset feedback vertex sets FV Fomin, P Heggernes, D Kratsch, C Papadopoulos, Y Villanger Algorithmica 69 (1), 216-231, 2014 | 20 | 2014 |

Clustering with partial information HL Bodlaender, MR Fellows, P Heggernes, F Mancini, C Papadopoulos, ... Theoretical Computer Science 411 (7-9), 1202-1211, 2010 | 17 | 2010 |

On the performance of the first-fit coloring algorithm on permutation graphs SD Nikolopoulos, C Papadopoulos Information Processing Letters 75 (6), 265-273, 2000 | 15 | 2000 |

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 | 14 | 2015 |

Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs L Georgiadis, GF Italiano, C Papadopoulos, N Parotsidis Algorithms-ESA 2015, 582-594, 2015 | 11 | 2015 |

Enumerating minimal subset feedback vertex sets FV Fomin, P Heggernes, D Kratsch, C Papadopoulos, Y Villanger Workshop on Algorithms and Data Structures, 399-410, 2011 | 11 | 2011 |

A complete characterisation of the linear clique-width of path powers P Heggernes, D Meister, C Papadopoulos International Conference on Theory and Applications of Models of Computation …, 2009 | 11 | 2009 |

Making arbitrary graphs transitively orientable: Minimal comparability completions P Heggernes, F Mancini, C Papadopoulos International Symposium on Algorithms and Computation, 419-428, 2006 | 11 | 2006 |

Characterizing and computing minimal cograph completions D Lokshtanov, F Mancini, C Papadopoulos Discrete Applied Mathematics 158 (7), 755-764, 2010 | 10 | 2010 |

An optimal parallel solution for the path cover problem on P4-sparse graphs K Asdre, SD Nikolopoulos, C Papadopoulos Journal of Parallel and Distributed Computing 67 (1), 63-76, 2007 | 10 | 2007 |

A Fully Dynamic Algorithm for the Recognition of *P* _{4}-Sparse GraphsSD Nikolopoulos, L Palios, C Papadopoulos International Workshop on Graph-Theoretic Concepts in Computer Science, 256-268, 2006 | 10 | 2006 |

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 | 9 | 2009 |

Clustering with partial information HL Bodlaender, MR Fellows, P Heggernes, F Mancini, C Papadopoulos, ... International Symposium on Mathematical Foundations of Computer Science, 144-155, 2008 | 9 | 2008 |