On the public citation graph
Approximation algorithms for partitioning a rectangle with interior points
0 signed · 29 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.1007/bfb0036481openalex-snapshot
Heuristics for minimum edge length rectangular partitions of rectilinear figures
inferredcites →https://doi.org/10.1016/0020-0190(78)90062-5openalex-snapshot
Triangulating a simple polygon
inferredcites →https://doi.org/10.1016/0031-3203(81)90002-9openalex-snapshot
An efficient algorithm for decomposing a polygon into star-shaped polygons
inferredcites →https://doi.org/10.1109/dac.1982.1585541openalex-snapshot
The "PI" (Placement And Interconnect) System
inferredcites →https://doi.org/10.1145/10515.10526openalex-snapshot
Fast heuristics for minimum length rectangular partitions of polygons
inferredcites →https://doi.org/10.1145/323233.323269openalex-snapshot
Bounds for partitioning rectilinear polygons
inferredcites →https://doi.org/10.1145/800135.804396openalex-snapshot
Decomposing a polygon into its convex parts
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.1007/11533719_56openalex-snapshot
An Upper Bound on the Number of Rectangulations of a Point Set
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_42openalex-snapshot
The Flip Diameter of Rectangulations and Convex Subdivisions
inferred← citeshttps://doi.org/10.1007/s00453-002-0962-9openalex-snapshot
Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90013-2openalex-snapshot
On optimal guillotine partitions approximating optimal d-box partitions
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50012-7openalex-snapshot
Polygon Decomposition
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101965openalex-snapshot
Rectangular partitions of a rectilinear polygon
inferred← citeshttps://doi.org/10.1016/j.jcta.2005.10.003openalex-snapshot
On the number of rectangulations of a planar point set
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.035openalex-snapshot
Computing conforming partitions of orthogonal polygons with minimum stabbing number
inferred← citeshttps://doi.org/10.1109/12.956091openalex-snapshot
A proposal for a heterogeneous cluster ScaLAPACK (dense linear solvers)
inferred← citeshttps://doi.org/10.1109/71.963416openalex-snapshot
Matrix multiplication on heterogeneous platforms
inferred← citeshttps://doi.org/10.1109/empdp.2001.905056openalex-snapshot
Heterogeneous matrix-matrix multiplication or partitioning a square into rectangles: NP-completeness and approximation algorithms
inferred← citeshttps://doi.org/10.1109/glsv.1991.143947openalex-snapshot
On the generalized channel definition problem
inferred← citeshttps://doi.org/10.1142/9789812777430_0005openalex-snapshot
Static Data Allocation and Load Balancing Techniques for Heterogeneous Systems
inferred← citeshttps://doi.org/10.1142/s0218195900000280openalex-snapshot
EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING
inferred← citeshttps://doi.org/10.1145/234860.234865openalex-snapshot
Efficient decomposition of polygons into L-shapes with application to VLSI layouts
inferred← citeshttps://doi.org/10.1145/332357.332401openalex-snapshot
Classical floorplanning harmful?
inferred← citeshttps://doi.org/10.46298/dmtcs.646openalex-snapshot
The Flip Diameter of Rectangulations and Convex Subdivisions
inferred← citeshttps://doi.org/10.47749/t/unicamp.1997.118276openalex-snapshot
Partição retangular minima de um retangulo em programação linear inteira
inferred← citeshttps://doi.org/10.47749/t/unicamp.2001.222259openalex-snapshot
Partições retangulares otimas
inferred← citeshttps://doi.org/10.5555/982792.982904openalex-snapshot
On the number of rectangular partitions
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.