Heidi Gebauer

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