Klöppel, Michael; Geletu, Abebe; Hoffmann, Armin; Li, Pu
Evaluating integration approaches to robust process optimization and control using chance constrained programming. - In: IEEE International Symposium on Computer-Aided Control System Design (CACSD), 2010, ISBN 978-1-4244-5355-9, (2010), S. 1079-1084
http://dx.doi.org/10.1109/CACSD.2010.5612699
Evaluating integration approaches to robust process optimization and control using chance constrained programming. - In: IEEE International Symposium on Computer-Aided Control System Design (CACSD), 2010, ISBN 978-1-4244-5355-9, (2010), S. 1079-1084
http://dx.doi.org/10.1109/CACSD.2010.5612699
Boßecker, Anett; Rautenbach, Dieter
Interpolating between bounds on the independence number. - In: Discrete mathematics, Bd. 310 (2010), 17/18, S. 2398-2403
http://dx.doi.org/10.1016/j.disc.2010.05.026
Interpolating between bounds on the independence number. - In: Discrete mathematics, Bd. 310 (2010), 17/18, S. 2398-2403
http://dx.doi.org/10.1016/j.disc.2010.05.026
Henn, Mark-Alexander; Mehl, Christian; Trunk, Carsten
Hyponormal and strongly hyponormal matrices in inner product spaces. - In: Linear algebra and its applications, ISSN 0024-3795, Bd. 433 (2010), 6, S. 1055-1076
http://dx.doi.org/10.1016/j.laa.2010.04.050
Hyponormal and strongly hyponormal matrices in inner product spaces. - In: Linear algebra and its applications, ISSN 0024-3795, Bd. 433 (2010), 6, S. 1055-1076
http://dx.doi.org/10.1016/j.laa.2010.04.050
Brandt, Stephan;
A note on generalized pentagons. - In: Discrete mathematics, Bd. 310 (2010), 20, S. 2766-2767
http://dx.doi.org/10.1016/j.disc.2010.04.017
A note on generalized pentagons. - In: Discrete mathematics, Bd. 310 (2010), 20, S. 2766-2767
http://dx.doi.org/10.1016/j.disc.2010.04.017
Böhme, Thomas; Kostochka, Alexandr; Thomason, Andrew
Hadwiger numbers and over-dominating colourings. - In: Discrete mathematics, Bd. 310 (2010), 20, S. 2662-2665
http://dx.doi.org/10.1016/j.disc.2010.03.024
Hadwiger numbers and over-dominating colourings. - In: Discrete mathematics, Bd. 310 (2010), 20, S. 2662-2665
http://dx.doi.org/10.1016/j.disc.2010.03.024
Löwenstein, Christian; Rautenbach, Dieter
Pairs of disjoint dominating sets and the minimum degree of graphs. - In: Graphs and combinatorics, ISSN 1435-5914, Bd. 26 (2010), 3, S. 407-424
https://doi.org/10.1007/s00373-010-0918-9
Pairs of disjoint dominating sets and the minimum degree of graphs. - In: Graphs and combinatorics, ISSN 1435-5914, Bd. 26 (2010), 3, S. 407-424
https://doi.org/10.1007/s00373-010-0918-9
Löwenstein, Christian; Rautenbach, Dieter; Rautenbach, Dieter *1972-*; Schiermeyer, Ingo;
Cycle length parities and the chromatic number. - In: Journal of graph theory, ISSN 1097-0118, Bd. 64 (2010), 3, S. 210-218
https://doi.org/10.1002/jgt.20450
Cycle length parities and the chromatic number. - In: Journal of graph theory, ISSN 1097-0118, Bd. 64 (2010), 3, S. 210-218
https://doi.org/10.1002/jgt.20450
Brandt, Stephan; Müttel, Janina; Rautenbach, Dieter; Regen, Friedrich
Minimum degree and density of binary sequences. - In: European journal of combinatorics, Bd. 31 (2010), 7, S. 1936-1945
https://doi.org/10.1016/j.ejc.2010.01.005
Minimum degree and density of binary sequences. - In: European journal of combinatorics, Bd. 31 (2010), 7, S. 1936-1945
https://doi.org/10.1016/j.ejc.2010.01.005
Henning, Michael A.; Löwenstein, Christian; Rautenbach, Dieter; Southey, Justin
Disjoint dominating and total dominating sets in graphs. - In: Discrete applied mathematics, ISSN 1872-6771, Bd. 158 (2010), 15, S. 1615-1523
https://doi.org/10.1016/j.dam.2010.06.004
Disjoint dominating and total dominating sets in graphs. - In: Discrete applied mathematics, ISSN 1872-6771, Bd. 158 (2010), 15, S. 1615-1523
https://doi.org/10.1016/j.dam.2010.06.004
Kostochka, Alexandr V.; Král', Daniel; Sereni, Jean-Sébastien; Stiebitz, Michael
Graphs with bounded tree-width and large odd-girth are almost bipartite. - In: Journal of combinatorial theory. . - Orlando, Fla. : Academic Press, 1971- , ZDB-ID: 1469158-9, Bd. 100 (2010), 6, S. 554-559
http://dx.doi.org/10.1016/j.jctb.2010.04.004
Graphs with bounded tree-width and large odd-girth are almost bipartite. - In: Journal of combinatorial theory. . - Orlando, Fla. : Academic Press, 1971- , ZDB-ID: 1469158-9, Bd. 100 (2010), 6, S. 554-559
http://dx.doi.org/10.1016/j.jctb.2010.04.004