On the public citation graph
Geometric knapsack problems
0 signed · 45 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.1002/net.3230190107openalex-snapshot
Optimal enclosing regions in planar graphs
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.1007/bf02187692openalex-snapshot
A polynomial solution for the potato-peeling problem
inferredcites →https://doi.org/10.1016/0012-365x(90)90147-aopenalex-snapshot
Covering convex sets with non-overlapping polygons
inferredcites →https://doi.org/10.1016/0020-0190(85)90015-8openalex-snapshot
The power of geometric duality revisited
inferredcites →https://doi.org/10.1016/0167-8655(93)90140-9openalex-snapshot
The complexity of computing minimum separating polygons
inferredcites →https://doi.org/10.1016/0196-6774(90)90010-copenalex-snapshot
Packing and covering the plane with translates of a convex polygon
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb22462.xopenalex-snapshot
Polyhedral Results for Antimatroidsa
inferredcites →https://doi.org/10.1137/0218035openalex-snapshot
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
inferredcites →https://doi.org/10.1137/0220055openalex-snapshot
An Output-Sensitive Algorithm for Computing Visibility Graphs
inferredcites →https://doi.org/10.1145/2455.214106openalex-snapshot
Approximation schemes for covering and packing problems in image processing and VLSI
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
inferredcites →https://doi.org/10.2307/2583458openalex-snapshot
Knapsack Problems: Algorithms and Computer Implementations
inferredcites →https://doi.org/10.4064/cm-17-1-103-110openalex-snapshot
Some packing and covering theorems
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-48686-0_47openalex-snapshot
A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation
inferred← citeshttps://doi.org/10.1007/s00224-013-9493-9openalex-snapshot
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing
inferred← citeshttps://doi.org/10.1007/s00453-007-9042-5openalex-snapshot
Delineating Boundaries for Imprecise Regions
inferred← citeshttps://doi.org/10.1007/s00454-019-00059-0openalex-snapshot
Minimum Perimeter-Sum Partitions in the Plane
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/s10878-014-9816-zopenalex-snapshot
Optimizing some constructions with bars: new geometric knapsack problems
inferred← citeshttps://doi.org/10.1007/s11042-026-21366-8openalex-snapshot
A combinatorial algorithm to compute the triangular convex skull of a digital object
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/j.comgeo.2009.01.004openalex-snapshot
Bounds for point recolouring in geometric graphs
inferred← citeshttps://doi.org/10.1109/icectech.2011.5941660openalex-snapshot
Classical knapsack to geometric knapsack: A journey
inferred← citeshttps://doi.org/10.1109/tnet.2019.2924471openalex-snapshot
RL-NSB: Reinforcement Learning-Based 5G Network Slice Broker
inferred← citeshttps://doi.org/10.1111/itor.13428openalex-snapshot
Exact and heuristic solutions for the prize‐collecting geometric enclosure problem
inferred← citeshttps://doi.org/10.1145/1137856.1137918openalex-snapshot
Splitting (complicated) surfaces is hard
inferred← citeshttps://doi.org/10.1145/220279.220318openalex-snapshot
Approximation algorithms for geometric tour and network design problems (extended abstract)
inferred← citeshttps://doi.org/10.1145/276884.276919openalex-snapshot
Resource-constrained geometric network optimization
inferred← citeshttps://doi.org/10.15607/rss.2012.viii.053openalex-snapshot
Efficiently finding optimal winding-constrained loops in the plane
inferred← citeshttps://doi.org/10.47749/t/unicamp.2020.1157713openalex-snapshot
Admission control and resource allocation in 5G network slicing
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.