default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeidi Gebauer
Person information
- affiliation: ETH Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j11]Dennis Clemens
, Heidi Gebauer, Anita Liebenau:
The Random Graph Intuition for the Tournament Game. Comb. Probab. Comput. 25(1): 76-88 (2016)- [j10]Heidi Gebauer, Tibor Szabó, Gábor Tardos:
The Local Lemma Is Asymptotically Tight for SAT. J. ACM 63(5): 43:1-43:32 (2016) - 2015
- [c7]Heidi Gebauer, Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula:
Disjoint Path Allocation with Sublinear Advice. COCOON 2015: 417-429 - 2014
- [c6]Kfir Barhum, Hans-Joachim Böckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Björn Steffen:
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. SOFSEM 2014: 89-101 - 2013
- [j9]Heidi Gebauer:
Size Ramsey Number of Bounded Degree Graphs for Games. Comb. Probab. Comput. 22(4): 499-516 (2013) - [j8]Heidi Gebauer:
On the construction of 3-chromatic hypergraphs with few edges. J. Comb. Theory A 120(7): 1483-1490 (2013) - 2012
- [j7]Heidi Gebauer:
Disproof of the neighborhood conjecture with implications to SAT. Comb. 32(5): 573-587 (2012) - [j6]Heidi Gebauer:
On the clique-game. Eur. J. Comb. 33(1): 8-19 (2012) - [i10]Heidi Gebauer, Frank Mousset:
On Rainbow Cycles and Paths. CoRR abs/1207.0840 (2012) - 2011
- [j5]Heidi Gebauer:
Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs. Electron. J. Comb. 18(1) (2011) - [j4]Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno:
A Doubly Exponentially Crumbled Cake. Electron. Notes Discret. Math. 38: 265-271 (2011) - [j3]Heidi Gebauer:
Finding and enumerating Hamilton cycles in 4-regular graphs. Theor. Comput. Sci. 412(35): 4579-4591 (2011) - [c5]Heidi Gebauer, Tibor Szabó, Gábor Tardos:
The Local Lemma is Tight for SAT. SODA 2011: 664-674 - [i9]Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno:
A Doubly Exponentially Crumbled Cake. CoRR abs/1104.0122 (2011) - [i8]Heidi Gebauer, Anna Gundert, Robin A. Moser, Yoshio Okamoto:
Not All Saturated 3-Forests Are Tight. CoRR abs/1109.3390 (2011) - 2010
- [i7]Heidi Gebauer, Tibor Szabó, Gábor Tardos:
The Local Lemma Is Tight for SAT. CoRR abs/1006.0744 (2010) - [i6]Heidi Gebauer:
Maker Can Construct a Sparse Graph on a Small Board. CoRR abs/1011.2178 (2010)
2000 – 2009
- 2009
- [j2]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) - [j1]Heidi Gebauer, Tibor Szabó:
Asymptotic random graph intuition for the biased connectivity game. Random Struct. Algorithms 35(4): 431-443 (2009) - [c4]Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl:
The Lovász Local Lemma and Satisfiability. Efficient Algorithms 2009: 30-54 - [c3]Heidi Gebauer:
Disproof of the Neighborhood Conjecture with Implications to SAT. ESA 2009: 764-775 - [i5]Heidi Gebauer:
Disproof of the Neighborhood Conjecture with Implications to SAT. CoRR abs/0904.2541 (2009) - [i4]Heidi Gebauer:
A Strategy for Maker in the Clique Game which Helps to Tackle some Open Problems by Beck. CoRR abs/0909.4362 (2009) - [i3]Heidi Gebauer:
Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges. CoRR abs/0911.0900 (2009) - 2008
- [c2]Heidi Gebauer:
On the Number of Hamilton Cycles in Bounded Degree Graphs. ANALCO 2008: 241-248 - [i2]Heidi Gebauer:
Unsatisfiable (k,(4*2^k/k))-CNF formulas. CoRR abs/0810.1904 (2008) - [i1]Heidi Gebauer:
Disproving the Neighborhood Conjecture. CoRR abs/0810.1981 (2008) - 2007
- [c1]Heidi Gebauer, Yoshio Okamoto:
Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. CATS 2007: 63-69
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
