Heidi Gebauer

	2012
19		Heidi Gebauer: On the clique-game. Eur. J. Comb. 33(1): 8-19 (2012)
	2011
18		Heidi Gebauer, Tibor Szabó, Gábor Tardos: The Local Lemma is Tight for SAT. SODA 2011: 664-674
17		Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno: A Doubly Exponentially Crumbled Cake CoRR abs/1104.0122: (2011)
16		Heidi Gebauer, Anna Gundert, Robin A. Moser, Yoshio Okamoto: Not All Saturated 3-Forests Are Tight CoRR abs/1109.3390: (2011)
15		Heidi Gebauer: Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs. Electr. J. Comb. 18(1): (2011)
14		Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno: A Doubly Exponentially Crumbled Cake. Electronic Notes in Discrete Mathematics 38: 265-271 (2011)
13		Heidi Gebauer: Finding and enumerating Hamilton cycles in 4-regular graphs. Theor. Comput. Sci. 412(35): 4579-4591 (2011)
	2010
12		Heidi Gebauer, Tibor Szabó, Gábor Tardos: The Local Lemma Is Tight for SAT CoRR abs/1006.0744: (2010)
11		Heidi Gebauer: Maker Can Construct a Sparse Graph on a Small Board CoRR abs/1011.2178: (2010)
	2009
10		Heidi Gebauer: Disproof of the Neighborhood Conjecture with Implications to SAT. ESA 2009: 764-775
9		Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl: The Lovász Local Lemma and Satisfiability. Efficient Algorithms 2009: 30-54
8		Heidi Gebauer: Disproof of the Neighborhood Conjecture with Implications to SAT CoRR abs/0904.2541: (2009)
7		Heidi Gebauer: A Strategy for Maker in the Clique Game which Helps to Tackle some Open Problems by Beck CoRR abs/0909.4362: (2009)
6		Heidi Gebauer: Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges CoRR abs/0911.0900: (2009)
5		Heidi Gebauer, Yoshio Okamoto: Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes. Int. J. Found. Comput. Sci. 20(1): 25-44 (2009)
4		Heidi Gebauer, Tibor Szabó: Asymptotic random graph intuition for the biased connectivity game. Random Struct. Algorithms 35(4): 431-443 (2009)
	2008
3		Heidi Gebauer: Unsatisfiable (k,(4*2^k/k))-CNF formulas CoRR abs/0810.1904: (2008)
2		Heidi Gebauer: Disproving the Neighborhood Conjecture CoRR abs/0810.1981: (2008)
	2007
1		Heidi Gebauer, Yoshio Okamoto: Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. CATS 2007: 63-69

Coauthor Index

1	Tobias Christ	[14] [17]
2	Andrea Francke	[14] [17]
3	Anna Gundert	[16]
4	Jirí Matousek	[14] [17]
5	Robin A. Moser	[9] [16]
6	Yoshio Okamoto	[1] [5] [16]
7	Dominik Scheder	[9]
8	Tibor Szabó	[4] [12] [18]
9	Gábor Tardos	[12] [18]
10	Takeaki Uno	[14] [17]
11	Emo Welzl	[9]

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page