The SCEAS System
| |||||||

## Search the dblp DataBase
Charis Papadopoulos:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Charis Papadopoulos, Constantinos Voglis
**Drawing Graphs Using Modular Decomposition.**[Citation Graph (0, 0)][DBLP] Graph Drawing, 2005, pp:343-354 [Conf] - 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] - Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
**A Fully Dynamic Algorithm for the Recognition of**[Citation Graph (0, 0)][DBLP]*P*_{4}-Sparse Graphs. WG, 2006, pp:256-268 [Conf] - Stavros D. Nikolopoulos, Charis Papadopoulos
**The Number of Spanning Trees in**[Citation Graph (0, 0)][DBLP]*K*_{n}-Complements of Quasi-Threshold Graphs. Graphs and Combinatorics, 2004, v:20, n:3, pp:383-397 [Journal] - 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] - Katerina Asdre, Stavros D. Nikolopoulos, Charis Papadopoulos
**An optimal parallel solution for the path cover problem on P**[Citation Graph (0, 0)][DBLP]_{4}-sparse graphs. J. Parallel Distrib. Comput., 2007, v:67, n:1, pp:63-76 [Journal] - 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] - 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] - Stavros D. Nikolopoulos, Charis Papadopoulos
**On the number of spanning trees of K**[Citation Graph (0, 0)][DBLP]_{n}^{m}±*G*graphs. Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:235-248 [Journal] **Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone.**[Citation Graph (, )][DBLP]**Clustering with Partial Information.**[Citation Graph (, )][DBLP]**Graphs of Linear Clique-Width at Most 3.**[Citation Graph (, )][DBLP]**A Complete Characterisation of the Linear Clique-Width of Path Powers.**[Citation Graph (, )][DBLP]**Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs.**[Citation Graph (, )][DBLP]**Characterizing and Computing Minimal Cograph Completions.**[Citation Graph (, )][DBLP]**A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs.**[Citation Graph (, )][DBLP]**Minimal comparability completions of arbitrary graphs.**[Citation Graph (, )][DBLP]**Characterizing and computing minimal cograph completions.**[Citation Graph (, )][DBLP]**Maximizing the number of spanning trees in K**[Citation Graph (, )][DBLP]_{n}-complements of asteroidal graphs.
Search in 5.852secs, Finished in 5.852secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |