On the public citation graph

Typical properties of winners and losers in discrete optimization

0 signed · 46 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.1998.0954openalex-snapshot
Average-Case Analysis of Off-Line and On-Line Knapsack Problems
inferredcites →https://doi.org/10.1007/3-540-61422-2_121openalex-snapshot
The constrained minimum spanning tree problem
inferredcites →https://doi.org/10.1007/978-1-4612-5791-2_22openalex-snapshot
On the Average Difference between the Solutions to Linear and Integer Knapsack Problems
inferredcites →https://doi.org/10.1007/978-3-540-45138-9_14openalex-snapshot
Smoothed Analysis of Three Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf01585941openalex-snapshot
Linear programming, complexity theory and elementary functional analysis
inferredcites →https://doi.org/10.1007/bf02579206openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1016/0166-218x(87)90067-9openalex-snapshot
Exact arborescences, matchings and cycles
inferredcites →https://doi.org/10.1137/0215020openalex-snapshot
Average Case Complete Problems
inferredcites →https://doi.org/10.1137/0805026openalex-snapshot
Incorporating Condition Measures into the Complexity Theory of Linear Programming
inferredcites →https://doi.org/10.1145/380752.380813openalex-snapshot
Smoothed analysis of algorithms
inferredcites →https://doi.org/10.1145/780542.780578openalex-snapshot
Random knapsack in expected polynomial time
inferredcites →https://doi.org/10.1145/800057.808701openalex-snapshot
On finding the exact solution of a zero-one knapsack problem
inferredcites →https://doi.org/10.1287/moor.14.1.162openalex-snapshot
Probabilistic Analysis of the Multidimensional Knapsack Problem
inferredcites →https://doi.org/10.5555/982792.982859openalex-snapshot
Probabilistic Analysis of Knapsack Core Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.20172openalex-snapshot
The diameter of randomly perturbed digraphs and some applications
inferred← citeshttps://doi.org/10.1007/11496915_21openalex-snapshot
Smoothed Analysis of Integer Programming
inferred← citeshttps://doi.org/10.1007/11533719_3openalex-snapshot
Smoothed Analysis of Algorithms and Heuristics
inferred← citeshttps://doi.org/10.1007/11537311_2openalex-snapshot
The Smoothed Analysis of Algorithms
inferred← citeshttps://doi.org/10.1007/11602613_68openalex-snapshot
Decision Making Based on Approximate and Smoothed Pareto Curves
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_43openalex-snapshot
Smoothed Analysis of Local Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_31openalex-snapshot
The Diameter of Randomly Perturbed Digraphs and Some Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_9openalex-snapshot
Labeling Smart Dust
inferred← citeshttps://doi.org/10.1007/978-3-540-78808-9_3openalex-snapshot
Expansion and Lack Thereof in Randomly Perturbed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_22openalex-snapshot
Algorithm Engineering – An Attempt at a Definition
inferred← citeshttps://doi.org/10.1007/978-3-642-14866-8_5openalex-snapshot
Chapter 5. Realistic Computer Models
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_15openalex-snapshot
Settling the Complexity of Local Max-Cut (Almost) Completely
inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_18openalex-snapshot
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching
inferred← citeshttps://doi.org/10.1007/s00453-011-9490-9openalex-snapshot
On Smoothed Analysis of Quicksort and Hoare’s Find
inferred← citeshttps://doi.org/10.1007/s10107-006-0055-7openalex-snapshot
Smoothed analysis of integer programming
inferred← citeshttps://doi.org/10.1016/j.scico.2014.10.007openalex-snapshot
An integrated framework for adapting WS-BPEL scenario execution using QoS and collaborative filtering techniques
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.034openalex-snapshot
Decision-making based on approximate and smoothed Pareto curves
inferred← citeshttps://doi.org/10.1080/15427951.2007.10129290openalex-snapshot
Expansion and Lack Thereof in Randomly Perturbed Graphs
inferred← citeshttps://doi.org/10.1109/focs.2010.79openalex-snapshot
Black-Box Randomized Reductions in Algorithmic Mechanism Design
inferred← citeshttps://doi.org/10.1134/s1064230718010045openalex-snapshot
An Average Polynomial Algorithm for Solving Antagonistic Games on Graphs
inferred← citeshttps://doi.org/10.1137/070709037openalex-snapshot
Dynamic Programming Optimization over Random Data: The Scaling Exponent for Near-Optimal Solutions
inferred← citeshttps://doi.org/10.1142/1181openalex-snapshot
Algorithms and Complexity
inferred← citeshttps://doi.org/10.1142/9789814324359_0005openalex-snapshot
The work of Daniel A. Spielman
inferred← citeshttps://doi.org/10.1145/1562764.1562785openalex-snapshot
Smoothed analysis
inferred← citeshttps://doi.org/10.1145/3627708openalex-snapshot
“Intelligent Heuristics Are the Future of Computing”
inferred← citeshttps://doi.org/10.17877/de290r-255openalex-snapshot
Über die Analyse randomisierter Suchheuristiken und den Entwurf spezialisierter Algorithmen im Bereich der kombinatorischen Optimierung
inferred← citeshttps://doi.org/10.33540/2424openalex-snapshot
Branch-and-bound trees, integrality gaps and online optimization
inferred← citeshttps://doi.org/10.3990/1.9789036540971openalex-snapshot
Smoothed analysis of belief propagation and minimum-cost flow algorithms
inferred← citeshttps://doi.org/10.4086/toc.2014.v010a010openalex-snapshot
inferred← citeshttps://doi.org/10.4171/msl/35openalex-snapshot
The smoothed complexity of Frank–Wolfe methods via conditioning of random matrices and polytopes
inferred← citeshttps://doi.org/10.48550/arxiv.1111.4649openalex-snapshot
Integer Feasibility of Random Polytopes
inferred← citeshttps://doi.org/10.7155/jgaa.00310openalex-snapshot
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching
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.