The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Amin Coja-Oghlan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. Amin Coja-Oghlan
    Coloring Semirandom Graphs Optimally. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:383-395 [Conf]
  5. Amin Coja-Oghlan
    An Adaptive Spectral Heuristic for Partitioning Random Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:691-702 [Conf]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. Amin Coja-Oghlan
    Finding Sparse Induced Subgraphs of Semirandom Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:139-148 [Conf]
  11. Amin Coja-Oghlan
    The Lovász Number of Random Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:228-239 [Conf]
  12. Amin Coja-Oghlan
    A spectral heuristic for bisecting random graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:850-859 [Conf]
  13. Amin Coja-Oghlan
    Finding Large Independent Sets in Polynomial Expected Time. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:511-522 [Conf]
  14. Amin Coja-Oghlan, Anusch Taraz
    Colouring Random Graphs in Expected Polynomial Time. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:487-498 [Conf]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. 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]

  31. Propagation Connectivity of Random Hypergraphs. [Citation Graph (, )][DBLP]


  32. Algorithmic Barriers from Phase Transitions. [Citation Graph (, )][DBLP]


  33. A Better Algorithm for Random k-SAT. [Citation Graph (, )][DBLP]


  34. Spectral Partitioning of Random Graphs with Given Expected Degrees. [Citation Graph (, )][DBLP]


  35. Partitioning Random Graphs with General Degree Distributions. [Citation Graph (, )][DBLP]


  36. Separating Populations with Wide Data: A Spectral Analysis. [Citation Graph (, )][DBLP]


  37. On smoothed k-CNF formulas and the Walksat algorithm. [Citation Graph (, )][DBLP]


  38. An efficient sparse regularity concept. [Citation Graph (, )][DBLP]


  39. A Spectral Approach to Analyzing Belief Propagation for 3-Coloring [Citation Graph (, )][DBLP]


  40. Random Constraint Satisfaction Problems [Citation Graph (, )][DBLP]


  41. On independent sets in random graphs [Citation Graph (, )][DBLP]


  42. On belief propagation guided decimation for random k-SAT [Citation Graph (, )][DBLP]


  43. Finding Large Independent Sets in Polynomial Expected Time. [Citation Graph (, )][DBLP]


  44. Colouring Semirandom Graphs. [Citation Graph (, )][DBLP]


  45. Strong Refutation Heuristics for Random k-SAT. [Citation Graph (, )][DBLP]


  46. On the Laplacian Eigenvalues of Gn, p. [Citation Graph (, )][DBLP]


  47. A Spectral Approach to Analysing Belief Propagation for 3-Colouring. [Citation Graph (, )][DBLP]


  48. The evolution of the min-min random graph process. [Citation Graph (, )][DBLP]


  49. Graph partitioning via adaptive spectral techniques. [Citation Graph (, )][DBLP]


Search in 0.060secs, Finished in 0.062secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002