André Lanka

Publication Activity (10 Years)

Years Active: 2003-2009
Publications (10 Years): 0

Publications

Amin Coja-Oghlan, André Lanka
Finding Planted Partitions in Random Graphs with General Degree Distributions. SIAM J. Discret. Math. 23 (4) (2009)
Amin Coja-Oghlan, André Lanka
The Spectral Gap of Random Graphs with Given Expected Degrees. Electron. J. Comb. 16 (1) (2009)
Amin Coja-Oghlan, André Lanka
Partitioning Random Graphs with General Degree Distributions. IFIP TCS (2008)
Amin Coja-Oghlan, Andreas Goerdt, André Lanka
Strong Refutation Heuristics for Random k-SAT. Comb. Probab. Comput. 16 (1) (2007)
Amin Coja-Oghlan, André Lanka
The Spectral Gap of Random Graphs with Given Expected Degrees. ICALP (1) (2006)
Amin Coja-Oghlan, Andreas Goerdt, André Lanka
Spectral Partitioning of Random Graphs with Given Expected Degrees. IFIP TCS (2006)
André Lanka, Andreas Goerdt
An approximation hardness result for bipartite Clique Electron. Colloquium Comput. Complex. (048) (2004)
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) (2004)
Amin Coja-Oghlan, Andreas Goerdt, André Lanka
Strong Refutation Heuristics for Random k-SAT. APPROX-RANDOM (2004)
Andreas Goerdt, André Lanka
On the Hardness and Easiness of Random 4-SAT Formulas. ISAAC (2004)
Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
-SAT Formulas Using Approximation Techniques. FCT (2003)
Andreas Goerdt, André Lanka
Recognizing more random unsatisfiable 3-SAT instances efficiently. Electron. Notes Discret. Math. 16 (2003)
Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques Electron. Colloquium Comput. Complex. 10 (030) (2003)