The SCEAS System
Navigation Menu

Conferences in DBLP

International Workshop on Parameterized and Exact Computation (iwpec)
2004 (conf/iwpec/2004)

  1. Peter Damaschke
    Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:1-12 [Conf]
  2. Rodney G. Downey, Catherine McCartin
    Online Problems, Pathwidth, and Persistence. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:13-24 [Conf]
  3. Robert Haas, Michael Hoffmann
    Chordless Paths Through Three Vertices. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:25-36 [Conf]
  4. Hans L. Bodlaender, Dimitrios M. Thilikos
    Computing Small Search Numbers in Linear Time. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:37-48 [Conf]
  5. Mark Weyer
    Bounded Fixed-Parameter Tractability: The Case 2poly(k). [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:49-60 [Conf]
  6. L. Sunil Chandran, Fabrizio Grandoni
    Refined Memorisation for Vertex Cover. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:61-70 [Conf]
  7. Dániel Marx
    Parameterized Graph Separation Problems. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:71-82 [Conf]
  8. Dániel Marx
    Parameterized Coloring Problems on Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:83-95 [Conf]
  9. Petr Hlinený, Detlef Seese
    On Decidability of MSO Theories of Representable Matroids. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:96-107 [Conf]
  10. Yijia Chen, Jörg Flum
    On Miniaturized Problems in Parameterized Complexity Theory. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:108-120 [Conf]
  11. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Smaller Kernels for Hitting Set Problems of Constant Arity. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:121-126 [Conf]
  12. Luke Mathieson, Elena Prieto, Peter Shaw
    Packing Edge Disjoint Triangles: A Parameterized View. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:127-137 [Conf]
  13. Elena Prieto, Christian Sloper
    Looking at the Stars. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:138-148 [Conf]
  14. Matthias Müller-Hannemann, Karsten Weihe
    Moving Policies in Cyclic Assembly-Line Scheduling. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:149-161 [Conf]
  15. Jiong Guo, Falk Hüffner, Rolf Niedermeier
    A Structural View on Parameterizing Problems: Distance from Triviality. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:162-173 [Conf]
  16. Jens Gramm, Till Nierhoff, Till Tantau
    Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:174-186 [Conf]
  17. Jonathan F. Buss, Tarique Islam
    Simplifying the Weft Hierarchy. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:187-199 [Conf]
  18. Michael Hoffmann, Yoshio Okamoto
    The Minimum Weight Triangulation Problem with Few Inner Points. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:200-212 [Conf]
  19. Faisal N. Abu-Khzam, Michael A. Langston
    A Direct Algorithm for the Parameterized Face Cover Problem. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:213-222 [Conf]
  20. Michael R. Fellows, Stefan Szeider, Graham Wrightson
    On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:223-234 [Conf]
  21. Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer
    Parameterized Algorithms for Feedback Vertex Set. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:235-247 [Conf]
  22. Sergey S. Fedin, Alexander S. Kulikov
    Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:248-259 [Conf]
  23. Venkatesh Raman, Saket Saurabh
    Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:260-270 [Conf]
  24. Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, Peter Shaw
    Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:271-280 [Conf]
  25. Gerhard J. Woeginger
    Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk). [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:281-290 [Conf]
  26. Michael A. Langston
    Practical FPT Implementations and Applications (Invited Talk). [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:291-292 [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