Matthias Kriesell

69 papers C 1Misc 1Journal 63Unranked 2
YearRankTypeTitle / Venue / Authors
2024 J jnl
Rainbow Bases in Matroids.
SIAM J. Discret. Math.
Florian Hörsch, Tomás Kaiser, Matthias Kriesell
2024 J jnl
Rooted minors and locally spanning subgraphs.
J. Graph Theory
Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt
2023 J jnl
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations.
Theor. Comput. Sci.
Jørgen Bang-Jensen, Florian Hörsch, Matthias Kriesell
2023 J jnl
Contractible edges in longest cycles.
J. Graph Theory
Tsz Lung Chan, Matthias Kriesell, Jens M. Schmidt
2022 J jnl
Good acyclic orientations of 4-regular 4-connected graphs.
J. Graph Theory
Jørgen Bang-Jensen, Matthias Kriesell
2022 J jnl
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties.
J. Graph Theory
Jørgen Bang-Jensen, Frédéric Havet, Matthias Kriesell, Anders Yeo
2021 J jnl
A note on uniquely 10-colorable graphs.
J. Graph Theory
Matthias Kriesell
2021 J jnl
Good orientations of unions of edge-disjoint spanning trees.
J. Graph Theory
Jørgen Bang-Jensen, Stéphane Bessy, Jing Huang, Matthias Kriesell
2020 J jnl
Maximal ambiguously
J. Comb. Theory, Ser. B
Matthias Kriesell
2019 J jnl
Rooted Complete Minors in Line Graphs with a Kempe Coloring.
Graphs Comb.
Matthias Kriesell, Samuel Mohr
2018 J jnl
More on foxes.
J. Graph Theory
Matthias Kriesell, Jens M. Schmidt
2018 J jnl
Nonseparating K4-subdivisions in graphs of minimum degree at least 4.
J. Graph Theory
Matthias Kriesell
2017 J jnl
Antistrong digraphs.
J. Comb. Theory B
Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell
2017 J jnl
Horst Sachs (1927-2016).
Discret. Math.
Thomas Böhme, Jochen Harant, Matthias Kriesell, Michael Stiebitz
2017 J jnl
Unique Colorability and Clique Minors.
J. Graph Theory
Matthias Kriesell
2016 J jnl
Arc-Disjoint Directed and Undirected Cycles in Digraphs.
J. Graph Theory
Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen
2016 J jnl
More on foxes.
CoRR
Matthias Kriesell, Jens M. Schmidt
2015 J jnl
On graphs double-critical with respect to the colouring number.
Discret. Math. Theor. Comput. Sci.
Matthias Kriesell, Anders Sune Pedersen
2014 J jnl
The Average Degree of Minimally Contraction-Critically 5-Connected Graphs.
J. Graph Theory
Kiyoshi Ando, Yoshimi Egawa, Matthias Kriesell
2014 J jnl
Vertex-disjoint directed and undirected cycles in general digraphs.
J. Comb. Theory B
Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen
2011 J jnl
Balancing two spanning trees.
Networks
Matthias Kriesell
2011 J jnl
On the problem of finding disjoint cycles and dicycles in a digraph.
Comb.
Jørgen Bang-Jensen, Matthias Kriesell
2010 J jnl
On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs.
Discret. Math.
Matthias Kriesell
2010 J jnl
Packing Steiner trees on four terminals.
J. Comb. Theory B
Matthias Kriesell
2010 J jnl
What is on his mind?
Discret. Math.
János Barát, Matthias Kriesell
2009 J jnl
Disjoint directed and undirected paths and cycles in digraphs.
Theor. Comput. Sci.
Jørgen Bang-Jensen, Matthias Kriesell
2009 J jnl
Disjoint sub(di)graphs in digraphs.
Electron. Notes Discret. Math.
Jørgen Bang-Jensen, Matthias Kriesell
2009 J jnl
Edge disjoint Steiner trees in graphs without large bridges.
J. Graph Theory
Matthias Kriesell
2009 J jnl
On the number of 4-contractible edges in 4-connected graphs.
J. Comb. Theory B
Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell
2009 — ch.
Semantic Enhancement of Social Tagging Systems.
Web 2.0 & Semantic Web
Fabian Abel, Nicola Henze, Daniel Krause, Matthias Kriesell
2008 — conf
On the Effect of Group Structures on Ranking Strategies in Folksonomies.
Weaving Services and People on the World Wide Web
Fabian Abel, Nicola Henze, Daniel Krause, Matthias Kriesell
2008 J jnl
On the number of contractible triples in 3-connected graphs.
J. Comb. Theory B
Matthias Kriesell
2008 J jnl
Vertex suppression in 3-connected graphs.
J. Graph Theory
Matthias Kriesell
2007 J jnl
A constructive characterization of 3-connected triangle-free graphs.
J. Comb. Theory B
Matthias Kriesell
2007 J jnl
How to contract an essentially 6-connected graph to a 5-connected graph.
Discret. Math.
Matthias Kriesell
2007 J jnl
On Small Contractible Subgraphs in 3-connected Graphs of Small Average Degree.
Graphs Comb.
Matthias Kriesell
2006 J jnl
Average degree and contractibility.
J. Graph Theory
Matthias Kriesell
2006 — ch.
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs.
Semantic Web and Peer-to-Peer
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell
2006 J jnl
Contractions, cycle double covers, and cyclic colorings in locally connected graphs.
J. Comb. Theory B
Matthias Kriesell
2006 J jnl
Global Connectivity And Expansion: Long Cycles and Factors In
Comb.
Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell
2006 J jnl
Mader's Conjecture On Extremely Critical Graphs.
Comb.
Matthias Kriesell
2006 J jnl
On the Pancyclicity of Lexicographic Products.
Graphs Comb.
Tomás Kaiser, Matthias Kriesell
2006 J jnl
There Exist Highly Critically Connected Graphs of Diameter Three.
Graphs Comb.
Matthias Kriesell
2005 J jnl
Closed Separator Sets.
Comb.
Matthias Kriesell
2005 J jnl
Disjoint
J. Comb. Theory B
Matthias Kriesell
2005 — conf
Semantic Web Enabled Information Systems: Personalized Views on Web Data.
ICCSA (2)
Robert Baumgartner, Christian Enzi, Nicola Henze, Marc Herrlich, Marcus Herzog, Matthias Kriesell, Kai Tomaschewski
2005 Misc conf
The Personal Publication Reader.
ISWC
Fabian Abel, Robert Baumgartner, Adrian Brooks, Christian Enzi, Georg Gottlob, Nicola Henze, Marcus Herzog, Matthias Kriesell, Wolfgang Nejdl, Kai Tomaschewski
2005 J jnl
Triangle Density and Contractibility.
Comb. Probab. Comput.
Matthias Kriesell
2004 C conf
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs.
ISPA
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell
2003 J jnl
Edge-disjoint trees containing some given vertices in a graph.
J. Comb. Theory B
Matthias Kriesell
2003 J jnl
On decomposing a hypergraph into k connected sub-hypergraphs.
Discret. Appl. Math.
András Frank, Tamás Király, Matthias Kriesell
2002 J jnl
A Contribution to a Conjecture of A. Saito.
Graphs Comb.
Matthias Kriesell
2002 J jnl
A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity.
Graphs Comb.
Matthias Kriesell
2002 J jnl
Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph.
Graphs Comb.
Matthias Kriesell
2001 J jnl
A Degree Sum Condition for the Existence of a Contractible Edge in a kappa-Connected Graph.
J. Comb. Theory B
Matthias Kriesell
2001 J jnl
All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected.
J. Comb. Theory B
Matthias Kriesell
2001 J jnl
Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices.
J. Comb. Theory B
Matthias Kriesell
2001 J jnl
Induced paths in 5-connected graphs.
J. Graph Theory
Matthias Kriesell
2001 J jnl
On factors of 4-connected claw-free graphs.
J. Graph Theory
Haitze J. Broersma, Matthias Kriesell, Zdenek Ryjácek
2001 J jnl
The symmetric (2
J. Graph Theory
Matthias Kriesell
2000 J jnl
Contractible Subgraphs in 3-Connected Graphs.
J. Comb. Theory B
Matthias Kriesell
2000 J jnl
The
J. Comb. Theory B
Matthias Kriesell
1999 J jnl
Contractible Non-Edges in Triangle-Free Graphs.
Graphs Comb.
Matthias Kriesell
1999 J jnl
Edge-Dominating Trails in AT-free Graphs (Extended Abstract).
Electron. Notes Discret. Math.
Ekkehard Köhler, Matthias Kriesell
1999 J jnl
Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity.
Electron. Notes Discret. Math.
Matthias Kriesell
1999 J jnl
On a conjecture of Thomassen and Toft.
J. Graph Theory
Matthias Kriesell
1998 J jnl
Contractible Non-edges in 3-Connected Graphs.
J. Comb. Theory B
Matthias Kriesell
1998 J jnl
On
J. Comb. Theory B
Matthias Kriesell
1997 J jnl
A Note on Hamiltonian Cycles in Lexicographical Products.
J. Autom. Lang. Comb.
Matthias Kriesell