Search the dblp DataBase

Publications of Author

1. Charis Papadopoulos, Constantinos Voglis
   Drawing Graphs Using Modular Decomposition. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2005, pp:343-354 [Conf]
   
2. Pinar Heggernes, Federico Mancini, Charis Papadopoulos
   Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2006, pp:419-428 [Conf]
   
3. Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
   A Fully Dynamic Algorithm for the Recognition of P₄-Sparse Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 2006, pp:256-268 [Conf]
   
4. Stavros D. Nikolopoulos, Charis Papadopoulos
   The Number of Spanning Trees in K _n-Complements of Quasi-Threshold Graphs. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2004, v:20, n:3, pp:383-397 [Journal]
   
5. Stavros D. Nikolopoulos, Charis Papadopoulos
   On the performance of the first-fit coloring algorithm on permutation graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:75, n:6, pp:265-273 [Journal]
   
6. Katerina Asdre, Stavros D. Nikolopoulos, Charis Papadopoulos
   An optimal parallel solution for the path cover problem on P₄-sparse graphs. [Citation Graph (0, 0)][DBLP]
   J. Parallel Distrib. Comput., 2007, v:67, n:1, pp:63-76 [Journal]
   
7. Pinar Heggernes, Charis Papadopoulos
   Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. [Citation Graph (0, 0)][DBLP]
   COCOON, 2007, pp:406-416 [Conf]
   
8. Stavros D. Nikolopoulos, Charis Papadopoulos
   The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs [Citation Graph (0, 0)][DBLP]
   CoRR, 2005, v:0, n:, pp:- [Journal]
   
9. Stavros D. Nikolopoulos, Charis Papadopoulos
   On the number of spanning trees of K_n^m±G graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:235-248 [Journal]
   
10. 
    Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. [Citation Graph (, )][DBLP]
    
    
11. 
    Clustering with Partial Information. [Citation Graph (, )][DBLP]
    
    
12. 
    Graphs of Linear Clique-Width at Most 3. [Citation Graph (, )][DBLP]
    
    
13. 
    A Complete Characterisation of the Linear Clique-Width of Path Powers. [Citation Graph (, )][DBLP]
    
    
14. 
    Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. [Citation Graph (, )][DBLP]
    
    
15. 
    Characterizing and Computing Minimal Cograph Completions. [Citation Graph (, )][DBLP]
    
    
16. 
    A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. [Citation Graph (, )][DBLP]
    
    
17. 
    Minimal comparability completions of arbitrary graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    Characterizing and computing minimal cograph completions. [Citation Graph (, )][DBLP]
    
    
19. 
    Maximizing the number of spanning trees in K_n-complements of asteroidal graphs. [Citation Graph (, )][DBLP]