| 2009 |
|---|
| 17 | EE | Pinar Heggernes,
Charis Papadopoulos:
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions.
Theor. Comput. Sci. 410(1): 1-15 (2009) |
| 2008 |
|---|
| 16 | EE | Daniel Lokshtanov,
Federico Mancini,
Charis Papadopoulos:
Characterizing and Computing Minimal Cograph Completions.
FAW 2008: 147-158 |
| 15 | EE | Hans L. Bodlaender,
Michael R. Fellows,
Pinar Heggernes,
Federico Mancini,
Charis Papadopoulos,
Frances A. Rosamond:
Clustering with Partial Information.
MFCS 2008: 144-155 |
| 14 | EE | Pinar Heggernes,
Daniel Meister,
Charis Papadopoulos:
Graphs of Linear Clique-Width at Most 3.
TAMC 2008: 330-341 |
| 13 | EE | Pinar Heggernes,
Daniel Lokshtanov,
Rodica Mihai,
Charis Papadopoulos:
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs.
WG 2008: 218-229 |
| 12 | EE | Pinar Heggernes,
Federico Mancini,
Charis Papadopoulos:
Minimal comparability completions of arbitrary graphs.
Discrete Applied Mathematics 156(5): 705-718 (2008) |
| 2007 |
|---|
| 11 | EE | Pinar Heggernes,
Charis Papadopoulos:
Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions.
COCOON 2007: 406-416 |
| 10 | EE | Charis Papadopoulos,
Constantinos Voglis:
Drawing graphs using modular decomposition.
J. Graph Algorithms Appl. 11(2): 481-511 (2007) |
| 9 | EE | Katerina Asdre,
Stavros D. Nikolopoulos,
Charis Papadopoulos:
An optimal parallel solution for the path cover problem on P4-sparse graphs.
J. Parallel Distrib. Comput. 67(1): 63-76 (2007) |
| 2006 |
|---|
| 8 | EE | Pinar Heggernes,
Federico Mancini,
Charis Papadopoulos:
Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions.
ISAAC 2006: 419-428 |
| 7 | EE | Stavros D. Nikolopoulos,
Leonidas Palios,
Charis Papadopoulos:
A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs.
WG 2006: 256-268 |
| 6 | EE | Stavros D. Nikolopoulos,
Charis Papadopoulos:
On the number of spanning trees of Knm±G graphs.
Discrete Mathematics & Theoretical Computer Science 8(1): 235-248 (2006) |
| 2005 |
|---|
| 5 | EE | Charis Papadopoulos,
Constantinos Voglis:
Drawing Graphs Using Modular Decomposition.
Graph Drawing 2005: 343-354 |
| 4 | EE | Stavros D. Nikolopoulos,
Charis Papadopoulos:
The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs
CoRR abs/cs/0502038: (2005) |
| 2004 |
|---|
| 3 | EE | Stavros D. Nikolopoulos,
Charis Papadopoulos:
The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs.
Graphs and Combinatorics 20(3): 383-397 (2004) |
| 2003 |
|---|
| 2 | EE | Stavros D. Nikolopoulos,
Charis Papadopoulos:
Counting Spanning Trees in Cographs.
Electronic Notes in Discrete Mathematics 13: 84-92 (2003) |
| 2000 |
|---|
| 1 | EE | Stavros D. Nikolopoulos,
Charis Papadopoulos:
On the performance of the first-fit coloring algorithm on permutation graphs.
Inf. Process. Lett. 75(6): 265-273 (2000) |
