Heidi Gebauer

Orcid: 0000-0002-7616-3821

Affiliations:
  • ETH Zurich, Switzerland


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
The Local Lemma Is Asymptotically Tight for SAT.
J. ACM, 2016

The Random Graph Intuition for the Tournament Game.
Comb. Probab. Comput., 2016

2015
Disjoint Path Allocation with Sublinear Advice.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

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

Size Ramsey Number of Bounded Degree Graphs for Games.
Comb. Probab. Comput., 2013

2012
On the clique-game.
Eur. J. Comb., 2012

On Rainbow Cycles and Paths
CoRR, 2012

Disproof of the neighborhood conjecture with implications to SAT.
Comb., 2012

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

A Doubly Exponentially Crumbled Cake.
Electron. Notes Discret. Math., 2011

Not All Saturated 3-Forests Are Tight
CoRR, 2011

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

The Local Lemma is Tight for SAT.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
Maker Can Construct a Sparse Graph on a Small Board
CoRR, 2010

2009
Asymptotic random graph intuition for the biased connectivity game.
Random Struct. Algorithms, 2009

Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes.
Int. J. Found. Comput. Sci., 2009

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

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

The Lovász Local Lemma and Satisfiability.
Proceedings of the Efficient Algorithms, 2009

2008
Disproving the Neighborhood Conjecture
CoRR, 2008

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

On the Number of Hamilton Cycles in Bounded Degree Graphs.
Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008

2007
Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes.
Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007


  Loading...