Search the dblp DataBase
Amin Coja-Oghlan :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Amin Coja-Oghlan , Andreas Goerdt , André Lanka Strong Refutation Heuristics for Random k-SAT. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:310-321 [Conf ] Amin Coja-Oghlan , Cristopher Moore , Vishal Sanwalani Counting Connected Graphs and Hypergraphs via the Probabilistic Method. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:322-333 [Conf ] Amin Coja-Oghlan , Andreas Goerdt , André Lanka , Frank Schädlich Certifying Unsatisfiability of Random 2k -SAT Formulas Using Approximation Techniques. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:15-26 [Conf ] Amin Coja-Oghlan Coloring Semirandom Graphs Optimally. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:383-395 [Conf ] Amin Coja-Oghlan An Adaptive Spectral Heuristic for Partitioning Random Graphs. [Citation Graph (0, 0)][DBLP ] ICALP (1), 2006, pp:691-702 [Conf ] Amin Coja-Oghlan , André Lanka The Spectral Gap of Random Graphs with Given Expected Degrees. [Citation Graph (0, 0)][DBLP ] ICALP (1), 2006, pp:15-26 [Conf ] Amin Coja-Oghlan , Cristopher Moore , Vishal Sanwalani MAX k-CUT and Approximating the Chromatic Number of Random Graphs. [Citation Graph (0, 0)][DBLP ] ICALP, 2003, pp:200-211 [Conf ] Amin Coja-Oghlan , Sven Oliver Krumke , Till Nierhoff A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact. [Citation Graph (0, 0)][DBLP ] ISAAC, 2003, pp:605-614 [Conf ] Amin Coja-Oghlan Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming. [Citation Graph (0, 0)][DBLP ] MFCS, 2002, pp:201-211 [Conf ] Amin Coja-Oghlan Finding Sparse Induced Subgraphs of Semirandom Graphs. [Citation Graph (0, 0)][DBLP ] RANDOM, 2002, pp:139-148 [Conf ] Amin Coja-Oghlan The Lovász Number of Random Graphs. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 2003, pp:228-239 [Conf ] Amin Coja-Oghlan A spectral heuristic for bisecting random graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2005, pp:850-859 [Conf ] Amin Coja-Oghlan Finding Large Independent Sets in Polynomial Expected Time. [Citation Graph (0, 0)][DBLP ] STACS, 2003, pp:511-522 [Conf ] Amin Coja-Oghlan , Anusch Taraz Colouring Random Graphs in Expected Polynomial Time. [Citation Graph (0, 0)][DBLP ] STACS, 2003, pp:487-498 [Conf ] Amin Coja-Oghlan , Michael Krivelevich , Dan Vilenchik Why Almost All k -Colorable Graphs Are Easy. [Citation Graph (0, 0)][DBLP ] STACS, 2007, pp:121-132 [Conf ] Amin Coja-Oghlan The Lovász Number of Random Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2005, v:14, n:4, pp:439-465 [Journal ] Amin Coja-Oghlan , Andreas Goerdt , André Lanka , Frank Schädlich Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:030, pp:- [Journal ] Amin Coja-Oghlan The Lovasz number of random graph [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:073, pp:- [Journal ] Amin Coja-Oghlan , Mark-Oliver Stehr Revisiting the Algebra of Petri Net Processes under the Collective Token Philosophy. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:54, n:2-3, pp:151-164 [Journal ] Amin Coja-Oghlan , Lars Kuhtz An improved algorithm for approximating the chromatic number of Gn, p . [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:99, n:6, pp:234-238 [Journal ] Amin Coja-Oghlan , Sven Oliver Krumke , Till Nierhoff A heuristic for the Stacker Crane Problem on trees which is almost surely exact. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2006, v:61, n:1, pp:1-19 [Journal ] Amin Coja-Oghlan Solving NP-hard semirandom graph problems in polynomial expected time. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2007, v:62, n:1, pp:19-46 [Journal ] Amin Coja-Oghlan A spectral heuristic for bisecting random graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2006, v:29, n:3, pp:351-398 [Journal ] Amin Coja-Oghlan , Cristopher Moore , Vishal Sanwalani MAX k -CUT and approximating the chromatic number of random graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2006, v:28, n:3, pp:289-322 [Journal ] Amin Coja-Oghlan , Anusch Taraz Exact and approximative algorithms for coloring G(n, p). [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2004, v:24, n:3, pp:259-278 [Journal ] Amin Coja-Oghlan , Sven Oliver Krumke , Till Nierhoff A Hard Dial-a-Ride Problem that is Easy on Average. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2005, v:8, n:3, pp:197-210 [Journal ] Amin Coja-Oghlan , Andreas Goerdt , André Lanka , Frank Schädlich Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:329, n:1-3, pp:1-45 [Journal ] Michael Behrisch , Amin Coja-Oghlan , Mihyun Kang Local Limit Theorems for the Giant Component of Random Hypergraphs. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2007, pp:341-352 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] ICALP, 2007, pp:789-800 [Conf ] Amin Coja-Oghlan , Konstantinos Panagiotou , Angelika Steger On the Chromatic Number of Random Graphs. [Citation Graph (0, 0)][DBLP ] ICALP, 2007, pp:777-788 [Conf ] Propagation Connectivity of Random Hypergraphs. [Citation Graph (, )][DBLP ] Algorithmic Barriers from Phase Transitions. [Citation Graph (, )][DBLP ] A Better Algorithm for Random k -SAT. [Citation Graph (, )][DBLP ] Spectral Partitioning of Random Graphs with Given Expected Degrees. [Citation Graph (, )][DBLP ] Partitioning Random Graphs with General Degree Distributions. [Citation Graph (, )][DBLP ] Separating Populations with Wide Data: A Spectral Analysis. [Citation Graph (, )][DBLP ] On smoothed k -CNF formulas and the Walksat algorithm. [Citation Graph (, )][DBLP ] An efficient sparse regularity concept. [Citation Graph (, )][DBLP ] A Spectral Approach to Analyzing Belief Propagation for 3-Coloring [Citation Graph (, )][DBLP ] Random Constraint Satisfaction Problems [Citation Graph (, )][DBLP ] On independent sets in random graphs [Citation Graph (, )][DBLP ] On belief propagation guided decimation for random k-SAT [Citation Graph (, )][DBLP ] Finding Large Independent Sets in Polynomial Expected Time. [Citation Graph (, )][DBLP ] Colouring Semirandom Graphs. [Citation Graph (, )][DBLP ] Strong Refutation Heuristics for Random k-SAT. [Citation Graph (, )][DBLP ] On the Laplacian Eigenvalues of Gn, p . [Citation Graph (, )][DBLP ] A Spectral Approach to Analysing Belief Propagation for 3-Colouring. [Citation Graph (, )][DBLP ] The evolution of the min-min random graph process. [Citation Graph (, )][DBLP ] Graph partitioning via adaptive spectral techniques. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.457secs