On the public citation graph
Finding minimum areak-gons
0 signed · 84 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/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01840359openalex-snapshot
Geometric applications of a matrix-searching algorithm
inferredcites →https://doi.org/10.1016/0196-6774(91)90022-qopenalex-snapshot
Finding k points with minimum diameter and related problems
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1145/12130.12171openalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1145/323233.323255openalex-snapshot
Computing the largest empty convex subset of a set of points
inferredcites →https://doi.org/10.1145/73393.73416openalex-snapshot
Searching for empty convex polygons
inferredcites →https://doi.org/10.1145/73833.73865openalex-snapshot
Fining k points with minimum spanning trees and related problems
inferredcites →https://doi.org/10.1287/opre.30.5.1009openalex-snapshot
Technical Note—Reducing Space Requirements for Shortest Path Problems
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
inferredcites →https://doi.org/10.4153/cmb-1983-077-8openalex-snapshot
Sets with No Empty Convex 7-Gons
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_23openalex-snapshot
Smallest Color-Spanning Objects
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_19openalex-snapshot
Finding maximum convex polygons
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_20openalex-snapshot
Approximations with axis-aligned rectangles (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_5openalex-snapshot
On Computing New Classes of Optimal Triangulations with Angular Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-85906-0_36openalex-snapshot
An Approximation Algorithm for the k-Connected Location Set Cover Problem with Color-Spanning Constraint
inferred← citeshttps://doi.org/10.1007/978-3-030-86976-2_3openalex-snapshot
Solving the Coarseness Problem by ILP Using Column Generation
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_17openalex-snapshot
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
inferred← citeshttps://doi.org/10.1007/978-3-031-09076-9_33openalex-snapshot
Finding Optimal Paths of All Lengths in Directed Grid Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_14openalex-snapshot
An Approximation Algorithm for the Smallest Color-Spanning Circle Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_24openalex-snapshot
Convex Polygons in Geometric Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-319-30139-6_14openalex-snapshot
Covering Points with Convex Sets of Minimum Size
inferred← citeshttps://doi.org/10.1007/978-3-319-78825-8_3openalex-snapshot
Extremal Kernelization: A Commemorative Paper
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_19openalex-snapshot
Minimum Convex Partitions and Maximum Empty Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_67openalex-snapshot
On the Most Likely Convex Hull of Uncertain Points
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_43openalex-snapshot
Containment and Evasion in Stochastic Point Data
inferred← citeshttps://doi.org/10.1007/bf01193574openalex-snapshot
Stacks, queues, and deques with order-statistic operations
inferred← citeshttps://doi.org/10.1007/bf02574012openalex-snapshot
Iterated nearest neighbors and finding minimal polytopes
inferred← citeshttps://doi.org/10.1007/pl00009320openalex-snapshot
A Large Subgraph of the Minimum Weight Triangulation
inferred← citeshttps://doi.org/10.1007/pl00009492openalex-snapshot
On Simple Polygonalizations with Optimal Area
inferred← citeshttps://doi.org/10.1007/s00373-022-02559-yopenalex-snapshot
On Rainbow Quadrilaterals in Colored Point Sets
inferred← citeshttps://doi.org/10.1007/s00453-022-01002-1openalex-snapshot
Empty Squares in Arbitrary Orientation Among Points
inferred← citeshttps://doi.org/10.1007/s00454-019-00147-1openalex-snapshot
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices
inferred← citeshttps://doi.org/10.1007/s10707-020-00416-9openalex-snapshot
Size constrained k simple polygons
inferred← citeshttps://doi.org/10.1007/s10878-018-0281-yopenalex-snapshot
Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
inferred← citeshttps://doi.org/10.1007/s11424-024-3366-yopenalex-snapshot
Global Optimization for Heilbronn Problem of Convex Polygons Based on Bilinear Matrix Inequalities Solving
inferred← citeshttps://doi.org/10.1007/s11749-023-00889-4openalex-snapshot
Statistical analysis of measures of non-convexity
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90237-copenalex-snapshot
Counting k-subsets and convex k-gons in the plane
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00130-5openalex-snapshot
Counting convex polygons in planar point sets
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00035-6openalex-snapshot
Sequential and parallel algorithms for finding a maximum convex polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101742openalex-snapshot
Largest and smallest area triangles on imprecise points
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101844openalex-snapshot
Extremal convex polygons inscribed in a given convex polygon
inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.017openalex-snapshot
An algorithm to find maximum area polygons circumscribed about a convex polygon
inferred← citeshttps://doi.org/10.1016/j.jda.2008.12.002openalex-snapshot
Algorithms for optimal outlier removal
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.038openalex-snapshot
The approximation algorithms for a class of multiple-choice problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.014openalex-snapshot
Covering points with convex sets of minimum size
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115583openalex-snapshot
On k -enclosing slab problems
inferred← citeshttps://doi.org/10.1016/s0167-6377(97)00051-5openalex-snapshot
Finding minimum area simple pentagons
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00016-xopenalex-snapshot
LMT-skeleton heuristics for several new classes of optimal triangulations☆☆This research is supported by the Grant-in-Aid of Ministry of Education, Science, Sports and Culture, of Japan, Grant-in-Aid for Scientific Research(C), 08680377, 1997, and Grant-in-Aid for Scientific Research(B), 10205214,…
inferred← citeshttps://doi.org/10.1017/9781108539180openalex-snapshot
Forbidden Configurations in Discrete Geometry
inferred← citeshttps://doi.org/10.1017/s0963548317000141openalex-snapshot
Convex Polygons in Geometric Triangulations
inferred← citeshttps://doi.org/10.1093/comjnl/bxv124openalex-snapshot
Area and Perimeter of the Convex Hull of Stochastic Points
inferred← citeshttps://doi.org/10.1109/3dv53792.2021.00023openalex-snapshot
Algebraic Constraint for Preserving Convexity of Planar Homography
inferred← citeshttps://doi.org/10.1109/cvpr.2018.00650openalex-snapshot
Illuminant Spectra-Based Source Separation Using Flash Photography
inferred← citeshttps://doi.org/10.1109/icectech.2011.5941660openalex-snapshot
Classical knapsack to geometric knapsack: A journey
inferred← citeshttps://doi.org/10.1109/iv.2011.88openalex-snapshot
Generating a Simple Polygonalizations
inferred← citeshttps://doi.org/10.1109/tcbb.2007.70260openalex-snapshot
Computing Phylogenetic Diversity for Split Systems
inferred← citeshttps://doi.org/10.1109/tip.2019.2954218openalex-snapshot
Arbitrarily Shaped Scene Text Detection With a Mask Tightness Text Detector
inferred← citeshttps://doi.org/10.1109/tmi.2021.3077913openalex-snapshot
Contralaterally Enhanced Networks for Thoracic Disease Detection
inferred← citeshttps://doi.org/10.1142/s0218195913600091openalex-snapshot
THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
inferred← citeshttps://doi.org/10.1142/s0218195922410035openalex-snapshot
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
inferred← citeshttps://doi.org/10.1145/1247069.1247084openalex-snapshot
Happy endings for flip graphs
inferred← citeshttps://doi.org/10.1145/160985.161016openalex-snapshot
Area optimization of simple polygons
inferred← citeshttps://doi.org/10.1145/2261250.2261257openalex-snapshot
The point-set embeddability problem for plane graphs
inferred← citeshttps://doi.org/10.1145/237218.237364openalex-snapshot
A (usually?) connected subgraph of the minimum weight triangulation
inferred← citeshttps://doi.org/10.1145/276884.276919openalex-snapshot
Resource-constrained geometric network optimization
inferred← citeshttps://doi.org/10.1145/2896849openalex-snapshot
An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets
inferred← citeshttps://doi.org/10.1214/aos/1013203456openalex-snapshot
Smallest nonparametric tolerance regions
inferred← citeshttps://doi.org/10.15649/2346075x.773openalex-snapshot
Designing a metaheuristic mining algorithm to separate two-color points in a two-dimensional environment
inferred← citeshttps://doi.org/10.24200/sci.2024.64287.8852openalex-snapshot
On the Maximum Triangle Problem
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2018.52openalex-snapshot
Convex Partial Transversals of Planar Regions
inferred← citeshttps://doi.org/10.47749/t/unicamp.2022.1254700openalex-snapshot
Geometric decomposition problems
inferred← citeshttps://doi.org/10.48550/arxiv.1112.1124openalex-snapshot
Minimum Convex Partitions and Maximum Empty Polytopes
inferred← citeshttps://doi.org/10.48550/arxiv.2103.01660openalex-snapshot
On Optimal $w$-gons in Convex Polygons
inferred← citeshttps://doi.org/10.5555/313559.313612openalex-snapshot
Iterated nearest neighbors and finding minimal polytypes
inferred← citeshttps://doi.org/10.7155/jgaa.00488openalex-snapshot
Finding a Maximum-Weight Convex Set in a Chordal Graph
showing the first 70 of 71 · page through all 71
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.