Algorithms – ESA 2005
From MaRDI portal
(Redirected from Publication:5475855)
Algorithms – ESA 2005 (scientific article; zbMATH DE number 5036493)
Algorithms – ESA 2005 (scientific article; zbMATH DE number 5036493)
Recommendations
Cited in
(48)- On the parameterized complexity of multiple-interval graph problems
- FO model checking on geometric graphs
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
- A unified model and algorithms for temporal map labeling
- Fractal dimension and lower bounds for geometric problems
- Exact multi-covering problems with geometric sets
- A tight analysis of geometric local search
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes
- The parameterized hardness of the \(k\)-center problem in transportation networks
- Dispersing and grouping points on planar segments
- On some matching problems under the color-spanning model
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- On the parameterized complexity of \(d\)-dimensional point set pattern matching
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- Computational complexity for the problem of optimal intersection of straight line segments by disks
- Safe approximation and its relation to kernelization
- Unique covering problems with geometric sets
- Consensus patterns (probably) has no EPTAS
- Linear-time approximation algorithms for unit disk graphs
- Fixed-parameter tractability and lower bounds for stabbing problems
- On approximating string selection problems with outliers
- Shifting strategy for geometric graphs without geometry
- Shifting coresets: obtaining linear-time approximations for unit disk graphs and other geometric intersection graphs
- Parameterized complexity of induced graph matching on claw-free graphs
- Twin-width II: small classes
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
- Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking
- Combinatorics of local search: an optimal 4-local Hall's theorem for planar graphs
- FO model checking of geometric graphs
- Optimality of geometric local search
- The parameterized hardness of the \(k\)-center problem in transportation networks
- scientific article; zbMATH DE number 7236474 (Why is no real title available?)
- scientific article; zbMATH DE number 7278055 (Why is no real title available?)
- Minimum vertex cover in rectangle graphs
- scientific article; zbMATH DE number 7053376 (Why is no real title available?)
- Parameterized complexity of geometric covering problems having conflicts
- Computing list homomorphisms in geometric intersection graphs
- Temporal interval cliques and independent sets
- Maximum bipartite subgraphs of geometric intersection graphs
- Hybrid k-clustering: blending k-median and k-center
- Approximating the maximum independent set of convex polygons with a bounded number of directions
- Fully dynamic maximum independent sets of disks in polylogarithmic update time
- Parameterized and approximation algorithms for coverings points with segments in the plane
- Hybrid k-clustering: blending k-median and k-center
- Parameterized approximation for maximum weight independent set of rectangles and segments
- Random-order online independent set of intervals and hyperrectangles
- Fully dynamic maximum independent sets of disks in polylogarithmic update time
- Approximation and parameterized algorithms for covering with disks of two types of radii
This page was built for publication: Algorithms – ESA 2005
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5475855)
