On the public citation graph

How to whack moles

https://doi.org/10.1016/j.tcs.2006.05.017
0 signed · 32 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230220305openalex-snapshot
Special cases of traveling salesman and repairman problems with time windows
inferredcites →https://doi.org/10.1007/3-540-44436-xopenalex-snapshot
Approximation Algorithms for Combinatorial Optimization
inferredcites →https://doi.org/10.1007/3-540-45753-4_18openalex-snapshot
Non-Abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/3-540-46521-9_11openalex-snapshot
The Online Dial-a-Ride Problem under Reasonable Load
inferredcites →https://doi.org/10.1007/3-540-46541-3_53openalex-snapshot
Online Dial-a-Ride Problems: Minimizing the Completion Time
inferredcites →https://doi.org/10.1007/3-540-57811-0openalex-snapshot
Algorithms and Complexity
inferredcites →https://doi.org/10.1007/3-540-68530-8openalex-snapshot
Algorithms — ESA’ 98
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-662-04331-8openalex-snapshot
Online Optimization of Large Scale Systems
inferredcites →https://doi.org/10.1007/s004530010071openalex-snapshot
Algorithms for the On-Line Travelling Salesman1
inferredcites →https://doi.org/10.1016/s0196-6774(03)00074-9openalex-snapshot
Maximizing job completions online
inferredcites →https://doi.org/10.1016/s0304-3975(00)00261-9openalex-snapshot
On-line single-server dial-a-ride problems
inferredcites →https://doi.org/10.1016/s0304-3975(02)00409-7openalex-snapshot
News from the online traveling repairman
inferredcites →https://doi.org/10.1023/b:josh.0000019683.85186.57openalex-snapshot
On-Line Algorithms for the Dynamic Traveling Repair Problem
inferredcites →https://doi.org/10.1109/real.1994.342713openalex-snapshot
On-line scheduling to maximize task completions
inferredcites →https://doi.org/10.1287/ijoc.1030.0052openalex-snapshot
Computer-Aided Complexity Classification of Dial-a-Ride Problems
inferredcites →https://doi.org/10.1287/ijoc.13.2.138.10517openalex-snapshot
The Online TSP Against Fair Adversaries

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4145446openalex-extracted
Competitive Perimeter Defense in Linear Environments
inferred← citeshttps://doi.org/10.1007/11496199_11openalex-snapshot
On the Online Dial-A-Ride Problem with Time-Windows
inferred← citeshttps://doi.org/10.1007/s10878-013-9654-4openalex-snapshot
Online traveling salesman problem with deadlines and service flexibility
inferred← citeshttps://doi.org/10.1007/s10878-020-00585-1openalex-snapshot
Online traveling salesman problem with time cost and non-zealous server
inferred← citeshttps://doi.org/10.1016/j.cie.2012.07.003openalex-snapshot
Online traveling salesman problem with deadline and advanced information
inferred← citeshttps://doi.org/10.1016/j.pcorm.2020.100115openalex-snapshot
Sample sizes for surveillance of S. aureus transmission to monitor effectiveness and provide feedback on intraoperative infection control including for COVID-19
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.01.003openalex-snapshot
Orienteering problem with time-windows and updating delay
inferred← citeshttps://doi.org/10.1088/1748-3190/acd896openalex-snapshot
Non-linear adaptive control inspired by neuromuscular systems
inferred← citeshttps://doi.org/10.1109/cig.2019.8848040openalex-snapshot
Using Simple Games to Evaluate Self-Organization Concepts: a Whack-a-mole Case Study
inferred← citeshttps://doi.org/10.1109/tro.2024.3351556openalex-snapshot
Multivehicle Perimeter Defense in Conical Environments
inferred← citeshttps://doi.org/10.23919/acc55779.2023.10155838openalex-snapshot
Perimeter Defense Using a Turret with Finite Range and Startup Time
inferred← citeshttps://doi.org/10.23919/acc63710.2025.11107725openalex-snapshot
Competitive Perimeter Defense in Tree Environments
inferred← citeshttps://doi.org/10.48550/arxiv.0802.1685openalex-snapshot
Generalized Whac-a-Mole
inferred← citeshttps://doi.org/10.6100/ir616430openalex-snapshot
Models and algorithms for online server routing
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.