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.uib.no
  N-5020 Bergen, Norway Http: www.ii.uib.no/~charis

 


[Education] [Publications] [Thesis] [Research Projects] [B.Sc & M.Sc. Projects] [Work Experience]

 Education

2001-2005 Ph. D., Dept. of Computer Science, University of Ioannina
1999-2001 M. Sc., Dept. of Computer Science, University of Ioannina
1995-1999 B. Sc., Dept. of Computer Science, University of Ioannina

 Publications

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, to appear (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).

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 (pdf). (to appear in LNCS).

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).


 Thesis

Ph. D. thesis Algorithms for classes of perfect graphs, in Greek
M. Sc. thesis The number of spanning trees in classes of graphs, in Greek
B. Sc. thesis Parallel algorithms in perfect graphs; implementation of visualization tools for perfect graphs, in Greek

 

 Research Projects

2005-2008 Minimal Separators and Triangulations in Graphs - Algorithms and Applications (NFR FRINAT grant), Norway
2005-2006

Sequential and Parallel Algorithms for Classes of Perfect Graphs, 

Research project PYTHAGORAS II, funded by the European Commission and the Hellenic Ministry of Education through Operational Programme for Education and Initial Vocational Training (EPEAEK II)

2002-2005

Parallel Algorithms for Classes of Perfect Graphs

Research project HRAKLEITOS funded by the European Commission and the Hellenic Ministry of Education through Operational Programme for Education and Initial Vocational Training (EPEAEK II)

2001-2002

Analysis of Routing Algorithms in Tree Structures

Inter-departmental research project in Computer Science and Mathematics, funded by the University of Ioannina, Greece

 

 B.Sc & M.Sc Projects

Databases Data-mining and experimental methods for topological study of web through Hubs & Authorities (ex., search engine: Google) in Greek
Optimization Linear Programming Simplex method (simplex.tar.gz) in Greek
3D Graphics Designed and developed a video producer (.avi format) using morphing techniques in 2 (ex. barney.mpg) and 3 (ex. lhmorph.mpg) dimensions. (morhpi.exe)
Examples :  - moving face: din_din.avi,      - man to woman: face2face.avi,     - two of my old professors: jon_pit.avi,
                    - another professor: pasx_ourag.avi,        - cs dept., uoi (2001): UoiCs.avi.
in Greek
Neural Networks Designed and developed parallel artificial neural network for pattern recognition. in Greek
Semantincs Programming Constraint Logic Programming (a survey). in Greek
Human Interaction Study virtual reality in internet for signal processing procedures.

 Work Experience

1999-current Teaching Assistant, various courses in Computer Science.
2001-2002 Designed and developed a compact XRC client/server platform (http://www.xrc.gr/), featuring: online/offline multimedia message exchange; chat (private or public rooms); video conferencing (multiple users conferencing simultaneously); file sharing (public and protected shares); multimedia player (with integrated mixer for every media channel); yellow pages; server controlled message broadcasting; software development toolbox for end-users extendibility; compact client (550Kbytes). x R c
1997-1998 Designed and developed "Parallel Algorithms" coursework into electronic form (CD-ROM) using visual and animation tools.

[top] [top]