| 2009 |
|---|
| 45 | EE | Amin Coja-Oghlan,
Colin Cooper,
Alan M. Frieze:
An efficient sparse regularity concept.
SODA 2009: 207-216 |
| 44 | EE | Amin Coja-Oghlan,
Uriel Feige,
Alan M. Frieze,
Michael Krivelevich,
Dan Vilenchik:
On smoothed k-CNF formulas and the Walksat algorithm.
SODA 2009: 451-460 |
| 2008 |
|---|
| 43 | EE | Dimitris Achlioptas,
Amin Coja-Oghlan:
Algorithmic Barriers from Phase Transitions.
FOCS 2008: 793-802 |
| 42 | EE | Amin Coja-Oghlan,
André Lanka:
Partitioning Random Graphs with General Degree Distributions.
IFIP TCS 2008: 127-141 |
| 41 | EE | Michael Behrisch,
Amin Coja-Oghlan,
Peter Liske:
Die Eulertour.
Taschenbuch der Algorithmen 2008: 295-301 |
| 40 | EE | Amin Coja-Oghlan,
Konstantinos Panagiotou,
Angelika Steger:
On the chromatic number of random graphs.
J. Comb. Theory, Ser. B 98(5): 980-993 (2008) |
| 2007 |
|---|
| 39 | EE | Michael Behrisch,
Amin Coja-Oghlan,
Mihyun Kang:
Local Limit Theorems for the Giant Component of Random Hypergraphs.
APPROX-RANDOM 2007: 341-352 |
| 38 | EE | Amin Coja-Oghlan,
Konstantinos Panagiotou,
Angelika Steger:
On the Chromatic Number of Random Graphs.
ICALP 2007: 777-788 |
| 37 | EE | 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: 789-800 |
| 36 | EE | Avrim Blum,
Amin Coja-Oghlan,
Alan M. Frieze,
Shuheng Zhou:
Separating Populations with Wide Data: A Spectral Analysis.
ISAAC 2007: 439-451 |
| 35 | EE | Amin Coja-Oghlan,
Michael Krivelevich,
Dan Vilenchik:
Why Almost All k -Colorable Graphs Are Easy.
STACS 2007: 121-132 |
| 34 | EE | Amin Coja-Oghlan,
Elchanan Mossel,
Dan Vilenchik:
A Spectral Approach to Analyzing Belief Propagation for 3-Coloring
CoRR abs/0712.0171: (2007) |
| 33 | EE | Amin Coja-Oghlan,
Andreas Goerdt,
André Lanka:
Strong Refutation Heuristics for Random k-SAT.
Combinatorics, Probability & Computing 16(1): 5-28 (2007) |
| 32 | EE | Amin Coja-Oghlan:
Colouring Semirandom Graphs.
Combinatorics, Probability & Computing 16(4): 515-552 (2007) |
| 31 | EE | Amin Coja-Oghlan:
On the Laplacian Eigenvalues of Gn, p.
Combinatorics, Probability & Computing 16(6): 923-946 (2007) |
| 30 | EE | Amin Coja-Oghlan:
Solving NP-hard semirandom graph problems in polynomial expected time.
J. Algorithms 62(1): 19-46 (2007) |
| 29 | EE | Amin Coja-Oghlan,
Cristopher Moore,
Vishal Sanwalani:
Counting connected graphs and hypergraphs via the probabilistic method.
Random Struct. Algorithms 31(3): 288-329 (2007) |
| 2006 |
|---|
| 28 | EE | Amin Coja-Oghlan,
André Lanka:
The Spectral Gap of Random Graphs with Given Expected Degrees.
ICALP (1) 2006: 15-26 |
| 27 | EE | Amin Coja-Oghlan:
An Adaptive Spectral Heuristic for Partitioning Random Graphs.
ICALP (1) 2006: 691-702 |
| 26 | EE | Amin Coja-Oghlan,
Andreas Goerdt,
André Lanka:
Spectral Partitioning of Random Graphs with Given Expected Degrees.
IFIP TCS 2006: 271-282 |
| 25 | EE | Amin Coja-Oghlan:
Finding Large Independent Sets in Polynomial Expected Time.
Combinatorics, Probability & Computing 15(5): 731-751 (2006) |
| 24 | EE | Amin Coja-Oghlan:
Graph partitioning via adaptive spectral techniques.
Electronic Colloquium on Computational Complexity (ECCC) 13(116): (2006) |
| 23 | EE | Amin Coja-Oghlan,
Lars Kuhtz:
An improved algorithm for approximating the chromatic number of Gn, p.
Inf. Process. Lett. 99(6): 234-238 (2006) |
| 22 | EE | Amin Coja-Oghlan,
Sven Oliver Krumke,
Till Nierhoff:
A heuristic for the Stacker Crane Problem on trees which is almost surely exact.
J. Algorithms 61(1): 1-19 (2006) |
| 21 | EE | Amin Coja-Oghlan,
Cristopher Moore,
Vishal Sanwalani:
MAX k-CUT and approximating the chromatic number of random graphs.
Random Struct. Algorithms 28(3): 289-322 (2006) |
| 20 | EE | Amin Coja-Oghlan:
A spectral heuristic for bisecting random graphs.
Random Struct. Algorithms 29(3): 351-398 (2006) |
| 2005 |
|---|
| 19 | EE | Amin Coja-Oghlan:
A spectral heuristic for bisecting random graphs.
SODA 2005: 850-859 |
| 18 | EE | Amin Coja-Oghlan:
The Lovász Number of Random Graphs.
Combinatorics, Probability & Computing 14(4): 439-465 (2005) |
| 17 | EE | Amin Coja-Oghlan,
Sven Oliver Krumke,
Till Nierhoff:
A Hard Dial-a-Ride Problem that is Easy on Average.
J. Scheduling 8(3): 197-210 (2005) |
| 2004 |
|---|
| 16 | EE | Amin Coja-Oghlan,
Andreas Goerdt,
André Lanka:
Strong Refutation Heuristics for Random k-SAT.
APPROX-RANDOM 2004: 310-321 |
| 15 | EE | Amin Coja-Oghlan,
Cristopher Moore,
Vishal Sanwalani:
Counting Connected Graphs and Hypergraphs via the Probabilistic Method.
APPROX-RANDOM 2004: 322-333 |
| 14 | EE | Amin Coja-Oghlan:
Coloring Semirandom Graphs Optimally.
ICALP 2004: 383-395 |
| 13 | EE | Amin Coja-Oghlan,
Anusch Taraz:
Exact and approximative algorithms for coloring G(n, p).
Random Struct. Algorithms 24(3): 259-278 (2004) |
| 12 | EE | 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): 1-45 (2004) |
| 2003 |
|---|
| 11 | EE | Amin Coja-Oghlan,
Andreas Goerdt,
André Lanka,
Frank Schädlich:
Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques.
FCT 2003: 15-26 |
| 10 | EE | Amin Coja-Oghlan,
Cristopher Moore,
Vishal Sanwalani:
MAX k-CUT and Approximating the Chromatic Number of Random Graphs.
ICALP 2003: 200-211 |
| 9 | EE | Amin Coja-Oghlan,
Sven Oliver Krumke,
Till Nierhoff:
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact.
ISAAC 2003: 605-614 |
| 8 | EE | Amin Coja-Oghlan:
The Lovász Number of Random Graphs.
RANDOM-APPROX 2003: 228-239 |
| 7 | EE | Amin Coja-Oghlan,
Anusch Taraz:
Colouring Random Graphs in Expected Polynomial Time.
STACS 2003: 487-498 |
| 6 | EE | Amin Coja-Oghlan:
Finding Large Independent Sets in Polynomial Expected Time.
STACS 2003: 511-522 |
| 5 | EE | 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) 10(030): (2003) |
| 4 | EE | Amin Coja-Oghlan:
The Lovasz number of random graph
Electronic Colloquium on Computational Complexity (ECCC)(073): (2003) |
| 3 | EE | Amin Coja-Oghlan,
Mark-Oliver Stehr:
Revisiting the Algebra of Petri Net Processes under the Collective Token Philosophy.
Fundam. Inform. 54(2-3): 151-164 (2003) |
| 2002 |
|---|
| 2 | EE | Amin Coja-Oghlan:
Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming.
MFCS 2002: 201-211 |
| 1 | EE | Amin Coja-Oghlan:
Finding Sparse Induced Subgraphs of Semirandom Graphs.
RANDOM 2002: 139-148 |
