Stiebitz, Michael;
Toft, Bjarne
A Brooks type theorem for the maximum local edge connectivity. - In: The electronic journal of combinatorics, ISSN 1077-8926, Bd. 25 (2018), 1, P1.50, S. 1-11
https://doi.org/10.37236/6043
A Brooks type theorem for the maximum local edge connectivity. - In: The electronic journal of combinatorics, ISSN 1077-8926, Bd. 25 (2018), 1, P1.50, S. 1-11
https://doi.org/10.37236/6043
Han, Jie; Kohayakawa, Yoshiharu; Person, Yury
Near-perfect clique-factors in sparse pseudorandom graphs. - In: Electronic notes in discrete mathematics, ISSN 1571-0653, Bd. 68 (2018), S. 221-226
https://doi.org/10.1016/j.endm.2018.06.038
Near-perfect clique-factors in sparse pseudorandom graphs. - In: Electronic notes in discrete mathematics, ISSN 1571-0653, Bd. 68 (2018), S. 221-226
https://doi.org/10.1016/j.endm.2018.06.038
Özkahya, Lale; Person, Yury
Minimum rainbow H-decompositions of graphs. - In: European journal of combinatorics, Bd. 81 (2018), S. 111-124
https://doi.org/10.1016/j.ejc.2018.03.002
Minimum rainbow H-decompositions of graphs. - In: European journal of combinatorics, Bd. 81 (2018), S. 111-124
https://doi.org/10.1016/j.ejc.2018.03.002
Cooley, Oliver; Kang, Mihyun; Person, Yury
Largest components in random hypergraphs. - In: Combinatorics, probability & computing, ISSN 1469-2163, Bd. 27 (2018), 5, S. 741-762
https://doi.org/10.1017/S096354831800010X
Largest components in random hypergraphs. - In: Combinatorics, probability & computing, ISSN 1469-2163, Bd. 27 (2018), 5, S. 741-762
https://doi.org/10.1017/S096354831800010X
Ilchmann, Achim;
Die Baugeschichte eines Rokoko-Stadthauses. - Erfurt : Ulenspiegel, 2018. - 253 Seiten ISBN 978-3-932655-56-2
Literaturverzeichnis Seite 233-246
Die Baugeschichte eines Rokoko-Stadthauses. - Erfurt : Ulenspiegel, 2018. - 253 Seiten ISBN 978-3-932655-56-2
Literaturverzeichnis Seite 233-246
Ilchmann, Achim; Witschel, Jonas; Worthmann, Karl
Model predictive control for linear DAEs without terminal constraints and costs. - In: IFAC-PapersOnLine, ISSN 2405-8963, Bd. 51 (2018), 20, S. 116-121
https://doi.org/10.1016/j.ifacol.2018.11.002
Model predictive control for linear DAEs without terminal constraints and costs. - In: IFAC-PapersOnLine, ISSN 2405-8963, Bd. 51 (2018), 20, S. 116-121
https://doi.org/10.1016/j.ifacol.2018.11.002
Schulze Darup, Moritz;
Worthmann, Karl
Tailored MPC for mobile robots with very short prediction horizons. - In: 2018 European Control Conference (ECC), (2018), S. 1361-1366
https://doi.org/10.23919/ECC.2018.8550514
Tailored MPC for mobile robots with very short prediction horizons. - In: 2018 European Control Conference (ECC), (2018), S. 1361-1366
https://doi.org/10.23919/ECC.2018.8550514
Ilchmann, Achim; Witschel, Jonas; Worthmann, Karl
Model predictive control for linear differential-algebraic equations. - In: IFAC-PapersOnLine, ISSN 2405-8963, Bd. 51 (2018), 20, S. 98-103
https://doi.org/10.1016/j.ifacol.2018.10.181
Model predictive control for linear differential-algebraic equations. - In: IFAC-PapersOnLine, ISSN 2405-8963, Bd. 51 (2018), 20, S. 98-103
https://doi.org/10.1016/j.ifacol.2018.10.181
Preißer, Johanna E.; Schmidt, Jens M.
Computing vertex-disjoint paths in large graphs using MAOs. - In: 29th International Symposium on Algorithms and Computation, (2018), Seite 13:1-13:12
http://dx.doi.org/10.4230/LIPIcs.ISAAC.2018.13
Computing vertex-disjoint paths in large graphs using MAOs. - In: 29th International Symposium on Algorithms and Computation, (2018), Seite 13:1-13:12
http://dx.doi.org/10.4230/LIPIcs.ISAAC.2018.13
Lo, On-Hei Solomon;
Schmidt, Jens M.
A cut tree representation for pendant pairs. - In: 29th International Symposium on Algorithms and Computation, (2018), Seite 38:1-38:9
http://dx.doi.org/10.4230/LIPIcs.ISAAC.2018.38
A cut tree representation for pendant pairs. - In: 29th International Symposium on Algorithms and Computation, (2018), Seite 38:1-38:9
http://dx.doi.org/10.4230/LIPIcs.ISAAC.2018.38