André Lanka

13 papers B 2Journal 7Unranked 4
YearRankTypeTitle / Venue / Authors
2009 J jnl
Finding Planted Partitions in Random Graphs with General Degree Distributions.
SIAM J. Discret. Math.
Amin Coja-Oghlan, André Lanka
2009 J jnl
The Spectral Gap of Random Graphs with Given Expected Degrees.
Electron. J. Comb.
Amin Coja-Oghlan, André Lanka
2008 — conf
Partitioning Random Graphs with General Degree Distributions.
IFIP TCS
Amin Coja-Oghlan, André Lanka
2007 J jnl
Strong Refutation Heuristics for Random k-SAT.
Comb. Probab. Comput.
Amin Coja-Oghlan, Andreas Goerdt, André Lanka
2006 — conf
Spectral Partitioning of Random Graphs with Given Expected Degrees.
IFIP TCS
Amin Coja-Oghlan, Andreas Goerdt, André Lanka
2006 — conf
The Spectral Gap of Random Graphs with Given Expected Degrees.
ICALP (1)
Amin Coja-Oghlan, André Lanka
2004 J jnl
An approximation hardness result for bipartite Clique
Electron. Colloquium Comput. Complex.
André Lanka, Andreas Goerdt
2004 B conf
On the Hardness and Easiness of Random 4-SAT Formulas.
ISAAC
Andreas Goerdt, André Lanka
2004 — conf
Strong Refutation Heuristics for Random k-SAT.
APPROX-RANDOM
Amin Coja-Oghlan, Andreas Goerdt, André Lanka
2004 J jnl
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT.
Theor. Comput. Sci.
Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
2003 B conf
Certifying Unsatisfiability of Random 2
FCT
Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
2003 J jnl
Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques
Electron. Colloquium Comput. Complex.
Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
2003 J jnl
Recognizing more random unsatisfiable 3-SAT instances efficiently.
Electron. Notes Discret. Math.
Andreas Goerdt, André Lanka