New directions and new challenges in algorithm design and complexity, parameterized

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

Volumn 2748, Issue , 2003, Pages 505-519

  Fellows, Michael R ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ALGORITHM DESIGN; PARAMETERIZED; PARAMETERIZED COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 35248882039     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45078-8_44     Document Type: Article

References (51)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela and M. Protasi. Complexity and Approximation. Springer-Verlag, 1999.
2. J. Alber, M. Fellows and R. Niedermeier. "Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case." Proceedings of Scandinavian Workshop on Algorithms and Theory (SWAT 2002), Springer-Verlag, Lecture Notes in Computer Science 2368 (2002), 150-159.
3. F. Abu-Khzam, M. Fellows, M. Langsten and F. Rosamond. "Bounded Vertex Cover Structure and the Design of FPT Algorithms." Manuscript, 2003.
4. F. Abu-Khzam, M. A. Langsten, P. Shanbhag and C. T. Symons. "High Performance Tools for Fixed-Parameter Tractable Implementations." WADS'03 Workshop Presentation, 2003.
5. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Prof verification and intractability of optimization problems. Proceedings of the IEEE Symposium on the Foundations of Computer Science (1992).
6. 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 (1996), 2-12.
7. 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 (1997), 554-563.
8. N. Alon, R. Yuster and U. Zwick. "Color-coding." Journal of the ACM 42 (1995), 844-856.
9. C. Bazgan, "Schemas d'approximation et complexité paramétrée." Rapport de stage de DEA d'Informatique à Orsay, 1995.
10. P.S. Bonsma, T. Brüggemann and G.J. Woeginger. A faster FPT algorithm for finding spanning trees with many leaves. Manuscript, 2003.
11. H. L. Bodlaender. "On Linear Time Minor Tests and Depth-First Search." Journal of Algorithms 14 (1993), 1-23.
12. H. L. Bodlaender. "A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth." SIAM Journal on Computing 25 (1996), 1305-1317.
13. L. Cai, J. Chen, R. Downey and M. Fellows. "On the Parameterized Complexity of Short Computation and Factorization." Archive for Mathematical Logic 36 (1997), 321-337.
14. Liming Cai, M. Fellows, D. Juedes and F. Rosamond, "Efficient Polynomial-Time Approximation Schemes for Problems on Planar Structures: Upper and Lower Bounds." Manuscript, 2001.
15. L. Cai and D. Juedes. "On the Existence of Subexponential Parameterized Algorithms," manuscript, 2001.
16. Revised version of the paper, "Subexponential Parameterized Algorithms Collapse the W-Hierarchy," in: Proceedings 28th ICALP, Springer-Verlag LNCS 2076 (2001), 273-284. (The conference version contains some major flaws.)
17. 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.
18. J. Chen, I. A. Kanj and W. Jia. "Vertex Cover: Further Observations and Further Improvements." Journal of Algorithms 41 (2001), 280-301.
19. 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 (1999), 418-427.
20. M. Cesati and L. Trevisan. "On the Efficiency of Polynomial Time Approximation Schemes." Information Processing Letters 64 (1997), 165-171.
21. 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." Electronic Notes in Theoretical Computer Science 78 (2003), 205-218.
22. R. G. Downey and M. R. Fellows. "Parameterized Computational Feasibility." In: P. Clote and J. Remmel (eds.), Feasible Mathematics II. Birkhauser, Boston (1995), 219-244.
23. R. G. Downey and M. R. Fellows. "Fixed Parameter Tractability and Completeness II: Completeness for W[1]." Theoretical Computer Science A 141 (1995), 109-131.
24. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
25. R. Downey, M. Fellows, E. Prieto-Rodriguez and F. Rosamond. "Fixed-parameter Tractability and Completeness V: Parametric Miniatures." Manuscript, 2003.
26. R. Downey, M. Fellows and U. Stege. "Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability." In: Contemporary Trends in Discrete Mathematics, (R. Graham, J. Kratochvíl, J. Nestríl and F. Roberts, eds.), Proceedings of the DIMACS-DIMATIA Workshop, Prague, 1997, AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49 (1999), 49-99.
27. R. Downey. "Parameterized Complexity for the Skeptic." Proceedings of the IEEE Computational Complexity Conference (CCC'03), IEEE Press (2003), to appear.
28. F. Dehne, A. Rau-Chaplin, U. Stege and P. Taillon. "Solving Large FPT Problems on Coarse Grained Parallel Machines." Manuscript, 2002.
29. E.A. Emerson and C.S. Jutla. "Tree Automata, μ-Calculus and Determinacy." Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS'91), IEEE Press (1991), 368-377.
30. T. Erlebach, K. Jansen and E. Seidel. "Polynomial Time Approximation Schemes for Geometric Graphs." Proc. ACM Symposium on Discrete Algorithms (SODA'01), ACM Press (2001), 671-679.
31. M. Fellows, J. Gramm and R. Niedermeier. "On the Parameterized Intractability of Motif Search Problems." Manuscript, 2003.
32. M.R. Fellows and M.A. Langston. "On Well-Partial-Order Theory and its Applications to Combinatorial Problems of VLSI Design." SIAM Journal on Discrete Mathematics 5, 117-126.
33. M. Fellows, C. McCartin, F. Rosamond and U. Stege. "Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems." Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'2000), Springer, Lecture Notes in Computer Science 1974 (2000), 240-251.
34. O. Goldschmidt and D.S. Hochbaum. "A Polynomial Algorithm for the k-Cut Problem." Proc. 29th Annual Symp. on the Foundations of Computer Science (FOCS) (1988), 444-451.
35. O. Goldschmidt and D.S. Hochbaum. "A Polynomial Algorithm for the k-Cut Problem for Fixed k." Mathematics of Operations Research 19 (1994), 24-37.
36. G. Gottlob, N. Leone and F. Scarcello. "Hypertree Decompositions and Tratable Queries." In Proceedings of the 18th ACM Symposium on Database Systems (1999), 21-32.
37. M. Grohe. "The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side." Manuscript, 2003.
38. G. Gottlob, F. Scarcello and M. Sideri. "Fixed Parameter Complexity in AI and Nonmonotonic Reasoning." To appear in The Artificial Intelligence Journal. Conference version in: Proc. of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LP-NMR'99), vol. 1730 of Lecture Notes in Artificial Intelligence (1999), 1-18.
39. M. Hallett. Presentation at the Annual Conference of the New Zealand Mathematics Research Institute, New Plymouth, January 2003.
40. S. Khanna and R. Motwani. "Towards a Syntactic Characterization of PTAS." In: Proc. STOC 1996, ACM Press (1996), 329-337.
41. S. Khot and V. Raman. "Parameterized Complexity of Finding Subgraphs with Hereditary properties." Proceedings of the Sixth Annual International Computing and Combinatorics Conference (COCOON 2000) July 2000, Sydney, Australia, Lecture Notes in Computer Science, Springer-Verlag 1858 (2000), 137-147.
42. D.R. Karger and C. Stein. "A New Approach to the Minimum Cut Problem." Journal of the ACM 43 (1996), 601-640.
43. H. W. Lenstra. "Integer Programming with a Fixed Number of Variables." Mathematics of Operations Research 8 (1983), 538-548.
44. E. Luks. "Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time." Journal of Computing and Systems Sciences 25 (1982), 42-65.
45. M. Mahajan and V. Raman. "Parameterizing Above Guaranteed Values: MaxSat and MaxCut." J. Algorithms 31 (1999), 335-354.
46. R. Niedermeier. "Invitation to Fixed-Parameter Algorithms." Habilitationschrift, University of Tübingen, 2002.
47. R. Niedermeier and P. Rossmanith. "Upper Bounds for Vertex Cover Further Improved." Proceedings 16th STACS, Springer-Verlag LNCS 1563 (1999), 561-570.
48. E. Prieto and C. Sloper. "Either/Or: Using Vertex Cover Structure in Designing FPT Algorithms - the Case of k-Internal Spanning Tree." In this volume.
49. N. Robertson and P. D. Seymour. "Graph Minors XIII. The Disjoint Paths Problem." Journal of Combinatorial Theory, Series B 63 (1995), 65-110.
50. R. Shamir and D. Tzur. "The Maximum Subforest Problem: Approximation and Exact Algorithms." Proc. ACM Symposium on Discrete Algorithms (SODA'98), ACM Press (1998), 394-399.
51. K. Weihe, "Covering Trains by Stations, or the Power of Data Reduction," Proc. ALEX'98 (1998), 1-8.