Charis Papadopoulos

2008
13	EE	Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos: Characterizing and Computing Minimal Cograph Completions. FAW 2008: 147-158
12	EE	Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond: Clustering with Partial Information. MFCS 2008: 144-155
11	EE	Pinar Heggernes, Daniel Meister, Charis Papadopoulos: Graphs of Linear Clique-Width at Most 3. TAMC 2008: 330-341
10	EE	Pinar Heggernes, Federico Mancini, Charis Papadopoulos: Minimal comparability completions of arbitrary graphs. Discrete Applied Mathematics 156(5): 705-718 (2008)
2007
9	EE	Pinar Heggernes, Charis Papadopoulos: Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. COCOON 2007: 406-416
8	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
7	EE	Pinar Heggernes, Federico Mancini, Charis Papadopoulos: Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. ISAAC 2006: 419-428
6	EE	Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos: A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs. WG 2006: 256-268
5	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
4	EE	Charis Papadopoulos, Constantinos Voglis: Drawing Graphs Using Modular Decomposition. Graph Drawing 2005: 343-354
3	EE	Stavros D. Nikolopoulos, Charis Papadopoulos: The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs CoRR abs/cs/0502038: (2005)
2004
2	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)
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)

Coauthor Index

1	Katerina Asdre	[8]
2	Hans L. Bodlaender	[12]
3	Michael R. Fellows (Mike Fellows)	[12]
4	Pinar Heggernes	[7] [9] [10] [11] [12]
5	Daniel Lokshtanov	[13]
6	Federico Mancini	[7] [10] [12] [13]
7	Daniel Meister	[11]
8	Stavros D. Nikolopoulos	[1] [2] [3] [5] [6] [8]
9	Leonidas Palios	[6]
10	Frances A. Rosamond	[12]
11	Constantinos Voglis	[4]

Colors in the list of coauthors