On the public citation graph
Improved Coverings of a Square with Six and Eight Equal Circles
0 signed · 67 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-0-387-36721-7_9openalex-snapshot
Packing up to 200 Equal Circles in a Square
inferredcites →https://doi.org/10.1007/978-1-4612-0963-8openalex-snapshot
Unsolved problems in geometry: unsolved problems in intuitive mathematics
inferredcites →https://doi.org/10.1007/pl00009472openalex-snapshot
More Optimal Packings of Equal Circles in a Square
inferredcites →https://doi.org/10.1016/0012-365x(93)e0230-2openalex-snapshot
New results in the packing of equal circles in a square
inferredcites →https://doi.org/10.1080/0025570x.1997.11996514openalex-snapshot
Loosest Circle Coverings of an Equilateral Triangle
inferredcites →https://doi.org/10.1112/jlms/s1-24.3.164openalex-snapshot
On the Least Number of Unit Circles Which Can Cover a Square
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.37236/1240openalex-snapshot
Repeated Patterns of Dense Packings of Equal Disks in a Square
inferredcites →https://doi.org/10.4153/cmb-1965-004-xopenalex-snapshot
On a Geometric Extremum Problem
inferredcites →https://doi.org/10.4153/cmb-1965-018-9openalex-snapshot
The Densest Packing of 9 Circles in a Square
inferredcites →https://doi.org/10.5169/seals-45416openalex-snapshot
Dichteste Packungen von gleichen Kreisen in einem Quadrat
inferredcites →https://doi.org/10.5169/seals-45417openalex-snapshot
Densest packing of six equal circles in a square
inferredcites →https://doi.org/10.5169/seals-46351openalex-snapshot
Covering a square by equal circles
inferredcites →https://doi.org/10.7551/mitpress/4931.003.0017openalex-snapshot
*13 Simulated Annealing and Boltzmann Machines
inferredcites →https://doi.org/10.7551/mitpress/4943.003.0034openalex-snapshot
(1983) S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, "Optimization by simulated annealing," Science 220: 671-680
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11603771_6openalex-snapshot
Placing a Given Number of Base Stations to Cover a Convex Region
inferred← citeshttps://doi.org/10.1007/978-3-319-18899-7_11openalex-snapshot
Robust Designs for Circle Coverings of a Square
inferred← citeshttps://doi.org/10.1007/978-3-642-29458-7_78openalex-snapshot
A Distributed Deployment Algorithm with Mobile Sensors in Wireless Sensor Network
inferred← citeshttps://doi.org/10.1007/s00500-019-03962-zopenalex-snapshot
Enhanced analysis of border surveillance using intruders’ crossing strategies
inferred← citeshttps://doi.org/10.1007/s10589-008-9191-8openalex-snapshot
Covering a compact polygonal set by identical circles
inferred← citeshttps://doi.org/10.1007/s10898-021-01007-0openalex-snapshot
Global exact optimization for covering a rectangle with 6 circles
inferred← citeshttps://doi.org/10.1007/s10898-025-01557-7openalex-snapshot
Covering a rectangle with 6 circles: a reliable mathematical programming approach
inferred← citeshttps://doi.org/10.1007/s40314-019-0991-5openalex-snapshot
An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
inferred← citeshttps://doi.org/10.1016/j.exmath.2013.12.002openalex-snapshot
Packing, covering and tiling in two-dimensional spaces
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.05.004openalex-snapshot
Efficient algorithm for placing a given number of base stations to cover a convex region
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00130-4openalex-snapshot
Covering a rectangle with six and seven circles
inferred← citeshttps://doi.org/10.1017/s0025557200179021openalex-snapshot
The sprinkler problem – a mathematician waters the lawn
inferred← citeshttps://doi.org/10.1023/a:1004224507766openalex-snapshot
Covering a Rectangle With Equal Circles
inferred← citeshttps://doi.org/10.1063/1.5089991openalex-snapshot
Covering a square with six circles by deterministic global optimization
inferred← citeshttps://doi.org/10.1080/0025570x.1997.11996514openalex-snapshot
Loosest Circle Coverings of an Equilateral Triangle
inferred← citeshttps://doi.org/10.1080/10586458.2000.10504649openalex-snapshot
Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
inferred← citeshttps://doi.org/10.1103/physrevd.101.123008openalex-snapshot
Optimal gravitational-wave follow-up tiling strategies using a genetic algorithm
inferred← citeshttps://doi.org/10.1109/ccdc.2009.5191663openalex-snapshot
A sensor deployment algorithm for mobile wireless sensor networks
inferred← citeshttps://doi.org/10.1109/dcoss.2012.62openalex-snapshot
Optimal Relay Placement for Indoor Sensor Networks
inferred← citeshttps://doi.org/10.1109/glocom.2004.1378938openalex-snapshot
The coverage problem in three-dimensional wireless sensor networks
inferred← citeshttps://doi.org/10.1109/icc.2001.936985openalex-snapshot
Power efficient organization of wireless sensor networks
inferred← citeshttps://doi.org/10.1109/iccse.2011.6028627openalex-snapshot
A novel circle covering algorithm based on Coulomb Force Model for the problem of locating repeaters
inferred← citeshttps://doi.org/10.1109/icicict.2014.6781314openalex-snapshot
Energy effective target coverage WSNs
inferred← citeshttps://doi.org/10.1109/icpads.2009.111openalex-snapshot
tk-coverage: Time-Based K-Coverage for Energy Efficient Monitoring
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462076openalex-snapshot
Pattern Mutation in Wireless Sensor Deployment
inferred← citeshttps://doi.org/10.1109/infcom.2011.5935073openalex-snapshot
Notice of Violation of IEEE Publication Principles - Optimal multiple-coverage of sensor networks
inferred← citeshttps://doi.org/10.1109/infcom.2013.6566911openalex-snapshot
On wireless network coverage in bounded areas
inferred← citeshttps://doi.org/10.1109/issnip.2005.1595599openalex-snapshot
Particle Swarm Optimisers for Cluster formation in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/jsac.2010.100903openalex-snapshot
Constructing low-connectivity and full-coverage three dimensional sensor networks
inferred← citeshttps://doi.org/10.1109/jsen.2025.3545184openalex-snapshot
Smart Relay and Deployment Scheme With Maximum Forwarding Efficiency for Multiple-Relay-Aided Random Access Systems
inferred← citeshttps://doi.org/10.1109/tc.2012.145openalex-snapshot
A Novel Node Placement for Long Belt Coverage in Wireless Networks
inferred← citeshttps://doi.org/10.1109/tmc.2009.143openalex-snapshot
Optimal Patterns for Four-Connectivity and Full Coverage in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnet.2010.2040191openalex-snapshot
Optimal Deployment Patterns for Full Coverage and $k$-Connectivity $(k \leq 6)$ Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnet.2012.2199515openalex-snapshot
Pattern Mutation in Wireless Sensor Deployment
inferred← citeshttps://doi.org/10.1109/tnet.2013.2267624openalex-snapshot
Notice of Violation of IEEE Publication Principles: Connected Optimal Two-Coverage of Sensor Networks
inferred← citeshttps://doi.org/10.1109/wcica.2010.5554326openalex-snapshot
A distributed sensor deployment algorithm of mobile sensor network
inferred← citeshttps://doi.org/10.1109/wcnc.2003.1200625openalex-snapshot
A distributed self spreading algorithm for mobile wireless sensor networks
inferred← citeshttps://doi.org/10.1115/1.4026826openalex-snapshot
A Performance Index for Planar Repetitive Workspace Robots
inferred← citeshttps://doi.org/10.1134/s0965542510040135openalex-snapshot
Optimization of multiple covering of a bounded set with circles
inferred← citeshttps://doi.org/10.1134/s0965542519040031openalex-snapshot
Optimization of the Number and Arrangement of Circles of Two Radii for Forming a k-Covering of a Bounded Set
inferred← citeshttps://doi.org/10.1134/s199047891901006xopenalex-snapshot
On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains
inferred← citeshttps://doi.org/10.1137/20m135950xopenalex-snapshot
A Shape Optimization Approach to the Problem of Covering a Two-Dimensional Region with Minimum-Radius Identical Balls
inferred← citeshttps://doi.org/10.1137/21m1426067openalex-snapshot
A Shape-Newton Approach to the Problem of Covering with Identical Balls
inferred← citeshttps://doi.org/10.1145/1149283.1149285openalex-snapshot
Decentralized energy-conserving and coverage-preserving protocols for wireless sensor networks
inferred← citeshttps://doi.org/10.1145/1374618.1374672openalex-snapshot
Complete optimal deployment patterns for full-coverage and k-connectivity (k≤6) wireless sensor networks
inferred← citeshttps://doi.org/10.11606/d.45.2022.tde-30032022-172201openalex-snapshot
Cobertura com círculos de raio mínimo
inferred← citeshttps://doi.org/10.1287/moor.2022.0104openalex-snapshot
Bounds on the Optimal Radius When Covering a Set with Minimum Radius Identical Disks
inferred← citeshttps://doi.org/10.3233/rft-150076openalex-snapshot
Modeling RFID readers deployment in three-dimensional space
inferred← citeshttps://doi.org/10.3934/math.2019.6.1796openalex-snapshot
Optimal covering points and curves
inferred← citeshttps://doi.org/10.5120/21119-3972openalex-snapshot
A study on the Coverage-based issues in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.5539/jmr.v8n2p25openalex-snapshot
Optimal Geometric Disks Covering using Tessellable Regular Polygons
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.