| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Amin Coja-Oghlan, Lenka Zdeborová |
The condensation transition in random hypergraph 2-coloring.  |
SODA  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Amin Coja-Oghlan, Federico Ricci-Tersenghi |
On the solution-space geometry of random constraint satisfaction problems. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Angelica Y. Pachon-Pinzon |
The decimation process in random k-SAT |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Alan M. Frieze |
Analyzing Walksat on random formulas |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Konstantinos Panagiotou |
Catching the k-NAESAT Threshold |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michael Behrisch, Amin Coja-Oghlan, Peter Liske |
Eulerian Circuits. |
Algorithms Unplugged |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
On Belief Propagation Guided Decimation for Random k-SAT. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Charilaos Efthymiou |
On independent sets in random graphs. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Angelica Y. Pachon-Pinzon |
The Decimation Process in Random k-SAT. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang |
The order of the giant component of random hypergraphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
Graph Partitioning via Adaptive Spectral Techniques. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Charilaos Efthymiou |
On independent sets in random graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
On belief propagation guided decimation for random k-SAT |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze |
An Efficient Sparse Regularity Concept. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik |
Why Almost All k-Colorable Graphs Are Easy to Color. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
A Better Algorithm for Random k-SAT. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht |
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Mikael Onsjö, Osamu Watanabe |
Propagation Connectivity of Random Hypergraphs. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Mihyun Kang |
The evolution of the min-min random graph process. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, André Lanka |
The Spectral Gap of Random Graphs with Given Expected Degrees. |
Electr. J. Comb. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik |
A Spectral Approach to Analysing Belief Propagation for 3-Colouring. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
Random Constraint Satisfaction Problems |
DCM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, André Lanka |
Finding Planted Partitions in Random Graphs with General Degree Distributions. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze |
An efficient sparse regularity concept. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik |
On smoothed k-CNF formulas and the Walksat algorithm. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
A Better Algorithm for Random k-SAT. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger |
On the chromatic number of random graphs. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Alan M. Frieze |
Random k-SAT: The Limiting Probability for Satisfiability for Moderately Growing k. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Michael Behrisch, Amin Coja-Oghlan, Peter Liske |
Die Eulertour. |
Taschenbuch der Algorithmen |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, André Lanka |
Partitioning Random Graphs with General Degree Distributions. |
IFIP TCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Amin Coja-Oghlan |
Algorithmic Barriers from Phase Transitions. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani |
Counting connected graphs and hypergraphs via the probabilistic method. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Andreas Goerdt, André Lanka |
Strong Refutation Heuristics for Random k-SAT. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
On the Laplacian Eigenvalues of Gn, p. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
Colouring Semirandom Graphs. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
Solving NP-hard semirandom graph problems in polynomial expected time. |
J. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik |
A Spectral Approach to Analyzing Belief Propagation for 3-Coloring |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht |
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
quasi-random graphs, Laplacian eigenvalues, Grothendieck’s inequality, regularity lemma, sparse graphs |
| 1 | Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger |
On the Chromatic Number of Random Graphs. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik |
Why Almost All k -Colorable Graphs Are Easy. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang |
Local Limit Theorems for the Giant Component of Random Hypergraphs. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuheng Zhou |
Separating Populations with Wide Data: A Spectral Analysis. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Lars Kuhtz |
An improved algorithm for approximating the chromatic number of Gn, p. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
Graph partitioning via adaptive spectral techniques. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani |
MAX k-CUT and approximating the chromatic number of random graphs. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
A spectral heuristic for bisecting random graphs. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
Finding Large Independent Sets in Polynomial Expected Time. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
A heuristic for the Stacker Crane Problem on trees which is almost surely exact. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, André Lanka |
The Spectral Gap of Random Graphs with Given Expected Degrees. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
An Adaptive Spectral Heuristic for Partitioning Random Graphs. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Andreas Goerdt, André Lanka |
Spectral Partitioning of Random Graphs with Given Expected Degrees. |
IFIP TCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
The Lovász Number of Random Graphs. |
Combinatorics, Probability & Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
A Hard Dial-a-Ride Problem that is Easy on Average. |
J. Scheduling |
2005 |
DBLP DOI BibTeX RDF |
approximation algorithm, NP-hard, average-case analysis |
| 1 | Amin Coja-Oghlan |
A spectral heuristic for bisecting random graphs. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Anusch Taraz |
Exact and approximative algorithms for coloring G(n, p). |
Random Struct. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
Coloring Semirandom Graphs Optimally. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Andreas Goerdt, André Lanka |
Strong Refutation Heuristics for Random k-SAT. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani |
Counting Connected Graphs and Hypergraphs via the Probabilistic Method. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
The Lovasz number of random graph |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Mark-Oliver Stehr |
Revisiting the Algebra of Petri Net Processes under the Collective Token Philosophy. |
Fundam. Inform. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani |
MAX k-CUT and Approximating the Chromatic Number of Random Graphs. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Anusch Taraz |
Colouring Random Graphs in Expected Polynomial Time. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
Finding Large Independent Sets in Polynomial Expected Time. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich |
Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. |
FCT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
The Lovász Number of Random Graphs. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
Finding Sparse Induced Subgraphs of Semirandom Graphs. |
RANDOM |
2002 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")