http://www.tu-ilmenau.de

Logo TU Ilmenau


Arbeitsgruppe
Diskrete Mathematik und Algebra


Foto des Ansprechpartners
Ansprechpartner

Univ.-Prof. Dr. rer. nat. habil. Matthias Kriesell

Fachgebietsleiter

Telefon +49 3677 69-3633

E-Mail senden


Ihre Position

INHALTE

Publikationsliste seit 1990

Anzahl der Treffer: 364
Erstellt: Thu, 14 Dec 2017 23:07:36 +0100 in 0.0296 sec


Schlipf, Lena; Schmidt, Jens M.
Edge-orders. - In: 44th International Colloquium on Automata, Languages, and Programming : ICALP 2017, Warsaw, Poland, July 10-14, 2017. - Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing / International Colloquium on Automata, Languages, and Programming ; 44 (Warsaw) : 2017.07.10-14., ISBN 978-3-95977-041-5, (2017), Seite 75:1-75:14

http://dx.doi.org/10.4230/LIPIcs.ICALP.2017.75
Schmidt, Jens M.
Tight bounds for the vertices of degree k in minimally k-connected graphs. - In: Journal of graph theory. - New York, NY [u.a.] : Wiley, ISSN 10970118, (2017), first published (18. Sep.), insges. 8 S.
https://doi.org/10.1002/jgt.22202
Brause, Christoph; Kemnitz, Arnfried; Marangio, Massimiliano; Pruchnewski, Anja; Voigt, Margit
Sum choice number of generalized [theta]-graphs. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 340 (2017), 11, S. 2633-2640
https://doi.org/10.1016/j.disc.2016.11.028
Kriesell, Matthias
Degree sequences and edge connectivity. - In: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. - Berlin [u.a.] : Springer, ISSN 18658784, Bd. 87 (2017), 2, S. 343-355
https://doi.org/10.1007/s12188-016-0171-0
Kriesell, Matthias
Unique colorability and clique minors. - In: Journal of graph theory. - New York, NY [u.a.] : Wiley, ISSN 10970118, Bd. 85 (2017), 1, S. 207-216
https://doi.org/10.1002/jgt.22056
Stiebitz, Michael
A relaxed version of the Erd˝os-Lovász Tihany conjecture. - In: Journal of graph theory. - New York, NY [u.a.] : Wiley, ISSN 10970118, Bd. 85 (2017), 1, S. 278-287
https://doi.org/10.1002/jgt.22060
Schweser, Thomas; Stiebitz, Michael
Degree choosable signed graphs. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 340 (2017), 5, S. 882-891
http://dx.doi.org/10.1016/j.disc.2017.01.007
Bang-Jensen, Jørgen; Bessy, Stéphane; Jackson, Bill; Kriesell, Matthias
Antistrong digraphs. - In: Journal of combinatorial theory / B. - Orlando, Fla : Academic Press, Bd. 122 (2017), S. 68-90
http://dx.doi.org/10.1016/j.jctb.2016.05.004
Mehlhorn, Kurt; Neumann, Adrian; Schmidt, Jens M.
Certifying 3-edge-connectivity. - In: Algorithmica : an international journal in computer science. - New York, NY : Springer, ISSN 14320541, Bd. 77 (2017), 2, S. 309-335
http://dx.doi.org/10.1007/s00453-015-0075-x
Harant, Jochen; Fabrici, Igor; Jendrol', Stanislav
On longest cycles in essentially 4-connected planar graphs. - In: Electronic notes in discrete mathematics. - Amsterdam : Elsevier Science, ISSN 15710653, Bd. 55 (2016), S. 143-146
https://doi.org/10.1016/j.endm.2016.10.036