[Edit]

Matthias Kriesell [FOAF]  [Follow]

Position: PD Dr.
Homepage: http://www.unics.uni-hannover.de/nhabkri...
[Edit]
Statistics: H-index: 8 (See all experts' h-index.)
total citation number: 237
highest-cited paper: On decomposing a hypergraph into k connected sub-hypergraphs (2003) at Discrete Applied Mathematics (Cited By 44)

Research Interest:

3-Connected Graphs, 4-connected Line Graphs, AT-free Graphs, Cayley Graphs, Claw Free Graphs

Show Temporal Interests (Do you want to see the change of his/her research interests?)


Publications: [Edit disambiguation Result]

2009(2)
[33]Jørgen Bang-Jensen, Matthias Kriesell. Disjoint directed and undirected paths and cycles in digraphs. 2009: 5138~5144    Cited By 2[Bibtex]
[32]Kiyoshi Ando, Yoshimi Egawa, K. Kawarabayashi, Matthias Kriesell. On the number of 4-contractible edges in 4-connected graphs. J. Comb. Theory, Ser. B, 2009: 97~109    Cited By 1[Bibtex]
2008(3)
[31]Matthias Kriesell. On the number of contractible triples in 3-connected graphs. J. Comb. Theory, Ser. B, 2008: 136~145    Cited By 1[Bibtex]
[30]Matthias Kriesell. Vertex suppression in 3-connected graphs. Journal of Graph Theory, 2008: 41~54   [Bibtex]
[29]Fabian Abel, Nicola Henze, Daniel Krause, Matthias Kriesell. On the Effect of Group Structures on Ranking Strategies in Folksonomies.  Ingénierie des Systèmes d'Information'2008. pp.275~300    Cited By 10[Bibtex]
2007(2)
[28]Matthias Kriesell. How to contract an essentially 6-connected graph to a 5-connected graph. Discrete Mathematics, 2007: 494~510    Cited By 2[Bibtex]
[27]Matthias Kriesell. A constructive characterization of 3-connected triangle-free graphs. J. Comb. Theory, Ser. B, 2007: 358~370    Cited By 3[Bibtex]
2006(5)
[26]Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell. Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. Combinatorica, 2006: 17~36    Cited By 7[Bibtex] [PDF]
[25]Matthias Kriesell. Mader's Conjecture On Extremely Critical Graphs. Combinatorica, 2006: 277~314    Cited By 3[Bibtex]
[24]Tomas Kaiser, Matthias Kriesell. On the Pancyclicity of Lexicographic Products. Graphs and Combinatorics, 2006: 51~58   [Bibtex]
[23]Matthias Kriesell. Contractions, cycle double covers, and cyclic colorings in locally connected graphs. J. Comb. Theory, Ser. B, 2006: 881~900    Cited By 3[Bibtex]
[22]Matthias Kriesell. Average degree and contractibility. Journal of Graph Theory, 2006: 205~224    Cited By 4[Bibtex]
2005(5)
[21]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. pp.988~997    Cited By 4[Bibtex] [PDF]
[20]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. pp.1050~1053    Cited By 7[Bibtex]
[19]Matthias Kriesell. Closed Separator Sets. Combinatorica, 2005: 575~598    Cited By 2[Bibtex]
[18]Matthias Kriesell. Triangle Density and Contractibility. Combinatorics, Probability Computing, 2005: 133~146    Cited By 9[Bibtex]
[17]Matthias Kriesell. Disjoint A-paths in digraphs. J. Comb. Theory, Ser. B, 2005: 168~172    Cited By 2[Bibtex]
2004(1)
[16]Changtao Qu, Wolfgang Nejdl, Matthias Kriesell. Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs.  ISPA'2004. pp.914~925    Cited By 22[Bibtex] [PDF]
2003(2)
[15]Andras Frank, Tamas Kiraly, Matthias Kriesell. On decomposing a hypergraph into k connected sub-hypergraphs. Discrete Applied Mathematics, 2003: 373~383    Cited By 44[Bibtex]
[14]Matthias Kriesell. Edge-disjoint trees containing some given vertices in a graph. J. Comb. Theory, Ser. B, 2003: 53~65    Cited By 23[Bibtex]
2002(3)
[13]Matthias Kriesell. A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity. Graphs and Combinatorics, 2002: 1~30    Cited By 26[Bibtex]
[12]Matthias Kriesell. Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph. Graphs and Combinatorics, 2002: 133~146    Cited By 5[Bibtex]
[11]Matthias Kriesell. A Contribution to a Conjecture of A. Saito. Graphs and Combinatorics, 2002: 565~571   [Bibtex]
2001(3)
[10]Matthias Kriesell. Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices. J. Comb. Theory, Ser. B, 2001: 305~319    Cited By 5[Bibtex]
[9]Matthias Kriesell. A Degree Sum Condition for the Existence of a Contractible Edge in a kappa-Connected Graph. J. Comb. Theory, Ser. B, 2001: 81~101   [Bibtex]
[8]Matthias Kriesell. All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected. J. Comb. Theory, Ser. B, 2001: 306~315    Cited By 16[Bibtex]
2000(2)
[7]Matthias Kriesell. Contractible Subgraphs in 3-Connected Graphs. J. Comb. Theory, Ser. B, 2000: 32~48    Cited By 19[Bibtex]
[6]Matthias Kriesell. The k-Critical 2k-Connected Graphs for kepsilon{3, 4}. J. Comb. Theory, Ser. B, 2000: 69~80   [Bibtex]
1999(2)
[5]Matthias Kriesell. Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity. Electronic Notes in Discrete Mathematics, 1999: 110~113    Cited By 8[Bibtex]
[4]Ekkehard Kohler, Matthias Kriesell. Edge-Dominating Trails in AT-free Graphs (Extended Abstract). Electronic Notes in Discrete Mathematics, 1999: 95~101    Cited By 4[Bibtex]
1998(2)
[3]Matthias Kriesell. On k-Critical Connected Line Graphs. J. Comb. Theory, Ser. B, 1998: 1~7    Cited By 4[Bibtex]
[2]Matthias Kriesell. Contractible Non-edges in 3-Connected Graphs. J. Comb. Theory, Ser. B, 1998: 192~201    Cited By 7[Bibtex]
1997(1)
[1]Matthias Kriesell. A Note on Hamiltonian Cycles in Lexicographical Products. Journal of Automata, Languages and Combinatorics, 1997: 135~142    Cited By 3[Bibtex]