Heidi Gebauer

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the number of Hamilton cycles in bounded degree graphs 2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)	2019-09-16	Paper
The local lemma Is asymptotically tight for SAT Journal of the ACM	2018-08-02	Paper
The random graph intuition for the tournament game Combinatorics, Probability and Computing	2017-10-04	Paper
The local lemma is tight for SAT	2017-09-29	Paper
Disjoint path allocation with sublinear advice Lecture Notes in Computer Science	2015-10-29	Paper
On the construction of 3-chromatic hypergraphs with few edges Journal of Combinatorial Theory. Series A	2015-06-19	Paper
On the power of advice and randomization for the disjoint path allocation problem SOFSEM 2014: Theory and Practice of Computer Science	2015-01-13	Paper
Disproof of the neighborhood conjecture with implications to SAT Combinatorica	2013-11-07	Paper
A doubly exponentially crumbled cake	2013-11-01	Paper
Size Ramsey number of bounded degree graphs for games Combinatorics, Probability and Computing	2013-07-26	Paper
On Rainbow Cycles and Paths	2012-07-03	Paper
On the clique-game European Journal of Combinatorics	2011-11-29	Paper
Not All Saturated 3-Forests Are Tight	2011-09-15	Paper
Finding and enumerating Hamilton cycles in 4-regular graphs Theoretical Computer Science	2011-09-12	Paper
Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs The Electronic Journal of Combinatorics	2011-06-24	Paper
Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs The Electronic Journal of Combinatorics	2011-06-24	Paper
Asymptotic random graph intuition for the biased connectivity game Random Structures & Algorithms	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 Lecture Notes in Computer Science	2009-11-12	Paper
Disproof of the Neighborhood Conjecture with Implications to SAT Lecture Notes in Computer Science	2009-10-29	Paper
FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES International Journal of Foundations of Computer Science	2009-04-14	Paper

Research outcomes over time

This page was built for person: Heidi Gebauer