| * | 2008 |
|---|
| 11 | EE | Amin Coja-Oghlan,
André Lanka:
Partitioning Random Graphs with General Degree Distributions.
IFIP TCS 2008: 127-141 |
| 2007 |
|---|
| 10 | EE | Amin Coja-Oghlan,
Andreas Goerdt,
André Lanka:
Strong Refutation Heuristics for Random k-SAT.
Combinatorics, Probability & Computing 16(1): 5-28 (2007) |
| 2006 |
|---|
| 9 | EE | Amin Coja-Oghlan,
André Lanka:
The Spectral Gap of Random Graphs with Given Expected Degrees.
ICALP (1) 2006: 15-26 |
| 8 | EE | Amin Coja-Oghlan,
Andreas Goerdt,
André Lanka:
Spectral Partitioning of Random Graphs with Given Expected Degrees.
IFIP TCS 2006: 271-282 |
| 2004 |
|---|
| 7 | EE | Amin Coja-Oghlan,
Andreas Goerdt,
André Lanka:
Strong Refutation Heuristics for Random k-SAT.
APPROX-RANDOM 2004: 310-321 |
| 6 | EE | Andreas Goerdt,
André Lanka:
On the Hardness and Easiness of Random 4-SAT Formulas.
ISAAC 2004: 470-483 |
| 5 | EE | André Lanka,
Andreas Goerdt:
An approximation hardness result for bipartite Clique
Electronic Colloquium on Computational Complexity (ECCC)(048): (2004) |
| 4 | EE | Amin Coja-Oghlan,
Andreas Goerdt,
André Lanka,
Frank Schädlich:
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT.
Theor. Comput. Sci. 329(1-3): 1-45 (2004) |
| 2003 |
|---|
| 3 | EE | Amin Coja-Oghlan,
Andreas Goerdt,
André Lanka,
Frank Schädlich:
Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques.
FCT 2003: 15-26 |
| 2 | EE | Amin Coja-Oghlan,
Andreas Goerdt,
André Lanka,
Frank Schädlich:
Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques
Electronic Colloquium on Computational Complexity (ECCC) 10(030): (2003) |
| 1 | EE | Andreas Goerdt,
André Lanka:
Recognizing more random unsatisfiable 3-SAT instances efficiently.
Electronic Notes in Discrete Mathematics 16: 21-46 (2003) |
