The SCEAS System
Navigation Menu

Conferences in DBLP

(acid)
2006 (conf/acid/2006)

  1. Jan Krajícek
    Proof Complexity Generators. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:3- [Conf]
  2. Alexander Schrijver
    New Code Bounds with Algebra and Semidefinite Programming. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:5- [Conf]
  3. Detlef Seese
    Trees, Grids and Matroids: Observations on Logical Ways to Avoid Complexity. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:7- [Conf]
  4. Berthold Vöcking
    Congestion Games: Optimization in Competition. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:9-20 [Conf]
  5. Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
    Kernelization for Convex Recoloring. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:23-35 [Conf]
  6. Matthias Brosemann, Jochen Alber, Falk Hüffner, Rolf Niedermeier
    Matrix Robustness, with an Application to Power System Observability. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:37-48 [Conf]
  7. Fouad B. Chedid
    Parameterized Enumerability for the Database Theorist. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:49-56 [Conf]
  8. Páidí J. Creed
    Sampling Eulerian Orientations of the Triangle. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:57-68 [Conf]
  9. Henning Fernau, David Manlove
    Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:69-84 [Conf]
  10. Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch
    Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:85-94 [Conf]
  11. Robert W. Irving, David Manlove, Gregg O'Malley
    Stable Marriage with Ties and Bounded Length Preference Lists. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:95-106 [Conf]
  12. Hannes Moser, Dimitrios M. Thilikos
    Parameterized Complexity of Finding Regular Induced Subgraphs. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:107-118 [Conf]
  13. Sofya Poger, Yoram J. Sussmann
    A Delta-Wye-Delta Reduction for Planar Grid Graphs in Subquadratic Time. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:119-130 [Conf]
  14. Igor Razgon
    A Faster Solving of the Maximum Independent Set Problem for Graphs with Maximal Degree 3. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:131-142 [Conf]
  15. Allan Scott
    Short Pursuit-Evasion. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:143-152 [Conf]
  16. Walid Ben-Ameur
    On the Maximum Cut Problem. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:154- [Conf]
  17. Luis Cereceda
    Finding Paths between Colourings. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:155- [Conf]
  18. Jan van den Heuvel
    On the Complexity of Ordered Colourings. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:156- [Conf]
  19. Andriy Kharechko
    Parametric Polynomial Time Perceptron Rescaling Algorithm. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:157- [Conf]
  20. Dániel Marx
    A Parameterized View on Matroid Optimization Problems. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:158- [Conf]
  21. Taoyang Wu
    Extremal Sequence Theory. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:159- [Conf]
  22. Vadim E. Zverovich
    The Computer System GRAPHOGRAPH. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:160- [Conf]
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