#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1954

2016

- This year (0)
- Last 5 years (6)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Heidi Gebauer, Tibor SzabÃ³
- Random Struct. Algorithms
- 2009

We study biased Maker/Breaker games on the edges of the complete graph, as introduced by ChvÃ¡tal and ErdÅ‘s. We show that Maker, occupying one edge in each of his turns, can build a spanning tree,â€¦ (More)

- Heidi Gebauer, Tibor SzabÃ³, GÃ¡bor Tardos
- SODA
- 2011

We construct unsatisfiable <i>k</i>-CNF formulas where every clause has <i>k</i> distinct literals and every variable appears in at most (2/<i>e</i> +<i>o</i>(1)) 2<sup><i>k</i></sup>/<i>k</i>â€¦ (More)

- Heidi Gebauer, Tibor SzabÃ³, GÃ¡bor Tardos
- J. ACM
- 2016

The Local Lemma is a fundamental tool of probabilistic combinatorics and theoretical computer science, yet there are hardly any natural problems known where it provides an asymptotically tightâ€¦ (More)

- Kfir Barhum, Hans-Joachim BÃ¶ckenhauer, +5 authors BjÃ¶rn Steffen
- SOFSEM
- 2014

In the disjoint path allocation problem, we consider a path of L + 1 vertices, representing the nodes in a communication network. Requests for an unbounded-time communication between pairs ofâ€¦ (More)

- Heidi Gebauer
- ESA
- 2009

We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsatisfiable k-CNFâ€¦ (More)

- Heidi Gebauer
- ANALCO
- 2008

The main contribution of this paper is a new approach for enumerating Hamilton cycles in bounded degree graphs â€“ deriving thereby extremal bounds. We describe an algorithm which enumerates allâ€¦ (More)

- Leonard Yves, R Ust, +43 authors Bernhard Von Stengel
- 2007

The goal of this thesis is to give a better understanding of the linear complementarity problem with a P-matrix (PLCP). Finding a polynomial time algorithm for the PLCP is a longstanding openâ€¦ (More)

- Heidi Gebauer
- ArXiv
- 2008

We study the following Maker/Breaker game. Maker and Breaker take turns in choosing vertices from a given n-uniform hypergraph F , with Maker going first. Makerâ€™s goal is to completely occupy aâ€¦ (More)

- Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl
- Efficient Algorithms
- 2009

We consider boolean formulas in conjunctive normal form (CNF). If all clauses are large, it needs many clauses to obtain an unsatisfiable formula; moreover, these clauses have to interleave. Weâ€¦ (More)

- Heidi Gebauer
- Electr. J. Comb.
- 2011

We describe an algorithm which enumerates all Hamilton cycles of a given 3regular n-vertex graph in time O(1.276n), improving on Eppsteinâ€™s previous bound. The resulting new upper bound of O(1.276n)â€¦ (More)