default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmin Coja-Oghlan
Person information
- affiliation: TU Dortmund, Germany
- affiliation (former): Goethe University of Frankfurt, Mathematics Institute, Frankfurt am Main, Germany
SPARQL queries 
🛈 Please note that only 72% of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j63]Amin Coja-Oghlan
, Max Hahn-Klimroth, Lukas Hintze, Dominik Kaaser, Lena Krieg, Maurice Rolvien, Olga Scheftelowitsch:
Noisy group testing via spatial coupling. Comb. Probab. Comput. 34(2): 210-258 (2025)- [j62]Petra Berenbrink, Amin Coja-Oghlan, Colin Cooper, Thorsten Götte, Lukas Hintze, Pavel Zakharov:
WalkSAT is Linear on Random 2-SAT. SIAM J. Discret. Math. 39(4): 1939-1952 (2025) - [c57]Arnab Chatterjee, Amin Coja-Oghlan, Mihyun Kang, Lena Krieg, Maurice Rolvien, Gregory B. Sorkin:
Belief Propagation Guided Decimation on Random k-XORSAT. ICALP 2025: 47:1-47:21 - [i52]Arnab Chatterjee, Amin Coja-Oghlan, Mihyun Kang, Lena Krieg, Maurice Rolvien, Gregory B. Sorkin:
Belief Propagation Guided Decimation on Random k-XORSAT. CoRR abs/2501.17657 (2025) - [i51]Arnab Chatterjee, Amin Coja-Oghlan, Catherine S. Greenhill, Vincent Pfenninger, Maurice Rolvien, Pavel Zakharov, Kostas Zampetakis:
The random k-SAT Gibbs uniqueness threshold revisited. CoRR abs/2506.01359 (2025) - 2024
- [j61]Amin Coja-Oghlan, Mihyun Kang, Lena Krieg, Maurice Rolvien:
The $k$-XORSAT Threshold Revisited. Electron. J. Comb. 31(2) (2024) - [j60]Amin Coja-Oghlan, Pu Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien:
The full rank condition for sparse random matrices. Comb. Probab. Comput. 33(5): 643-707 (2024) - [c56]Arnab Chatterjee, Amin Coja-Oghlan, Noëla Müller, Connor Riddlesden, Maurice Rolvien, Pavel Zakharov, Haodong Zhu:
The Number of Random 2-SAT Solutions Is Asymptotically Log-Normal. APPROX/RANDOM 2024: 39:1-39:15 - [i50]Amin Coja-Oghlan, Max Hahn-Klimroth, Lukas Hintze, Dominik Kaaser, Lena Krieg, Maurice Rolvien, Olga Scheftelowitsch:
Noisy group testing via spatial coupling. CoRR abs/2402.02895 (2024) - [i49]Arnab Chatterjee, Amin Coja-Oghlan, Noëla Müller, Connor Riddlesden, Maurice Rolvien, Pavel Zakharov, Haodong Zhu:
The number of random 2-SAT solutions is asymptotically log-normal. CoRR abs/2405.03302 (2024) - [i48]Amin Coja-Oghlan, Lena Krieg, Johannes Christian Lawnik, Olga Scheftelowitsch:
Bad local minima exist in the stochastic block model. CoRR abs/2407.17851 (2024) - [i47]Petra Berenbrink, Amin Coja-Oghlan, Colin Cooper, Thorsten Götte, Lukas Hintze, Pavel Zakharov:
WalkSAT is linear on random 2-SAT. CoRR abs/2412.04156 (2024) - 2023
- [j59]Amin Coja-Oghlan, Alperen Ali Ergür, Pu Gao, Samuel Hetterich, Maurice Rolvien:
The rank of sparse random matrices. Random Struct. Algorithms 62(1): 68-130 (2023) - [c55]Amin Coja-Oghlan, Jane Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien:
The Full Rank Condition for Sparse Random Matrices. APPROX/RANDOM 2023: 54:1-54:14 - [i46]Amin Coja-Oghlan, Mihyun Kang, Lena Krieg, Maurice Rolvien:
The k-XORSAT threshold revisited. CoRR abs/2301.09287 (2023) - 2022
- [j58]Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill:
Lower Bounds on the Chromatic Number of Random Graphs. Comb. 42(5): 617-658 (2022) - [j57]Amin Coja-Oghlan, Philipp Loick, Balázs F. Mezei, Gregory B. Sorkin:
The Ising Antiferromagnet and Max Cut on Random Regular Graphs. SIAM J. Discret. Math. 36(2): 1306-1342 (2022) - [c54]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Alexander S. Wein, Ilias Zadik:
Statistical and Computational Phase Transitions in Group Testing. COLT 2022: 4764-4781 - [c53]Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda:
Metastability of the Potts Ferromagnet on Random Regular Graphs. ICALP 2022: 45:1-45:20 - [c52]Petra Berenbrink, Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, Malin Rau:
On the Hierarchy of Distributed Majority Protocols. OPODIS 2022: 23:1-23:19 - [c51]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Joon Lee, Jean Bernoulli Ravelomanana:
The Sparse Parity Matrix. SODA 2022: 822-833 - [c50]Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Manuel Penschuck:
Efficient and Accurate Group Testing via Belief Propagation: An Empirical Study. SEA 2022: 8:1-8:18 - [i45]Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda:
Metastability of the Potts ferromagnet on random regular graphs. CoRR abs/2202.05777 (2022) - [i44]Petra Berenbrink, Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, Malin Rau:
On the Hierarchy of Distributed Majority Protocols. CoRR abs/2205.08203 (2022) - [i43]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Alexander S. Wein, Ilias Zadik:
Statistical and Computational Phase Transitions in Group Testing. CoRR abs/2206.07640 (2022) - 2021
- [j56]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick:
Optimal group testing. Comb. Probab. Comput. 30(6): 811-848 (2021) - [j55]Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Manuel Penschuck, Guangyan Zhou:
The number of satisfying assignments of random 2-SAT formulas. Random Struct. Algorithms 58(4): 609-647 (2021) - [j54]Amin Coja-Oghlan, Max Hahn-Klimroth:
The Cut Metric for Probability Distributions. SIAM J. Discret. Math. 35(2): 1096-1135 (2021) - [c49]Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Noëla Müller, Konstantinos Panagiotou, Matija Pasch:
Inference and Mutual Information on Random Factor Graphs. STACS 2021: 24:1-24:15 - [i42]Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Manuel Penschuck:
Efficient and accurate group testing via Belief Propagation: an empirical study. CoRR abs/2105.07882 (2021) - [i41]Amin Coja-Oghlan, Pu Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien:
The full rank condition for sparse random matrices. CoRR abs/2112.14090 (2021) - 2020
- [j53]Peter J. Ayre, Amin Coja-Oghlan, Pu Gao, Noëla Müller:
The Satisfiability Threshold For Random Linear Equations. Comb. 40(2): 179-235 (2020) - [j52]Amin Coja-Oghlan, Tobias Kapetanopoulos, Noëla Müller:
The replica symmetric phase of random constraint satisfaction problems. Comb. Probab. Comput. 29(3): 346-422 (2020) - [j51]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick:
Information-Theoretic and Algorithmic Thresholds for Group Testing. IEEE Trans. Inf. Theory 66(12): 7911-7928 (2020) - [c48]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick:
Optimal Group Testing. COLT 2020: 1374-1388 - [c47]Amin Coja-Oghlan, Alperen Ali Ergür, Pu Gao, Samuel Hetterich, Maurice Rolvien:
The rank of sparse random matrices. SODA 2020: 579-591 - [i40]Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Manuel Penschuck, Guangyan Zhou:
The random 2-SAT partition function. CoRR abs/2002.03690 (2020) - [i39]Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Noëla Müller, Konstantinos Panagiotou, Matija Pasch:
Inference and mutual information on random factor graphs. CoRR abs/2007.07494 (2020) - [i38]Amin Coja-Oghlan, Philipp Loick, Balázs F. Mezei, Gregory B. Sorkin:
The Ising antiferromagnet and max cut on random regular graphs. CoRR abs/2009.10483 (2020) - [i37]Amin Coja-Oghlan, Noëla Müller, Jean B. Ravelomanana:
Belief Propagation on the random k-SAT model. CoRR abs/2011.02303 (2020)
2010 – 2019
- 2019
- [j50]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
Core forging and local limit theorems for the k-core of random graphs. J. Comb. Theory B 137: 178-231 (2019) - [j49]Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill:
Hypergraph coloring up to condensation. Random Struct. Algorithms 54(4): 615-652 (2019) - [c46]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick:
Information-Theoretic and Algorithmic Thresholds for Group Testing. ICALP 2019: 43:1-43:14 - [i36]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick:
Information-theoretic and algorithmic thresholds for group testing. CoRR abs/1902.02202 (2019) - [i35]Amin Coja-Oghlan, Max Hahn-Klimroth:
The cut metric for probability distributions. CoRR abs/1905.13619 (2019) - [i34]Amin Coja-Oghlan, Alperen Ali Ergür, Samuel Hetterich, Maurice Rolvien:
The rank of sparse random matrices. CoRR abs/1906.05757 (2019) - [i33]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick:
Optimal non-adaptive group testing. CoRR abs/1911.02287 (2019) - 2018
- [j48]Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari:
Local Convergence of Random Graph Colorings. Comb. 38(2): 341-380 (2018) - [j47]Amin Coja-Oghlan, Nick Wormald:
The Number of Satisfying Assignments of Random Regular k-SAT Formulas. Comb. Probab. Comput. 27(4): 496-530 (2018) - [i32]Amin Coja-Oghlan, Tobias Kapetanopoulos, Noëla Müller:
The replica symmetric phase of random constraint satisfaction problems. CoRR abs/1802.09311 (2018) - [i31]Amin Coja-Oghlan, Pu Gao:
The rank of random matrices over finite fields. CoRR abs/1810.07390 (2018) - [i30]Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill:
Lower bounds on the chromatic number of random graphs. CoRR abs/1812.09691 (2018) - 2017
- [j46]Victor Bapst, Amin Coja-Oghlan, Charilaos Efthymiou:
Planting Colourings Silently. Comb. Probab. Comput. 26(3): 338-366 (2017) - [j45]Amin Coja-Oghlan, Will Perkins, Kathrin Skubch:
Limits of discrete distributions and Gibbs measures on random graphs. Eur. J. Comb. 66: 37-59 (2017) - [j44]Amin Coja-Oghlan:
Belief Propagation Guided Decimation Fails on Random Formulas. J. ACM 63(6): 49:1-49:55 (2017) - [j43]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
How does the core sit inside the mantle? Random Struct. Algorithms 51(3): 459-482 (2017) - [j42]Amin Coja-Oghlan, Amir Haqshenas, Samuel Hetterich:
Walksat Stalls Well Below Satisfiability. SIAM J. Discret. Math. 31(2): 1160-1173 (2017) - [j41]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
The Minimum Bisection in the Planted Bisection Model. Theory Comput. 13(1): 1-22 (2017) - [c45]Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, Tobias Kapetanopoulos:
Charting the Replica Symmetric Phase. APPROX-RANDOM 2017: 40:1-40:17 - [c44]Amin Coja-Oghlan, Florent Krzakala, Will Perkins, Lenka Zdeborová:
Information-theoretic thresholds from the cavity method. STOC 2017: 146-157 - [i29]Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, Tobias Kapetanopoulos:
Charting the replica symmetric phase. CoRR abs/1704.01043 (2017) - [i28]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
Core forging and local limit theorems for the k-core of random graphs. CoRR abs/1707.03556 (2017) - [i27]Peter J. Ayre, Amin Coja-Oghlan, Pu Gao, Noëla Müller:
The satisfiability threshold for random linear equations. CoRR abs/1710.07497 (2017) - 2016
- [j40]Amin Coja-Oghlan, Nor Jaafari:
On the Potts Antiferromagnet on Random Graphs. Electron. J. Comb. 23(4): 4 (2016) - [j39]Amin Coja-Oghlan, Charilaos Efthymiou, Samuel Hetterich:
On the chromatic number of random regular graphs. J. Comb. Theory B 116: 367-439 (2016) - [j38]Victor Bapst, Amin Coja-Oghlan:
Harnessing the Bethe free energy. Random Struct. Algorithms 49(4): 694-741 (2016) - [c43]Victor Bapst, Amin Coja-Oghlan:
The Condensation Phase Transition in the Regular k-SAT Model. APPROX-RANDOM 2016: 22:1-22:18 - [c42]Amin Coja-Oghlan, Will Perkins:
Belief Propagation on Replica Symmetric Random Factor Graph Models. APPROX-RANDOM 2016: 27:1-27:15 - [i26]Amin Coja-Oghlan, Will Perkins:
Belief Propagation on replica symmetric random factor graph models. CoRR abs/1603.08191 (2016) - [i25]Amin Coja-Oghlan, Florent Krzakala, Will Perkins, Lenka Zdeborová:
Information-theoretic thresholds from the cavity method. CoRR abs/1611.00814 (2016) - [i24]Amin Coja-Oghlan, Nick Wormald:
The number of satisfying assignments of random regular k-SAT formulas. CoRR abs/1611.03236 (2016) - 2015
- [j37]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
'The Asymptotic Number of Connected d-Uniform Hypergraphs' - CORRIGENDUM. Comb. Probab. Comput. 24(1): 373-375 (2015) - [j36]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
How does the core sit inside the mantle? Electron. Notes Discret. Math. 49: 489-496 (2015) - [j35]Amin Coja-Oghlan, Charilaos Efthymiou:
On independent sets in random graphs. Random Struct. Algorithms 47(3): 436-486 (2015) - [c41]Victor Bapst, Amin Coja-Oghlan:
Harnessing the Bethe Free Energy. APPROX-RANDOM 2015: 467-480 - [c40]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
The Minimum Bisection in the Planted Bisection Model. APPROX-RANDOM 2015: 710-725 - [c39]Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari:
Local Convergence of Random Graph Colorings. APPROX-RANDOM 2015: 726-737 - [c38]Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman:
Contagious Sets in Expanders. SODA 2015: 1953-1987 - [i23]Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari:
Local convergence of random graph colorings. CoRR abs/1501.06301 (2015) - [i22]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
How does the core sit inside the mantle? CoRR abs/1503.09030 (2015) - [i21]Victor Bapst, Amin Coja-Oghlan:
Harnessing the Bethe free energy. CoRR abs/1504.03975 (2015) - [i20]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
The minimum bisection in the planted bisection model. CoRR abs/1505.02985 (2015) - [i19]Victor Bapst, Amin Coja-Oghlan:
The condensation phase transition in the regular k-SAT model. CoRR abs/1507.03512 (2015) - [i18]Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill:
Hypergraph coloring up to condensation. CoRR abs/1508.01841 (2015) - 2014
- [j34]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
Local Limit Theorems for the Giant Component of Random Hypergraphs. Comb. Probab. Comput. 23(3): 331-366 (2014) - [j33]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
The Asymptotic Number of Connected d-Uniform Hypergraphs. Comb. Probab. Comput. 23(3): 367-385 (2014) - [j32]Amin Coja-Oghlan, Alan M. Frieze:
Analyzing Walksat on Random Formulas. SIAM J. Comput. 43(4): 1456-1485 (2014) - [c37]Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, Dan Vilenchik:
The Condensation Phase Transition in Random Graph Coloring. APPROX-RANDOM 2014: 449-464 - [c36]Amin Coja-Oghlan:
The asymptotic k-SAT threshold. STOC 2014: 804-813 - [i17]Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, Dan Vilenchik:
The condensation phase transition in random graph coloring. CoRR abs/1404.5513 (2014) - [i16]Victor Bapst, Amin Coja-Oghlan, Felicia Raßmann:
A positive temperature phase transition in random hypergraph 2-coloring. CoRR abs/1410.2190 (2014) - [i15]Victor Bapst, Amin Coja-Oghlan, Charilaos Efthymiou:
Planting colourings silently. CoRR abs/1411.0610 (2014) - 2013
- [j31]Amin Coja-Oghlan:
Upper-Bounding the k-Colorability Threshold by Counting Covers. Electron. J. Comb. 20(3): 32 (2013) - [c35]Amin Coja-Oghlan, Dan Vilenchik:
Chasing the K-Colorability Threshold. FOCS 2013: 380-389 - [c34]Amin Coja-Oghlan, Konstantinos Panagiotou:
Going after the k-SAT threshold. STOC 2013: 705-714 - [i14]Amin Coja-Oghlan, Dan Vilenchik:
Chasing the k-colorability threshold. CoRR abs/1304.1063 (2013) - [i13]Amin Coja-Oghlan:
Upper-bounding the k-colorability threshold by counting covers. CoRR abs/1305.0177 (2013) - [i12]Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman:
Contagious Sets in Expanders. CoRR abs/1306.2465 (2013) - [i11]Amin Coja-Oghlan:
Random regular k-SAT. CoRR abs/1310.2728 (2013) - 2012
- [j30]Amin Coja-Oghlan, Mikael Onsjö, Osamu Watanabe:
Propagation Connectivity of Random Hypergraphs. Electron. J. Comb. 19(1): 17 (2012) - [j29]Amin Coja-Oghlan, Angélica Y. Pachón-Pinzon:
The Decimation Process in Random k-SAT. SIAM J. Discret. Math. 26(4): 1471-1509 (2012) - [c33]Amin Coja-Oghlan, Alan M. Frieze:
Analyzing Walksat on Random Formulas. ANALCO 2012: 48-55 - [c32]Amin Coja-Oghlan, Lenka Zdeborová:
The condensation transition in random hypergraph 2-coloring. SODA 2012: 241-250 - [c31]Amin Coja-Oghlan, Konstantinos Panagiotou:
Catching the k-NAESAT threshold. STOC 2012: 899-908 - [i10]Amin Coja-Oghlan, Konstantinos Panagiotou:
Going after the k-SAT Threshold. CoRR abs/1212.1682 (2012) - 2011
- [j28]Dimitris Achlioptas, Amin Coja-Oghlan, Federico Ricci-Tersenghi:
On the solution-space geometry of random constraint satisfaction problems. Random Struct. Algorithms 38(3): 251-268 (2011) - [c30]Amin Coja-Oghlan, Angélica Y. Pachón-Pinzon:
The Decimation Process in Random k-SAT. ICALP (1) 2011: 305-316 - [c29]Amin Coja-Oghlan, Charilaos Efthymiou:
On independent sets in random graphs. SODA 2011: 136-144 - [c28]Amin Coja-Oghlan:
On Belief Propagation Guided Decimation for Random k-SAT. SODA 2011: 957-966 - [p2]Michael Behrisch, Amin Coja-Oghlan, Peter Liske:
Eulerian Circuits. Algorithms Unplugged 2011: 277-283 - [i9]Amin Coja-Oghlan, Angélica Y. Pachón-Pinzon:
The decimation process in random k-SAT. CoRR abs/1102.3145 (2011) - [i8]Amin Coja-Oghlan, Alan M. Frieze:
Analyzing Walksat on random formulas. CoRR abs/1106.0120 (2011) - [i7]Amin Coja-Oghlan, Konstantinos Panagiotou:
Catching the k-NAESAT Threshold. CoRR abs/1111.1274 (2011) - 2010
- [j27]Amin Coja-Oghlan:
Graph Partitioning via Adaptive Spectral Techniques. Comb. Probab. Comput. 19(2): 227-284 (2010) - [j26]Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik:
Why Almost All k-Colorable Graphs Are Easy to Color. Theory Comput. Syst. 46(3): 523-565 (2010) - [j25]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
The order of the giant component of random hypergraphs. Random Struct. Algorithms 36(2): 149-184 (2010) - [j24]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. 39(6): 2336-2362 (2010) - [j23]Amin Coja-Oghlan:
A Better Algorithm for Random k-SAT. SIAM J. Comput. 39(7): 2823-2864 (2010) - [j22]Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze:
An Efficient Sparse Regularity Concept. SIAM J. Discret. Math. 23(4): 2000-2034 (2010) - [c27]Amin Coja-Oghlan, Mikael Onsjö, Osamu Watanabe:
Propagation Connectivity of Random Hypergraphs. APPROX-RANDOM 2010: 490-503 - [i6]Amin Coja-Oghlan:
On belief propagation guided decimation for random k-SAT. CoRR abs/1007.1328 (2010) - [i5]Amin Coja-Oghlan, Charilaos Efthymiou:
On independent sets in random graphs. CoRR abs/1007.1378 (2010)
2000 – 2009
- 2009
- [j21]Amin Coja-Oghlan, André Lanka:
The Spectral Gap of Random Graphs with Given Expected Degrees. Electron. J. Comb. 16(1) (2009) - [j20]Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik:
A Spectral Approach to Analysing Belief Propagation for 3-Colouring. Comb. Probab. Comput. 18(6): 881-912 (2009) - [j19]Amin Coja-Oghlan, Mihyun Kang:
The evolution of the min-min random graph process. Discret. Math. 309(13): 4527-4544 (2009) - [j18]Amin Coja-Oghlan, André Lanka:
Finding Planted Partitions in Random Graphs with General Degree Distributions. SIAM J. Discret. Math. 23(4): 1682-1714 (2009) - [c26]Amin Coja-Oghlan:
A Better Algorithm for Random k-SAT. ICALP (1) 2009: 292-303 - [c25]Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze:
An efficient sparse regularity concept. SODA 2009: 207-216 - [c24]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 - [c23]Amin Coja-Oghlan:
Random Constraint Satisfaction Problems. DCM 2009: 32-37 - 2008
- [j17]Amin Coja-Oghlan, Alan M. Frieze:
Random k-SAT: The Limiting Probability for Satisfiability for Moderately Growing k. Electron. J. Comb. 15(1) (2008) - [j16]Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger:
On the chromatic number of random graphs. J. Comb. Theory B 98(5): 980-993 (2008) - [c22]Dimitris Achlioptas, Amin Coja-Oghlan:
Algorithmic Barriers from Phase Transitions. FOCS 2008: 793-802 - [c21]Amin Coja-Oghlan, André Lanka:
Partitioning Random Graphs with General Degree Distributions. IFIP TCS 2008: 127-141 - [p1]Michael Behrisch, Amin Coja-Oghlan, Peter Liske:
Die Eulertour. Taschenbuch der Algorithmen 2008: 295-301 - 2007
- [j15]Amin Coja-Oghlan, Andreas Goerdt, André Lanka:
Strong Refutation Heuristics for Random k-SAT. Comb. Probab. Comput. 16(1): 5-28 (2007) - [j14]Amin Coja-Oghlan:
Colouring Semirandom Graphs. Comb. Probab. Comput. 16(4): 515-552 (2007) - [j13]Amin Coja-Oghlan:
On the Laplacian Eigenvalues of Gn, p. Comb. Probab. Comput. 16(6): 923-946 (2007) - [j12]Amin Coja-Oghlan:
Solving NP-hard semirandom graph problems in polynomial expected time. J. Algorithms 62(1): 19-46 (2007) - [j11]Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani:
Counting connected graphs and hypergraphs via the probabilistic method. Random Struct. Algorithms 31(3): 288-329 (2007) - [c20]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
Local Limit Theorems for the Giant Component of Random Hypergraphs. APPROX-RANDOM 2007: 341-352 - [c19]Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger:
On the Chromatic Number of Random Graphs. ICALP 2007: 777-788 - [c18]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 - [c17]Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuheng Zhou:
Separating Populations with Wide Data: A Spectral Analysis. ISAAC 2007: 439-451 - [c16]Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik:
Why Almost All k -Colorable Graphs Are Easy. STACS 2007: 121-132 - [i4]Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik:
A Spectral Approach to Analyzing Belief Propagation for 3-Coloring. CoRR abs/0712.0171 (2007) - 2006
- [j10]Amin Coja-Oghlan:
Finding Large Independent Sets in Polynomial Expected Time. Comb. Probab. Comput. 15(5): 731-751 (2006) - [j9]Amin Coja-Oghlan, Lars Kuhtz:
An improved algorithm for approximating the chromatic number of Gn, p. Inf. Process. Lett. 99(6): 234-238 (2006) - [j8]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) - [j7]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) - [j6]Amin Coja-Oghlan:
A spectral heuristic for bisecting random graphs. Random Struct. Algorithms 29(3): 351-398 (2006) - [c15]Amin Coja-Oghlan, André Lanka:
The Spectral Gap of Random Graphs with Given Expected Degrees. ICALP (1) 2006: 15-26 - [c14]Amin Coja-Oghlan:
An Adaptive Spectral Heuristic for Partitioning Random Graphs. ICALP (1) 2006: 691-702 - [c13]Amin Coja-Oghlan, Andreas Goerdt, André Lanka:
Spectral Partitioning of Random Graphs with Given Expected Degrees. IFIP TCS 2006: 271-282 - [i3]Amin Coja-Oghlan:
Graph partitioning via adaptive spectral techniques. Electron. Colloquium Comput. Complex. TR06: Article TR06-116 (2006) - 2005
- [j5]Amin Coja-Oghlan:
The Lovász Number of Random Graphs. Comb. Probab. Comput. 14(4): 439-465 (2005) - [j4]Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff:
A Hard Dial-a-Ride Problem that is Easy on Average. J. Sched. 8(3): 197-210 (2005) - [c12]Amin Coja-Oghlan:
A spectral heuristic for bisecting random graphs. SODA 2005: 850-859 - 2004
- [j3]Amin Coja-Oghlan, Anusch Taraz:
Exact and approximative algorithms for coloring G(n, p). Random Struct. Algorithms 24(3): 259-278 (2004) - [j2]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) - [c11]Amin Coja-Oghlan, Andreas Goerdt, André Lanka:
Strong Refutation Heuristics for Random k-SAT. APPROX-RANDOM 2004: 310-321 - [c10]Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani:
Counting Connected Graphs and Hypergraphs via the Probabilistic Method. APPROX-RANDOM 2004: 322-333 - [c9]Amin Coja-Oghlan:
Coloring Semirandom Graphs Optimally. ICALP 2004: 383-395 - 2003
- [j1]Amin Coja-Oghlan, Mark-Oliver Stehr:
Revisiting the Algebra of Petri Net Processes under the Collective Token Philosophy. Fundam. Informaticae 54(2-3): 151-164 (2003) - [c8]Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich:
Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. FCT 2003: 15-26 - [c7]Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani:
MAX k-CUT and Approximating the Chromatic Number of Random Graphs. ICALP 2003: 200-211 - [c6]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 - [c5]Amin Coja-Oghlan:
The Lovász Number of Random Graphs. RANDOM-APPROX 2003: 228-239 - [c4]Amin Coja-Oghlan, Anusch Taraz:
Colouring Random Graphs in Expected Polynomial Time. STACS 2003: 487-498 - [c3]Amin Coja-Oghlan:
Finding Large Independent Sets in Polynomial Expected Time. STACS 2003: 511-522 - [i2]Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich:
Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques. Electron. Colloquium Comput. Complex. TR03: Article TR03-030 (2003) - [i1]Amin Coja-Oghlan:
The Lovasz number of random graph. Electron. Colloquium Comput. Complex. TR03: Article TR03-073 (2003) - 2002
- [b1]Amin Coja-Oghlan:
Varianz und Erwartungswert in Operatoralgebren. Berichte aus der Informatik, Shaker 2002, ISBN 978-3-8265-9760-2 - [c2]Amin Coja-Oghlan:
Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming. MFCS 2002: 201-211 - [c1]Amin Coja-Oghlan:
Finding Sparse Induced Subgraphs of Semirandom Graphs. RANDOM 2002: 139-148
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-02-03 23:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
