The following pages link to Heidi Gebauer (Q377801):
Displaying 17 items.
- Disproof of the neighborhood conjecture with implications to SAT (Q377802) (← links)
- Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs (Q547792) (← links)
- Finding and enumerating Hamilton cycles in 4-regular graphs (Q638522) (← links)
- On the clique-game (Q649002) (← links)
- On the construction of 3-chromatic hypergraphs with few edges (Q2349182) (← links)
- Size Ramsey Number of Bounded Degree Graphs for Games (Q2841487) (← links)
- (Q2857357) (← links)
- On the Power of Advice and Randomization for the Disjoint Path Allocation Problem (Q2938097) (← links)
- Asymptotic random graph intuition for the biased connectivity game (Q3055785) (← links)
- The Local Lemma Is Asymptotically Tight for SAT (Q3177819) (← links)
- Disjoint Path Allocation with Sublinear Advice (Q3196403) (← links)
- FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES (Q3620613) (← links)
- Disproof of the Neighborhood Conjecture with Implications to SAT (Q3639289) (← links)
- The Lovász Local Lemma and Satisfiability (Q3644712) (← links)
- On the Number of Hamilton Cycles in Bounded Degree Graphs (Q5194650) (← links)
- The Random Graph Intuition for the Tournament Game (Q5364264) (← links)
- (Q5365071) (← links)
