On the public citation graph

Perfect Graphs and Orthogonally Convex Covers

https://doi.org/10.1137/0402033

0 signed · 52 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot

Algorithms in Combinatorial Geometry

inferredcites →https://doi.org/10.1007/bf01788689openalex-snapshot

Optimizing weakly triangulated graphs

inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot

The ellipsoid method and its consequences in combinatorial optimization

inferredcites →https://doi.org/10.1016/0095-8956(84)90039-xopenalex-snapshot

A minimax theorem on intervals

inferredcites →https://doi.org/10.1016/0095-8956(85)90050-4openalex-snapshot

Weakly triangulated graphs

inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50012-8openalex-snapshot

Minimum Decompositions of Polygonal Objects

inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot

Algorithmic Graph Theory and Perfect Graphs

inferredcites →https://doi.org/10.1016/s0019-9958(84)80012-1openalex-snapshot

An algorithm for covering polygons with rectangles

inferredcites →https://doi.org/10.1109/tit.1983.1056648openalex-snapshot

Some NP-hard polygon decomposition problems

inferredcites →https://doi.org/10.1137/0214056openalex-snapshot

Decomposing a Polygon into Simpler Components

inferredcites →https://doi.org/10.1137/0602026openalex-snapshot

Covering Regions with Squares

inferredcites →https://doi.org/10.1137/0602042openalex-snapshot

Covering Regions by Rectangles

inferredcites →https://doi.org/10.1137/0603027openalex-snapshot

A Class of Perfect Graphs

inferredcites →https://doi.org/10.1137/0603034openalex-snapshot

A Class of Perfect Graphs Associated with Planar Rectilinear Regions

inferredcites →https://doi.org/10.1137/0605018openalex-snapshot

It’s Hard to Color Antirectangles

inferredcites →https://doi.org/10.1145/800135.804396openalex-snapshot

Decomposing a polygon into its convex parts

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11427186_7openalex-snapshot

Rectangle Covers Revisited Computationally

inferred← citeshttps://doi.org/10.1007/3-540-45477-2_11openalex-snapshot

Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach

inferred← citeshttps://doi.org/10.1007/3-540-54891-2_21openalex-snapshot

A Generalization of staircase visibility

inferred← citeshttps://doi.org/10.1007/3-540-55488-2_26openalex-snapshot

Restricted orientation computational geometry

inferred← citeshttps://doi.org/10.1007/978-1-4613-3629-7_3openalex-snapshot

Two Geometric Optimization Problems

inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_15openalex-snapshot

Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem

inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_39openalex-snapshot

A Scheme for Computing Minimum Covers within Simple Regions

inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_41openalex-snapshot

Optimal Cover of Points by Disks in a Simple Polygon

inferred← citeshttps://doi.org/10.1007/bf01300371openalex-snapshot

Staircase visibility and computation of kernels

inferred← citeshttps://doi.org/10.1007/bf02523677openalex-snapshot

Complexities of efficient solutions of rectilinear polygon cover problems

inferred← citeshttps://doi.org/10.1007/s00453-010-9458-1openalex-snapshot

A Scheme for Computing Minimum Covers within Simple Regions

inferred← citeshttps://doi.org/10.1007/s00453-020-00769-5openalex-snapshot

On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth

inferred← citeshttps://doi.org/10.1007/s00454-005-1177-zopenalex-snapshot

On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane

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/0020-0190(94)00017-4openalex-snapshot

Polyominos and perfect graphs

inferred← citeshttps://doi.org/10.1016/0022-0000(90)90017-fopenalex-snapshot

Covering orthogonal polygons with star polygons: The perfect graph approach

inferred← citeshttps://doi.org/10.1016/0166-218x(91)90033-sopenalex-snapshot

An efficient algorithm for finding a two-pair, and its applications

inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0161-qopenalex-snapshot

Algorithms for weakly triangulated graphs

inferred← citeshttps://doi.org/10.1016/0304-3975(94)00195-oopenalex-snapshot

Efficient algorithms for shortest distance queries on special classes of polygons

inferred← citeshttps://doi.org/10.1016/0925-7721(93)90013-vopenalex-snapshot

Covering grids and orthogonal polygons with periscope guards

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50012-7openalex-snapshot

Polygon Decomposition

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot

Visibility in the Plane

inferred← citeshttps://doi.org/10.1016/j.cviu.2012.08.017openalex-snapshot

Approximate partitioning of 2D objects into orthogonally convex components

inferred← citeshttps://doi.org/10.1016/j.ejor.2019.02.004openalex-snapshot

Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms

inferred← citeshttps://doi.org/10.1016/j.ipl.2007.06.015openalex-snapshot

Note on covering monotone orthogonal polygons with star-shaped polygons

inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.09.002openalex-snapshot

Estimating all pairs shortest paths in restricted graph families: a unified approach

inferred← citeshttps://doi.org/10.1017/9781108592376.015openalex-snapshot

Covering geometric domains

inferred← citeshttps://doi.org/10.1109/5.163407openalex-snapshot

Recent results in art galleries (geometry)

inferred← citeshttps://doi.org/10.1137/0402027openalex-snapshot

Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles

inferred← citeshttps://doi.org/10.1137/100808459openalex-snapshot

Optimal Cover of Points by Disks in a Simple Polygon

inferred← citeshttps://doi.org/10.1142/s0218195900000048openalex-snapshot

POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER

inferred← citeshttps://doi.org/10.1142/s021819591250001xopenalex-snapshot

LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM

inferred← citeshttps://doi.org/10.1145/1187436.1216583openalex-snapshot

Rectangle covers revisited computationally

inferred← citeshttps://doi.org/10.1145/73393.73415openalex-snapshot

Covering orthogonal polygons with star polygons: the perfect graph approach

inferred← citeshttps://doi.org/10.48550/arxiv.1910.01193openalex-snapshot

Rectangle Blanket Problem: Binary integer linear programming formulation and solution algorithms

inferred← citeshttps://doi.org/10.5555/1115481.1712333openalex-snapshot

Estimating all pairs shortest paths in restricted graph families

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.