% csauthors.net - beta - BibTeX bibliography of Amin Coja-Oghlan
@inproceedings{conf/mfcs/Coja-Oghlan02,
title = {Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming.},
year = {2002},
booktitle = {MFCS},
author = {{Amin Coja-Oghlan}},
publisher = {Springer},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings}
}
@inproceedings{conf/random/Coja-Oghlan02,
title = {Finding Sparse Induced Subgraphs of Semirandom Graphs.},
year = {2002},
booktitle = {RANDOM},
author = {{Amin Coja-Oghlan}},
publisher = {Springer},
booktitle = {Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings}
}
@inproceedings{conf/fct/Coja-OghlanGLS03,
title = {Certifying Unsatisfiability of Random 2*k*-SAT Formulas Using Approximation Techniques.},
year = {2003},
booktitle = {FCT},
author = {{Amin Coja-Oghlan} and {Andreas Goerdt} and {André Lanka} and {Frank Schädlich}},
publisher = {Springer},
booktitle = {Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings}
}
@inproceedings{conf/icalp/Coja-OghlanMS03,
title = {MAX k-CUT and Approximating the Chromatic Number of Random Graphs.},
year = {2003},
booktitle = {ICALP},
author = {{Amin Coja-Oghlan} and {Cristopher Moore} and {Vishal Sanwalani}},
publisher = {Springer},
booktitle = {Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings}
}
@inproceedings{conf/isaac/Coja-OghlanKN03,
title = {A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact.},
year = {2003},
booktitle = {ISAAC},
author = {{Amin Coja-Oghlan} and {Sven Oliver Krumke} and {Till Nierhoff}},
publisher = {Springer},
booktitle = {Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings}
}
@inproceedings{conf/random/Coja-Oghlan03,
title = {The Lovász Number of Random Graphs.},
year = {2003},
booktitle = {RANDOM-APPROX},
author = {{Amin Coja-Oghlan}},
publisher = {Springer},
booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}
}
@inproceedings{conf/stacs/Coja-Oghlan03,
title = {Finding Large Independent Sets in Polynomial Expected Time.},
year = {2003},
booktitle = {STACS},
author = {{Amin Coja-Oghlan}},
publisher = {Springer},
booktitle = {STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings}
}
@inproceedings{conf/stacs/Coja-OghlanT03,
title = {Colouring Random Graphs in Expected Polynomial Time.},
year = {2003},
booktitle = {STACS},
author = {{Amin Coja-Oghlan} and {Anusch Taraz}},
publisher = {Springer},
booktitle = {STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings}
}
@article{journals/eccc/ECCC-TR03-030,
title = {Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques},
year = {2003},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
author = {{Amin Coja-Oghlan} and {Andreas Goerdt} and {André Lanka} and {Frank Schädlich}}
}
@article{journals/eccc/ECCC-TR03-073,
title = {The Lovasz number of random graph},
year = {2003},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
author = {{Amin Coja-Oghlan}}
}
@article{journals/fuin/Coja-OghlanS03,
title = {Revisiting the Algebra of Petri Net Processes under the Collective Token Philosophy.},
year = {2003},
journal = {Fundam. Inform.},
author = {{Amin Coja-Oghlan} and {Mark-Oliver Stehr}}
}
@inproceedings{conf/approx/Coja-OghlanGL04,
title = {Strong Refutation Heuristics for Random k-SAT.},
year = {2004},
booktitle = {APPROX-RANDOM},
author = {{Amin Coja-Oghlan} and {Andreas Goerdt} and {André Lanka}},
publisher = {Springer},
booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings}
}
@inproceedings{conf/approx/Coja-OghlanMS04,
title = {Counting Connected Graphs and Hypergraphs via the Probabilistic Method.},
year = {2004},
booktitle = {APPROX-RANDOM},
author = {{Amin Coja-Oghlan} and {Cristopher Moore} and {Vishal Sanwalani}},
publisher = {Springer},
booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings}
}
@inproceedings{conf/icalp/Coja-Oghlan04,
title = {Coloring Semirandom Graphs Optimally.},
year = {2004},
booktitle = {ICALP},
author = {{Amin Coja-Oghlan}},
publisher = {Springer},
booktitle = {Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings}
}
@article{journals/rsa/Coja-OghlanT04,
title = {Exact and approximative algorithms for coloring G(n, p).},
year = {2004},
journal = {Random Struct. Algorithms},
author = {{Amin Coja-Oghlan} and {Anusch Taraz}}
}
@article{journals/tcs/Coja-OghlanGLS04,
title = {Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT.},
year = {2004},
journal = {Theor. Comput. Sci.},
author = {{Amin Coja-Oghlan} and {Andreas Goerdt} and {André Lanka} and {Frank Schädlich}}
}
@inproceedings{conf/soda/Coja-Oghlan05,
title = {A spectral heuristic for bisecting random graphs.},
year = {2005},
booktitle = {SODA},
author = {{Amin Coja-Oghlan}},
publisher = {SIAM},
booktitle = {Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005}
}
@article{journals/scheduling/Coja-OghlanKN05,
title = {A Hard Dial-a-Ride Problem that is Easy on Average.},
year = {2005},
journal = {J. Scheduling},
author = {{Amin Coja-Oghlan} and {Sven Oliver Krumke} and {Till Nierhoff}}
}
@inproceedings{conf/icalp/Coja-Oghlan06,
title = {An Adaptive Spectral Heuristic for Partitioning Random Graphs.},
year = {2006},
booktitle = {ICALP (1)},
author = {{Amin Coja-Oghlan}},
publisher = {Springer},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I}
}
@inproceedings{conf/icalp/Coja-OghlanL06,
title = {The Spectral Gap of Random Graphs with Given Expected Degrees.},
year = {2006},
booktitle = {ICALP (1)},
author = {{Amin Coja-Oghlan} and {André Lanka}},
publisher = {Springer},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I}
}
@inproceedings{conf/ifipTCS/Coja-OghlanGL06,
title = {Spectral Partitioning of Random Graphs with Given Expected Degrees.},
year = {2006},
booktitle = {IFIP TCS},
author = {{Amin Coja-Oghlan} and {Andreas Goerdt} and {André Lanka}},
publisher = {Springer},
booktitle = {Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), IFIP 19th World Computer Congress, TC-1 Foundations of Computer Science, August 23-24, 2006, Santiago, Chile}
}
@article{journals/eccc/Coja-Oghlan06,
title = {Graph partitioning via adaptive spectral techniques.},
year = {2006},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
author = {{Amin Coja-Oghlan}}
}
@article{journals/ipl/Coja-OghlanK06,
title = {An improved algorithm for approximating the chromatic number of G_{n, p}.},
year = {2006},
journal = {Inf. Process. Lett.},
author = {{Amin Coja-Oghlan} and {Lars Kuhtz}}
}
@article{journals/rsa/Coja-OghlanMS06,
title = {MAX *k*-CUT and approximating the chromatic number of random graphs.},
year = {2006},
journal = {Random Struct. Algorithms},
author = {{Amin Coja-Oghlan} and {Cristopher Moore} and {Vishal Sanwalani}}
}
@inproceedings{conf/approx/BehrischCK07,
title = {Local Limit Theorems for the Giant Component of Random Hypergraphs.},
year = {2007},
booktitle = {APPROX-RANDOM},
author = {{Michael Behrisch} and {Amin Coja-Oghlan} and {Mihyun Kang}},
publisher = {Springer},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings}
}
@inproceedings{conf/icalp/AlonCHKRS07,
title = {Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions.},
year = {2007},
booktitle = {ICALP},
author = {{Noga Alon} and {Amin Coja-Oghlan} and {Hiêp Hàn} and {Mihyun Kang} and {Vojtech Rödl} and {Mathias Schacht}},
publisher = {Springer},
booktitle = {Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings}
}
@inproceedings{conf/icalp/Coja-OghlanPS07,
title = {On the Chromatic Number of Random Graphs.},
year = {2007},
booktitle = {ICALP},
author = {{Amin Coja-Oghlan} and {Konstantinos Panagiotou} and {Angelika Steger}},
publisher = {Springer},
booktitle = {Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings}
}
@inproceedings{conf/isaac/BlumCFZ07,
title = {Separating Populations with Wide Data: A Spectral Analysis.},
year = {2007},
booktitle = {ISAAC},
author = {{Avrim Blum} and {Amin Coja-Oghlan} and {Alan M. Frieze} and {Shuheng Zhou}},
publisher = {Springer},
booktitle = {Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings}
}
@inproceedings{conf/stacs/Coja-OghlanKV07,
title = {Why Almost All *k* -Colorable Graphs Are Easy.},
year = {2007},
booktitle = {STACS},
author = {{Amin Coja-Oghlan} and {Michael Krivelevich} and {Dan Vilenchik}},
publisher = {Springer},
booktitle = {STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings}
}
@article{journals/cpc/Coja-Oghlan07,
title = {Colouring Semirandom Graphs.},
year = {2007},
journal = {Combinatorics, Probability & Computing},
author = {{Amin Coja-Oghlan}}
}
@article{journals/cpc/Coja-Oghlan07a,
title = {On the Laplacian Eigenvalues of G_{n, p}.},
year = {2007},
journal = {Combinatorics, Probability & Computing},
author = {{Amin Coja-Oghlan}}
}
@article{journals/jal/Coja-Oghlan07,
title = {Solving NP-hard semirandom graph problems in polynomial expected time.},
year = {2007},
journal = {J. Algorithms},
author = {{Amin Coja-Oghlan}}
}
@inproceedings{conf/focs/AchlioptasC08,
title = {Algorithmic Barriers from Phase Transitions.},
year = {2008},
booktitle = {FOCS},
author = {{Dimitris Achlioptas} and {Amin Coja-Oghlan}},
publisher = {IEEE Computer Society},
booktitle = {49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA}
}
@inproceedings{conf/ifipTCS/Coja-OghlanL08,
title = {Partitioning Random Graphs with General Degree Distributions.},
year = {2008},
booktitle = {IFIP TCS},
author = {{Amin Coja-Oghlan} and {André Lanka}},
publisher = {Springer},
booktitle = {Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy}
}
@article{journals/combinatorics/Coja-OghlanF08,
title = {Random k-SAT: The Limiting Probability for Satisfiability for Moderately Growing k.},
year = {2008},
journal = {Electr. J. Comb.},
author = {{Amin Coja-Oghlan} and {Alan M. Frieze}}
}
@incollection{reference/algo/BehrischCL08,
title = {Die Eulertour.},
year = {2008},
booktitle = {Taschenbuch der Algorithmen},
author = {{Michael Behrisch} and {Amin Coja-Oghlan} and {Peter Liske}},
publisher = {Springer},
booktitle = {Taschenbuch der Algorithmen}
}
@inproceedings{conf/icalp/Coja-Oghlan09,
title = {A Better Algorithm for Random *k*-SAT.},
year = {2009},
booktitle = {ICALP (1)},
author = {{Amin Coja-Oghlan}},
publisher = {Springer},
booktitle = {Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I}
}
@inproceedings{conf/soda/Coja-OghlanCF09,
title = {An efficient sparse regularity concept.},
year = {2009},
booktitle = {SODA},
author = {{Amin Coja-Oghlan} and {Colin Cooper} and {Alan M. Frieze}},
publisher = {SIAM},
booktitle = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009}
}
@inproceedings{conf/soda/Coja-OghlanFFKV09,
title = {On smoothed *k*-CNF formulas and the Walksat algorithm.},
year = {2009},
booktitle = {SODA},
author = {{Amin Coja-Oghlan} and {Uriel Feige} and {Alan M. Frieze} and {Michael Krivelevich} and {Dan Vilenchik}},
publisher = {SIAM},
booktitle = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009}
}
@inproceedings{journals/corr/abs-0911-2322,
title = {Random Constraint Satisfaction Problems},
year = {2009},
booktitle = {DCM},
author = {{Amin Coja-Oghlan}},
booktitle = {Proceedings Fifth Workshop on Developments in Computational Models--Computational Models From Nature, DCM 2009, Rhodes, Greece, 11th July 2009.}
}
@article{journals/cpc/Coja-OghlanMV09,
title = {A Spectral Approach to Analysing Belief Propagation for 3-Colouring.},
year = {2009},
journal = {Combinatorics, Probability & Computing},
author = {{Amin Coja-Oghlan} and {Elchanan Mossel} and {Dan Vilenchik}}
}
@article{journals/dm/Coja-OghlanK09,
title = {The evolution of the min-min random graph process.},
year = {2009},
journal = {Discrete Mathematics},
author = {{Amin Coja-Oghlan} and {Mihyun Kang}}
}
@article{journals/siamdm/Coja-OghlanL09,
title = {Finding Planted Partitions in Random Graphs with General Degree Distributions.},
year = {2009},
journal = {SIAM J. Discrete Math.},
author = {{Amin Coja-Oghlan} and {André Lanka}}
}
@inproceedings{conf/approx/Coja-OghlanOW10,
title = {Propagation Connectivity of Random Hypergraphs.},
year = {2010},
booktitle = {APPROX-RANDOM},
author = {{Amin Coja-Oghlan} and {Mikael Onsjö} and {Osamu Watanabe 0001}},
publisher = {Springer},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings}
}
@article{journals/cpc/Coja-Oghlan10,
title = {Graph Partitioning via Adaptive Spectral Techniques.},
year = {2010},
journal = {Combinatorics, Probability & Computing},
author = {{Amin Coja-Oghlan}}
}
@article{journals/mst/Coja-OghlanKV10,
title = {Why Almost All *k*-Colorable Graphs Are Easy to Color.},
year = {2010},
journal = {Theory Comput. Syst.},
author = {{Amin Coja-Oghlan} and {Michael Krivelevich} and {Dan Vilenchik}}
}
@article{journals/rsa/BehrischCK10,
title = {The order of the giant component of random hypergraphs.},
year = {2010},
journal = {Random Struct. Algorithms},
author = {{Michael Behrisch} and {Amin Coja-Oghlan} and {Mihyun Kang}}
}
@article{journals/siamcomp/Coja-Oghlan10,
title = {A Better Algorithm for Random k-SAT.},
year = {2010},
journal = {SIAM J. Comput.},
author = {{Amin Coja-Oghlan}}
}
@incollection{books/sp/voecking2011/BehrischCL11,
title = {Eulerian Circuits.},
year = {2011},
booktitle = {Algorithms Unplugged},
author = {{Michael Behrisch} and {Amin Coja-Oghlan} and {Peter Liske}},
publisher = {Springer},
booktitle = {Algorithms Unplugged}
}
@inproceedings{conf/icalp/Coja-OghlanP11,
title = {The Decimation Process in Random *k*-SAT.},
year = {2011},
booktitle = {ICALP (1)},
author = {{Amin Coja-Oghlan} and {Angelica Y. Pachon-Pinzon}},
publisher = {Springer},
booktitle = {Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I}
}
@inproceedings{conf/soda/Coja-Oghlan11,
title = {On Belief Propagation Guided Decimation for Random k-SAT.},
year = {2011},
booktitle = {SODA},
author = {{Amin Coja-Oghlan}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011}
}
@inproceedings{conf/soda/Coja-OghlanE11,
title = {On independent sets in random graphs.},
year = {2011},
booktitle = {SODA},
author = {{Amin Coja-Oghlan} and {Charilaos Efthymiou}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011}
}
@article{journals/rsa/AchlioptasCR11,
title = {On the solution-space geometry of random constraint satisfaction problems.},
year = {2011},
journal = {Random Struct. Algorithms},
author = {{Dimitris Achlioptas} and {Amin Coja-Oghlan} and {Federico Ricci-Tersenghi}}
}
@inproceedings{conf/analco/Coja-OghlanF12,
title = {Analyzing Walksat on Random Formulas.},
year = {2012},
booktitle = {ANALCO},
author = {{Amin Coja-Oghlan} and {Alan M. Frieze}},
publisher = {SIAM},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2012, Kyoto, Japan, January 16, 2012}
}
@inproceedings{conf/soda/Coja-OghlanZ12,
title = {The condensation transition in random hypergraph 2-coloring.},
year = {2012},
booktitle = {SODA},
author = {{Amin Coja-Oghlan} and {Lenka Zdeborová}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012}
}
@inproceedings{conf/stoc/Coja-OghlanP12,
title = {Catching the k-NAESAT threshold.},
year = {2012},
booktitle = {STOC},
author = {{Amin Coja-Oghlan} and {Konstantinos Panagiotou}},
publisher = {ACM},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012}
}
@article{journals/siamdm/Coja-OghlanP12,
title = {The Decimation Process in Random k-SAT.},
year = {2012},
journal = {SIAM J. Discrete Math.},
author = {{Amin Coja-Oghlan} and {Angelica Y. Pachon-Pinzon}}
}
@inproceedings{conf/focs/Coja-OghlanV13,
title = {Chasing the K-Colorability Threshold.},
year = {2013},
booktitle = {FOCS},
author = {{Amin Coja-Oghlan} and {Dan Vilenchik}},
publisher = {IEEE Computer Society},
booktitle = {54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA}
}
@inproceedings{conf/stoc/Coja-OghlanP13,
title = {Going after the k-SAT threshold.},
year = {2013},
booktitle = {STOC},
author = {{Amin Coja-Oghlan} and {Konstantinos Panagiotou}},
publisher = {ACM},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013}
}
@article{journals/combinatorics/Coja-Oghlan13,
title = {Upper-Bounding the k-Colorability Threshold by Counting Covers.},
year = {2013},
journal = {Electr. J. Comb.},
author = {{Amin Coja-Oghlan}}
}
@inproceedings{conf/approx/BapstCHRV14,
title = {The Condensation Phase Transition in Random Graph Coloring.},
year = {2014},
booktitle = {APPROX-RANDOM},
author = {{Victor Bapst} and {Amin Coja-Oghlan} and {Samuel Hetterich} and {Felicia Raßmann} and {Dan Vilenchik}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain}
}
@inproceedings{conf/stoc/Coja-Oghlan14,
title = {The asymptotic k-SAT threshold.},
year = {2014},
booktitle = {STOC},
author = {{Amin Coja-Oghlan}},
publisher = {ACM},
booktitle = {Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014}
}
@article{journals/cpc/BehrischCK14a,
title = {The Asymptotic Number of Connected *d*-Uniform Hypergraphs.},
year = {2014},
journal = {Combinatorics, Probability & Computing},
author = {{Michael Behrisch} and {Amin Coja-Oghlan} and {Mihyun Kang}}
}
@inproceedings{conf/approx/BapstC15,
title = {Harnessing the Bethe Free Energy.},
year = {2015},
booktitle = {APPROX-RANDOM},
author = {{Victor Bapst} and {Amin Coja-Oghlan}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA}
}
@inproceedings{conf/approx/Coja-OghlanCKS15,
title = {The Minimum Bisection in the Planted Bisection Model.},
year = {2015},
booktitle = {APPROX-RANDOM},
author = {{Amin Coja-Oghlan} and {Oliver Cooley} and {Mihyun Kang} and {Kathrin Skubch}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA}
}
@inproceedings{conf/approx/Coja-OghlanEJ15,
title = {Local Convergence of Random Graph Colorings.},
year = {2015},
booktitle = {APPROX-RANDOM},
author = {{Amin Coja-Oghlan} and {Charilaos Efthymiou} and {Nor Jaafari}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA}
}
@inproceedings{conf/soda/Coja-OghlanFKR15,
title = {Contagious Sets in Expanders.},
year = {2015},
booktitle = {SODA},
author = {{Amin Coja-Oghlan} and {Uriel Feige} and {Michael Krivelevich} and {Daniel Reichman 0001}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015}
}
@article{journals/cpc/BehrischCK15,
title = {'The Asymptotic Number of Connected *d*-Uniform Hypergraphs' - CORRIGENDUM.},
year = {2015},
journal = {Combinatorics, Probability & Computing},
author = {{Michael Behrisch} and {Amin Coja-Oghlan} and {Mihyun Kang}}
}
@article{journals/endm/Coja-OghlanCKS15,
title = {How does the core sit inside the mantle?},
year = {2015},
journal = {Electronic Notes in Discrete Mathematics},
author = {{Amin Coja-Oghlan} and {Oliver Cooley} and {Mihyun Kang} and {Kathrin Skubch}}
}
@inproceedings{conf/approx/BapstC16,
title = {The Condensation Phase Transition in the Regular k-SAT Model.},
year = {2016},
booktitle = {APPROX-RANDOM},
author = {{Victor Bapst} and {Amin Coja-Oghlan}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France}
}
@inproceedings{conf/approx/Coja-OghlanP16,
title = {Belief Propagation on Replica Symmetric Random Factor Graph Models.},
year = {2016},
booktitle = {APPROX-RANDOM},
author = {{Amin Coja-Oghlan} and {Will Perkins}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France}
}
@article{journals/combinatorics/Coja-OghlanJ16,
title = {On the Potts Antiferromagnet on Random Graphs.},
year = {2016},
journal = {Electr. J. Comb.},
author = {{Amin Coja-Oghlan} and {Nor Jaafari}}
}
@article{journals/jct/Coja-OghlanEH16,
title = {On the chromatic number of random regular graphs.},
year = {2016},
journal = {J. Comb. Theory, Ser. B},
author = {{Amin Coja-Oghlan} and {Charilaos Efthymiou} and {Samuel Hetterich}}
}
@inproceedings{conf/approx/Coja-OghlanEJKK17,
title = {Charting the Replica Symmetric Phase.},
year = {2017},
booktitle = {APPROX-RANDOM},
author = {{Amin Coja-Oghlan} and {Charilaos Efthymiou} and {Nor Jaafari} and {Mihyun Kang} and {Tobias Kapetanopoulos}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA}
}
@inproceedings{conf/stoc/Coja-OghlanKPZ17,
title = {Information-theoretic thresholds from the cavity method.},
year = {2017},
booktitle = {STOC},
author = {{Amin Coja-Oghlan} and {Florent Krzakala} and {Will Perkins} and {Lenka Zdeborová}},
publisher = {ACM},
booktitle = {Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017}
}
@article{journals/cpc/BapstCE17,
title = {Planting Colourings Silently.},
year = {2017},
journal = {Combinatorics, Probability & Computing},
author = {{Victor Bapst} and {Amin Coja-Oghlan} and {Charilaos Efthymiou}}
}
@article{journals/ejc/Coja-OghlanPS17,
title = {Limits of discrete distributions and Gibbs measures on random graphs.},
year = {2017},
journal = {Eur. J. Comb.},
author = {{Amin Coja-Oghlan} and {Will Perkins} and {Kathrin Skubch}}
}
@article{journals/jacm/Coja-Oghlan17,
title = {Belief Propagation Guided Decimation Fails on Random Formulas.},
year = {2017},
journal = {J. ACM},
author = {{Amin Coja-Oghlan}}
}
@article{journals/rsa/Coja-OghlanCKS17,
title = {How does the core sit inside the mantle?},
year = {2017},
journal = {Random Struct. Algorithms},
author = {{Amin Coja-Oghlan} and {Oliver Cooley} and {Mihyun Kang} and {Kathrin Skubch}}
}
@article{journals/siamdm/Coja-OghlanHH17,
title = {Walksat Stalls Well Below Satisfiability.},
year = {2017},
journal = {SIAM J. Discrete Math.},
author = {{Amin Coja-Oghlan} and {Amir Haqshenas} and {Samuel Hetterich}}
}
@article{journals/cpc/Coja-OghlanW18,
title = {The Number of Satisfying Assignments of Random Regular k-SAT Formulas.},
year = {2018},
journal = {Combinatorics, Probability & Computing},
author = {{Amin Coja-Oghlan} and {Nick Wormald}}
}