A Note on Hamiltonian Cycles in Lexicographical Products. - Matthias Kriesell (J. Autom. Lang. Comb., 1997)

On k-Critical Connected Line Graphs. - Matthias Kriesell (J. Comb. Theory B, 1998)

Contractible Non-edges in 3-Connected Graphs. - Matthias Kriesell (J. Comb. Theory B, 1998)

Edge-Dominating Trails in AT-free Graphs (Extended Abstract). - Ekkehard Köhler; Matthias Kriesell (Electron. Notes Discret. Math., 1999)

Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity. - Matthias Kriesell (Electron. Notes Discret. Math., 1999)

Contractible Non-Edges in Triangle-Free Graphs. - Matthias Kriesell (Graphs Comb., 1999)

On a conjecture of Thomassen and Toft. - Matthias Kriesell (J. Graph Theory, 1999)

Contractible Subgraphs in 3-Connected Graphs. - Matthias Kriesell (J. Comb. Theory B, 2000)

The k-Critical 2k-Connected Graphs for kepsilon{3, 4}. - Matthias Kriesell (J. Comb. Theory B, 2000)

Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices. - Matthias Kriesell (J. Comb. Theory B, 2001)

A Degree Sum Condition for the Existence of a Contractible Edge in a kappa-Connected Graph. - Matthias Kriesell (J. Comb. Theory B, 2001)

All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected. - Matthias Kriesell (J. Comb. Theory B, 2001)

On factors of 4-connected claw-free graphs. - Haitze J. Broersma; Matthias Kriesell; Zdenek Ryjácek (J. Graph Theory, 2001)

The symmetric (2k, k)-graphs. - Matthias Kriesell (J. Graph Theory, 2001)

Induced paths in 5-connected graphs. - Matthias Kriesell (J. Graph Theory, 2001)

A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity. - Matthias Kriesell (Graphs Comb., 2002)

Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph. - Matthias Kriesell (Graphs Comb., 2002)

A Contribution to a Conjecture of A. Saito. - Matthias Kriesell (Graphs Comb., 2002)

On decomposing a hypergraph into k connected sub-hypergraphs. - András Frank; Tamás Király; Matthias Kriesell (Discret. Appl. Math., 2003)

Edge-disjoint trees containing some given vertices in a graph. - Matthias Kriesell (J. Comb. Theory B, 2003)

Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs. - Changtao Qu; Wolfgang Nejdl; Matthias Kriesell (ISPA, 2004)

Semantic Web Enabled Information Systems: Personalized Views on Web Data. - Robert Baumgartner; Christian Enzi; Nicola Henze; Marc Herrlich; Marcus Herzog; Matthias Kriesell; Kai Tomaschewski (ICCSA (2), 2005)

The Personal Publication Reader. - Fabian Abel; Robert Baumgartner; Adrian Brooks; Christian Enzi; Georg Gottlob; Nicola Henze; Marcus Herzog; Matthias Kriesell; Wolfgang Nejdl; Kai Tomaschewski (ISWC, 2005)

Closed Separator Sets. - Matthias Kriesell (Comb., 2005)

Triangle Density and Contractibility. - Matthias Kriesell (Comb. Probab. Comput., 2005)

Disjoint A-paths in digraphs. - Matthias Kriesell (J. Comb. Theory B, 2005)

Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs. - Changtao Qu; Wolfgang Nejdl; Matthias Kriesell (Semantic Web and Peer-to-Peer, 2006)

Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. - Stephan Brandt; Hajo Broersma; Reinhard Diestel; Matthias Kriesell (Comb., 2006)

Mader's Conjecture On Extremely Critical Graphs. - Matthias Kriesell (Comb., 2006)

On the Pancyclicity of Lexicographic Products. - Tomás Kaiser; Matthias Kriesell (Graphs Comb., 2006)

There Exist Highly Critically Connected Graphs of Diameter Three. - Matthias Kriesell (Graphs Comb., 2006)

Contractions, cycle double covers, and cyclic colorings in locally connected graphs. - Matthias Kriesell (J. Comb. Theory B, 2006)

Average degree and contractibility. - Matthias Kriesell (J. Graph Theory, 2006)

How to contract an essentially 6-connected graph to a 5-connected graph. - Matthias Kriesell (Discret. Math., 2007)

On Small Contractible Subgraphs in 3-connected Graphs of Small Average Degree. - Matthias Kriesell (Graphs Comb., 2007)

A constructive characterization of 3-connected triangle-free graphs. - Matthias Kriesell (J. Comb. Theory B, 2007)

On the Effect of Group Structures on Ranking Strategies in Folksonomies. - Fabian Abel; Nicola Henze; Daniel Krause 002; Matthias Kriesell (Weaving Services and People on the World Wide Web, 2008)

