The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants

doi 10.1007/978-3-540-69311-6_30
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

The Parameterized Complexity of the Shared Center Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2012English

The Parameterized Complexity of the Induced Matching Problem in Planar Graphs

English

The Complexity of Restricted Variants of the Stable Paths Problem

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2010English

Higher-Dimensional Orthogonal Range Reporting and Rectangle Stabbing in the Pointer Machine Model

2012English

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Parameterized Proof Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2011English

On the Space Complexity of Parameterized Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

The Complexity of Irredundant Sets Parameterized by Size

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2000English

The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy