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.0447 sec


Alt, Helmut; Payne, Michael S.; Schmidt, Jens M.; Wood, David R.
Thoughts on Barnette's conjecture. - In: The Australasian journal of combinatorics. - Queensland : Centre for Discrete Mathematics and Computing, Univ. of Queensland, ISSN 10344942, Bd. 64 (2016), S. 354-365
http://nbn-resolving.de/urn:nbn:de:gbv:ilm1-2016200298
Schmidt, Jens M.
Mondshein sequences (a.k.a. (2,1)-orders). - In: SIAM journal on computing : a publication of the Society for Industrial and Applied Mathematics. - Philadelphia, Pa : SIAM, ISSN 10957111, Bd. 45 (2016), 6, S. 1985-2003
http://dx.doi.org/10.1137/15M1030030
Mnich, Matthias; Rutter, Ignaz; Schmidt, Jens M.
Linear-time recognition of map graphs with outerplanar witness. - In: 15th Scandinavian Symposium and Workshops on Algorithm Theory : SWAT 2016, June 22-24, 2016, Reykjavik, Iceland. - Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing / Scandinavian Symposium and Workshops on Algorithm Theory ; 15 (Reykjavik) : 2016.06.22-24., ISBN 978-3-95977-011-8, (2016), Seite 5:1-5:14

http://dx.doi.org/10.4230/LIPIcs.SWAT.2016.5
Bang-Jensen, Jørgen; Kriesell, Matthias; Maddaloni, Alessandro; Simonsen, Sven
Arc-disjoint directed and undirected cycles in digraphs. - In: Journal of graph theory. - New York, NY [u.a.] : Wiley, ISSN 10970118, Bd. 83 (2016), 4, S. 406-420
http://dx.doi.org/10.1002/jgt.22006
Adamaszek, Anna; Adamaszek, Michal; Mnich, Matthias; Schmidt, Jens M.
Lower bounds for locally highly connected graphs. - In: Graphs and combinatorics. - Tokyo : Springer-Verl. Tokyo, ISSN 14355914, Bd. 32 (2016), 5, S. 1641-1650
http://dx.doi.org/10.1007/s00373-016-1686-y
Harant, Jochen; Kemnitz, Arnfried
Lower bounds on the sum choice number of a graph. - In: Electronic notes in discrete mathematics. - Amsterdam : Elsevier Science, ISSN 15710653, Bd. 53 (2016), S. 421-431
http://dx.doi.org/10.1016/j.endm.2016.05.036
Fabrici, Igor; Harant, Jochen; Jendrol', Stanislav
On longest cycles in essentially 4-connected planar graphs. - In: Discussiones mathematicae / Graph theory. - Warsaw : De Gruyter Open, ISSN 20835892, Bd. 36 (2016), 3, S. 565-575
http://dx.doi.org/10.7151/dmgt.1875
Przybyło, Jakub; Schreyer, Jens; Škrabul'áková, Erika
On the facial Thue choice number of plane graphs via entropy compression method. - In: Graphs and combinatorics. - Tokyo : Springer-Verl. Tokyo, ISSN 14355914, Bd. 32 (2016), 3, S. 1137-1153
http://dx.doi.org/10.1007/s00373-015-1642-2
Harant, Jochen; Mohr, Samuel
Maximum weighted induced subgraphs. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 339 (2016), 7, S. 1954-1559
http://dx.doi.org/10.1016/j.disc.2015.07.013
Axenovich, Maria; Harant, Jochen; Przybyło, Jaromir; Soták, Roman; Voigt, Margit; Weidelich, Jenny
A note on adjacent vertex distinguishing colorings of graphs. - In: Discrete applied mathematics. - [S.l.] : Elsevier, Bd. 205 (2016), S. 1-7
http://dx.doi.org/10.1016/j.dam.2015.12.005