 | 2011 |
|---|
| 44 |       | Jørgen Bang-Jensen,
Matthias Kriesell:
On the problem of finding disjoint cycles and dicycles in a digraph.
Combinatorica 31(6): 639-668 (2011) |
| 43 | | Matthias Kriesell:
Balancing two spanning trees.
Networks 57(4): 351-353 (2011) |
| 2010 |
|---|
| 42 | | János Barát,
Matthias Kriesell:
What is on his mind?
Discrete Mathematics 310(20): 2573-2583 (2010) |
| 41 | | Matthias Kriesell:
On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs.
Discrete Mathematics 310(20): 2714-2724 (2010) |
| 40 | | Matthias Kriesell:
Packing Steiner trees on four terminals.
J. Comb. Theory, Ser. B 100(6): 546-553 (2010) |
| 2009 |
|---|
| 39 | | Fabian Abel,
Nicola Henze,
Daniel Krause,
Matthias Kriesell:
Semantic Enhancement of Social Tagging Systems.
Web 2.0 & Semantic Web 2009: 25-54 |
| 38 | | Jørgen Bang-Jensen,
Matthias Kriesell:
Disjoint sub(di)graphs in digraphs.
Electronic Notes in Discrete Mathematics 34: 179-183 (2009) |
| 37 | | Kiyoshi Ando,
Yoshimi Egawa,
Ken-ichi Kawarabayashi,
Matthias Kriesell:
On the number of 4-contractible edges in 4-connected graphs.
J. Comb. Theory, Ser. B 99(1): 97-109 (2009) |
| 36 | | Matthias Kriesell:
Edge disjoint Steiner trees in graphs without large bridges.
Journal of Graph Theory 62(2): 188-198 (2009) |
| 35 | | Jørgen Bang-Jensen,
Matthias Kriesell:
Disjoint directed and undirected paths and cycles in digraphs.
Theor. Comput. Sci. 410(47-49): 5138-5144 (2009) |
| 2008 |
|---|
| 34 | | Fabian Abel,
Nicola Henze,
Daniel Krause,
Matthias Kriesell:
On the Effect of Group Structures on Ranking Strategies in Folksonomies.
Weaving Services and People on the World Wide Web 2008: 275-300 |
| 33 | | Matthias Kriesell:
On the number of contractible triples in 3-connected graphs.
J. Comb. Theory, Ser. B 98(1): 136-145 (2008) |
| 32 | | Matthias Kriesell:
Vertex suppression in 3-connected graphs.
Journal of Graph Theory 57(1): 41-54 (2008) |
| 2007 |
|---|
| 31 | | Matthias Kriesell:
How to contract an essentially 6-connected graph to a 5-connected graph.
Discrete Mathematics 307(3-5): 494-510 (2007) |
| 30 | | Matthias Kriesell:
On Small Contractible Subgraphs in 3-connected Graphs of Small Average Degree.
Graphs and Combinatorics 23(5): 545-557 (2007) |
| 29 | | Matthias Kriesell:
A constructive characterization of 3-connected triangle-free graphs.
J. Comb. Theory, Ser. B 97(3): 358-370 (2007) |
| 2006 |
|---|
| 28 | | 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) |
| 27 | | Matthias Kriesell:
Mader's Conjecture On Extremely Critical Graphs.
Combinatorica 26(3): 277-314 (2006) |
| 26 | | Tomás Kaiser,
Matthias Kriesell:
On the Pancyclicity of Lexicographic Products.
Graphs and Combinatorics 22(1): 51-58 (2006) |
| 25 | | Matthias Kriesell:
There Exist Highly Critically Connected Graphs of Diameter Three.
Graphs and Combinatorics 22(4): 481-485 (2006) |
| 24 | | Matthias Kriesell:
Contractions, cycle double covers, and cyclic colorings in locally connected graphs.
J. Comb. Theory, Ser. B 96(6): 881-900 (2006) |
| 23 | | Matthias Kriesell:
Average degree and contractibility.
Journal of Graph Theory 51(3): 205-224 (2006) |
| 2005 |
|---|
| 22 | | 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 |
| 21 | | 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 |
| 20 | | Matthias Kriesell:
Closed Separator Sets.
Combinatorica 25(5): 575-598 (2005) |
| 19 | | Matthias Kriesell:
Triangle Density and Contractibility.
Combinatorics, Probability & Computing 14(1-2): 133-146 (2005) |
| 18 | | Matthias Kriesell:
Disjoint A-paths in digraphs.
J. Comb. Theory, Ser. B 95(1): 168-172 (2005) |
| 2004 |
|---|
| 17 | | Changtao Qu,
Wolfgang Nejdl,
Matthias Kriesell:
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs.
ISPA 2004: 914-925 |
| 2003 |
|---|
| 16 | | 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) |
| 15 | | Matthias Kriesell:
Edge-disjoint trees containing some given vertices in a graph.
J. Comb. Theory, Ser. B 88(1): 53-65 (2003) |
| 2002 |
|---|
| 14 | | Matthias Kriesell:
A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity.
Graphs and Combinatorics 18(1): 1-30 (2002) |
| 13 | | Matthias Kriesell:
Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph.
Graphs and Combinatorics 18(1): 133-146 (2002) |
| 12 | | Matthias Kriesell:
A Contribution to a Conjecture of A. Saito.
Graphs and Combinatorics 18(3): 565-571 (2002) |
| 2001 |
|---|
| 11 | | 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) |
| 10 | | Matthias Kriesell:
All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected.
J. Comb. Theory, Ser. B 82(2): 306-315 (2001) |
| 9 | | 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 |
|---|
| 8 | | Matthias Kriesell:
The k-Critical 2k-Connected Graphs for kepsilon{3, 4}.
J. Comb. Theory, Ser. B 78(1): 69-80 (2000) |
| 7 | | Matthias Kriesell:
Contractible Subgraphs in 3-Connected Graphs.
J. Comb. Theory, Ser. B 80(1): 32-48 (2000) |
| 1999 |
|---|
| 6 | | Matthias Kriesell:
Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity.
Electronic Notes in Discrete Mathematics 3: 110-113 (1999) |
| 5 | | Ekkehard Köhler,
Matthias Kriesell:
Edge-Dominating Trails in AT-free Graphs (Extended Abstract).
Electronic Notes in Discrete Mathematics 3: 95-101 (1999) |
| 4 | | Matthias Kriesell:
Contractible Non-Edges in Triangle-Free Graphs.
Graphs and Combinatorics 15(4): 429-439 (1999) |
| 1998 |
|---|
| 3 | | Matthias Kriesell:
On k-Critical Connected Line Graphs.
J. Comb. Theory, Ser. B 74(1): 1-7 (1998) |
| 2 | | 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) |
Data released under the ODC-BY 1.0 license — See also our legal information page