On the public citation graph
Almost optimal set covers in finite VC-dimension
0 signed · 458 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.1006/jagm.1996.0060openalex-snapshot
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
inferredcites →https://doi.org/10.1007/3-540-56483-7_20openalex-snapshot
Training a 3-node neural network is NP-complete
inferredcites →https://doi.org/10.1007/3-540-57155-8_252openalex-snapshot
Algorithms for polytope covering and approximation
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1007/bf01303517openalex-snapshot
Discrepancy and approximations for bounded VC-dimension
inferredcites →https://doi.org/10.1007/bf02122778openalex-snapshot
A deterministic view of random sampling and its use in geometry
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187743openalex-snapshot
Quasi-optimal range searching in spaces of finite VC-dimension
inferredcites →https://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferredcites →https://doi.org/10.1007/bf02573972openalex-snapshot
Range searching with efficient hierarchical cuttings
inferredcites →https://doi.org/10.1007/bf02573985openalex-snapshot
An optimal convex hull algorithm in any fixed dimension
inferredcites →https://doi.org/10.1016/0012-365x(75)90058-8openalex-snapshot
On the ratio of optimal integral and fractional covers
inferredcites →https://doi.org/10.1016/0097-3165(72)90019-2openalex-snapshot
On the density of families of sets
inferredcites →https://doi.org/10.1016/0885-064x(90)90012-3openalex-snapshot
On learning a union of half spaces
inferredcites →https://doi.org/10.1016/0925-7721(92)90006-eopenalex-snapshot
Reporting points in halfspaces
inferredcites →https://doi.org/10.1016/0925-7721(95)00006-uopenalex-snapshot
Separation and approximation of polyhedral objects
inferredcites →https://doi.org/10.1016/s0022-0000(05)80068-6openalex-snapshot
Efficient NC algorithms for set cover with applications to learning and geometry
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1109/sfcs.1987.37openalex-snapshot
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
inferredcites →https://doi.org/10.1109/sfcs.1988.21961openalex-snapshot
A Las Vegas algorithm for linear programming when the dimension is small
inferredcites →https://doi.org/10.1109/sfcs.1989.63455openalex-snapshot
Efficient NC algorithms for set cover with applications to learning and geometry
inferredcites →https://doi.org/10.1109/sfcs.1991.185345openalex-snapshot
An optimal convex hull algorithm and new results on cuttings
inferredcites →https://doi.org/10.1109/sfcs.1991.185401openalex-snapshot
Discrepancy and in -approximations for bounded VC-dimension
inferredcites →https://doi.org/10.1109/sfcs.1993.366847openalex-snapshot
Product range spaces, sensitive sampling, and derandomization
inferredcites →https://doi.org/10.1109/sfcs.1993.366855openalex-snapshot
Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs
inferredcites →https://doi.org/10.1137/0211045openalex-snapshot
Approximation Algorithms for the Set Covering and Vertex Cover Problems
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
inferredcites →https://doi.org/10.1145/12130.12158openalex-snapshot
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1145/160985.161002openalex-snapshot
Geometric partitioning made easier, even in parallel
inferredcites →https://doi.org/10.1145/160985.161167openalex-snapshot
Decision trees for geometric models
inferredcites →https://doi.org/10.1145/167088.167172openalex-snapshot
On the hardness of approximating minimization problems
inferredcites →https://doi.org/10.1145/167088.167174openalex-snapshot
Efficient probabilistically checkable proofs and applications to approximations
inferredcites →https://doi.org/10.1145/167088.167222openalex-snapshot
Improved bounds on weak ε-nets for convex sets
inferredcites →https://doi.org/10.1145/177424.178119openalex-snapshot
Almost optimal polyhedral separators
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/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/73393.73397openalex-snapshot
Partition trees for triangle counting and other range searching problems
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1145/98524.98530openalex-snapshot
How to net a lot with little: small ε-nets for disks and halfspaces
inferredcites →https://doi.org/10.1287/moor.4.3.233openalex-snapshot
A Greedy Heuristic for the Set-Covering Problem
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rnc.1220openalex-snapshot
Cooperative sensor deployment for multi‐target monitoring
inferred← citeshttps://doi.org/10.1006/inco.2001.3059openalex-snapshot
Learning Fixed-Dimension Linear Thresholds from Fragmented Data
inferred← citeshttps://doi.org/10.1006/jagm.1996.0027openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1006/jagm.1997.0922openalex-snapshot
Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic
inferred← citeshttps://doi.org/10.1007/11682462_58openalex-snapshot
A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains
inferred← citeshttps://doi.org/10.1007/11830924_3openalex-snapshot
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36224-x_12openalex-snapshot
Omnidirectional Sensing for Robot Control
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_1openalex-snapshot
Approximation of Multiobjective Optimization Problems
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_4openalex-snapshot
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_53openalex-snapshot
Hardness of Set Cover with Intersection 1
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_32openalex-snapshot
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_9openalex-snapshot
Approximation Algorithms for k-Line Center
inferred← citeshttps://doi.org/10.1007/3-540-49257-7_16openalex-snapshot
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity and Applications
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_52openalex-snapshot
On the complexity of approximating and illuminating three-dimensional convex polyhedra
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_25openalex-snapshot
On dependent randomized rounding algorithms
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_69openalex-snapshot
Dynamic data structures for fat objects and their applications
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_175openalex-snapshot
Greedy Set-Cover Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_16openalex-snapshot
Guarding Galleries and Terrains
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_6openalex-snapshot
Randomized Algorithms for Geometric Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_175openalex-snapshot
Greedy Set-Cover Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-10564-8_32openalex-snapshot
Capacitated Discrete Unit Disk Cover
inferred← citeshttps://doi.org/10.1007/978-3-030-34029-2_10openalex-snapshot
Unit Disk Cover for Massive Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-50026-9_2openalex-snapshot
Parameterized Analysis of Art Gallery and Terrain Guarding
inferred← citeshttps://doi.org/10.1007/978-3-030-79527-6_19openalex-snapshot
Constant Round Distributed Domination on Graph Classes with Bounded Expansion
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_32openalex-snapshot
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_50openalex-snapshot
Constrained Hitting Set Problem with Intervals
inferred← citeshttps://doi.org/10.1007/978-3-030-96731-4_27openalex-snapshot
Hypergraph Representation via Axis-Aligned Point-Subspace Cover
inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_27openalex-snapshot
A PTAS for the Horizontal Rectangle Stabbing Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-32412-3_12openalex-snapshot
Covering a Set of Points with a Minimum Number of Equal Disks via Simulated Annealing
inferred← citeshttps://doi.org/10.1007/978-3-031-49815-2_12openalex-snapshot
Hitting Sets when the Shallow Cell Complexity is Small
inferred← citeshttps://doi.org/10.1007/978-3-031-55598-5_19openalex-snapshot
Guarding Polyominoes Under k-Hop Visibility
inferred← citeshttps://doi.org/10.1007/978-3-031-99928-4_1openalex-snapshot
Fundamentals of Supervised Learning
inferred← citeshttps://doi.org/10.1007/978-3-319-04657-0_4openalex-snapshot
Generalized Class Cover Problem with Axis-Parallel Strips
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_31openalex-snapshot
Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments
inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_16openalex-snapshot
Approximation Algorithms for the Set Cover Formation by Oblivious Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_44openalex-snapshot
Linear Time Approximation Schemes for Geometric Maximum Coverage
inferred← citeshttps://doi.org/10.1007/978-3-319-21852-6_21openalex-snapshot
Bounding Embeddings of VC Classes into Maximum Classes
inferred← citeshttps://doi.org/10.1007/978-3-319-28684-6_13openalex-snapshot
Geometric Hitting Set for Segments of Few Orientations
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_15openalex-snapshot
Constant-Factor Approximation for TSP with Disks
inferred← citeshttps://doi.org/10.1007/978-3-319-51741-4_7openalex-snapshot
A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_5openalex-snapshot
On Guarding Orthogonal Polygons with Sliding Cameras
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_20openalex-snapshot
Covering Polygons with Rectangles
inferred← citeshttps://doi.org/10.1007/978-3-319-73013-4_31openalex-snapshot
Hitting Set Problem for Axis-Parallel Squares Intersecting a Straight Line Is Polynomially Solvable for Any Fixed Range of Square Sizes
inferred← citeshttps://doi.org/10.1007/978-3-319-89441-6_7openalex-snapshot
Approximating Domination on Intersection Graphs of Paths on a Grid
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_6openalex-snapshot
Minimum Polygons for Fixed Visibility VC-Dimension
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_16openalex-snapshot
Computing Coverage Kernels Under Restricted Settings
inferred← citeshttps://doi.org/10.1007/978-3-540-30570-5_14openalex-snapshot
Approximately Dominating Representatives
inferred← citeshttps://doi.org/10.1007/978-3-540-69311-6_24openalex-snapshot
A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_15openalex-snapshot
A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_6openalex-snapshot
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_56openalex-snapshot
Covering Points by Unit Disks of Fixed Location
inferred← citeshttps://doi.org/10.1007/978-3-540-78275-9_4openalex-snapshot
Polyhedral Surface Approximation of Non-convex Voxel Sets through the Modification of Convex Hulls
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_64openalex-snapshot
Domination in Geometric Intersection Graphs
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/978-3-642-02085-8_22openalex-snapshot
Efficient Sensor Placement for Surveillance Problems
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-03417-6_11openalex-snapshot
ε-Net Approach to Sensor k-Coverage
inferred← citeshttps://doi.org/10.1007/978-3-642-11322-2_31openalex-snapshot
Bandwidth Provisioning in Infrastructure-Based Wireless Networks Employing Directional Antennas
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_26openalex-snapshot
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_13openalex-snapshot
PTAS for Weighted Set Cover on Unit Squares
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/978-3-642-19094-0_16openalex-snapshot
On the Discrete Unit Disk Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-20662-7_20openalex-snapshot
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-21073-0_12openalex-snapshot
Cup Products on Polyhedral Approximations of 3D Digital Images
inferred← citeshttps://doi.org/10.1007/978-3-642-21378-6_11openalex-snapshot
Maximizing Coverage Degree Based on Event Patterns in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_58openalex-snapshot
VC-Dimension and Shortest Path Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_4openalex-snapshot
On Capacitated Set Cover Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-23490-3_10openalex-snapshot
Wireless Coverage via Dynamic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-23490-3_3openalex-snapshot
Minimum-Cost Linear Coverage by Sensors with Adjustable Ranges
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_30openalex-snapshot
Hitting Sets Online and Vertex Ranking
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_6openalex-snapshot
On Isolating Points Using Disks
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_175-2openalex-snapshot
Greedy Set-Cover Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_14openalex-snapshot
Weighted Geometric Set Multi-cover via Quasi-uniform Sampling
inferred← citeshttps://doi.org/10.1007/978-3-642-35452-6_18openalex-snapshot
A Novel Approximation Algorithm for Minimum Geometric Disk Cover Problem with Hexagon Tessellation
inferred← citeshttps://doi.org/10.1007/978-3-642-38856-9_21openalex-snapshot
Verification as Learning Geometric Concepts
inferred← citeshttps://doi.org/10.1007/978-3-642-39643-4_6openalex-snapshot
Unit Disk Cover Problem in 2D
inferred← citeshttps://doi.org/10.1007/978-3-642-61012-7_12openalex-snapshot
Suchen und Konstruieren durch Verdoppeln
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_73openalex-snapshot
A PTAS for the Weighted Unit Disk Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_75openalex-snapshot
Geometric Hitting Sets for Disks: Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_39openalex-snapshot
Approximation Algorithms in the Successive Hitting Set Model
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_46openalex-snapshot
The VC-Dimension of Visibility on the Boundary of a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-7091-0388-3_7openalex-snapshot
Region-Based Geospatial Abduction with Counter-IED Applications
inferred← citeshttps://doi.org/10.1007/978-981-95-0215-8_20openalex-snapshot
Minimum Membership Geometric Set Cover in the Continuous Setting
inferred← citeshttps://doi.org/10.1007/978-981-96-8312-3_12openalex-snapshot
The Subinterval Cover Problem
inferred← citeshttps://doi.org/10.1007/bf01582131openalex-snapshot
Rounding algorithms for covering problems
inferred← citeshttps://doi.org/10.1007/pl00009325openalex-snapshot
Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming
inferred← citeshttps://doi.org/10.1007/s00224-005-1273-8openalex-snapshot
Constant Approximation Algorithms for Rectangle Stabbing and Related Problems
inferred← citeshttps://doi.org/10.1007/s00224-016-9744-7openalex-snapshot
Geometric Hitting Set for Segments of Few Orientations
inferred← citeshttps://doi.org/10.1007/s00446-006-0012-yopenalex-snapshot
On the establishment of distinct identities in overlay networks
inferred← citeshttps://doi.org/10.1007/s00453-005-1166-xopenalex-snapshot
Approximation Algorithms for a k-Line Center
inferred← citeshttps://doi.org/10.1007/s00453-009-9358-4openalex-snapshot
Improved Approximations for Guarding 1.5-Dimensional Terrains
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-011-9517-2openalex-snapshot
Near-Linear Approximation Algorithms for Geometric Hitting Sets
inferred← citeshttps://doi.org/10.1007/s00453-011-9591-5openalex-snapshot
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
inferred← citeshttps://doi.org/10.1007/s00453-017-0298-0openalex-snapshot
Approximating the Generalized Minimum Manhattan Network Problem
inferred← citeshttps://doi.org/10.1007/s00453-017-0338-9openalex-snapshot
A Clustering-Based Approach to Kinetic Closest Pair
inferred← citeshttps://doi.org/10.1007/s00453-018-00539-4openalex-snapshot
A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs
inferred← citeshttps://doi.org/10.1007/s00453-018-0433-6openalex-snapshot
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation
inferred← citeshttps://doi.org/10.1007/s00453-019-00600-wopenalex-snapshot
Parameterized Complexity of Geometric Covering Problems Having Conflicts
inferred← citeshttps://doi.org/10.1007/s00453-022-01084-xopenalex-snapshot
Improved Bounds for Metric Capacitated Covering Problems
inferred← citeshttps://doi.org/10.1007/s00453-024-01292-7openalex-snapshot
Guarding Polyominoes Under k-Hop Visibility
inferred← citeshttps://doi.org/10.1007/s004539910017openalex-snapshot
Probabilistic Algorithms for Efficient Grasping and Fixturing
inferred← citeshttps://doi.org/10.1007/s00454-001-0026-yopenalex-snapshot
Online Point Location in Planar Arrangements and Its Applications
inferred← citeshttps://doi.org/10.1007/s00454-006-1273-8openalex-snapshot
Improved Approximation Algorithms for Geometric Set Cover
inferred← citeshttps://doi.org/10.1007/s00454-009-9167-1openalex-snapshot
Helly-Type Theorems for Approximate Covering
inferred← citeshttps://doi.org/10.1007/s00454-010-9285-9openalex-snapshot
Improved Results on Geometric Hitting Set Problems
inferred← citeshttps://doi.org/10.1007/s00454-010-9323-7openalex-snapshot
A Non-linear Lower Bound for Planar Epsilon-nets
inferred← citeshttps://doi.org/10.1007/s00454-011-9352-xopenalex-snapshot
Improved Approximation for Guarding Simple Galleries from the Perimeter
inferred← citeshttps://doi.org/10.1007/s00454-012-9417-5openalex-snapshot
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
inferred← citeshttps://doi.org/10.1007/s00454-014-9656-8openalex-snapshot
An $$O(\lg \lg {\mathrm {OPT}})$$ O ( lg lg OPT ) -Approximation Algorithm for Multi-guarding Galleries
inferred← citeshttps://doi.org/10.1007/s00454-016-9819-xopenalex-snapshot
Limits of Local Search: Quality and Efficiency
inferred← citeshttps://doi.org/10.1007/s00454-017-9872-0openalex-snapshot
Packing and Covering with Balls on Busemann Surfaces
inferred← citeshttps://doi.org/10.1007/s00454-018-0019-8openalex-snapshot
( $$\delta ,{\varepsilon }$$ δ , ε )-Ball Approximation of a Shape: Definition and Complexity
inferred← citeshttps://doi.org/10.1007/s00454-018-9983-2openalex-snapshot
Packing and Covering with Non-Piercing Regions
inferred← citeshttps://doi.org/10.1007/s00454-019-00099-6openalex-snapshot
Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
inferred← citeshttps://doi.org/10.1007/s00454-019-00103-zopenalex-snapshot
On Separating Points by Lines
inferred← citeshttps://doi.org/10.1007/s00454-019-00127-5openalex-snapshot
Capacitated Covering Problems in Geometric Spaces
inferred← citeshttps://doi.org/10.1007/s00454-021-00318-zopenalex-snapshot
The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances
inferred← citeshttps://doi.org/10.1007/s00454-022-00376-xopenalex-snapshot
The $\epsilon$-$t$-Net Problem
inferred← citeshttps://doi.org/10.1007/s00454-022-00402-yopenalex-snapshot
On the Geometric Set Multicover Problem
inferred← citeshttps://doi.org/10.1007/s00454-023-00569-yopenalex-snapshot
The Parameterized Complexity of Guarding Almost Convex Polygons
inferred← citeshttps://doi.org/10.1007/s00454-023-00608-8openalex-snapshot
Geometric Stabbing via Threshold Rounding and Factor Revealing LPs
inferred← citeshttps://doi.org/10.1007/s00454-024-00637-xopenalex-snapshot
Computing Instance-Optimal Kernels in Two Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-025-00792-9openalex-snapshot
Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-025-00815-5openalex-snapshot
Optimal Area-Sensitive Bounds for Polytope Approximation
inferred← citeshttps://doi.org/10.1007/s00778-015-0392-3openalex-snapshot
On k-Path Covers and their applications
inferred← citeshttps://doi.org/10.1007/s10107-003-0438-yopenalex-snapshot
Approximation schemes for NP-hard geometric optimization problems: a survey
inferred← citeshttps://doi.org/10.1007/s10107-024-02106-yopenalex-snapshot
A PTAS for the horizontal rectangle stabbing problem
inferred← citeshttps://doi.org/10.1007/s10208-014-9193-0openalex-snapshot
Computing Cup Products in $$\mathbb {Z}_2$$ Z 2 -Cohomology of 3D Polyhedral Complexes
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.1007/s10479-018-3025-6openalex-snapshot
On interval and circular-arc covering problems
inferred← citeshttps://doi.org/10.1007/s10618-005-1396-1openalex-snapshot
Automatic Subspace Clustering of High Dimensional Data
inferred← citeshttps://doi.org/10.1007/s10878-009-9216-yopenalex-snapshot
Polynomial time approximation schemes for minimum disk cover problems
inferred← citeshttps://doi.org/10.1007/s10878-021-00777-3openalex-snapshot
Sublinear search spaces for shortest path planning in grid and road networks
inferred← citeshttps://doi.org/10.1007/s10878-022-00874-xopenalex-snapshot
Algorithms for covering multiple submodular constraints and applications
inferred← citeshttps://doi.org/10.1007/s10898-021-01033-yopenalex-snapshot
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s11227-026-08390-zopenalex-snapshot
Voronoi-based heuristic strategies for efficient solutions to the unit disk cover problem
inferred← citeshttps://doi.org/10.1007/s11276-006-3724-9openalex-snapshot
Improved approximation algorithms for connected sensor cover
inferred← citeshttps://doi.org/10.1016/b978-0-443-24834-4.00001-1openalex-snapshot
Introduction to a many-sorted algebra view
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50004-8openalex-snapshot
Discrete Geometric Shapes: Matching, Interpolation, and Approximation**Partially supported by Deutsche Forschungsgemeinschaft (DFG), Grant No. A1 253/4-2.
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50014-0openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.adhoc.2012.03.009openalex-snapshot
Polynomial time solution to minimum forwarding set problem in wireless networks under disk coverage model
inferred← citeshttps://doi.org/10.1016/j.automatica.2017.04.053openalex-snapshot
The robust minimal controllability problem
inferred← citeshttps://doi.org/10.1016/j.cageo.2014.05.010openalex-snapshot
Surface roughness of rock faces through the curvature of triangulated meshes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.01.001openalex-snapshot
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.02.002openalex-snapshot
On guarding the vertices of rectilinear domains
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.01.014openalex-snapshot
The class cover problem with boxes
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.comgeo.2012.07.004openalex-snapshot
Fast vertex guarding for polygons with and without holes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.05.008openalex-snapshot
Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.06.006openalex-snapshot
On the approximability of covering points by lines and related problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.12.002openalex-snapshot
Tighter estimates for ϵ-nets for disks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.04.002openalex-snapshot
Approximation algorithms for the unit disk cover problem in 2D and 3D
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.07.004openalex-snapshot
Polygon guarding with orientation
inferred← citeshttps://doi.org/10.1016/j.comgeo.2018.10.006openalex-snapshot
The VC-dimension of visibility on the boundary of monotone polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101861openalex-snapshot
The maximum exposure problem
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101925openalex-snapshot
Experiments with unit disk cover algorithms for covering massive pointsets
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.101984openalex-snapshot
On the geometric priority set cover problem
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102065openalex-snapshot
Generalized class cover problem with axis-parallel strips
inferred← citeshttps://doi.org/10.1016/j.comnet.2004.08.012openalex-snapshot
Polynomial time approximation schemes for base station coverage with minimum total radii
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2022.108444openalex-snapshot
Efficient approximation algorithms for offline and online unit disk multiple coverage
inferred← citeshttps://doi.org/10.1016/j.cor.2008.02.013openalex-snapshot
Covering a line segment with variable radius discs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.04.008openalex-snapshot
Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets
inferred← citeshttps://doi.org/10.1016/j.dam.2014.06.019openalex-snapshot
Hitting sets online and unique-max coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2017.12.018openalex-snapshot
Practical and efficient algorithms for the geometric hitting set problem
inferred← citeshttps://doi.org/10.1016/j.dam.2020.05.025openalex-snapshot
Capacitated discrete unit disk cover
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.06.007openalex-snapshot
Set systems and families of permutations with small traces
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103309openalex-snapshot
Kernelization and approximation of distance- r independent sets on nowhere dense graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103773openalex-snapshot
Distributed domination on sparse graph classes
inferred← citeshttps://doi.org/10.1016/j.eswa.2007.09.062openalex-snapshot
EQOWSN: Evolutionary-based query optimization over self-organized wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.03.010openalex-snapshot
Hitting sets when the VC-dimension is small
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.05.014openalex-snapshot
Guarding galleries and terrains
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.01.010openalex-snapshot
Hausdorff approximation of 3D convex polytopes
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.01.001openalex-snapshot
On the VC-dimension of unique round-trip shortest path systems
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.01.006openalex-snapshot
Greedy domination on biclique-free graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106402openalex-snapshot
Monochromatic Partitioning of Colored Points by Lines
inferred← citeshttps://doi.org/10.1016/j.jalgor.2003.11.006openalex-snapshot
Approximation algorithms for array partitioning problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103782openalex-snapshot
Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
inferred← citeshttps://doi.org/10.1016/j.jda.2015.05.002openalex-snapshot
Unit disk cover problem in 2D
inferred← citeshttps://doi.org/10.1016/j.jda.2017.04.005openalex-snapshot
Guarding monotone art galleries with sliding cameras in linear time
inferred← citeshttps://doi.org/10.1016/j.jnca.2016.06.011openalex-snapshot
On balanced k-coverage in visual sensor networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.08.006openalex-snapshot
A power-aware 2-covered path routing for wireless body area networks with variable transmission ranges
inferred← citeshttps://doi.org/10.1016/j.orl.2020.11.003openalex-snapshot
The matroid intersection cover problem
inferred← citeshttps://doi.org/10.1016/j.orl.2023.07.005openalex-snapshot
A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
inferred← citeshttps://doi.org/10.1016/j.pmcj.2010.07.003openalex-snapshot
Bandwidth provisioning in infrastructure-based wireless networks employing directional antennas
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.11.003openalex-snapshot
Approximately dominating representatives
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.026openalex-snapshot
A PTAS for the cardinality constrained covering with unit balls
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.030openalex-snapshot
The within-strip discrete unit disk cover problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.026openalex-snapshot
Near-linear time approximation schemes for geometric maximum coverage
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.034openalex-snapshot
Exact learning from an honest teacher that answers membership queries
showing the first 200 of 405 · page through all 405
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.