Heidi Gebauer

Publication Activity (10 Years)

Years Active: 2007-2016
Publications (10 Years): 3

Top Topics

Boolean Satisfiability

Stochastic Local Search Algorithms

Johnson Lindenstrauss

Top Venues

Comb. Probab. Comput.

J. Comb. Theory, Ser. A

Publications

Dennis Clemens, Heidi Gebauer, Anita Liebenau
The Random Graph Intuition for the Tournament Game. Comb. Probab. Comput. 25 (1) (2016)
Heidi Gebauer, Tibor Szabó, Gábor Tardos
The Local Lemma Is Asymptotically Tight for SAT. J. ACM 63 (5) (2016)
Heidi Gebauer, Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula
Disjoint Path Allocation with Sublinear Advice. COCOON (2015)
Kfir Barhum, Hans-Joachim Böckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Björn Steffen
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. SOFSEM (2014)
Heidi Gebauer
On the construction of 3-chromatic hypergraphs with few edges. J. Comb. Theory, Ser. A 120 (7) (2013)
Heidi Gebauer
Size Ramsey Number of Bounded Degree Graphs for Games. Comb. Probab. Comput. 22 (4) (2013)
Heidi Gebauer
On the clique-game. Eur. J. Comb. 33 (1) (2012)
Heidi Gebauer
Disproof of the neighborhood conjecture with implications to SAT. Comb. 32 (5) (2012)
Heidi Gebauer, Frank Mousset
On Rainbow Cycles and Paths CoRR (2012)
Heidi Gebauer
Finding and enumerating Hamilton cycles in 4-regular graphs. Theor. Comput. Sci. 412 (35) (2011)
Heidi Gebauer
Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs. Electron. J. Comb. 18 (1) (2011)
Heidi Gebauer, Anna Gundert, Robin A. Moser, Yoshio Okamoto
Not All Saturated 3-Forests Are Tight CoRR (2011)
Heidi Gebauer, Tibor Szabó, Gábor Tardos
The Local Lemma is Tight for SAT. SODA (2011)
Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno
A Doubly Exponentially Crumbled Cake. Electron. Notes Discret. Math. 38 (2011)
Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno
A Doubly Exponentially Crumbled Cake CoRR (2011)
Heidi Gebauer, Tibor Szabó, Gábor Tardos
The Local Lemma Is Tight for SAT CoRR (2010)
Heidi Gebauer
Maker Can Construct a Sparse Graph on a Small Board CoRR (2010)
Heidi Gebauer, Tibor Szabó
Asymptotic random graph intuition for the biased connectivity game. Random Struct. Algorithms 35 (4) (2009)
Heidi Gebauer
Disproof of the Neighborhood Conjecture with Implications to SAT. ESA (2009)
Heidi Gebauer
Disproof of the Neighborhood Conjecture with Implications to SAT CoRR (2009)
Heidi Gebauer
Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges CoRR (2009)
Heidi Gebauer
A Strategy for Maker in the Clique Game which Helps to Tackle some Open Problems by Beck CoRR (2009)
Heidi Gebauer, Yoshio Okamoto
Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes. Int. J. Found. Comput. Sci. 20 (1) (2009)
Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl
The Lovász Local Lemma and Satisfiability. Efficient Algorithms (2009)
Heidi Gebauer
Disproving the Neighborhood Conjecture CoRR (2008)
Heidi Gebauer
On the Number of Hamilton Cycles in Bounded Degree Graphs. ANALCO (2008)
Heidi Gebauer
Unsatisfiable (k,(4*2^k/k))-CNF formulas CoRR (2008)
Heidi Gebauer, Yoshio Okamoto
Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. CATS (2007)