Publikationen

Publikationen von Prof. Dr. Matthias Kriesell


66.	Maximal ambiguously k-colorable graphs, Journal of Combinatorial Theory (B) 140 (2020), 248-262. DOI.
65.	Rooted complete minors in line graphs with a Kempe coloring, with S. Mohr, Graphs and Combinatorics 35 (2019), 551-557. DOI.
64.	Nonseparating K₄-subdivisions in graphs of minimum degree at least 4, Journal of Graph Theory 89 (2018), 194-213. DOI.
63.	More on foxes, with J. M. Schmidt, Journal of Graph Theory 89 (2018), 101-114. DOI.
62.	Degree Sequences and Edge Connectivity, Abh. Math. Sem. Univ. Hamburg 87 (2017), 343-355. DOI.
61.	Unique colorability and clique minors, Journal of Graph Theory 85 (2017), 207-216. DOI.
60.	Antistrong digraphs, with J. Bang-Jensen, S. Bessy, and B. Jackson, Journal of Combinatorial Theory (B) 122 (2017), 68-90. DOI.
59.	Arc-Disjoint Directed and Undirected Cycles in Digraphs, with J. Bang-Jensen, A. Maddaloni, and S. Simonsen, Journal of Graph Theory 83 (2016), 406-420. DOI.
58.	On graphs double-critical with respect to the colouring number, with A. S. Pedersen, Discrete Mathematics & Theoretical Computer Science 17 (2015), 49-62.
57.	Vertex-disjoint directed and undirected cycles in general digraphs, with J. Bang-Jensen, A. Maddaloni, and S. Simonsen, Journal of Combinatorial Theory (B) 106 (2014), 1-14.
56.	The average degree of minimally contraction-critically 5-connected graphs, with K. Ando and Y. Egawa, Journal of Graph Theory 75 (2014), 331-354. DOI.
55.	Axioms for infinite matroids, with H. Bruhn, R. Diestel, R. Pendavingh, and P. Wollan, Advances in Mathematics 239 (2013), 18-46.
54.	Minimal Connectivity, in Topics in Structural Graph Theory, edited by L. Beineke and R. Wilson, Cambridge University Press (2013), 71-99.
53.	On the problem of finding disjoint cycles and dicycles in a digraph, with J. Bang-Jensen, Combinatorica 31 (2011), 639-668.
52.	What is on his mind?, with J. Barát, Discrete Mathematics 310 (2010), 2573-2583. DOI.
51.	On Seymour's strengthening of Hadwiger's Conjecture for graphs with certain forbidden subgraphs, Discrete Mathematics 310 (2010), 2714-2724. DOI.
50.	Balancing two spanning trees, Networks 57 (2011), 351-353. DOI.
49.	Packing Steiner trees on four terminals, Journal of Combinatorial Theory (B) 100 (2010), 546-553. DOI.
48.	Semantic Enhancement of Social Tagging Systems, with F. Abel, N. Henze, and D. Krause, Annals of Information Systems 6 (2009), 25-54. DOI.
47.	Disjoint directed and undirected paths and cycles in digraphs, with J. Bang-Jensen, Theoretical Computer Science 46-49 (2009), 5138-5144. DOI.
46.	Edge disjoint Steiner trees in graphs without large bridges, Journal of Graph Theory 62 (2009), 188-198. DOI.
45.	Disjoint sub(di)graphs in digraphs, with J. Bang-Jensen, European Conference on Combinatorics, Graph Theory and Applications (2009), Electronic Notes in Discrete Mathematics 34 (2009), 179-183. DOI.
44.	On the number of 4-contractible edges in 4-connected graphs, with K. Ando, Y. Egawa, and K. Kawarabayashi, Journal of Combinatorial Theory (B) 99 (2009), 97-109. DOI.
43.	On the Effect of Group Structures on Ranking Strategies in Folksonomies, with F. Abel, N. Henze, and D. Krause, in: Weaving Services and People on the World Wide Web, Part 2, Springer Berlin Heidelberg (2009), 275-300. DOI.
42.	An elementary proof of Frank's characterization of the graphs having k edge disjoint spanning trees, SUT Journal of Mathematics 44 (2008), 101-107.
41.	On the number of contractible triples in 3-connected graphs, Journal of Combinatorial Theory (B) 98 (2008), 136-145. DOI.
40.	Vertex suppression in 3-connected graphs, Journal of Graph Theory 57 (2008), 41-54. DOI.
39.	On small contractible subgraphs in 3-connected graphs of small average degree, Graphs and Combinatorics 23 (2007), 545-557. DOI.
38.	A constructive characterization of the 3-connected triangle free graphs, Journal of Combinatorial Theory (B) 97 (2007), 358-370. DOI.
37.	How to contract an essentially 6-connected graph to a 5-connected graph, Discrete Mathematics 307 (2007), 494-510. DOI.
36.	A generating theorem for 5-regular simple planar graphs. I., with J. Kanno, Congressus Numerantium 185 (2007), 127-143.
35.	There exist highly critically connected graphs of diameter 3, Graphs and Combinatorics 22 (2006), 481-485. DOI.
34.	Contractions, Cycle Double Covers, and Cyclic Colorings in Locally Connected Graphs, Journal of Combinatorial Theory (B) 96 (2006), 881-900. DOI.
33.	Mader's conjecture on extremely critical graphs, Combinatorica 26 (2006), 277-314. DOI.
32.	On the Pancyclicity of Lexicographic Products, with T. Kaiser, Graphs and Combinatorics 22 (2006), 51-58. DOI.
31.	Average Degree and Contractibility, Journal of Graph Theory 51 (2006), 205-224. DOI.
30.	Global connectivity and expansion: long cycles and factors in f-connected graphs, with S. Brandt, H. Broersma, and R. Diestel, Combinatorica 26 (2006), 17-36. DOI.
29.	Closed Separator Sets, Combinatorica 25 (2005), 575-598. DOI.
28.	A Pictured Memorandum on Synthesis Phenomena Occurring in the Homicidal Chauffeur Game, with M. H. Breitner and A. Meyer, Proceedings of the Fifth International ISDG Workshop, International Society of Dynamic Games, Segovia (2005), 17-32.
27.	The Personal Publication Reader, with F. Abel, R. Baumgartner, A. Brooks, C. Enzi, G. Gottlob, N. Henze, M. Herzog, W. Nejdl, K. Tomaschewski, Semantic Web Challenge, 4th International Semantic Web Conference, Galway (2005).
26.	Disjoint A-paths in Digraphs, Journal of Combinatorial Theory (B) 95 (2005), 168-172. DOI.
25.	Semantic Web enabled Information Systems: Personalized Views on Web Data, with R. Baumgartner, C. Enzi, N. Henze, M. Herrlich, M. Herzog, K. Tomaschewski, International Ubiquitous Web Systems and Intelligence Workshop, Singapore (UWSI 2005). DOI.
24.	Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs, with W. Nejdl and C. Qu, 2nd International Symposium on Parallel and Distributed Processing, Hongkong (ISPA 2004). Also contained as a chapter in Semantic Web and Peer-to-Peer, S. Staab und H. Stuckenschmidt (eds.), Springer Heidelberg (2005). DOI.
23.	Triangle Density and Contractibility, Combinatorics, Probability and Computing 14 (2005), 133-146. DOI.
22.	Personalization Functionality for the Semantic Web: Architectural Outline and First Sample Implementations, with N. Henze, 1st International Workshop on Engineering the Adaptive Web (EAW 2004).
21.	On decomposing a hypergraph into k connected sub-hypergraphs, with A. Frank and T. Király, Discrete Applied Mathematics 131 (2003), 373-383. DOI.
20.	Edge disjoint trees containing some given vertices in a graph, Journal of Combinatorial Theory (B) 88 (2003), 53-65. DOI.
19.	A contribution to a conjecture of A. Saito, Graphs and Combinatorics 18 (2002), 565-571. DOI.
18.	A survey on contractible edges in graphs of a given vertex connectivity, Graphs and Combinatorics 18 (2002), 1-30. DOI.
17.	Upper bounds to the number of vertices in a k-critically n-connected graph, Graphs and Combinatorics 18 (2002), 133-146. DOI.
16.	Almost all 3-connected graphs contain a contractible set of k vertices, Journal of Combinatorial Theory (B) 83 (2001), 305-319. DOI.
15.	All 4-connected line graphs of claw free graphs are Hamiltonian connected, Journal of Combinatorial Theory (B) 82 (2001), 306-315. DOI.
14.	On factors of 4-connected claw free graphs, with H. Broersma and Zd. Ryjácek, Journal of Graph Theory 37 (2001), 125-136. DOI.
13.	A degree sum condition for the existence of a contractible edge in a k-connected graph, Journal of Combinatorial Theory (B) 82 (2001), 81-101. DOI.
12.	Induced paths in 5-connected graphs, Journal of Graph Theory 36 (2001), 52-58. DOI.
11.	The symmetric (2k,k)-graphs, Journal of Graph Theory 36 (2001), 35-51. DOI.
10.	Contractible subgraphs in 3-connected graphs, Journal of Combinatorial Theory (B) 80 (2000), 32-48. DOI.
9.	The k-critically 2k-connected graphs for k=3 and k=4, Journal of Combinatorial Theory (B) 78 (2000), 69-80. DOI.
8.	Contractible non-edges in triangle free graphs, Graphs and Combinatorics 15 (1999), 429-439.
7.	On a conjecture of Thomassen and Toft, Journal of Graph Theory 32 (1999), 118-122.
6.	Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity, 6th Twente Workshop on Graphs and Combinatorial Optimization (Enschede 1999), Electron. Notes Discrete Math., 3, Elsevier, Amsterdam (1999). DOI.
5.	Edge-dominating trails in AT-free graphs, with E. Köhler, 6th Twente Workshop on Graphs and Combinatorial Optimization (Enschede 1999), Electron. Notes Discrete Math., 3, Elsevier, Amsterdam (1999). DOI.
4.	Contractible non-edges in 3-connected graphs, Journal of Combinatorial Theory (B) 74 (1998), 192-201. DOI.
3.	On k-critically connected line graphs, Journal of Combinatorial Theory (B) 74 (1998), 1-7. DOI.
2.	Criticity Results Concerning the Connectivity of Graphs, PhD Thesis, TU Berlin (1997).
1.	A note on Hamiltonian Cycles in Lexicographical Products, Journal of Automata, Languages, and Combinatorics 2 (1997), 135-138.

