On the public citation graph
Complexities of efficient solutions of rectilinear polygon cover problems
0 signed · 40 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/0890-5401(92)90056-lopenalex-snapshot
On the complexity of approximating the independent set problem
inferredcites →https://doi.org/10.1016/s0019-9958(84)80012-1openalex-snapshot
An algorithm for covering polygons with rectangles
inferredcites →https://doi.org/10.1049/ip-i-1.1981.0010openalex-snapshot
Introduction to V.L.S.I. Systems
inferredcites →https://doi.org/10.1109/sfcs.1992.267823openalex-snapshot
Proof verification and hardness of approximation problems
inferredcites →https://doi.org/10.1109/tit.1983.1056648openalex-snapshot
Some NP-hard polygon decomposition problems
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0402027openalex-snapshot
Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
inferredcites →https://doi.org/10.1137/0402033openalex-snapshot
Perfect Graphs and Orthogonally Convex Covers
inferredcites →https://doi.org/10.3233/fi-1978-2114openalex-snapshot
On two-dimensional data organization I1
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.2001.1188openalex-snapshot
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
inferred← citeshttps://doi.org/10.1007/11427186_7openalex-snapshot
Rectangle Covers Revisited Computationally
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_44openalex-snapshot
A Geometric Approach to Boolean Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_44openalex-snapshot
Close approximations of minimum rectangular coverings
inferred← citeshttps://doi.org/10.1007/978-3-540-72914-3_19openalex-snapshot
Drawing Borders Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_5openalex-snapshot
Stabbing Convex Polygons with a Segment or a Polygon
inferred← citeshttps://doi.org/10.1007/s00224-008-9117-yopenalex-snapshot
Drawing Borders Efficiently
inferred← citeshttps://doi.org/10.1007/s00454-006-1273-8openalex-snapshot
Improved Approximation Algorithms for Geometric Set Cover
inferred← citeshttps://doi.org/10.1007/s10115-011-0420-6openalex-snapshot
Sleeved co-clustering of lagged data
inferred← citeshttps://doi.org/10.1007/s10288-022-00515-3openalex-snapshot
A hybrid heuristic for the rectilinear picture compression problem
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.04.001openalex-snapshot
Exact algorithms and APX-hardness results for geometric packing and covering problems
inferred← citeshttps://doi.org/10.1016/j.dam.2021.09.031openalex-snapshot
The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00203-4openalex-snapshot
Lower bounds for approximate polygon decomposition and minimum gap
inferred← citeshttps://doi.org/10.1023/a:1009833410742openalex-snapshot
On Some Polyhedra Covering Problems
inferred← citeshttps://doi.org/10.1109/dcc.2019.00022openalex-snapshot
BWT Tunnel Planning is Hard But Manageable
inferred← citeshttps://doi.org/10.1109/icdm.2006.163openalex-snapshot
Turning Clusters into Patterns: Rectangle-Based Discriminative Data Description
inferred← citeshttps://doi.org/10.1109/infcom.2013.6567005openalex-snapshot
A difference resolution approach to compressing Access Control Lists
inferred← citeshttps://doi.org/10.1109/tnet.2015.2397393openalex-snapshot
A Difference Resolution Approach to Compressing Access Control Lists
inferred← citeshttps://doi.org/10.1137/s0097539799358835openalex-snapshot
Covering Rectilinear Polygons with Axis-Parallel Rectangles
inferred← citeshttps://doi.org/10.1145/1187436.1216583openalex-snapshot
Rectangle covers revisited computationally
inferred← citeshttps://doi.org/10.1145/3551639openalex-snapshot
Dynamic Geometric Set Cover and Hitting Set
inferred← citeshttps://doi.org/10.26599/tst.2018.9010003openalex-snapshot
FPC: A new approach to firewall policies compression
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2021.3openalex-snapshot
Box Covers and Domain Orderings for Beyond Worst-Case Join Processing
inferred← citeshttps://doi.org/10.4230/lipics.socg.2020.2openalex-snapshot
Dynamic Geometric Set Cover and Hitting Set
inferred← citeshttps://doi.org/10.48550/arxiv.2106.12969openalex-snapshot
Approximability of (Simultaneous) Class Cover for Boxes
inferred← citeshttps://doi.org/10.5555/1283383.1283498openalex-snapshot
Compressing rectilinear pictures and minimizing access control lists
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.