Catching the k-NAESAT Threshold (with A. Coja-Oghlan)
Accepted for publication in: Proceedings of the 44th ACM Symposium on Theory of Computing (STOC'12).
Ultra-fast Rumor Spreading in Models of Real-world Networks (with N. Fountoulakis and T. Sauerwald)
In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '12), p. 1642-1660.
The Maximum Degree of Random Planar Graphs (with M. Drmota, O. Gimenez, M. Noy and A. Steger)
In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '12), p. 281-287.
Approximate Counting of Cycles in Streams (with M. Madhusudan, K. Mehlhorn and H. Sun)
In: Proceedings of the 19th Annual European Symposium on Algorithms (ESA '11), p. 677-688.
The Multiple-orientability Thresholds for Random Hypergraphs
(with N. Fountoulakis and M. Khosla)
In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '11), p. 1222-1236.
On the Degree Distribution of Random Planar Graphs
(with A. Steger)
In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '11), p. 1198-1210.
Multi-Target Ray Searching Problems (with S. Angelopoulos and A. Lopez-Ortiz)
In: Algorithms and Data Structures Symposium (WADS '11), Lecture Notes in Computer Science, Volume 6844/2011, 37-48.
Explosive Percolation in Erdös-Renyi-Like Processes (with R. Spöhel, A. Steger and H. Thomas)
Accepted for publication in: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '11).
Rumor Spreading on Random Regular Graphs and Expanders (with N. Fountoulakis)
In: 14th International Workshop on Randomization and Computation (RANDOM '10), p. 560-573.
Orientability of Random Hypergraphs and the Power of Multiple Choices (with N. Fountoulakis)
In: 37th International Colloquium on Automata, Languages and Programming (ICALP '10, Track A), p. 348-359.
Reliable Broadcasting in Random Networks and the Effect of Density (with N. Fountoulakis and A. Huber)
In: 29th Conference on Computer Communications (IEEE INFOCOM '10), p. 1-9.
Vertices of Degree k in Random Maps (with D. Johannsen)
In: Proceedings of the 21th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '10), p. 1436-1447.
Synchrony and Asynchrony in Neural Networks (with F. Kuhn, J. Spencer, A. Steger)
In: Proceedings of the 21th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '10), p. 949-964.
Boltzmann Generation for Regular Languages with Shuffle (with A. Darasse, O. Roussel and M. Soria)
Accepted for publication in: Random Generation of Combinatorial Structures (GASCom '10).
Maximal Biconnected Subgraphs of Random Planar Graphs (with A. Steger)
In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '09), p. 432-440.
Full version invited and accepted to special issue of Transactions of Algorithms.
The Speed of Broadcasting in Random Networks: Density Does Not Matter (with N. Fountoulakis and A. Huber)
Accepted for publication in: 23rd International Symposium on Distributed Computing (DISC '09).
Vertices of Degree k in Random Unlabeled Trees (with M. Sinha)
In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), Electronic Notes in Discrete Mathematics, Volume 34, p. 41-45.
Blocks in Constrained Random Graphs with Fixed Average Degree
In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC '09), DMTCS Proceedings AK, 733-744.
On Properties of Random Dissections and Triangulations (with N. Bernasconi and A. Steger) [preprint]
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08), p. 132-141.
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs (with N. Bernasconi and A. Steger)
In: Proceedings of the 12th International Workshop on Randomized Techniques in Computation (RANDOM'08), p. 303-316.
On Extremal Subgraphs of Random Graphs (with G. Brightwell and A. Steger) [preprint]
In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '07), p. 477-485.
On the Chromatic Number of Random Graphs (with A. Coja-Oghlan and A. Steger)
In: Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP '07), p. 777-788.
Optimal Algorithms for k-Search with Application in Option Pricing (with J. Lorenz and A. Steger) [preprint]
In: 15th Annual European Symposium on Algorithms (ESA '07), p. 275-286. Full version invited and accepted to special issue of Algorithmica.
Properties of Random Graphs via Boltzmann Samplers (with A. Weissl)
In: 2007 International Conference on Analysis of Algorithms (AofA'07), DMTCS Proceedings AH, 159-168.
On Adequate Performance Measures for Paging (with A. Souza) [preprint]
In: Proceedings of the 38th ACM Symposium on Theory of Computing (STOC'06), p. 487-496.
Papers in Refereed Journals
Vertices of Degree k in Random Unlabeled Trees (with M. Sinha)
In: Journal of Graph Theory, 69(2), p. 114-130, 2012.
3-connected Cores in Random Planar Graphs (with N. Fountoulakis)
In: Combinatorics, Probability and Computing, 20(3), p. 381-412, 2011.
On Properties of Random Dissections and Triangulations (with N. Bernasconi and A. Steger)
In: Combinatorica, 30(6), p. 627-654, 2010.
Maximal Biconnected Subgraphs of Random Planar Graphs (with A. Steger)
In: Transactions on Algorithms, 6(2), p. 1-21, 2010. Special issue devoted to SODA '09 best papers.
The Degree Sequence of Random Graphs from Subcritical Classes (with N. Bernasconi and A. Steger)
In: Combinatorics, Probability and Computing, Volume 18, Special Issue 05, p. 647-681, 2009.
Tight Bounds for Quasirandom Rumor Spreading (with S. Angelopoulos, B. Doerr and A. Huber)
In: Electronic Journal of Combinatorics, 16(1), R102, 2009.
Optimal Algorithms for k-Search with Application in Option Pricing (with J. Lorenz and A. Steger)
In: Algorithmica, 55(2), p. 311-328, 2009. Special issue devoted to ESA'07 best papers.
A Note on the Chromatic Number of a Dense Random Graph (with A. Steger)
In: Discrete Mathematics, 309(10), p. 3420-3423, 2009.
On the Chromatic Number of Random Graphs (with A. Coja-Oghlan and A. Steger)
In: Journal of Combinatorial Theory, Series B 98, p. 980-993, 2008.
