Publications

Book chapters

Matrix Theory
J. Lengler, B. Mehnert
In Advances in Mathematics Research. Volume 15, Nova Publishers, 2011.

Journal articles

Small subgraphs in random graphs and the power of multiple choices
T. Mütze, R. Spöhel, and H. Thomas
Journal of Combinatorial Theory, Series B 101(4), 2011, 237-268.

On the path-avoidance vertex-coloring game
T. Mütze and R. Spöhel
Electronic Journal of Combinatorics 18(1), 2011, Research Paper 163, 33 pages.

Pegging graphs yields a small diameter
S. Gerke, A. Steger, and N. Wormald
Combinatorics, Probability, and Computing 20, 2011, 239–248.

Construction of 2-factors in the middle layer of the discrete cube
T. Hruz and U. Peter
Internet Mathematics 6(4), 2011, 461-487.

Conference proceedings

Explosive Percolation in Erdös-Rényi-Like Random Graph Processes
K. Panagiotou, R. Spöhel, A. Steger, and H. Thomas
In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb '11)
Electronic Notes in Discrete Mathematics 38, 2011, 699–704.

A randomized version of Ramsey's theorem
L. Gugelmann, Y. Person, A. Steger, and H. Thomas
In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb '11)
Electronic Notes in Discrete Mathematics 38, 2011, 425-430.

On Balanced Coloring Games in Random Graphs
L. Gugelmann and R. Spöhel
In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb '11)
Electronic Notes in Discrete Mathematics 38, 2011, 657-662.

On the path-avoidance vertex-coloring game
T. Mütze and R. Spöhel
In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb '11)
Electronic Notes in Discrete Mathematics 38, 2011, 657-662.

Interacting maps for fast visual interpretation
M. Cook, L. Gugelmann, F. Jug, C. Krautz, and A. Steger
In Proceedings of the International Joint Conference on Neural Networks (IJCNN '11), 2011, 770-776.

Neuronal Projections Can Be Sharpened by a Biologically Plausible Learning Mechanism
M. Cook, F. Jug, and C. Krautz
In Proceedings of the 21th International Conference on Artificial Neural Networks (ICANN '11)
Lecture Notes in Computer Science 6791, 2011, 101-108.

Coloring random graphs online without creating monochromatic subgraphs
T. Mütze, T. Rast, and R. Spöhel
In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '11), 2011, 145-158.

On the Degree Distribution of Random Planar Graphs
K. Panagiotou and A. Steger
In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '11), 2011, 1198-1210.

Black-box complexities of combinatorial problems
B. Doerr, T. Kötzing, J. Lengler, and C. Winzen
In Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference (GECCO '11), 2011, 981-988.