On the number of contractible triples in 3-connected graphs. - Matthias Kriesell (J. Comb. Theory B, 2008)

Vertex suppression in 3-connected graphs. - Matthias Kriesell (J. Graph Theory, 2008)

Disjoint sub(di)graphs in digraphs. - Jørgen Bang-Jensen; Matthias Kriesell (Electron. Notes Discret. Math., 2009)

On the number of 4-contractible edges in 4-connected graphs. - Kiyoshi Ando; Yoshimi Egawa; Ken-ichi Kawarabayashi; Matthias Kriesell (J. Comb. Theory B, 2009)

Edge disjoint Steiner trees in graphs without large bridges. - Matthias Kriesell (J. Graph Theory, 2009)

Disjoint directed and undirected paths and cycles in digraphs. - Jørgen Bang-Jensen; Matthias Kriesell (Theor. Comput. Sci., 2009)

Semantic Enhancement of Social Tagging Systems. - Fabian Abel; Nicola Henze; Daniel Krause 002; Matthias Kriesell (Web 2.0 & Semantic Web, 2009)

What is on his mind? - János Barát; Matthias Kriesell (Discret. Math., 2010)

On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs. - Matthias Kriesell (Discret. Math., 2010)

Packing Steiner trees on four terminals. - Matthias Kriesell (J. Comb. Theory B, 2010)

On the problem of finding disjoint cycles and dicycles in a digraph. - Jørgen Bang-Jensen; Matthias Kriesell (Comb., 2011)

Balancing two spanning trees. - Matthias Kriesell (Networks, 2011)

Vertex-disjoint directed and undirected cycles in general digraphs. - Jørgen Bang-Jensen; Matthias Kriesell; Alessandro Maddaloni; Sven Simonsen (J. Comb. Theory B, 2014)

The Average Degree of Minimally Contraction-Critically 5-Connected Graphs. - Kiyoshi Ando; Yoshimi Egawa; Matthias Kriesell (J. Graph Theory, 2014)

On graphs double-critical with respect to the colouring number. - Matthias Kriesell; Anders Sune Pedersen (Discret. Math. Theor. Comput. Sci., 2015)

Arc-Disjoint Directed and Undirected Cycles in Digraphs. - Jørgen Bang-Jensen; Matthias Kriesell; Alessandro Maddaloni; Sven Simonsen (J. Graph Theory, 2016)

Horst Sachs (1927-2016). - Thomas Böhme 001; Jochen Harant; Matthias Kriesell; Michael Stiebitz (Discret. Math., 2017)

Antistrong digraphs. - Jørgen Bang-Jensen; Stéphane Bessy; Bill Jackson; Matthias Kriesell (J. Comb. Theory B, 2017)

Unique Colorability and Clique Minors. - Matthias Kriesell (J. Graph Theory, 2017)

Nonseparating K4-subdivisions in graphs of minimum degree at least 4. - Matthias Kriesell (J. Graph Theory, 2018)

More on foxes. - Matthias Kriesell; Jens M. Schmidt (J. Graph Theory, 2018)

Rooted Complete Minors in Line Graphs with a Kempe Coloring. - Matthias Kriesell; Samuel Mohr (Graphs Comb., 2019)

Maximal ambiguously k-colorable graphs. - Matthias Kriesell (J. Comb. Theory, Ser. B, 2020)

Good orientations of unions of edge-disjoint spanning trees. - Jørgen Bang-Jensen; Stéphane Bessy; Jing Huang 007; Matthias Kriesell (J. Graph Theory, 2021)

A note on uniquely 10-colorable graphs. - Matthias Kriesell (J. Graph Theory, 2021)

Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. - Jørgen Bang-Jensen; Frédéric Havet; Matthias Kriesell; Anders Yeo (J. Graph Theory, 2022)

Good acyclic orientations of 4-regular 4-connected graphs. - Jørgen Bang-Jensen; Matthias Kriesell (J. Graph Theory, 2022)

Contractible edges in longest cycles. - Tsz Lung Chan; Matthias Kriesell; Jens M. Schmidt (J. Graph Theory, 2023)

Complexity of (arc)-connectivity problems involving arc-reversals or deorientations. - Jørgen Bang-Jensen; Florian Hörsch; Matthias Kriesell (Theor. Comput. Sci., 2023)

Rainbow Bases in Matroids. - Florian Hörsch; Tomás Kaiser; Matthias Kriesell (SIAM J. Discret. Math., 2024)

Rooted minors and locally spanning subgraphs. - Thomas Böhme 001; Jochen Harant; Matthias Kriesell; Samuel Mohr; Jens M. Schmidt (J. Graph Theory, 2024)