Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. - Heidi Gebauer; Yoshio Okamoto (CATS, 2007)

On the Number of Hamilton Cycles in Bounded Degree Graphs. - Heidi Gebauer (ANALCO, 2008)

Unsatisfiable (k,(4*2^k/k))-CNF formulas - Heidi Gebauer (CoRR, 2008)

Disproving the Neighborhood Conjecture - Heidi Gebauer (CoRR, 2008)

The Lovász Local Lemma and Satisfiability. - Heidi Gebauer; Robin A. Moser; Dominik Scheder; Emo Welzl (Efficient Algorithms, 2009)

A Strategy for Maker in the Clique Game which Helps to Tackle some Open Problems by Beck - Heidi Gebauer (CoRR, 2009)

Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges - Heidi Gebauer (CoRR, 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)

Asymptotic random graph intuition for the biased connectivity game. - Heidi Gebauer; Tibor Szabó (Random Struct. Algorithms, 2009)

Maker Can Construct a Sparse Graph on a Small Board - Heidi Gebauer (CoRR, 2010)

The Local Lemma is Tight for SAT. - Heidi Gebauer; Tibor Szabó; Gábor Tardos (SODA, 2011)

Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs. - Heidi Gebauer (Electron. J. Comb., 2011)

Not All Saturated 3-Forests Are Tight - Heidi Gebauer; Anna Gundert; Robin A. Moser; Yoshio Okamoto (CoRR, 2011)

A Doubly Exponentially Crumbled Cake. - Tobias Christ; Andrea Francke; Heidi Gebauer; Jirí Matousek 001; Takeaki Uno (Electron. Notes Discret. Math., 2011)

Finding and enumerating Hamilton cycles in 4-regular graphs. - Heidi Gebauer (Theor. Comput. Sci., 2011)

Disproof of the neighborhood conjecture with implications to SAT. - Heidi Gebauer (Comb., 2012)

On Rainbow Cycles and Paths - Heidi Gebauer; Frank Mousset (CoRR, 2012)

On the clique-game. - Heidi Gebauer (Eur. J. Comb., 2012)

Size Ramsey Number of Bounded Degree Graphs for Games. - Heidi Gebauer (Comb. Probab. Comput., 2013)

On the construction of 3-chromatic hypergraphs with few edges. - Heidi Gebauer (J. Comb. Theory A, 2013)

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 (SOFSEM, 2014)

Disjoint Path Allocation with Sublinear Advice. - Heidi Gebauer; Dennis Komm; Rastislav Královic; Richard Královic; Jasmin Smula (COCOON, 2015)

The Random Graph Intuition for the Tournament Game. - Dennis Clemens; Heidi Gebauer; Anita Liebenau (Comb. Probab. Comput., 2016)

The Local Lemma Is Asymptotically Tight for SAT. - Heidi Gebauer; Tibor Szabó; Gábor Tardos (J. ACM, 2016)