Some new directions and questions in parameterized complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3340, Issue , 2004, Pages 12-26

  Downey, Rodney G ^a   McCartin, Catherine ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b MASSEY UNIVERSITY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

'CURRENT; MODEL THEORY; ON-LINE MODELLING; PARAMETERIZED COMPLEXITY; ONLINE MODELING;

PARAMETERIZATION;

EID: 35048890145     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30550-7_2     Document Type: Article

References (41)

1. K. Abrahamson, R. Downey and M. Fellows: Fixed Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogs, Annals of Pure and Applied Logic, 73, pp.235-276, 1995.
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela and M. Protasi: Complexity and Approximation, Springer-Verlag, 1999.
3. M. Alekhnovich and A. Razborov: Resolution is Not Automatizable Unless W[P] is Tractable, Proc. of the 42nd IEEE FOCS, pp.210-219, 2001.
4. S. Arora: Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems, In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, pp. 2-12, 1996.
5. S. Arora: Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems, Proc. 38th Annual IEEE Symposium on the Foundations of Computing (FOCS' 97), IEEE Press, pp.554-563, 1997.
6. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy: Proof Verification and Intractability of Approximation Algorithms, Proceedings of the IEEE Symposium on the Foundations of Computer Science, 1992.
7. C. Bazgan: Schémas d'approximation et complexité paramétrée, Rapport de stage de DEA d'Informatique à Orsay, 1995.
8. Liming Gai and J. Chen: On Fixed-Parameter Tractability and Approximability of NP-Hard Optimization Problems, J. Computer and Systems Sciences 54, pp.465-474, 1997.
9. Liming Cai, M. Fellows, D. Juedes and F. Rosamond: Efficient Polynomial-Time Approximation Schemes for Problems on Planar Stru ctures: Upper and Lower Bounds, manuscript, 2001.
10. L. Cai and D. Juedes: On the existence of subexponential time parameterized algorithms, J. Comput. Sys. Sci., Vol. 67, pp.789-807, 2003.
11. C. Chekuri and S. Khanna: A PTAS for the Multiple Knapsack Problem, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 213-222, 2000.
12. J. Chen, I.A. Kanj and W. Jia: Vertex Cover: Further Observations and Further Improvements, Journal of Algorithms, 41, pp.280-301, 2001.
13. J. Chen, X. Huang, I. Kanj, and G. Xia: Polynomial time approximation schemes and parameterized complexity, in Mathematical Foundations of Computer Science, 29th Annual Meeting, 2004, (J. Faila, V. Koubek, and J. Kratochvil, eds.) Springer-Verlag Lecture Notes in Computer Science 3153, pp.500-512, 2004.
14. J. Chen and A. Miranda: A Polynomial-Time Approximation Scheme for General Multiprocessor Scheduling, Proc. ACM Symposium on Theory of Computing (STOC '99), ACM Press, pp. 418-427, 1999.
15. M. Chrobak and M. Slusarek: On some packing problems related to dynamic storage allogation, RARIO Inform. Theor. Appl., Vol. 22, pp.487-499, 1988.
16. R. Downey: Parameterized complexity for the skeptic, in Proceeding of the 18th Annual IEEE Conference on Comutational Complexity, 2003.
17. R. Downey, V. Estivill-Castro, M. Fellows, E. Prieto-Rodriguez and F. Rosamond: Cutting Up Is Hard To Do: the Parameterized Complexity of k-Cut and Related Problems, in Proc. Australian Theory Symposium, CATS, 2003.
18. R. G. Downey, M. R. Fellows: Parameterized Complexity, Springer-Verlag, 1999.
19. R. G. Downey, C.M. McCartin: Online Problems, Pathwidth, and Persistence, to appear in Proceedings of IWPEC 2004.
20. R. G. Downey, C.M. McCartin: Bounded Persistence Pathwidth, to appear.
21. T. Erlebach, K. Jansen and E. Seidel: Polynomial Time Approximation Schemes for Geometric Graphs, Proc. ACM Symposium on Discrete Algorithms (SODA'01), pp. 671-67, 2001.
22. M. Fellows: Parameterized complexity: the main ideas and connections to practical computing. In: R. Fleischer et al. (Eds.) Experimental Algorithmics, LNCS 2547, pp.51-77, 2002.
23. M. Fellows: Personal communication, March 2003.
24. J. Flum and M. Grohe: Parameterized complexity and subexponential time, to appear Bulletin EATCS.
25. 2 nondeterministic bits, to appear Journal of Comput. Sys. Sci.
26. M. Frick and M. Grohe: The Complexity of First-Order and Monadic Second-Order Logic Revisited, in LICS, pp.215-224, 2002.
27. J. Fouhy: Computational Experiments on Graph Width Metrics, MSc Thesis, Victoria University, Wellington, 2003.
28. M. Garey and D. Johnson: Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman, San Francisco, 1979.
29. R. Impagliazzo and R. Paturi: On the complexity of K-SAT, JCSS, 62(2), pp.367-375, March 2001.
30. R. Impagliazzo, R. Paturi and F. Zane: Which problems have strongly exponential complexity?, JCSS 63(4), pp.512-530, 2001.
31. S. Irani: Coloring Inductive Graphs On-Line, Algorithmica, vol.11, pp.53-72, 1994.
32. S. Khanna and R. Motwani: Towards a Syntactic Characterization of PTAS, in Proc. STOC 1996, ACM Press, pp.329-337, 1996.
33. H. A. Kierstead: The Linearity of First Fit Coloring of Interval Graphs, SIAM J. on Discrete MAth, Vol 1, No. 4, pp 526-530, 1988.
34. H. Kierstead and J. Qin: Colouring interval graphs with First-Fit, Discrete Math. Vol. 144, pp.47-57, 1995.
35. H. Kierstead and W. Trotter: The linearity of first-fit colouring of interval graphs, SIAM J. on Discrete Math., Vol. 1, pp.528-530, 1988.
36. C. McCartin: Contributions to Parameterized Complexity, PhD Thesis, Victoria University, Wellington, 2003.
37. R. Niedermeier: Ubiquitous parameterization: invitation to fized-parameter algorithms, in Mathematical Foundations of Computer Science, 29th Annual Meeting, 2004, (J. Faila, V. Koubek, and J. Kratochvil, eds.) Springer-Verlag Lecture Notes in Computer Science 3153, pp.84-103, 2004.
38. R. Niedermeier: Fixed Parameter Algorithms, Oxford University Press, in preparation.
39. S. Rubin: Automatic Structures, PhD Diss, Auckland University, 2004.
40. R. Shamir and D. Tzur: The Maximum Subforest Problem: Approximation and Exact Algorithms, Proc. ACM Symposium on Discrete Algorithms (SODA'98), ACM Press, pp.394-399, 1998.
41. U. Stege, Resolving Conflicts in Problems in Computational Biochemistry, Ph.D. dissertation, ETH, 2000.