Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. - Amin Coja-Oghlan; Andreas Goerdt; André Lanka; Frank Schädlich (FCT, 2003)

Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques - Amin Coja-Oghlan; Andreas Goerdt; André Lanka; Frank Schädlich (Electron. Colloquium Comput. Complex., 2003)

Recognizing more random unsatisfiable 3-SAT instances efficiently. - Andreas Goerdt; André Lanka (Electron. Notes Discret. Math., 2003)

On the Hardness and Easiness of Random 4-SAT Formulas. - Andreas Goerdt; André Lanka (ISAAC, 2004)

An approximation hardness result for bipartite Clique - André Lanka; Andreas Goerdt (Electron. Colloquium Comput. Complex., 2004)

Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. - Amin Coja-Oghlan; Andreas Goerdt; André Lanka; Frank Schädlich (Theor. Comput. Sci., 2004)

Spectral Partitioning of Random Graphs with Given Expected Degrees. - Amin Coja-Oghlan; Andreas Goerdt; André Lanka (IFIP TCS, 2006)

Strong Refutation Heuristics for Random k-SAT. - Amin Coja-Oghlan; Andreas Goerdt; André Lanka (Comb. Probab. Comput., 2007)

Partitioning Random Graphs with General Degree Distributions. - Amin Coja-Oghlan; André Lanka (IFIP TCS, 2008)

The Spectral Gap of Random Graphs with Given Expected Degrees. - Amin Coja-Oghlan; André Lanka (Electron. J. Comb., 2009)

Finding Planted Partitions in Random Graphs with General Degree Distributions. - Amin Coja-Oghlan; André Lanka (SIAM J. Discret. Math., 2009)