The computer journal special issue on parameterized complexity: Foreword by the guest editors

Computer Journal

Volumn 51, Issue 1, 2008, Pages 1-6

  Downey, Rodney G ^a   Fellows, Michael R ^b   Langston, Michael A ^c  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c UNIVERSITY OF TENNESSEE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38349052340     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxm111     Document Type: Editorial

References (20)

1. Arora, S. (1996) Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems. Proc. 37th IEEE Symp. Foundations of Computer Science, pp. 2-12. IEEE Computer Society Publications.
2. Arora, S. (1997) Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems. Proc. 38th Annual IEEE Symp. Foundations of Computing (FOCS'97), IEEE Press, 554-563.
3. Bodlaender, H.L., Downey, R., Fellows, M. and Hermelin, D. (2007) On problems without polynomial kernels. Manuscript.
4. Bodlaender, H.L. and van Dijk, T.C. (2007) A cubic kernel for feedback vertex set and loop cutset. Manuscript.
5. Cai, L. and Juedes, D. (2003) On the existence of subexponential parameterized algorithms. J. Comput. Syst. Sci. 64, 789-807.
6. Chen, J., Kanj, I. and Xia, G. (2006) Improved Parameterized Upper Bounds for Vertex Cover. Proc. 31st Int. Symp. Mathematical Foundations of Computer Science (MFCS'06), Lecture Notes in Computer Science, Vol. 4162, Springer, pp. 238-249.
7. Downey, R.G., Fellows, M.R. and McCartin, C. (2006) Parameterized Approximation Problems. Proc. IWPEC 2006, Lecture Notes in Computer Science, Vol. 4169, Springer, 121-129.
8. Fortnow, L. and Santhanam, R. Infeasibility of Instance Compression and Succinct PCP's for NP. Report 96, Electronic Colloquium on Computational Complexity, 2007.
9. Grohe, M. and Grüber, M. (2007) Parameterized Approximability of the Disjoint Cycle Problem. Proc. ICALP'07, Lecture Notes in Computer Science, 4596, Springer-Verlag, 363-374.
10. Goldschmidt, O. and Hochbaum, D. (1988) Polynomial Algorithm for the k-cut Problem. Proc. IEEE Symp. Foundations of Computer Science (FOCS'88), IEEE Press, 444-451.
11. Held, M. and Karp, R. (1962) A dynamic programming approach to sequencing problems. SIAM Journal, Vol. 10, pp. 196-210.
12. Henglein, F. and Mairson, H.G. (1991) The Complexity of Type Inference for Higher-Order Typed Lambda Calculi. Proc. Symp. Principles of Programming Languages (POPL), pp. 119-130. ACM Publications.
13. Impagliazzo, R., Paturi, R. and Zane, F. (1998) Which Problems Have Strongly Exponential Complexity? Proc. 39th Annual Symp. Foundations of Computer Science (FOCS'1998), pp. 653-663. IEEE Computer Society Publications.
14. Khuller, S., Bhatia, R. and Pless, R. (2003) Placement of meters in networks. SIAM J. Comput., 32, 470-487.
15. Lichtenstein, O. and Pneuli, A. (1985) Checking that Finite-State Concurrent Programs Satisfy Their Linear Specification. Proc. 12th ACM Symp. Principles of Programming Languages, pp. 97-107. ACM Publications.
16. Marx, D. (2005) The Closest Substring Problem with Small Distances. Proc. 46th Annual IEEE Symp. Foundations of Computer Science (FOCS'05 IEEE Computer Society Publications, pp. 63-72. IEEE Computer Society Publications.
17. Marx, D. (2006) Parameterized Complexity of Independence and Domination on Geometric Graphs. Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC 2006), Lecture Notes in Computer Science, Vol. 4169, Springer, 154-165.
18. Marx, D. Searching the k-change neighborhood for TSP is W[1]-hard. Oper. Res. Lett., to appear.
19. Weihe, K. (2001) On the Differences Between 'practical' and 'applied'. Proc. WAE 2000, Lecture Notes in Computer Science, Vol. 1982, Springer, 1-10.
20. Woeginger, G.J. (2003) Exact Algorithms for NP-hard Problems: A Survey. In Junger, M., Reinelt, G. and Rinaldi, G. (Festschrift eds) Proc. 5th Int. Workshop on Combinatorial Optimization-Eureka, You Shrink! Papers dedicated to Jack Edmonds, Lecture Notes in Computer Science, Vol. 2570, Springer, 184-207.