me in Bergen   Charis Papadopoulos

Contact Info

  PostDoc at the Algorithms Research Group Tel: +47 55 58 41 76
  Department of Informatics Fax: +47 55 58 41 99
  University of Bergen E-mail: charis "at" ii "dot" uib "dot" no
  N-5020 Bergen, Norway Http: www.ii.uib.no/~charis

 


[Home] [Publications] [Education-Thesis] [Research Projects] [Previous Works]

 Publications

     [Journal Papers]      [Refereed Conference Papers]      [Technical Reports]

 Journal Papers      [Top]

Minimal comparability completions of arbitrary graphs.
Pinar Heggernes, Federico Mancini, and Charis Papadopoulos.
Discrete Applied Mathematics, to appear (pdf).

Drawing graphs using modular decomposition.
Charis Papadopoulos and Constantinos Voglis.
Journal of Graph Algorithms and Applications, special issue on GD 2005, to appear (pdf).

Counting spanning trees in cographs: An algorithmic approach.
Stavros D. Nikolopoulos and Charis Papadopoulos.
Ars Combinatoria, to appear (pdf).

An optimal parallel solution for the path cover problem on P4-sparse graphs.
Katerina Asdre, Stavros D. Nikolopoulos and Charis Papadopoulos.
Journal of Parallel and Distributed Computing 67: 63 - 76, 2007 (pdf).

 

On the number of spanning trees of K_n^m \pm G graphs.
Stavros D. Nikolopoulos and Charis Papadopoulos.
Discrete Mathematics & Theoretical Computer Science 8: 235 - 248, 2006 (pdf).

The number of spanning trees in Kn-complements of quasi-threshold graphs.
Stavros D. Nikolopoulos and Charis Papadopoulos.
Graphs and Combinatorics 20: 383 - 397, 2004 (pdf).

On the performance of the first-fit coloring algorithm on permutation graphs.
Stavros D. Nikolopoulos and Charis Papadopoulos.
Information Processing Letters 75: 265 - 273, 2000 (pdf).

 Refereed Conference Papers     [Top]

Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions.
Pinar Heggernes and Charis Papadopoulos.
13th Computing and Combinatorics Conference (COCOON 2007), Banff, Alberta, Canada, 2007. Springer Verlag, Lecture Notes in Computer Science 4598: 406 - 416 (pdf).

Making arbitrary graphs transitively orientable: Minimal comparability completions.
Pinar Heggernes, Federico Mancini, and Charis Papadopoulos.
17th Int'l Symposium on Algorithms and Computation (ISAAC'06), Kolkata, India, 2006. Springer Verlag, Lecture Notes in Computer Science 4288: 419 - 428 (pdf).

A fully dynamic algorithm for the recognition of P4-sparse graphs.
Stavros D. Nikolopoulos, Leonidas Palios, and Charis Papadopoulos.
32nd Workshop on Graph-Theoretic Concepts in Computer Science (WG'06), Bergen, Norway, 2006. Springer Verlag, Lecture Notes in Computer Science 4271: 256 - 268 (pdf).

Drawing graphs using modular decomposition.
Charis Papadopoulos and Constantinos Voglis.
13th Int'l Symposium on Graph Drawing (GD'05), Limerick, Irelend, 2005. Springer Verlag, Lecture Notes in Computer Science 3843: 343 - 354 (pdf).

Optimal algorithms for the path cover problem on P4-sparse graphs.
Katerina Asdre, Stavros D. Nikolopoulos, and Charis Papadopoulos.
Workshop on Graphs and Combinatorial Optimization (CTW'05), Cologne, Germany, 2005 (ps).

The number of spanning trees in P4-reducible graphs.
Stavros D. Nikolopoulos and Charis Papadopoulos.
3rd Int'l Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities (MathInfo III), Birkhauser, Vienna, 2004 (ps).

Counting the number of spanning trees in cographs.
Stavros D. Nikolopoulos and Charis Papadopoulos.
Workshop on Graphs and Combinatorial Optimization (CTW'03), Enschede, The Netherlands, 2003. Also in: ENDM (Elsevier) 13: 87 - 95, 2003 (ps).

A formula for the number of spanning trees in quasi-threshold graphs.
Stavros D. Nikolopoulos and Charis Papadopoulos.
Balcan Conference on Informatics (BCI'03), Thessaloniki, Greece, 2003 (pdf).

 Technical Reports     [Top]

~

A new representation of proper interval graphs with an application to clique-width.
Pinar Heggernes, Daniel Meister, and Charis Papadopoulos.
Reports in Informatics 354, University of Bergen, June 2007.(pdf).

~

Computing and extracting minimal cograph completions in linear time.
Daniel Lokshtanov, Federico Mancini, and Charis Papadopoulos.
Reports in Informatics 352, University of Bergen, April 2007.(pdf).