Editorial Activities:

3. The Electronic Journal of Combinatorics

2. Discrete Mathematics & Theoretical Computer Science

1. AKCE International Journal of Graphs and Combinatorics

Publikationen im Fachgebiet

Löwenstein, Christian; Pedersen, Anders Sune; Rautenbach, Dieter; Regen, Friedrich
Independence, odd girth, and average degree. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 15 S., 232,7 KB). - (Preprint ; M09,32)
http://www.db-thueringen.de/servlets/DocumentServlet?id=14425

Harant, Jochen; Rautenbach, Dieter;
Independence in connected graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 10 S., 193,9 KB). - (Preprint ; M09,31)
http://www.db-thueringen.de/servlets/DocumentServlet?id=14424

Henning, Michael A.; Löwenstein, Christian; Rautenbach, Dieter
Remarks about disjoint dominating sets. - In: Discrete mathematics, Bd. 309 (2009), 23/24, S. 6451-6458

http://dx.doi.org/10.1016/j.disc.2009.06.017

Bartoschek, Christoph; Held, Stephan; Rautenbach, Dieter; Vygen, Jens
Fast buffering for optimizing worst slack and resource consumption in repeater trees. - In: Proceedings of the 2009 ACM International Symposium on Physical Design, ISBN 978-1-60558-449-2, (2009), S. 43-50

