The Parameterized Complexity of Stabbing Rectangles

This publication has 33 references indexed in Scilit:

• Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
  ACM Transactions on Algorithms, 2008
• Improved Approximation Algorithms for Geometric Set Cover
  Discrete & Computational Geometry, 2006
• SEPARATING POINTS BY AXIS-PARALLEL LINES
  International Journal of Computational Geometry & Applications, 2005
• Tight lower bounds for certain parameterized NP-hard problems
  Information and Computation, 2005
• On the Crossing Spanning Tree Problem
  Lecture Notes in Computer Science, 2004
• Cutting Up Is Hard To Do
  Electronic Notes in Theoretical Computer Science, 2003
• Parameterized Complexity
  1999
• Efficient algorithms for geometric optimization
  ACM Computing Surveys, 1998
• On Physical Mapping and the consecutive ones property for sparse matrices
  Discrete Applied Mathematics, 1996
• Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues
  Annals of Pure and Applied Logic, 1995