default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Kriesell
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j62]Thomas Böhme, Jochen Harant, Matthias Kriesell
, Samuel Mohr, Jens M. Schmidt:
Rooted minors and locally spanning subgraphs. J. Graph Theory 105(2): 209-229 (2024)- [j61]Florian Hörsch, Tomás Kaiser, Matthias Kriesell:
Rainbow Bases in Matroids. SIAM J. Discret. Math. 38(2): 1472-1491 (2024) - 2023
- [j60]Tsz Lung Chan, Matthias Kriesell, Jens M. Schmidt:
Contractible edges in longest cycles. J. Graph Theory 103(3): 542-563 (2023) - [j59]Jørgen Bang-Jensen, Florian Hörsch, Matthias Kriesell:
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations. Theor. Comput. Sci. 973: 114097 (2023) - 2022
- [j58]Jørgen Bang-Jensen, Frédéric Havet, Matthias Kriesell, Anders Yeo:
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. J. Graph Theory 99(4): 615-636 (2022) - [j57]Jørgen Bang-Jensen, Matthias Kriesell:
Good acyclic orientations of 4-regular 4-connected graphs. J. Graph Theory 100(4): 698-720 (2022) - 2021
- [j56]Jørgen Bang-Jensen, Stéphane Bessy, Jing Huang, Matthias Kriesell:
Good orientations of unions of edge-disjoint spanning trees. J. Graph Theory 96(4): 594-618 (2021) - [j55]Matthias Kriesell:
A note on uniquely 10-colorable graphs. J. Graph Theory 98(1): 24-26 (2021) - 2020
- [j54]Matthias Kriesell:
Maximal ambiguously k-colorable graphs. J. Comb. Theory, Ser. B 140: 248-262 (2020)
2010 – 2019
- 2019
- [j53]Matthias Kriesell, Samuel Mohr:
Rooted Complete Minors in Line Graphs with a Kempe Coloring. Graphs Comb. 35(2): 551-557 (2019) - 2018
- [j52]Matthias Kriesell, Jens M. Schmidt:
More on foxes. J. Graph Theory 89(2): 101-114 (2018) - [j51]Matthias Kriesell:
Nonseparating K4-subdivisions in graphs of minimum degree at least 4. J. Graph Theory 89(2): 194-213 (2018) - 2017
- [j50]Thomas Böhme, Jochen Harant, Matthias Kriesell, Michael Stiebitz:
Horst Sachs (1927-2016). Discret. Math. 340(11): 2615 (2017) - [j49]Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell:
Antistrong digraphs. J. Comb. Theory B 122: 68-90 (2017) - [j48]Matthias Kriesell:
Unique Colorability and Clique Minors. J. Graph Theory 85(1): 207-216 (2017) - 2016
- [j47]Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen:
Arc-Disjoint Directed and Undirected Cycles in Digraphs. J. Graph Theory 83(4): 406-420 (2016) - [i1]Matthias Kriesell, Jens M. Schmidt:
More on foxes. CoRR abs/1610.09093 (2016) - 2015
- [j46]Matthias Kriesell, Anders Sune Pedersen:
On graphs double-critical with respect to the colouring number. Discret. Math. Theor. Comput. Sci. 17(2): 49-62 (2015) - 2014
- [j45]Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen:
Vertex-disjoint directed and undirected cycles in general digraphs. J. Comb. Theory B 106: 1-14 (2014) - [j44]Kiyoshi Ando, Yoshimi Egawa, Matthias Kriesell:
The Average Degree of Minimally Contraction-Critically 5-Connected Graphs. J. Graph Theory 75(4): 331-354 (2014) - 2011
- [j43]Jørgen Bang-Jensen, Matthias Kriesell:
On the problem of finding disjoint cycles and dicycles in a digraph. Comb. 31(6): 639-668 (2011) - [j42]Matthias Kriesell:
Balancing two spanning trees. Networks 57(4): 351-353 (2011) - 2010
- [j41]János Barát, Matthias Kriesell:
What is on his mind? Discret. Math. 310(20): 2573-2583 (2010) - [j40]Matthias Kriesell:
On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs. Discret. Math. 310(20): 2714-2724 (2010) - [j39]Matthias Kriesell:
Packing Steiner trees on four terminals. J. Comb. Theory B 100(6): 546-553 (2010)
2000 – 2009
- 2009
- [j38]Jørgen Bang-Jensen, Matthias Kriesell:
Disjoint sub(di)graphs in digraphs. Electron. Notes Discret. Math. 34: 179-183 (2009) - [j37]Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell:
On the number of 4-contractible edges in 4-connected graphs. J. Comb. Theory B 99(1): 97-109 (2009) - [j36]Matthias Kriesell:
Edge disjoint Steiner trees in graphs without large bridges. J. Graph Theory 62(2): 188-198 (2009) - [j35]Jørgen Bang-Jensen, Matthias Kriesell:
Disjoint directed and undirected paths and cycles in digraphs. Theor. Comput. Sci. 410(47-49): 5138-5144 (2009) - [p2]Fabian Abel, Nicola Henze, Daniel Krause, Matthias Kriesell:
Semantic Enhancement of Social Tagging Systems. Web 2.0 & Semantic Web 2009: 25-54 - 2008
- [j34]Matthias Kriesell:
On the number of contractible triples in 3-connected graphs. J. Comb. Theory B 98(1): 136-145 (2008) - [j33]Matthias Kriesell:
Vertex suppression in 3-connected graphs. J. Graph Theory 57(1): 41-54 (2008) - [c4]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 - 2007
- [j32]Matthias Kriesell:
How to contract an essentially 6-connected graph to a 5-connected graph. Discret. Math. 307(3-5): 494-510 (2007) - [j31]Matthias Kriesell:
On Small Contractible Subgraphs in 3-connected Graphs of Small Average Degree. Graphs Comb. 23(5): 545-557 (2007) - [j30]Matthias Kriesell:
A constructive characterization of 3-connected triangle-free graphs. J. Comb. Theory B 97(3): 358-370 (2007) - 2006
- [j29]Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell:
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. Comb. 26(1): 17-36 (2006) - [j28]Matthias Kriesell:
Mader's Conjecture On Extremely Critical Graphs. Comb. 26(3): 277-314 (2006) - [j27]Tomás Kaiser, Matthias Kriesell:
On the Pancyclicity of Lexicographic Products. Graphs Comb. 22(1): 51-58 (2006) - [j26]Matthias Kriesell:
There Exist Highly Critically Connected Graphs of Diameter Three. Graphs Comb. 22(4): 481-485 (2006) - [j25]Matthias Kriesell:
Contractions, cycle double covers, and cyclic colorings in locally connected graphs. J. Comb. Theory B 96(6): 881-900 (2006) - [j24]Matthias Kriesell:
Average degree and contractibility. J. Graph Theory 51(3): 205-224 (2006) - [p1]Changtao Qu, Wolfgang Nejdl, Matthias Kriesell:
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs. Semantic Web and Peer-to-Peer 2006: 89-105 - 2005
- [j23]Matthias Kriesell:
Closed Separator Sets. Comb. 25(5): 575-598 (2005) - [j22]Matthias Kriesell:
Triangle Density and Contractibility. Comb. Probab. Comput. 14(1-2): 133-146 (2005) - [j21]Matthias Kriesell:
Disjoint A-paths in digraphs. J. Comb. Theory B 95(1): 168-172 (2005) - [c3]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 - [c2]Fabian Abel, Robert Baumgartner, Adrian Brooks, Christian Enzi, Georg Gottlob, Nicola Henze, Marcus Herzog, Matthias Kriesell, Wolfgang Nejdl, Kai Tomaschewski:
The Personal Publication Reader. ISWC 2005: 1050-1053 - 2004
- [c1]Changtao Qu, Wolfgang Nejdl, Matthias Kriesell:
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs. ISPA 2004: 914-925 - 2003
- [j20]András Frank, Tamás Király, Matthias Kriesell:
On decomposing a hypergraph into k connected sub-hypergraphs. Discret. Appl. Math. 131(2): 373-383 (2003) - [j19]Matthias Kriesell:
Edge-disjoint trees containing some given vertices in a graph. J. Comb. Theory B 88(1): 53-65 (2003) - 2002
- [j18]Matthias Kriesell:
A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity. Graphs Comb. 18(1): 1-30 (2002) - [j17]Matthias Kriesell:
Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph. Graphs Comb. 18(1): 133-146 (2002) - [j16]Matthias Kriesell:
A Contribution to a Conjecture of A. Saito. Graphs Comb. 18(3): 565-571 (2002) - 2001
- [j15]Matthias Kriesell:
A Degree Sum Condition for the Existence of a Contractible Edge in a kappa-Connected Graph. J. Comb. Theory B 82(1): 81-101 (2001) - [j14]Matthias Kriesell:
All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected. J. Comb. Theory B 82(2): 306-315 (2001) - [j13]Matthias Kriesell:
Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices. J. Comb. Theory B 83(2): 305-319 (2001) - [j12]Matthias Kriesell:
The symmetric (2k, k)-graphs. J. Graph Theory 36(1): 35-51 (2001) - [j11]Matthias Kriesell:
Induced paths in 5-connected graphs. J. Graph Theory 36(1): 52-58 (2001) - [j10]Haitze J. Broersma, Matthias Kriesell, Zdenek Ryjácek:
On factors of 4-connected claw-free graphs. J. Graph Theory 37(2): 125-136 (2001) - 2000
- [j9]Matthias Kriesell:
The k-Critical 2k-Connected Graphs for kepsilon{3, 4}. J. Comb. Theory B 78(1): 69-80 (2000) - [j8]Matthias Kriesell:
Contractible Subgraphs in 3-Connected Graphs. J. Comb. Theory B 80(1): 32-48 (2000)
1990 – 1999
- 1999
- [j7]Ekkehard Köhler, Matthias Kriesell:
Edge-Dominating Trails in AT-free Graphs (Extended Abstract). Electron. Notes Discret. Math. 3: 95-101 (1999) - [j6]Matthias Kriesell:
Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity. Electron. Notes Discret. Math. 3: 110-113 (1999) - [j5]Matthias Kriesell:
Contractible Non-Edges in Triangle-Free Graphs. Graphs Comb. 15(4): 429-439 (1999) - [j4]Matthias Kriesell:
On a conjecture of Thomassen and Toft. J. Graph Theory 32(2): 118-122 (1999) - 1998
- [j3]Matthias Kriesell:
On k-Critical Connected Line Graphs. J. Comb. Theory B 74(1): 1-7 (1998) - [j2]Matthias Kriesell:
Contractible Non-edges in 3-Connected Graphs. J. Comb. Theory B 74(2): 192-201 (1998) - 1997
- [j1]Matthias Kriesell:
A Note on Hamiltonian Cycles in Lexicographical Products. J. Autom. Lang. Comb. 2(2): 135-138 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-11 21:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
