# André Lanka

According to our database

Collaborative distances:

^{1}, André Lanka authored at least 11 papers between 2003 and 2009.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2009

Finding Planted Partitions in Random Graphs with General Degree Distributions.

SIAM J. Discrete Math., 2009

2008

Partitioning Random Graphs with General Degree Distributions.

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2006

Spectral Partitioning of Random Graphs with Given Expected Degrees.

Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

The Spectral Gap of Random Graphs with Given Expected Degrees.

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2004

Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT.

Theor. Comput. Sci., 2004

An approximation hardness result for bipartite Clique

Electronic Colloquium on Computational Complexity (ECCC), 2004

On the Hardness and Easiness of Random 4-SAT Formulas.

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Strong Refutation Heuristics for Random k-SAT.

Proceedings of the Approximation, 2004

2003

Recognizing more random unsatisfiable 3-SAT instances efficiently.

Electronic Notes in Discrete Mathematics, 2003

Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques

Electronic Colloquium on Computational Complexity (ECCC), 2003

Certifying Unsatisfiability of Random 2

*k*-SAT Formulas Using Approximation Techniques.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003