Heidi Gebauer Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeidi Gebauer: Disproof of the Neighborhood Conjecture with Implications to SAT. ESA 2009: 764-775
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl: The Lovász Local Lemma and Satisfiability. Efficient Algorithms 2009: 30-54
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeidi Gebauer: Disproof of the Neighborhood Conjecture with Implications to SAT CoRR abs/0904.2541: (2009)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeidi Gebauer: A Strategy for Maker in the Clique Game which Helps to Tackle some Open Problems by Beck CoRR abs/0909.4362: (2009)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeidi 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)
2008
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeidi Gebauer: Unsatisfiable (k,(4*2^k/k))-CNF formulas CoRR abs/0810.1904: (2008)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeidi Gebauer: Disproving the Neighborhood Conjecture CoRR abs/0810.1981: (2008)
2007
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeidi Gebauer, Yoshio Okamoto: Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. CATS 2007: 63-69

Coauthor Index

1Robin A. Moser [7]
2Yoshio Okamoto [1] [4]
3Dominik Scheder [7]
4Emo Welzl [7]

Colors in the list of coauthors

Copyright © Sat Nov 28 20:06:51 2009 by Michael Ley (ley@uni-trier.de)