| 2008 |
|---|
| 27 | EE | Matthias Kriesell:
On the number of contractible triples in 3-connected graphs.
J. Comb. Theory, Ser. B 98(1): 136-145 (2008) |
| 2007 |
|---|
| 26 | EE | Matthias Kriesell:
How to contract an essentially 6-connected graph to a 5-connected graph.
Discrete Mathematics 307(3-5): 494-510 (2007) |
| 25 | EE | Matthias Kriesell:
A constructive characterization of 3-connected triangle-free graphs.
J. Comb. Theory, Ser. B 97(3): 358-370 (2007) |
| 2006 |
|---|
| 24 | EE | Stephan Brandt,
Hajo Broersma,
Reinhard Diestel,
Matthias Kriesell:
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs.
Combinatorica 26(1): 17-36 (2006) |
| 23 | EE | Matthias Kriesell:
Mader's Conjecture On Extremely Critical Graphs.
Combinatorica 26(3): 277-314 (2006) |
| 22 | EE | Tomás Kaiser,
Matthias Kriesell:
On the Pancyclicity of Lexicographic Products.
Graphs and Combinatorics 22(1): 51-58 (2006) |
| 21 | EE | Matthias Kriesell:
Contractions, cycle double covers, and cyclic colorings in locally connected graphs.
J. Comb. Theory, Ser. B 96(6): 881-900 (2006) |
| 20 | EE | Matthias Kriesell:
Average degree and contractibility.
Journal of Graph Theory 51(3): 205-224 (2006) |
| 2005 |
|---|
| 19 | EE | Robert Baumgartner,
Christian Enzi,
Nicola Henze,
Marc Herrlich,
Marcus Herzog,
Matthias Kriesell,
Kai Tomaschewski:
Semantic Web Enabled Information Systems: Personalized Views on Web Data.
ICCSA (2) 2005: 988-997 |
| 18 | EE | Fabian Abel,
Robert Baumgartner,
Adrian Brooks,
Christian Enzi,
Georg Gottlob,
Nicola Henze,
Marcus Herzog,
Matthias Kriesell,
Wolfgang Nejdl,
Kai Tomaschewski:
The Personal Publication Reader.
International Semantic Web Conference 2005: 1050-1053 |
| 17 | EE | Matthias Kriesell:
Closed Separator Sets.
Combinatorica 25(5): 575-598 (2005) |
| 16 | EE | Matthias Kriesell:
Triangle Density and Contractibility.
Combinatorics, Probability & Computing 14(1-2): 133-146 (2005) |
| 15 | EE | Matthias Kriesell:
Disjoint A-paths in digraphs.
J. Comb. Theory, Ser. B 95(1): 168-172 (2005) |
| 2004 |
|---|
| 14 | EE | Changtao Qu,
Wolfgang Nejdl,
Matthias Kriesell:
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs.
ISPA 2004: 914-925 |
| 2003 |
|---|
| 13 | EE | András Frank,
Tamás Király,
Matthias Kriesell:
On decomposing a hypergraph into k connected sub-hypergraphs.
Discrete Applied Mathematics 131(2): 373-383 (2003) |
| 12 | EE | Matthias Kriesell:
Edge-disjoint trees containing some given vertices in a graph.
J. Comb. Theory, Ser. B 88(1): 53-65 (2003) |
| 2002 |
|---|
| 11 | EE | Matthias Kriesell:
A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity.
Graphs and Combinatorics 18(1): 1-30 (2002) |
| 10 | EE | Matthias Kriesell:
Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph.
Graphs and Combinatorics 18(1): 133-146 (2002) |
| 9 | EE | Matthias Kriesell:
A Contribution to a Conjecture of A. Saito.
Graphs and Combinatorics 18(3): 565-571 (2002) |
| 2001 |
|---|
| 8 | EE | Matthias Kriesell:
A Degree Sum Condition for the Existence of a Contractible Edge in a kappa-Connected Graph.
J. Comb. Theory, Ser. B 82(1): 81-101 (2001) |
| 7 | EE | Matthias Kriesell:
All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected.
J. Comb. Theory, Ser. B 82(2): 306-315 (2001) |
| 6 | EE | Matthias Kriesell:
Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices.
J. Comb. Theory, Ser. B 83(2): 305-319 (2001) |
| 2000 |
|---|
| 5 | EE | Matthias Kriesell:
The k-Critical 2k-Connected Graphs for kepsilon{3, 4}.
J. Comb. Theory, Ser. B 78(1): 69-80 (2000) |
| 4 | EE | Matthias Kriesell:
Contractible Subgraphs in 3-Connected Graphs.
J. Comb. Theory, Ser. B 80(1): 32-48 (2000) |
| 1998 |
|---|
| 3 | EE | Matthias Kriesell:
On k-Critical Connected Line Graphs.
J. Comb. Theory, Ser. B 74(1): 1-7 (1998) |
| 2 | EE | Matthias Kriesell:
Contractible Non-edges in 3-Connected Graphs.
J. Comb. Theory, Ser. B 74(2): 192-201 (1998) |
| 1997 |
|---|
| 1 | | Matthias Kriesell:
A Note on Hamiltonian Cycles in Lexicographical Products.
Journal of Automata, Languages and Combinatorics 2(2): 135-142 (1997) |
