Brandt, Stephan; Miskuf, Jozef; Rautenbach, Dieter
Edge irregular total labellings for graphs of linear size. - In: Discrete mathematics, Bd. 309 (2009), 12, S. 3786-3792
http://dx.doi.org/10.1016/j.disc.2008.10.009
Edge irregular total labellings for graphs of linear size. - In: Discrete mathematics, Bd. 309 (2009), 12, S. 3786-3792
http://dx.doi.org/10.1016/j.disc.2008.10.009
Ilchmann, Achim; Schuster, Hans
PI-funnel control for two mass systems. - In: IEEE transactions on automatic control, ISSN 1558-2523, Bd. 54 (2009), 4, S. 918-923
http://dx.doi.org/10.1109/TAC.2009.2013013
PI-funnel control for two mass systems. - In: IEEE transactions on automatic control, ISSN 1558-2523, Bd. 54 (2009), 4, S. 918-923
http://dx.doi.org/10.1109/TAC.2009.2013013
Rautenbach, Dieter; Regen, Friedrich
On packing shortest cycles in graphs. - In: Information processing letters, ISSN 1872-6119, Bd. 109 (2009), 14, S. 816-821
http://dx.doi.org/10.1016/j.ipl.2009.04.001
On packing shortest cycles in graphs. - In: Information processing letters, ISSN 1872-6119, Bd. 109 (2009), 14, S. 816-821
http://dx.doi.org/10.1016/j.ipl.2009.04.001
Harant, Jochen; Rautenbach, Dieter; Recht, Peter; Schiermeyer, Ingo; Schulte-Loh, Eva-Maria
Packing disjoint cycles over vertex cuts. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 9 S., 166,5 KB). - (Preprint ; M09,17)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12995
Packing disjoint cycles over vertex cuts. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 9 S., 166,5 KB). - (Preprint ; M09,17)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12995
Mörig, Marc; Rautenbach, Dieter; Smid, Michiel; Tusch, Jan
An [Omega] (n log n) lower bound for computing the sum of even-ranked elements. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 3 S., 136,5 KB). - (Preprint ; M09,16)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12993
An [Omega] (n log n) lower bound for computing the sum of even-ranked elements. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 3 S., 136,5 KB). - (Preprint ; M09,16)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12993
Dourado, Mitre C.; Protti, Fábio; Rautenbach, Dieter; Szwarcfiter, Jayme Luiz
Some remarks on the geodetic number of a graph. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 10 S., 184,5 KB). - (Preprint ; M09,15)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12992
Some remarks on the geodetic number of a graph. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 10 S., 184,5 KB). - (Preprint ; M09,15)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12992
Dourado, Mitre C.; Protti, Fábio; Rautenbach, Dieter; Szwarcfiter, Jayme Luiz
On the convexity number of graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 14 S., 340,1 KB). - (Preprint ; M09,14)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12991
On the convexity number of graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 14 S., 340,1 KB). - (Preprint ; M09,14)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12991
Dourado, Mitre C.; Protti, Fábio; Rautenbach, Dieter; Szwarcfiter, Jayme Luiz
On the hull number of triangle-free graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 12 S., 223,7 KB). - (Preprint ; M09,13)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12990
On the hull number of triangle-free graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 12 S., 223,7 KB). - (Preprint ; M09,13)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12990
Löwenstein, Christian; Rautenbach, Dieter; Regen, Friedrich
On spanning tree congestion. - In: Discrete mathematics, Bd. 309 (2009), 13, S. 4653-4655
http://dx.doi.org/10.1016/j.disc.2009.01.012
On spanning tree congestion. - In: Discrete mathematics, Bd. 309 (2009), 13, S. 4653-4655
http://dx.doi.org/10.1016/j.disc.2009.01.012
Böhme, Thomas; Kawarabayashi, Ken-ichi; Maharry, John; Mohar, Bojan
Linear connectivity forces large complete bipartite minors. - In: Journal of combinatorial theory. . - Orlando, Fla. : Academic Press, 1971- , ZDB-ID: 1469158-9, Bd. 99 (2009), 3, S. 557-582
http://dx.doi.org/10.1016/j.jctb.2008.07.006
Linear connectivity forces large complete bipartite minors. - In: Journal of combinatorial theory. . - Orlando, Fla. : Academic Press, 1971- , ZDB-ID: 1469158-9, Bd. 99 (2009), 3, S. 557-582
http://dx.doi.org/10.1016/j.jctb.2008.07.006