printlogo
http://www.ethz.ch/index_EN
Computational Structures and Algorithms
 
print
  

2009

Join us

PhD Positions, Graduate School, Internships

Find out more about our offerings here!

Journals


G. Sorkin, A. Steger, R. Zenklusen
A tight bound on the collection of edges in MSTs of induced subgraphs
Journal of Combinatorial Theory, Series B 99, 2009, 428-435.

A. Prakash, R. Spöhel, H. Thomas
Balanced Online Ramsey Games in Random Graphs
The Electronic Journal of Combinatorics 16(1), 2009, R11.


D. Hefetz, M. Krivelevich, T. Szabo
Hamilton cycles in highly connected and expanding graphs
Combinatorica, 29(5) (2009), 547-568.


D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabo
A sharp threshold for the Hamilton cycle Maker-Breaker game
Random Structures & Algorithms 34, 2009, 112-122.

D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabo
Fast winning strategies in Maker-Breaker games
Journal of Combinatorial Theory, Series B 99, 2009, 39-47.

D. Hefetz, S. Stich
On two problems regarding the Hamilton cycle game
The Electronic Journal of Combinatorics 16(1), 2009, R28.


D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabo
Fast winning strategies in Avoider-Enforcer games
Graphs and Combinatorics, 25 (2009), 533-544.


M. Marciniszyn, R. Spöhel, A. Steger
Online Ramsey Games in Random Graphs
Combinatorics, Probability and Computing 18(1-2), 2009, 271-300.

M. Marciniszyn, R. Spöhel, A. Steger
Upper Bounds for Online Ramsey Games in Random Graphs
Combinatorics, Probability and Computing 18(1-2), 2009, 259-270.

M. Marciniszyn, J. Skokan, R. Spöhel, A. Steger
Asymmetric Ramsey Properties of Random Graphs Involving Cliques
Random Structures & Algorithms 34(4), 2009, 413-459; extended abstract appeared in RANDOM'06.

M. Cook, F. Jug, C. Krautz
Sharpening Projections
BMC Neuroscience, 10(Suppl 1), 2009, P214.

N. Bernasconi, K. Panagiotou, A. Steger
The Degree Sequence of Random Graphs from Subcritical Classes
Combinatorics, Probability and Computing
(5), 2009, 647-681.

J. Remy, A. Steger
Approximation schemes for node-weighted geometric Steiner tree problems
Algorithmica, 55(1), 2009, 240-267.

K. Panagiotou, A. Steger
A note on the chromatic number of a dense random graph
Discrete Mathematics, 309(10), 2009, 3420-3423.

J. Remy, A. Steger
A quasi-polynomial time approximation scheme for minimum weight triangulation
Journal of the ACM, 56(3), 2009.

J. Lorenz, K. Panagiotou, A. Steger
Optimal algorithms for k-search with application in option pricing

Algorithmica, 55(2), 2009, 311-328.

Conference Proceedings

K. Panagiotou, A. Steger
Maximal biconnected subgraphs of random planar graphs
In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '09).

R. Spöhel, A. Steger, H.Thomas
Coloring the Edges of a Random Graph Without a Monochromatic Giant Component
In: Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), ENDM 34, 615-619.

 

Wichtiger Hinweis:
Diese Website wird in älteren Versionen von Netscape ohne graphische Elemente dargestellt. Die Funktionalität der Website ist aber trotzdem gewährleistet. Wenn Sie diese Website regelmässig benutzen, empfehlen wir Ihnen, auf Ihrem Computer einen aktuellen Browser zu installieren. Weitere Informationen finden Sie auf
folgender Seite.

Important Note:
The content in this site is accessible to any browser or Internet device, however, some graphics will display correctly only in the newer versions of Netscape. To get the most out of our site we suggest you upgrade to a newer browser.
More information

© 2012 ETH Zurich | Imprint | Disclaimer | 17 January 2011
top