Independent sets and hitting sets of bicolored rectangular families
From MaRDI portal
Publication:2032357
DOI10.1007/s00453-021-00810-1OpenAlexW3129762362MaRDI QIDQ2032357
Publication date: 11 June 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.2311
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for maximum independent set of pseudo-disks
- On orthogonal ray graphs
- A minimax theorem on intervals
- The strong perfect graph theorem
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
- Optimal packing and covering in the plane are NP-complete
- A weighted min-max relation for intervals
- Finding minimum generators of path systems
- Alternating cycle-free matchings
- Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Minimal edge-coverings of pairs of sets
- On edge perfectness and classes of bipartite graphs
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
- A characterization of perfect graphs
- Jump Number of Two-Directional Orthogonal Ray Graphs
- Iterative Methods in Combinatorial Optimization
- Coloring and Maximum Independent Set of Rectangles
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- An algorithm for covering polygons with rectangles
- Adding range restriction capability to dynamic data structures
- Graph Classes: A Survey
- Covering Regions by Rectangles
- Primal-dual approach for directed vertex connectivity augmentation and generalizations
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
- Irredundant intervals
- Algorithms – ESA 2004
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
