Charis Papadopoulos

	2009
21		Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan: Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. COCOON 2009: 398-407
20		Stavros D. Nikolopoulos, Charis Papadopoulos: A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. CTW 2009: 23-27
19		Pinar Heggernes, Daniel Meister, Charis Papadopoulos: A Complete Characterisation of the Linear Clique-Width of Path Powers. TAMC 2009: 241-250
18		Pinar Heggernes, Daniel Meister, Charis Papadopoulos: A new representation of proper interval graphs with an application to clique-width. Electronic Notes in Discrete Mathematics 32: 27-34 (2009)
17		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		Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos: Characterizing and Computing Minimal Cograph Completions. FAW 2008: 147-158
15		Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond: Clustering with Partial Information. MFCS 2008: 144-155
14		Pinar Heggernes, Daniel Meister, Charis Papadopoulos: Graphs of Linear Clique-Width at Most 3. TAMC 2008: 330-341
13		Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos: Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. WG 2008: 218-229
12		Pinar Heggernes, Federico Mancini, Charis Papadopoulos: Minimal comparability completions of arbitrary graphs. Discrete Applied Mathematics 156(5): 705-718 (2008)
	2007
11		Pinar Heggernes, Charis Papadopoulos: Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. COCOON 2007: 406-416
10		Charis Papadopoulos, Constantinos Voglis: Drawing graphs using modular decomposition. J. Graph Algorithms Appl. 11(2): 481-511 (2007)
9		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		Pinar Heggernes, Federico Mancini, Charis Papadopoulos: Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. ISAAC 2006: 419-428
7		Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos: A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs. WG 2006: 256-268
6		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		Charis Papadopoulos, Constantinos Voglis: Drawing Graphs Using Modular Decomposition. Graph Drawing 2005: 343-354
4		Stavros D. Nikolopoulos, Charis Papadopoulos: The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs CoRR abs/cs/0502038: (2005)
	2004
3		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		Stavros D. Nikolopoulos, Charis Papadopoulos: Counting Spanning Trees in Cographs. Electronic Notes in Discrete Mathematics 13: 84-92 (2003)
	2000
1		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	[9]
2	Hans L. Bodlaender	[15]
3	Michael R. Fellows (Mike Fellows)	[15]
4	Pinar Heggernes	[8] [11] [12] [13] [14] [15] [17] [18] [19] [21]
5	Daniel Lokshtanov	[13] [16]
6	Federico Mancini	[8] [12] [15] [16] [21]
7	Daniel Meister	[14] [18] [19]
8	Rodica Mihai	[13]
9	Stavros D. Nikolopoulos	[1] [2] [3] [4] [6] [7] [9] [20]
10	Leonidas Palios	[7]
11	Frances A. Rosamond	[15]
12	R. Sritharan	[21]
13	Constantinos Voglis	[5] [10]

Colors in the list of coauthors