Peyer, Sven; Rautenbach, Dieter; Vygen, Jens
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing. - In: Journal of discrete algorithms, Bd. 7 (2009), 4, S. 377-390

http://dx.doi.org/10.1016/j.jda.2007.08.003

Böhme, Thomas; Schreyer, Jens;
A game theoretic approach to graph problems. - In: 9th International Conference on Innovative Internet Community Systems, I2CS 2009, (2009), S. 149-156

Maßberg, Jens; Rautenbach, Dieter
Binary trees with choosable edge lengths. - In: Information processing letters, ISSN 1872-6119, Bd. 109 (2009), 18, S. 1087-1092

http://dx.doi.org/10.1016/j.ipl.2009.07.002

Boßecker, Anett; Rautenbach, Dieter;
Interpolating between bounds on the independence number. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 9 S., 169,8 KB). - (Preprint ; M09,26)
http://www.db-thueringen.de/servlets/DocumentServlet?id=13756

Henning, Michael A.; Löwenstein, Christian; Rautenbach, Dieter;
Partitioning a graph into a dominating set, a total dominating set, and something else. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 11 S., 331,5 KB). - (Preprint ; M09,25)
http://www.db-thueringen.de/servlets/DocumentServlet?id=13714

Henning, Michael A.; Löwenstein, Christian; Rautenbach, Dieter;
An independent dominating set in the complement of a minimum dominating set of a tree. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 4 S., 142,9 KB). - (Preprint ; M09,24)
http://www.db-thueringen.de/servlets/DocumentServlet?id=13707

Seite 7 von 20 (⋎ Alle anzeigen )

Studienangebot

Uni erleben

Studienstart

Studierendenleben

Quicklinks

Studienangebot

Studienorganisation

Studieren ist mehr

Information und Beratung

Quicklinks

Berufseinstieg

Gründungsservice

Weiterbildung

Alumni

Quicklinks

Kontakt

Publikationen von Prof. Dr. Matthias Kriesell

Editorial Activities:

Publikationen im Fachgebiet

Studienangebot

Uni erleben

Studienstart

Studierendenleben

Quicklinks

Studienangebot

Studienorganisation

Studieren ist mehr

Information und Beratung

Quicklinks

Berufseinstieg

Gründungsservice

Weiterbildung

Alumni

Quicklinks

Publikationen von Prof. Dr. Matthias Kriesell

Refereed Publications

Preprints

Editorial Activities:

Publikationen im Fachgebiet