Heidi Gebauer

Available identifiers

Publication	Date of Publication	Type
On the Number of Hamilton Cycles in Bounded Degree Graphs	2019-09-16	Paper
The Local Lemma Is Asymptotically Tight for SAT	2018-08-02	Paper
The Random Graph Intuition for the Tournament Game	2017-10-04	Paper
https://portal.mardi4nfdi.de/entity/Q5365071	2017-09-29	Paper
Disjoint Path Allocation with Sublinear Advice	2015-10-29	Paper
On the construction of 3-chromatic hypergraphs with few edges	2015-06-19	Paper
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem	2015-01-13	Paper
Disproof of the neighborhood conjecture with implications to SAT	2013-11-07	Paper
A doubly exponentially crumbled cake	2013-11-01	Paper
Size Ramsey number of bounded degree graphs for games	2013-07-26	Paper
On Rainbow Cycles and Paths	2012-07-03	Paper
On the clique-game	2011-11-29	Paper
Not All Saturated 3-Forests Are Tight	2011-09-15	Paper
Finding and enumerating Hamilton cycles in 4-regular graphs	2011-09-12	Paper
Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs	2011-06-24	Paper
Asymptotic random graph intuition for the biased connectivity game	2010-11-09	Paper
Maker Can Construct a Sparse Graph on a Small Board	2010-11-09	Paper
The Lovász Local Lemma and Satisfiability	2009-11-12	Paper
Disproof of the Neighborhood Conjecture with Implications to SAT	2009-10-29	Paper
FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES	2009-04-14	Paper

This page was built for person: Heidi Gebauer