Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Papadopoulos, Charis - Department of Mathematics, University of Ioannina
2010-2011 1 2 5 6 3(. )
A Fully Dynamic Algorithm for the Recognition of P4-sparse Graphs
An optimal parallel solution for the path cover problem on P4-sparse graphs
02/03/2011 ) 3:00 4:30 .... -9398
The Number of Spanning Trees in Kn-Complements of Quasi-Threshold Graphs
(343) Test 1 30 .
www.cs.uoi.gr/~charis/java343/ 195.251.195.117/343 3 4
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 11, no. 2, pp. 481511 (2007)
02/03/2011 ) 3:00 4:30 .... -9398
www.cs.uoi.gr/~charis/java343/ JAVA.
Making arbitrary graphs transitively orientable: Minimal comparability completions
1 2 5 6 3(. ) 9 12 13 10
A simple linear-time recognition algorithm for weakly quasi-threshold graphs
Counting Spanning Trees in Graphs using Modular Decomposition
2010-2011 .. (1-3-5-7-9)
2005 , 4 2005
Information Processing Letters 75 (2000) 265273 On the performance of the first-fit coloring algorithm
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 8, 2006, 235248 On the number of spanning trees of Km
2010-2011 1 2 5 6 3()
BlueJ 1 of 2
A Fully Dynamic Algorithm for the Recognition of P4-sparse Graphs
2011-2012 e-mail: istamat@cc.uoi.gr
