Independent sets and hitting sets of bicolored rectangular families
type: Item
instance of: scholarly article
title: Independent sets and hitting sets of bicolored rectangular families
author: Claudio Telha
author: José A. Soto
published in: Algorithmica
publication date: 2021-06-11T00:00:00Z
full work available at URL: https://arxiv.org/abs/1411.2311
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7357823
zbMATH Keywords: independent set
zbMATH Keywords: hitting set
zbMATH Keywords: axis-parallel rectangles
zbMATH Keywords: jump number
MaRDI profile type: Publication
OpenAlex ID: W3129762362
cites work: Q5501780
cites work: Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
cites work: Q4938791
cites work: Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
cites work: Q3974856
cites work: Graph Classes: A Survey
cites work: Covering Regions by Rectangles
cites work: Coloring and Maximum Independent Set of Rectangles
cites work: Q4633902
cites work: Approximation algorithms for maximum independent set of pseudo-disks
cites work: Q3890731
cites work: The strong perfect graph theorem
cites work: Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
cites work: Q4525268
cites work: Q3984738
cites work: Q3292914
cites work: Optimal packing and covering in the plane are NP-complete
cites work: Finding minimum generators of path systems
cites work: Q4263470
cites work: Minimal edge-coverings of pairs of sets
cites work: An algorithm for covering polygons with rectangles
cites work: A minimax theorem on intervals
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
cites work: Irredundant intervals
cites work: Iterative Methods in Combinatorial Optimization
cites work: A characterization of perfect graphs
cites work: A weighted min-max relation for intervals
cites work: Algorithms – ESA 2004
cites work: Alternating cycle-free matchings
cites work: On edge perfectness and classes of bipartite graphs
cites work: Q4152571
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: On orthogonal ray graphs
cites work: Jump Number of Two-Directional Orthogonal Ray Graphs
cites work: A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
cites work: Primal-dual approach for directed vertex connectivity augmentation and generalizations
cites work: Adding range restriction capability to dynamic data structures
DOI: 10.1007/S00453-021-00810-1
description: scientific article; zbMATH DE number 7357823