On the public citation graph
On a circle placement problem
0 signed · 108 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.1016/0196-6774(83)90012-3openalex-snapshot
Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
inferredcites →https://doi.org/10.1016/0304-3975(78)90051-8openalex-snapshot
Finding the intersection of two convex polyhedra
inferredcites →https://doi.org/10.1109/sfcs.1983.11openalex-snapshot
Constructing arrangements of lines and hyperplanes with applications
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1287/mnsc.27.7.848openalex-snapshot
Note—On a Modified One-Center Model
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11970125_5openalex-snapshot
Covering Many or Few Points with Unit Disks
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_118openalex-snapshot
Arrangements of curves in the plane — topology, combinatorics, and algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_8openalex-snapshot
Translating a Planar Object to Maximize Point Containment
inferred← citeshttps://doi.org/10.1007/978-3-030-32177-2_5openalex-snapshot
Covering Location Problems
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-031-49611-0_16openalex-snapshot
A Novel Approximation Algorithm for Max-Covering Circle Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-13111-5_5openalex-snapshot
Covering Location Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-17885-1_1514openalex-snapshot
Maximizing Range Sum in Spatial Databases
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-23519-6_1514-1openalex-snapshot
Maximizing Range Sum in Spatial Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-45738-3_5openalex-snapshot
Distance-Constrained k Spatial Sub-Networks: A Summary of Results
inferred← citeshttps://doi.org/10.1007/978-3-319-46922-5_8openalex-snapshot
An Index-Based Method for Efficient Maximizing Range Sum Queries in Road Network
inferred← citeshttps://doi.org/10.1007/978-3-319-56657-3_4openalex-snapshot
Distance-Constrained k Spatial Sub-networks
inferred← citeshttps://doi.org/10.1007/978-3-642-29700-7_30openalex-snapshot
In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-56082-8_2openalex-snapshot
Continuous Covering Location Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/bf01405196openalex-snapshot
Uniform fourth order difference scheme for a singular perturbation problem
inferred← citeshttps://doi.org/10.1007/bf01602097openalex-snapshot
Geometric problems on two-dimensional array processors
inferred← citeshttps://doi.org/10.1007/bf02564786openalex-snapshot
Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
inferred← citeshttps://doi.org/10.1007/bf02574012openalex-snapshot
Iterated nearest neighbors and finding minimal polytopes
inferred← citeshttps://doi.org/10.1007/bf02574706openalex-snapshot
Onk-sets in arrangements of curves and surfaces
inferred← citeshttps://doi.org/10.1007/bfb0016240openalex-snapshot
Geometric location problems and their complexity
inferred← citeshttps://doi.org/10.1007/s00224-008-9135-9openalex-snapshot
Covering Many or Few Points with Unit Disks
inferred← citeshttps://doi.org/10.1007/s00224-011-9353-4openalex-snapshot
An Improved Approximation Algorithm for the Most Points Covering Problem
inferred← citeshttps://doi.org/10.1007/s00224-018-9870-5openalex-snapshot
The Most Points Connected-Covering Problem with Two Disks
inferred← citeshttps://doi.org/10.1007/s00454-017-9878-7openalex-snapshot
Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance
inferred← citeshttps://doi.org/10.1007/s11227-020-03299-7openalex-snapshot
Windowing queries using Minkowski sum and their extension to MapReduce
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90153-zopenalex-snapshot
A faster algorithm for the two-center decision problem
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00029-xopenalex-snapshot
A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.10.001openalex-snapshot
Covering point sets with two disjoint disks or squares
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.12.003openalex-snapshot
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs
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.cor.2009.11.003openalex-snapshot
Generalized coverage: New developments in covering location models
inferred← citeshttps://doi.org/10.1016/j.dam.2002.11.004openalex-snapshot
Computing large planar regions in terrains, with an application to fracture surfaces
inferred← citeshttps://doi.org/10.1016/j.dam.2014.06.025openalex-snapshot
In-place algorithms for computing a largest clique in geometric intersection graphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.06.048openalex-snapshot
Covering problems with polyellipsoids: A location analysis perspective
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.09.029openalex-snapshot
New exact algorithms for planar maximum covering location by ellipses problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.04.034openalex-snapshot
An elliptical cover problem in drone delivery network design and its solution algorithms
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.09.001openalex-snapshot
Enclosing weighted points with an almost-unit ball
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.029openalex-snapshot
Optimizing squares covering a set of points
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.2019.12.010openalex-snapshot
Online unit covering in Euclidean space
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114901openalex-snapshot
Approximation algorithms for finding maximum containing circle and sphere
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00048-8openalex-snapshot
Robust algorithms for restricted domains
inferred← citeshttps://doi.org/10.1016/s0734-189x(87)80134-2openalex-snapshot
Picture Processing: 1986
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00015-7openalex-snapshot
Optimal placement of convex polygons to maximize point containment
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80982-4openalex-snapshot
Computing Large Planar Regions in Terrains
inferred← citeshttps://doi.org/10.1080/10618600.2017.1390471openalex-snapshot
Minimizing Sum of Truncated Convex Functions and Its Applications
inferred← citeshttps://doi.org/10.1109/access.2018.2801941openalex-snapshot
Coverage of Targets in Mobile Sensor Networks With Restricted Mobility
inferred← citeshttps://doi.org/10.1109/hpcc-smartcity-dss50907.2020.00111openalex-snapshot
Fast Algorithms for Spatial K-Core Discovery and Maintenance
inferred← citeshttps://doi.org/10.1109/icacci.2017.8125978openalex-snapshot
Efficient relocation of mobile sensors for target coverage
inferred← citeshttps://doi.org/10.1109/icde.2019.00083openalex-snapshot
Efficient Maximal Spatial Clique Enumeration
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00061openalex-snapshot
Maximizing Range Sum in Trajectory Data
inferred← citeshttps://doi.org/10.1109/iiki.2016.16openalex-snapshot
Circle-Covering Algorithm for Multiple-POI Searching
inferred← citeshttps://doi.org/10.1109/mdm52706.2021.00031openalex-snapshot
Spatial K-Core Identification in Large Spatial Data
inferred← citeshttps://doi.org/10.1109/robio49542.2019.8961476openalex-snapshot
Efficient Optimal Backhaul-aware Placement of Multiple Drone-Cells Based on Genetic Algorithm
inferred← citeshttps://doi.org/10.1109/tac.2017.2713049openalex-snapshot
Source Localization by a Binary Sensor Network in the Presence of Imperfection, Noise, and Outliers
inferred← citeshttps://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferred← citeshttps://doi.org/10.1109/tnet.2022.3231184openalex-snapshot
Covering Users With QoS by a Connected Swarm of Drones: Graph Theoretical Approach and Experiments
inferred← citeshttps://doi.org/10.1109/wcnc.2007.381openalex-snapshot
Upper Bound of The Number of Channels for Conflict-Free Communication in Multi-Channel Wireless Networks
inferred← citeshttps://doi.org/10.1111/j.1467-8667.2009.00623.xopenalex-snapshot
Locating a Surveillance Infrastructure in and Near Ports or on Other Planar Surfaces to Monitor Flows
inferred← citeshttps://doi.org/10.1137/1.9781611973402.103openalex-snapshot
Four Soviets Walk the Dog—with an Application to Alt's Conjecture
inferred← citeshttps://doi.org/10.1142/s0129054114500257openalex-snapshot
AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS
inferred← citeshttps://doi.org/10.1142/s0217595922500452openalex-snapshot
Location Problems with Cutoff
inferred← citeshttps://doi.org/10.1142/s0218195905001750openalex-snapshot
FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE
inferred← citeshttps://doi.org/10.1142/s0218195910003335openalex-snapshot
A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING
inferred← citeshttps://doi.org/10.1142/s0218195915500156openalex-snapshot
Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points
inferred← citeshttps://doi.org/10.1142/s0218195999000091openalex-snapshot
COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
inferred← citeshttps://doi.org/10.1145/1400863.1400879openalex-snapshot
Modelling gateway placement in wireless networks
inferred← citeshttps://doi.org/10.1145/2629477openalex-snapshot
Maximizing Range Sum in External Memory
inferred← citeshttps://doi.org/10.1145/3080554openalex-snapshot
A General Framework for MaxRS and MaxCRS Monitoring in Spatial Data Streams
inferred← citeshttps://doi.org/10.1145/3767709openalex-snapshot
A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
inferred← citeshttps://doi.org/10.1145/997817.997835openalex-snapshot
Finding planar regions in a terrain
inferred← citeshttps://doi.org/10.1155/2014/541602openalex-snapshot
An Efficient Algorithm for Maximizing Range Sum Queries in a Road Network
inferred← citeshttps://doi.org/10.1155/2017/4323590openalex-snapshot
A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning
inferred← citeshttps://doi.org/10.11606/d.55.2020.tde-23072020-154136openalex-snapshot
New Exact Algorithms for Planar Maximum Covering Location by Ellipses Problems
inferred← citeshttps://doi.org/10.1287/ijoc.2022.1243openalex-snapshot
Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions
inferred← citeshttps://doi.org/10.14778/2350229.2350230openalex-snapshot
A scalable algorithm for maximizing range sum in spatial databases
inferred← citeshttps://doi.org/10.1515/amcs-2015-0055openalex-snapshot
The Non–Symmetric s –Step Lanczos Algorithm: Derivation of Efficient Recurrences and Synchronization–Reducing Variants of BiCG and QMR
inferred← citeshttps://doi.org/10.22028/d291-23759openalex-snapshot
Geometric algorithms for object placement and planarity in a terrain
inferred← citeshttps://doi.org/10.26754/uz.978-84-92774-11-1openalex-snapshot
XIII Encuentros de Geometría Computacional. Zaragoza, 29 de junio al 1 de julio de 2009
inferred← citeshttps://doi.org/10.4236/ajcm.2014.43016openalex-snapshot
Variations of Enclosing Problem Using Axis Parallel Square(s): A General Approach
inferred← citeshttps://doi.org/10.46298/dmtcs.2102openalex-snapshot
Output sensitive algorithms for covering many points
inferred← citeshttps://doi.org/10.48550/arxiv.1312.0389openalex-snapshot
Output sensitive algorithm for covering many points
inferred← citeshttps://doi.org/10.48550/arxiv.1401.4248openalex-snapshot
Complexity Analysis of Heuristic Pulse Interleaving Algorithms for Multi-Target Tracking with Multiple Simultaneous Receive Beams
inferred← citeshttps://doi.org/10.48550/arxiv.1409.8055openalex-snapshot
The 2-center problem and ball operators in strictly convex normed planes
inferred← citeshttps://doi.org/10.48550/arxiv.1411.6810openalex-snapshot
Discretization of Planar Geometric Cover Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1608.00236openalex-snapshot
Minimizing Sum of Truncated Convex Functions and Its Applications
inferred← citeshttps://doi.org/10.48550/arxiv.2106.13162openalex-snapshot
Some Problems of Deployment and Navigation of Civilian Aerial Drones
inferred← citeshttps://doi.org/10.53846/goediss-9234openalex-snapshot
Barycenters and ANOVA for Point Pattern Data
inferred← citeshttps://doi.org/10.5555/313559.313612openalex-snapshot
Iterated nearest neighbors and finding minimal polytypes
inferred← citeshttps://doi.org/10.6100/ir777493openalex-snapshot
Similarity measures and algorithms for cartographic schematization
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.