The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Heidi Gebauer" ( http://dblp.L3S.de/Authors/Heidi_Gebauer )

URL (Homepage):  http://www.ti.inf.ethz.ch/people/gebauer.html  Author page on DBLP  Author page in RDF  Community of Heidi Gebauer in ASPL-2

Publication years (Num. hits)
2007-2011 (18) 2012 (1)
Publication types (Num. hits)
article(15) inproceedings(4)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 19 publication records. Showing 19 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Heidi Gebauer On the clique-game. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno A Doubly Exponentially Crumbled Cake. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Heidi Gebauer Finding and enumerating Hamilton cycles in 4-regular graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Heidi Gebauer Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2011 DBLP  BibTeX  RDF
1Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno A Doubly Exponentially Crumbled Cake Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Heidi Gebauer, Anna Gundert, Robin A. Moser, Yoshio Okamoto Not All Saturated 3-Forests Are Tight Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Heidi Gebauer, Tibor Szabó, Gábor Tardos The Local Lemma is Tight for SAT. Search on Bibsonomy SODA The full citation details ... 2011 DBLP  BibTeX  RDF
1Heidi Gebauer Maker Can Construct a Sparse Graph on a Small Board Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Heidi Gebauer, Tibor Szabó, Gábor Tardos The Local Lemma Is Tight for SAT Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Heidi Gebauer, Yoshio Okamoto Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Heidi Gebauer, Tibor Szabó Asymptotic random graph intuition for the biased connectivity game. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Heidi Gebauer Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Heidi Gebauer Disproof of the Neighborhood Conjecture with Implications to SAT Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Heidi Gebauer A Strategy for Maker in the Clique Game which Helps to Tackle some Open Problems by Beck Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Heidi Gebauer Disproof of the Neighborhood Conjecture with Implications to SAT. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl The Lovász Local Lemma and Satisfiability. Search on Bibsonomy Efficient Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Heidi Gebauer Disproving the Neighborhood Conjecture Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Heidi Gebauer Unsatisfiable (k,(4*2^k/k))-CNF formulas Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Heidi Gebauer, Yoshio Okamoto Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. Search on Bibsonomy CATS The full citation details ... 2007 DBLP  BibTeX  RDF
Displaying result #1 - #19 of 19 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.