Heidi Gebauer

According to our database, Heidi Gebauer authored at least 24 papers between 2007 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

The Local Lemma Is Asymptotically Tight for SAT.

Heidi Gebauer, Tibor Szabó, Gábor Tardos

J. ACM, 2016

The Random Graph Intuition for the Tournament Game.

Dennis Clemens, Heidi Gebauer, Anita Liebenau

Comb. Probab. Comput., 2016

2015

Disjoint Path Allocation with Sublinear Advice.

Heidi Gebauer, Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

On the Power of Advice and Randomization for the Disjoint Path Allocation Problem.

Kfir Barhum, Hans-Joachim Böckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Björn Steffen

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

2013

On the construction of 3-chromatic hypergraphs with few edges.

Heidi Gebauer

J. Comb. Theory A, 2013

Size Ramsey Number of Bounded Degree Graphs for Games.

Heidi Gebauer

Comb. Probab. Comput., 2013

2012

On the clique-game.

Heidi Gebauer

Eur. J. Comb., 2012

On Rainbow Cycles and Paths

Heidi Gebauer, Frank Mousset

CoRR, 2012

Disproof of the neighborhood conjecture with implications to SAT.

Heidi Gebauer

Comb., 2012

2011

Finding and enumerating Hamilton cycles in 4-regular graphs.

Heidi Gebauer

Theor. Comput. Sci., 2011

A Doubly Exponentially Crumbled Cake.

Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno

Electron. Notes Discret. Math., 2011

Not All Saturated 3-Forests Are Tight

Heidi Gebauer, Anna Gundert, Robin A. Moser, Yoshio Okamoto

CoRR, 2011

Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs.

Heidi Gebauer

Electron. J. Comb., 2011

The Local Lemma is Tight for SAT.

Heidi Gebauer, Tibor Szabó, Gábor Tardos

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Maker Can Construct a Sparse Graph on a Small Board

Heidi Gebauer

CoRR, 2010

2009

Asymptotic random graph intuition for the biased connectivity game.

Heidi Gebauer, Tibor Szabó

Random Struct. Algorithms, 2009

Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes.

Heidi Gebauer, Yoshio Okamoto

Int. J. Found. Comput. Sci., 2009

Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges

Heidi Gebauer

CoRR, 2009

A Strategy for Maker in the Clique Game which Helps to Tackle some Open Problems by Beck

Heidi Gebauer

CoRR, 2009

The Lovász Local Lemma and Satisfiability.

Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl

Proceedings of the Efficient Algorithms, 2009

2008

Disproving the Neighborhood Conjecture

Heidi Gebauer

CoRR, 2008

Unsatisfiable (k,(4*2^k/k))-CNF formulas

Heidi Gebauer

CoRR, 2008

On the Number of Hamilton Cycles in Bounded Degree Graphs.

Heidi Gebauer

Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008

2007

Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes.

Heidi Gebauer, Yoshio Okamoto

Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007