Algorithms – ESA 2005
From MaRDI portal
Publication:5475855
DOI10.1007/11561071zbMATH Open1162.68822OpenAlexW2501059503MaRDI QIDQ5475855FDOQ5475855
Authors: Dániel Marx 
Publication date: 27 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561071
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (40)
- Maximum bipartite subgraphs of geometric intersection graphs
- On approximating string selection problems with outliers
- Consensus patterns (probably) has no EPTAS
- Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs
- Minimum vertex cover in rectangle graphs
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking
- A tight analysis of geometric local search
- Title not available (Why is that?)
- Computing list homomorphisms in geometric intersection graphs
- A unified model and algorithms for temporal map labeling
- Dispersing and grouping points on planar segments
- Temporal interval cliques and independent sets
- FO model checking on geometric graphs
- On some matching problems under the color-spanning model
- Parameterized approximation algorithms for some location problems in graphs
- Shifting strategy for geometric graphs without geometry
- Fractal dimension and lower bounds for geometric problems
- On the parameterized complexity of multiple-interval graph problems
- Safe approximation and its relation to kernelization
- Parameterized complexity of geometric covering problems having conflicts
- Twin-width II: small classes
- Parameterized complexity of induced graph matching on claw-free graphs
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
- Unique covering problems with geometric sets
- Title not available (Why is that?)
- Fixed-parameter tractability and lower bounds for stabbing problems
- Exact multi-covering problems with geometric sets
- The Parameterized Hardness of the k-Center Problem in Transportation Networks
- Title not available (Why is that?)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- Linear-time approximation algorithms for unit disk graphs
- On the parameterized complexity of \(d\)-dimensional point set pattern matching
- Title not available (Why is that?)
- Computational complexity for the problem of optimal intersection of straight line segments by disks
- Title not available (Why is that?)
- The parameterized hardness of the \(k\)-center problem in transportation networks
- Title not available (Why is that?)
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)
