Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Matthias Kriesell
@article{DBLP:journals/jgt/BohmeHKMS24,
author = {Thomas B{\"{o}}hme and
Jochen Harant and
Matthias Kriesell and
Samuel Mohr and
Jens M. Schmidt},
title = {Rooted minors and locally spanning subgraphs},
journal = {J. Graph Theory},
volume = {105},
number = {2},
pages = {209--229},
year = {2024},
url = {https://doi.org/10.1002/jgt.23012},
doi = {10.1002/JGT.23012},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BohmeHKMS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChanKS23,
author = {Tsz Lung Chan and
Matthias Kriesell and
Jens M. Schmidt},
title = {Contractible edges in longest cycles},
journal = {J. Graph Theory},
volume = {103},
number = {3},
pages = {542--563},
year = {2023},
url = {https://doi.org/10.1002/jgt.22935},
doi = {10.1002/JGT.22935},
timestamp = {Sun, 10 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/ChanKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BangJensenHK23,
author = {J{\o}rgen Bang{-}Jensen and
Florian H{\"{o}}rsch and
Matthias Kriesell},
title = {Complexity of (arc)-connectivity problems involving arc-reversals
or deorientations},
journal = {Theor. Comput. Sci.},
volume = {973},
pages = {114097},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2023.114097},
doi = {10.1016/J.TCS.2023.114097},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BangJensenHK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Bang-JensenHKY22,
author = {J{\o}rgen Bang{-}Jensen and
Fr{\'{e}}d{\'{e}}ric Havet and
Matthias Kriesell and
Anders Yeo},
title = {Low chromatic spanning sub(di)graphs with prescribed degree or connectivity
properties},
journal = {J. Graph Theory},
volume = {99},
number = {4},
pages = {615--636},
year = {2022},
url = {https://doi.org/10.1002/jgt.22755},
doi = {10.1002/JGT.22755},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Bang-JensenHKY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Bang-JensenK22,
author = {J{\o}rgen Bang{-}Jensen and
Matthias Kriesell},
title = {Good acyclic orientations of 4-regular 4-connected graphs},
journal = {J. Graph Theory},
volume = {100},
number = {4},
pages = {698--720},
year = {2022},
url = {https://doi.org/10.1002/jgt.22803},
doi = {10.1002/JGT.22803},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Bang-JensenK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Bang-JensenBHK21,
author = {J{\o}rgen Bang{-}Jensen and
St{\'{e}}phane Bessy and
Jing Huang and
Matthias Kriesell},
title = {Good orientations of unions of edge-disjoint spanning trees},
journal = {J. Graph Theory},
volume = {96},
number = {4},
pages = {594--618},
year = {2021},
url = {https://doi.org/10.1002/jgt.22633},
doi = {10.1002/JGT.22633},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/Bang-JensenBHK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kriesell21,
author = {Matthias Kriesell},
title = {A note on uniquely 10-colorable graphs},
journal = {J. Graph Theory},
volume = {98},
number = {1},
pages = {24--26},
year = {2021},
url = {https://doi.org/10.1002/jgt.22679},
doi = {10.1002/JGT.22679},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kriesell21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell20,
author = {Matthias Kriesell},
title = {Maximal ambiguously \emph{k}-colorable graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {140},
pages = {248--262},
year = {2020},
url = {https://doi.org/10.1016/j.jctb.2019.05.007},
doi = {10.1016/J.JCTB.2019.05.007},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KriesellM19,
author = {Matthias Kriesell and
Samuel Mohr},
title = {Rooted Complete Minors in Line Graphs with a Kempe Coloring},
journal = {Graphs Comb.},
volume = {35},
number = {2},
pages = {551--557},
year = {2019},
url = {https://doi.org/10.1007/s00373-019-02012-7},
doi = {10.1007/S00373-019-02012-7},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/KriesellM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KriesellS18,
author = {Matthias Kriesell and
Jens M. Schmidt},
title = {More on foxes},
journal = {J. Graph Theory},
volume = {89},
number = {2},
pages = {101--114},
year = {2018},
url = {https://doi.org/10.1002/jgt.22243},
doi = {10.1002/JGT.22243},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KriesellS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kriesell18,
author = {Matthias Kriesell},
title = {Nonseparating K4-subdivisions in graphs of minimum degree at least
4},
journal = {J. Graph Theory},
volume = {89},
number = {2},
pages = {194--213},
year = {2018},
url = {https://doi.org/10.1002/jgt.22247},
doi = {10.1002/JGT.22247},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kriesell18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BohmeHKS17,
author = {Thomas B{\"{o}}hme and
Jochen Harant and
Matthias Kriesell and
Michael Stiebitz},
title = {Horst Sachs {(1927-2016)}},
journal = {Discret. Math.},
volume = {340},
number = {11},
pages = {2615},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2017.04.023},
doi = {10.1016/J.DISC.2017.04.023},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BohmeHKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Bang-JensenBJK17,
author = {J{\o}rgen Bang{-}Jensen and
St{\'{e}}phane Bessy and
Bill Jackson and
Matthias Kriesell},
title = {Antistrong digraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {122},
pages = {68--90},
year = {2017},
url = {https://doi.org/10.1016/j.jctb.2016.05.004},
doi = {10.1016/J.JCTB.2016.05.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Bang-JensenBJK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kriesell17,
author = {Matthias Kriesell},
title = {Unique Colorability and Clique Minors},
journal = {J. Graph Theory},
volume = {85},
number = {1},
pages = {207--216},
year = {2017},
url = {https://doi.org/10.1002/jgt.22056},
doi = {10.1002/JGT.22056},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kriesell17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Bang-JensenKMS16,
author = {J{\o}rgen Bang{-}Jensen and
Matthias Kriesell and
Alessandro Maddaloni and
Sven Simonsen},
title = {Arc-Disjoint Directed and Undirected Cycles in Digraphs},
journal = {J. Graph Theory},
volume = {83},
number = {4},
pages = {406--420},
year = {2016},
url = {https://doi.org/10.1002/jgt.22006},
doi = {10.1002/JGT.22006},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Bang-JensenKMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KriesellS16,
author = {Matthias Kriesell and
Jens M. Schmidt},
title = {More on foxes},
journal = {CoRR},
volume = {abs/1610.09093},
year = {2016},
url = {http://arxiv.org/abs/1610.09093},
eprinttype = {arXiv},
eprint = {1610.09093},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KriesellS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/KriesellP15,
author = {Matthias Kriesell and
Anders Sune Pedersen},
title = {On graphs double-critical with respect to the colouring number},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {17},
number = {2},
pages = {49--62},
year = {2015},
url = {https://doi.org/10.46298/dmtcs.2129},
doi = {10.46298/DMTCS.2129},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/KriesellP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Bang-JensenKMS14,
author = {J{\o}rgen Bang{-}Jensen and
Matthias Kriesell and
Alessandro Maddaloni and
Sven Simonsen},
title = {Vertex-disjoint directed and undirected cycles in general digraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {106},
pages = {1--14},
year = {2014},
url = {https://doi.org/10.1016/j.jctb.2013.10.005},
doi = {10.1016/J.JCTB.2013.10.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Bang-JensenKMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AndoEK14,
author = {Kiyoshi Ando and
Yoshimi Egawa and
Matthias Kriesell},
title = {The Average Degree of Minimally Contraction-Critically 5-Connected
Graphs},
journal = {J. Graph Theory},
volume = {75},
number = {4},
pages = {331--354},
year = {2014},
url = {https://doi.org/10.1002/jgt.21741},
doi = {10.1002/JGT.21741},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AndoEK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Bang-JensenK11,
author = {J{\o}rgen Bang{-}Jensen and
Matthias Kriesell},
title = {On the problem of finding disjoint cycles and dicycles in a digraph},
journal = {Comb.},
volume = {31},
number = {6},
pages = {639--668},
year = {2011},
url = {https://doi.org/10.1007/s00493-011-2670-z},
doi = {10.1007/S00493-011-2670-Z},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Bang-JensenK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Kriesell11,
author = {Matthias Kriesell},
title = {Balancing two spanning trees},
journal = {Networks},
volume = {57},
number = {4},
pages = {351--353},
year = {2011},
url = {https://doi.org/10.1002/net.20405},
doi = {10.1002/NET.20405},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Kriesell11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BaratK10,
author = {J{\'{a}}nos Bar{\'{a}}t and
Matthias Kriesell},
title = {What is on his mind?},
journal = {Discret. Math.},
volume = {310},
number = {20},
pages = {2573--2583},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2010.06.007},
doi = {10.1016/J.DISC.2010.06.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BaratK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Kriesell10,
author = {Matthias Kriesell},
title = {On Seymour's strengthening of Hadwiger's conjecture for graphs with
certain forbidden subgraphs},
journal = {Discret. Math.},
volume = {310},
number = {20},
pages = {2714--2724},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2010.04.005},
doi = {10.1016/J.DISC.2010.04.005},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Kriesell10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell10,
author = {Matthias Kriesell},
title = {Packing Steiner trees on four terminals},
journal = {J. Comb. Theory, Ser. {B}},
volume = {100},
number = {6},
pages = {546--553},
year = {2010},
url = {https://doi.org/10.1016/j.jctb.2010.04.003},
doi = {10.1016/J.JCTB.2010.04.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Bang-JensenK09,
author = {J{\o}rgen Bang{-}Jensen and
Matthias Kriesell},
title = {Disjoint sub(di)graphs in digraphs},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {179--183},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.030},
doi = {10.1016/J.ENDM.2009.07.030},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Bang-JensenK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/AndoEKK09,
author = {Kiyoshi Ando and
Yoshimi Egawa and
Ken{-}ichi Kawarabayashi and
Matthias Kriesell},
title = {On the number of 4-contractible edges in 4-connected graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {99},
number = {1},
pages = {97--109},
year = {2009},
url = {https://doi.org/10.1016/j.jctb.2008.04.003},
doi = {10.1016/J.JCTB.2008.04.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/AndoEKK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kriesell09,
author = {Matthias Kriesell},
title = {Edge disjoint Steiner trees in graphs without large bridges},
journal = {J. Graph Theory},
volume = {62},
number = {2},
pages = {188--198},
year = {2009},
url = {https://doi.org/10.1002/jgt.20389},
doi = {10.1002/JGT.20389},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kriesell09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bang-JensenK09,
author = {J{\o}rgen Bang{-}Jensen and
Matthias Kriesell},
title = {Disjoint directed and undirected paths and cycles in digraphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5138--5144},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.034},
doi = {10.1016/J.TCS.2009.08.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bang-JensenK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/anis/AbelHKK09,
author = {Fabian Abel and
Nicola Henze and
Daniel Krause and
Matthias Kriesell},
editor = {Vladan Devedzic and
Dragan Gasevic},
title = {Semantic Enhancement of Social Tagging Systems},
booktitle = {Web 2.0 {\&} Semantic Web},
series = {Annals of Information Systems},
volume = {6},
pages = {25--54},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-1-4419-1219-0\_2},
doi = {10.1007/978-1-4419-1219-0\_2},
timestamp = {Tue, 21 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/series/anis/AbelHKK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell08,
author = {Matthias Kriesell},
title = {On the number of contractible triples in 3-connected graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {98},
number = {1},
pages = {136--145},
year = {2008},
url = {https://doi.org/10.1016/j.jctb.2007.05.003},
doi = {10.1016/J.JCTB.2007.05.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kriesell08,
author = {Matthias Kriesell},
title = {Vertex suppression in 3-connected graphs},
journal = {J. Graph Theory},
volume = {57},
number = {1},
pages = {41--54},
year = {2008},
url = {https://doi.org/10.1002/jgt.20277},
doi = {10.1002/JGT.20277},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kriesell08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/AbelHKK08,
author = {Fabian Abel and
Nicola Henze and
Daniel Krause and
Matthias Kriesell},
editor = {Irwin King and
Ricardo Baeza{-}Yates},
title = {On the Effect of Group Structures on Ranking Strategies in Folksonomies},
booktitle = {Weaving Services and People on the World Wide Web, [features some
of the cutting-edge research work that were presented at the Workshop
Track of the 17th International World Wide Web Conference {(WWW} 2008)
held at Beijing, China, from April 21-25, 2008]},
pages = {275--300},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-642-00570-1\_14},
doi = {10.1007/978-3-642-00570-1\_14},
timestamp = {Mon, 26 Jun 2023 20:42:02 +0200},
biburl = {https://dblp.org/rec/conf/www/AbelHKK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Kriesell07,
author = {Matthias Kriesell},
title = {How to contract an essentially 6-connected graph to a 5-connected
graph},
journal = {Discret. Math.},
volume = {307},
number = {3-5},
pages = {494--510},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.09.040},
doi = {10.1016/J.DISC.2005.09.040},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Kriesell07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Kriesell07,
author = {Matthias Kriesell},
title = {On Small Contractible Subgraphs in 3-connected Graphs of Small Average
Degree},
journal = {Graphs Comb.},
volume = {23},
number = {5},
pages = {545--557},
year = {2007},
url = {https://doi.org/10.1007/s00373-007-0749-5},
doi = {10.1007/S00373-007-0749-5},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Kriesell07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell07,
author = {Matthias Kriesell},
title = {A constructive characterization of 3-connected triangle-free graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {97},
number = {3},
pages = {358--370},
year = {2007},
url = {https://doi.org/10.1016/j.jctb.2006.06.002},
doi = {10.1016/J.JCTB.2006.06.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BrandtBDK06,
author = {Stephan Brandt and
Hajo Broersma and
Reinhard Diestel and
Matthias Kriesell},
title = {Global Connectivity And Expansion: Long Cycles and Factors In \emph{f}-Connected
Graphs},
journal = {Comb.},
volume = {26},
number = {1},
pages = {17--36},
year = {2006},
url = {https://doi.org/10.1007/s00493-006-0002-5},
doi = {10.1007/S00493-006-0002-5},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BrandtBDK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Kriesell06,
author = {Matthias Kriesell},
title = {Mader's Conjecture On Extremely Critical Graphs},
journal = {Comb.},
volume = {26},
number = {3},
pages = {277--314},
year = {2006},
url = {https://doi.org/10.1007/s00493-006-0017-y},
doi = {10.1007/S00493-006-0017-Y},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Kriesell06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KaiserK06,
author = {Tom{\'{a}}s Kaiser and
Matthias Kriesell},
title = {On the Pancyclicity of Lexicographic Products},
journal = {Graphs Comb.},
volume = {22},
number = {1},
pages = {51--58},
year = {2006},
url = {https://doi.org/10.1007/s00373-005-0639-7},
doi = {10.1007/S00373-005-0639-7},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KaiserK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Kriesell06,
author = {Matthias Kriesell},
title = {There Exist Highly Critically Connected Graphs of Diameter Three},
journal = {Graphs Comb.},
volume = {22},
number = {4},
pages = {481--485},
year = {2006},
url = {https://doi.org/10.1007/s00373-006-0672-1},
doi = {10.1007/S00373-006-0672-1},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Kriesell06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell06,
author = {Matthias Kriesell},
title = {Contractions, cycle double covers, and cyclic colorings in locally
connected graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {96},
number = {6},
pages = {881--900},
year = {2006},
url = {https://doi.org/10.1016/j.jctb.2006.02.009},
doi = {10.1016/J.JCTB.2006.02.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kriesell06,
author = {Matthias Kriesell},
title = {Average degree and contractibility},
journal = {J. Graph Theory},
volume = {51},
number = {3},
pages = {205--224},
year = {2006},
url = {https://doi.org/10.1002/jgt.20131},
doi = {10.1002/JGT.20131},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kriesell06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/daglib/p/QuNK06,
author = {Changtao Qu and
Wolfgang Nejdl and
Matthias Kriesell},
editor = {Steffen Staab and
Heiner Stuckenschmidt},
title = {Cayley DHTs - {A} Group-Theoretic Framework for Analyzing DHTs Based
on Cayley Graphs},
booktitle = {Semantic Web and Peer-to-Peer - Decentralized Management and Exchange
of Knowledge and Information},
pages = {89--105},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/3-540-28347-1\_5},
doi = {10.1007/3-540-28347-1\_5},
timestamp = {Tue, 07 May 2024 19:59:15 +0200},
biburl = {https://dblp.org/rec/books/daglib/p/QuNK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Kriesell05,
author = {Matthias Kriesell},
title = {Closed Separator Sets},
journal = {Comb.},
volume = {25},
number = {5},
pages = {575--598},
year = {2005},
url = {https://doi.org/10.1007/s00493-005-0035-1},
doi = {10.1007/S00493-005-0035-1},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Kriesell05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Kriesell05,
author = {Matthias Kriesell},
title = {Triangle Density and Contractibility},
journal = {Comb. Probab. Comput.},
volume = {14},
number = {1-2},
pages = {133--146},
year = {2005},
url = {https://doi.org/10.1017/S0963548304006601},
doi = {10.1017/S0963548304006601},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Kriesell05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell05,
author = {Matthias Kriesell},
title = {Disjoint \emph{A}-paths in digraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {95},
number = {1},
pages = {168--172},
year = {2005},
url = {https://doi.org/10.1016/j.jctb.2005.03.001},
doi = {10.1016/J.JCTB.2005.03.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccsa/BaumgartnerEHHHKT05,
author = {Robert Baumgartner and
Christian Enzi and
Nicola Henze and
Marc Herrlich and
Marcus Herzog and
Matthias Kriesell and
Kai Tomaschewski},
editor = {Osvaldo Gervasi and
Marina L. Gavrilova and
Vipin Kumar and
Antonio Lagan{\`{a}} and
Heow Pueh Lee and
Youngsong Mun and
David Taniar and
Chih Jeng Kenneth Tan},
title = {Semantic Web Enabled Information Systems: Personalized Views on Web
Data},
booktitle = {Computational Science and Its Applications - {ICCSA} 2005, International
Conference, Singapore, May 9-12, 2005, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {3481},
pages = {988--997},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11424826\_106},
doi = {10.1007/11424826\_106},
timestamp = {Thu, 28 Apr 2022 16:17:38 +0200},
biburl = {https://dblp.org/rec/conf/iccsa/BaumgartnerEHHHKT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/semweb/AbelBBEGHHKNT05,
author = {Fabian Abel and
Robert Baumgartner and
Adrian Brooks and
Christian Enzi and
Georg Gottlob and
Nicola Henze and
Marcus Herzog and
Matthias Kriesell and
Wolfgang Nejdl and
Kai Tomaschewski},
editor = {Yolanda Gil and
Enrico Motta and
V. Richard Benjamins and
Mark A. Musen},
title = {The Personal Publication Reader},
booktitle = {The Semantic Web - {ISWC} 2005, 4th International Semantic Web Conference,
{ISWC} 2005, Galway, Ireland, November 6-10, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3729},
pages = {1050--1053},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11574620\_75},
doi = {10.1007/11574620\_75},
timestamp = {Tue, 07 Sep 2021 13:47:46 +0200},
biburl = {https://dblp.org/rec/conf/semweb/AbelBBEGHHKNT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ispa/QuNK04,
author = {Changtao Qu and
Wolfgang Nejdl and
Matthias Kriesell},
editor = {Jiannong Cao and
Laurence Tianruo Yang and
Minyi Guo and
Francis Chi{-}Moon Lau},
title = {Cayley DHTs - {A} Group-Theoretic Framework for Analyzing DHTs Based
on Cayley Graphs},
booktitle = {Parallel and Distributed Processing and Applications, Second InternationalSymposium,
{ISPA} 2004, Hong Kong, China, December 13-15, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3358},
pages = {914--925},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30566-8\_105},
doi = {10.1007/978-3-540-30566-8\_105},
timestamp = {Tue, 14 Apr 2020 13:23:10 +0200},
biburl = {https://dblp.org/rec/conf/ispa/QuNK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FrankKK03,
author = {Andr{\'{a}}s Frank and
Tam{\'{a}}s Kir{\'{a}}ly and
Matthias Kriesell},
title = {On decomposing a hypergraph into k connected sub-hypergraphs},
journal = {Discret. Appl. Math.},
volume = {131},
number = {2},
pages = {373--383},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00463-8},
doi = {10.1016/S0166-218X(02)00463-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FrankKK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell03,
author = {Matthias Kriesell},
title = {Edge-disjoint trees containing some given vertices in a graph},
journal = {J. Comb. Theory, Ser. {B}},
volume = {88},
number = {1},
pages = {53--65},
year = {2003},
url = {https://doi.org/10.1016/S0095-8956(02)00013-8},
doi = {10.1016/S0095-8956(02)00013-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Kriesell02,
author = {Matthias Kriesell},
title = {A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity},
journal = {Graphs Comb.},
volume = {18},
number = {1},
pages = {1--30},
year = {2002},
url = {https://doi.org/10.1007/s003730200000},
doi = {10.1007/S003730200000},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Kriesell02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Kriesell02a,
author = {Matthias Kriesell},
title = {Upper Bounds to the Number of Vertices in a k-Critically n-Connected
Graph},
journal = {Graphs Comb.},
volume = {18},
number = {1},
pages = {133--146},
year = {2002},
url = {https://doi.org/10.1007/s003730200008},
doi = {10.1007/S003730200008},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Kriesell02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Kriesell02b,
author = {Matthias Kriesell},
title = {A Contribution to a Conjecture of A. Saito},
journal = {Graphs Comb.},
volume = {18},
number = {3},
pages = {565--571},
year = {2002},
url = {https://doi.org/10.1007/s003730200040},
doi = {10.1007/S003730200040},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Kriesell02b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell01a,
author = {Matthias Kriesell},
title = {A Degree Sum Condition for the Existence of a Contractible Edge in
a kappa-Connected Graph},
journal = {J. Comb. Theory, Ser. {B}},
volume = {82},
number = {1},
pages = {81--101},
year = {2001},
url = {https://doi.org/10.1006/jctb.2000.2024},
doi = {10.1006/JCTB.2000.2024},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell01b,
author = {Matthias Kriesell},
title = {All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected},
journal = {J. Comb. Theory, Ser. {B}},
volume = {82},
number = {2},
pages = {306--315},
year = {2001},
url = {https://doi.org/10.1006/jctb.2001.2040},
doi = {10.1006/JCTB.2001.2040},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell01b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell01,
author = {Matthias Kriesell},
title = {Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices},
journal = {J. Comb. Theory, Ser. {B}},
volume = {83},
number = {2},
pages = {305--319},
year = {2001},
url = {https://doi.org/10.1006/jctb.2001.2060},
doi = {10.1006/JCTB.2001.2060},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kriesell01,
author = {Matthias Kriesell},
title = {The symmetric (2\emph{k, k})-graphs},
journal = {J. Graph Theory},
volume = {36},
number = {1},
pages = {35--51},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200101)36:1\&\#60;35::AID-JGT4\&\#62;3.0.CO;2-J},
doi = {10.1002/1097-0118(200101)36:1\&\#60;35::AID-JGT4\&\#62;3.0.CO;2-J},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kriesell01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kriesell01a,
author = {Matthias Kriesell},
title = {Induced paths in 5-connected graphs},
journal = {J. Graph Theory},
volume = {36},
number = {1},
pages = {52--58},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200101)36:1\&\#60;52::AID-JGT5\&\#62;3.0.CO;2-N},
doi = {10.1002/1097-0118(200101)36:1\&\#60;52::AID-JGT5\&\#62;3.0.CO;2-N},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kriesell01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaKR01,
author = {Haitze J. Broersma and
Matthias Kriesell and
Zdenek Ryj{\'{a}}cek},
title = {On factors of 4-connected claw-free graphs},
journal = {J. Graph Theory},
volume = {37},
number = {2},
pages = {125--136},
year = {2001},
url = {https://doi.org/10.1002/jgt.1008},
doi = {10.1002/JGT.1008},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaKR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell00a,
author = {Matthias Kriesell},
title = {The \emph{k}-Critical 2\emph{k}-Connected Graphs for \emph{k}epsilon\{3,
4\}},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {1},
pages = {69--80},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1929},
doi = {10.1006/JCTB.1999.1929},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell00a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell00,
author = {Matthias Kriesell},
title = {Contractible Subgraphs in 3-Connected Graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {80},
number = {1},
pages = {32--48},
year = {2000},
url = {https://doi.org/10.1006/jctb.2000.1960},
doi = {10.1006/JCTB.2000.1960},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KohlerK99,
author = {Ekkehard K{\"{o}}hler and
Matthias Kriesell},
title = {Edge-Dominating Trails in AT-free Graphs (Extended Abstract)},
journal = {Electron. Notes Discret. Math.},
volume = {3},
pages = {95--101},
year = {1999},
url = {https://doi.org/10.1016/S1571-0653(05)80033-2},
doi = {10.1016/S1571-0653(05)80033-2},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KohlerK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Kriesell99,
author = {Matthias Kriesell},
title = {Local spanning trees in graphs and hypergraph decomposition with respect
to edge connectivity},
journal = {Electron. Notes Discret. Math.},
volume = {3},
pages = {110--113},
year = {1999},
url = {https://doi.org/10.1016/S1571-0653(05)80036-8},
doi = {10.1016/S1571-0653(05)80036-8},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Kriesell99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Kriesell99,
author = {Matthias Kriesell},
title = {Contractible Non-Edges in Triangle-Free Graphs},
journal = {Graphs Comb.},
volume = {15},
number = {4},
pages = {429--439},
year = {1999},
url = {https://doi.org/10.1007/s003730050051},
doi = {10.1007/S003730050051},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Kriesell99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kriesell99,
author = {Matthias Kriesell},
title = {On a conjecture of Thomassen and Toft},
journal = {J. Graph Theory},
volume = {32},
number = {2},
pages = {118--122},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199910)32:2\&\#60;118::AID-JGT2\&\#62;3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0118(199910)32:2\&\#60;118::AID-JGT2\&\#62;3.0.CO;2-N},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kriesell99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell98,
author = {Matthias Kriesell},
title = {On \emph{k}-Critical Connected Line Graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {74},
number = {1},
pages = {1--7},
year = {1998},
url = {https://doi.org/10.1006/jctb.1998.1823},
doi = {10.1006/JCTB.1998.1823},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell98a,
author = {Matthias Kriesell},
title = {Contractible Non-edges in 3-Connected Graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {74},
number = {2},
pages = {192--201},
year = {1998},
url = {https://doi.org/10.1006/jctb.1998.1842},
doi = {10.1006/JCTB.1998.1842},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell98a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/Kriesell97,
author = {Matthias Kriesell},
title = {A Note on Hamiltonian Cycles in Lexicographical Products},
journal = {J. Autom. Lang. Comb.},
volume = {2},
number = {2},
pages = {135--138},
year = {1997},
url = {https://doi.org/10.25596/jalc-1997-135},
doi = {10.25596/JALC-1997-135},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jalc/Kriesell97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 01:13 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:
