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.
|
· |
Drawing graphs using modular decomposition.
|
· |
Counting spanning trees in cographs: An algorithmic approach.
|
· |
An optimal parallel solution for the path cover problem on P4-sparse graphs.
|
·
|
On the number of spanning trees of
graphs.
|
· |
The number of spanning trees in
Kn-complements of quasi-threshold graphs.
|
· |
On the performance of the first-fit coloring algorithm on
permutation graphs.
|
Refereed Conference Papers [Top] | |
° |
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions.
|
° |
Making arbitrary graphs transitively orientable: Minimal comparability completions.
|
° |
A fully dynamic algorithm for the recognition of P4-sparse
graphs.
|
° |
Drawing graphs using modular decomposition.
|
° |
Optimal algorithms for the path cover problem on P4-sparse graphs.
|
° |
The number of spanning trees in P4-reducible graphs.
|
° |
Counting the number of spanning trees in cographs.
|
° |
A formula for the number of spanning trees in
quasi-threshold graphs.
|
Technical Reports [Top] | |
~ |
A new representation of proper interval graphs with an application to clique-width.
|
~ |
Computing and extracting minimal cograph completions in linear time.
|