On the public citation graph

Online matching: haste makes waste!

https://doi.org/10.1145/2897518.2897557
0 signed · 87 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.1006/jagm.1993.1026openalex-snapshot
Online Weighted Matching
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/978-3-540-30140-0_10openalex-snapshot
Graph Decomposition Lemmas and Their Role in Metric Embedding Methods
inferredcites →https://doi.org/10.1007/978-3-540-75520-3_24openalex-snapshot
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
inferredcites →https://doi.org/10.1007/978-3-540-75520-3_47openalex-snapshot
An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_39openalex-snapshot
The Price of Matching with Metric Preferences
inferredcites →https://doi.org/10.1016/0304-3975(94)90042-6openalex-snapshot
On-line algorithms for weighted bipartite matching and stable marriages
inferredcites →https://doi.org/10.1016/j.ejor.2006.06.004openalex-snapshot
On-line supply chain scheduling problems with preemption
inferredcites →https://doi.org/10.1016/j.ipl.2014.06.013openalex-snapshot
On the advice complexity of online bipartite matching and online stable marriage
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.011openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferredcites →https://doi.org/10.1016/j.orl.2013.10.002openalex-snapshot
Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem
inferredcites →https://doi.org/10.1109/sfcs.1986.14openalex-snapshot
Competitive snoopy caching
inferredcites →https://doi.org/10.1109/sfcs.1996.548477openalex-snapshot
Probabilistic approximation of metric spaces and its algorithmic applications
inferredcites →https://doi.org/10.1109/sfcs.2005.12openalex-snapshot
AdWords and Generalized On-line Matching
inferredcites →https://doi.org/10.1137/0210050openalex-snapshot
On a Greedy Heuristic for Complete Matching
inferredcites →https://doi.org/10.1137/s009753970037446xopenalex-snapshot
Minimizing the Flow Time Without Migration
inferredcites →https://doi.org/10.1137/s0895480198342310openalex-snapshot
The Online Transportation Problem
inferredcites →https://doi.org/10.1145/100216.100262openalex-snapshot
An optimal algorithm for on-line bipartite matching
inferredcites →https://doi.org/10.1145/129712.129768openalex-snapshot
Competitive distributed job scheduling (extended abstract)
inferredcites →https://doi.org/10.1145/1360443.1360462openalex-snapshot
On-line bipartite matching made simple
inferredcites →https://doi.org/10.1145/1374376.1374411openalex-snapshot
Randomized k-server on hierarchical binary trees
inferredcites →https://doi.org/10.1145/2764468.2764482openalex-snapshot
Near-Optimum Online Ad Allocation for Targeted Advertising
inferredcites →https://doi.org/10.1145/276698.276725openalex-snapshot
On approximating arbitrary metrices by tree metrics
inferredcites →https://doi.org/10.1145/276698.276792openalex-snapshot
TCP dynamic acknowledgment delay (extended abstract)
inferredcites →https://doi.org/10.1145/375827.375843openalex-snapshot
On-line analysis of the TCP acknowledgment delay problem
inferredcites →https://doi.org/10.1145/380752.380845openalex-snapshot
Dynamic TCP acknowledgement and other stories about e/(e-1)
inferredcites →https://doi.org/10.1561/0400000057openalex-snapshot
Online Matching and Ad Allocation
inferredcites →https://doi.org/10.5555/1109557.1109662openalex-snapshot
Randomized online algorithms for minimum metric bipartite matching
inferredcites →https://doi.org/10.5555/2133036.2133131openalex-snapshot
Online vertex-weighted bipartite matching and single-bid budgeted allocations
inferredcites →https://doi.org/10.5555/2627817.2627824openalex-snapshot
Randomized primal-dual analysis of RANKING for online bipartite matching
inferredcites →https://doi.org/10.5555/320176.320216openalex-snapshot
Competitive randomized algorithms for non-uniform problems
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices

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.3511444openalex-extracted
Quick or Cheap? Breaking Points in Dynamic Markets
inferred← citeshttps://doi.org/10.2139/ssrn.3524972openalex-extracted
Quick or Cheap? Breaking Points in Dynamic Markets
inferred← citeshttps://doi.org/10.1007/978-3-030-04693-4_2openalex-snapshot
Deterministic Min-Cost Matching with Delays
inferred← citeshttps://doi.org/10.1007/978-3-030-04693-4_4openalex-snapshot
A Primal-Dual Online Deterministic Algorithm for Matching with Delays
inferred← citeshttps://doi.org/10.1007/978-3-031-48974-7_20openalex-snapshot
Randomized Algorithm for MPMD on Two Sources
inferred← citeshttps://doi.org/10.1007/978-3-031-49193-1_18openalex-snapshot
Deterministic Primal-Dual Algorithms for Online k-Way Matching with Delays
inferred← citeshttps://doi.org/10.1007/978-3-031-81396-2_9openalex-snapshot
Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_18openalex-snapshot
Minimum Cost Perfect Matching with Delays for Two Sources
inferred← citeshttps://doi.org/10.1007/978-3-319-89441-6_11openalex-snapshot
A Match in Time Saves Nine: Deterministic Online Matching with Delays
inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_15openalex-snapshot
MPMD on Two Sources with Lookahead
inferred← citeshttps://doi.org/10.1007/s00224-019-09963-7openalex-snapshot
Deterministic Min-Cost Matching with Delays
inferred← citeshttps://doi.org/10.1007/s00224-024-10207-6openalex-snapshot
Online Matching with Delays and Stochastic Arrival Times
inferred← citeshttps://doi.org/10.1007/s00224-025-10230-1openalex-snapshot
Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
inferred← citeshttps://doi.org/10.1007/s00453-019-00569-6openalex-snapshot
Stable Secretaries
inferred← citeshttps://doi.org/10.1007/s00778-019-00568-7openalex-snapshot
Spatial crowdsourcing: a survey
inferred← citeshttps://doi.org/10.1007/s12597-026-01245-4openalex-snapshot
Optimization of sustainable sensor networks using graph parameter equivalence on unit disk graph corona products for smart cities
inferred← citeshttps://doi.org/10.1016/j.disopt.2021.100647openalex-snapshot
On bin packing with clustering and bin packing with delays
inferred← citeshttps://doi.org/10.1016/j.jmateco.2024.102987openalex-snapshot
Quick or Cheap? Breaking Points in Dynamic Markets
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114988openalex-snapshot
Deterministic primal-dual algorithms for online k-way matching with delays
inferred← citeshttps://doi.org/10.1109/focs.2019.00013openalex-snapshot
General Framework for Metric Optimization Problems with Delay or with Deadlines
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00129openalex-snapshot
Beyond Tree Embeddings – a Deterministic Framework for Network Design with Deadlines or Delay
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00057openalex-snapshot
A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows
inferred← citeshttps://doi.org/10.1109/icde.2019.00131openalex-snapshot
Minimizing Maximum Delay of Task Assignment in Spatial Crowdsourcing
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00051openalex-snapshot
Differentially Private Online Task Assignment in Spatial Crowdsourcing: A Tree-based Approach
inferred← citeshttps://doi.org/10.1137/1.9781611974782.67openalex-snapshot
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
inferred← citeshttps://doi.org/10.1137/1.9781611976465.20openalex-snapshot
The Min-Cost Matching with Concave Delays Problem
inferred← citeshttps://doi.org/10.1137/1.9781611976700.27openalex-snapshot
Adaptive Holding for Online Bottleneck Matching with Delays
inferred← citeshttps://doi.org/10.1137/20m1346286openalex-snapshot
Caching with Time Windows and Delays
inferred← citeshttps://doi.org/10.1142/s1793830921501561openalex-snapshot
Competitive analysis for two variants of online metric matching problem
inferred← citeshttps://doi.org/10.1142/s179383092350057xopenalex-snapshot
Capacity-insensitive algorithms for online facility assignment problems on a line
inferred← citeshttps://doi.org/10.1145/3055399.3055475openalex-snapshot
Online Service with Delay
inferred← citeshttps://doi.org/10.1145/3173127.3173145openalex-snapshot
SIGACT News Online Algorithms Column 32
inferred← citeshttps://doi.org/10.1145/3309697.3331519openalex-snapshot
The Segmentation-Thickness Tradeoff in Online Marketplaces
inferred← citeshttps://doi.org/10.1145/3322205.3311089openalex-snapshot
The Segmentation-Thickness Tradeoff in Online Marketplaces
inferred← citeshttps://doi.org/10.1145/3323165.3323180openalex-snapshot
The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays
inferred← citeshttps://doi.org/10.1145/3328526.3329573openalex-snapshot
Edge Weighted Online Windowed Matching
inferred← citeshttps://doi.org/10.1145/3328526.3329619openalex-snapshot
Incorporating Compatible Pairs in Kidney Exchange
inferred← citeshttps://doi.org/10.1145/3357713.3384277openalex-snapshot
Caching with time windows
inferred← citeshttps://doi.org/10.1145/3580507.3597660openalex-snapshot
Superiority of Instantaneous Decisions in Thin Dynamic Matching Markets
inferred← citeshttps://doi.org/10.1287/ijoc.2021.0203openalex-snapshot
An Approximate Dynamic Programming Approach to Dynamic Stochastic Matching
inferred← citeshttps://doi.org/10.1287/moor.2023.0333openalex-snapshot
Dynamic Bipartite Matching Markets with Stochastic Arrivals and Departures
inferred← citeshttps://doi.org/10.1287/opre.2022.2277openalex-snapshot
Technical Note—Online Hypergraph Matching with Delays
inferred← citeshttps://doi.org/10.14778/3748191.3748199openalex-snapshot
X-Blossom: Massive Parallelization of Graph Maximum Matching
inferred← citeshttps://doi.org/10.1609/aaai.v36i4.20299openalex-snapshot
Real-Time Driver-Request Assignment in Ridesourcing
inferred← citeshttps://doi.org/10.1609/aaai.v37i10.26417openalex-snapshot
Fully Online Matching with Stochastic Arrivals and Departures
inferred← citeshttps://doi.org/10.23919/ccc52363.2021.9549977openalex-snapshot
Rule Designs for Optimal Online Game Matchmaking
inferred← citeshttps://doi.org/10.32657/10356/155387openalex-snapshot
Online matching with its applications to ridesharing
inferred← citeshttps://doi.org/10.3390/electronics13040775openalex-snapshot
Fairness-Aware Dynamic Ride-Hailing Matching Based on Reinforcement Learning
inferred← citeshttps://doi.org/10.3929/ethz-b-000379990openalex-snapshot
Robust Global Localization Using GPS and Aircraft Signals
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2020.40openalex-snapshot
PERMUTATION Strikes Back: The Power of Recourse in Online Metric Matching
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2022.45openalex-snapshot
Online Facility Location with Linear Delay
inferred← citeshttps://doi.org/10.48550/arxiv.1807.08543openalex-snapshot
Set Cover with Delay -- Clairvoyance is not Required
inferred← citeshttps://doi.org/10.48550/arxiv.2109.06640openalex-snapshot
Online k-Way Matching with Delays and the H-Metric
inferred← citeshttps://doi.org/10.5555/3091125.3091277openalex-snapshot
Theoretical Foundations of Team Matchmaking
inferred← citeshttps://doi.org/10.70675/4e9493cbzab28z4c3dza5bbzd9e9a728e23fopenalex-snapshot
Exploring and optimizing data-driven service operations
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.