On the public citation graph
Solving Linear Programs without Breaking Abstractions
0 signed · 60 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-3-540-25960-2_15openalex-snapshot
A Faster Exact Separation Algorithm for Blossom Inequalities
inferredcites →https://doi.org/10.1007/978-3-642-15025-8openalex-snapshot
Fields of logic and computation: essays dedicated to Yuri Gurevich on the occasion of his 70th birthday
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-662-07003-1openalex-snapshot
Elements of Finite Model Theory
inferredcites →https://doi.org/10.1007/978-3-662-44777-2_42openalex-snapshot
Dimension Reduction via Colour Refinement
inferredcites →https://doi.org/10.1007/bf01071394openalex-snapshot
Cut-off method with space extension in convex programming problems
inferredcites →https://doi.org/10.1007/bf01192523openalex-snapshot
Minimizing submodular functions over families of sets
inferredcites →https://doi.org/10.1007/bf01305232openalex-snapshot
An optimal lower bound on the number of variables for graph identification
inferredcites →https://doi.org/10.1007/bf01305952openalex-snapshot
A theory of alternating paths and blossoms for proving correctness of the $$O(\sqrt V E)$$ general graph maximum matching algorithm
inferredcites →https://doi.org/10.1007/bf02341816openalex-snapshot
Utilization of the operation of space dilatation in the minimization of convex functions
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1016/0020-0190(79)90152-2openalex-snapshot
Linear programming is log-space hard for P
inferredcites →https://doi.org/10.1016/0022-0000(82)90012-5openalex-snapshot
Structure and complexity of relational queries
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/j.tcs.2008.12.049openalex-snapshot
Affine systems of equations and counting infinitary logic
inferredcites →https://doi.org/10.1016/s0019-9958(86)80029-8openalex-snapshot
Relational queries computable in polynomial time
inferredcites →https://doi.org/10.1016/s0168-0072(99)00005-6openalex-snapshot
Choiceless polynomial time
inferredcites →https://doi.org/10.1109/lics.2013.23openalex-snapshot
Maximum Matching and Linear Programming in Fixed-Point Logic with Counting
inferredcites →https://doi.org/10.1109/sfcs.1980.12openalex-snapshot
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
inferredcites →https://doi.org/10.1137/0403036openalex-snapshot
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
inferredcites →https://doi.org/10.1145/2090236.2090265openalex-snapshot
Sherali-Adams relaxations and indistinguishability in counting logics
inferredcites →https://doi.org/10.1145/2371656.2371662openalex-snapshot
Fixed-point definability and polynomial time on graphs with excluded minors
inferredcites →https://doi.org/10.1145/2529989openalex-snapshot
Linear-Time Approximation for Maximum Weight Matching
inferredcites →https://doi.org/10.1145/2591796.2591834openalex-snapshot
The matching polytope has exponential extension complexity
inferredcites →https://doi.org/10.1145/800057.808695openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.1145/990308.990310openalex-snapshot
Smoothed analysis of algorithms
inferredcites →https://doi.org/10.1287/moor.7.1.67openalex-snapshot
Odd Minimum Cut-Sets and b -Matchings
inferredcites →https://doi.org/10.17863/cam.646openalex-snapshot
On Symmetric Circuits and Fixed-Point Logics
inferredcites →https://doi.org/10.18452/16335openalex-snapshot
The structure of graphs and new logics for the characterization of Polynomial Time
inferredcites →https://doi.org/10.2178/jsl/1190150152openalex-snapshot
On polynomial time computation over unordered structures
inferredcites →https://doi.org/10.48550/arxiv.1204.1990openalex-snapshot
Pebble Games and Linear Equations
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.1007/978-3-030-25027-0_8openalex-snapshot
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_25openalex-snapshot
On the Weisfeiler-Leman Dimension of Fractional Packing
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104803openalex-snapshot
On the Weisfeiler-Leman dimension of fractional packing
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.04.003openalex-snapshot
On Weisfeiler-Leman invariance: Subgraph counts and related graph properties
inferred← citeshttps://doi.org/10.1093/logcom/exz022openalex-snapshot
Definable inapproximability: new challenges for duplicator
inferred← citeshttps://doi.org/10.1109/lics.2017.8005081openalex-snapshot
Descriptive complexity of linear equation systems and applications to propositional proof complexity
inferred← citeshttps://doi.org/10.1109/lics.2017.8005082openalex-snapshot
Definability of summation problems for Abelian groups and semigroups
inferred← citeshttps://doi.org/10.1109/lics.2017.8005108openalex-snapshot
Definability of semidefinite programming and lasserre lower bounds for CSPs
inferred← citeshttps://doi.org/10.1109/lics.2019.8785682openalex-snapshot
Canonisation and Definability for Graphs of Bounded Rank Width
inferred← citeshttps://doi.org/10.1109/lics.2019.8785792openalex-snapshot
On the Power of Symmetric Linear Programs
inferred← citeshttps://doi.org/10.1137/20m1338435openalex-snapshot
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem
inferred← citeshttps://doi.org/10.1145/3209108.3209186openalex-snapshot
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem
inferred← citeshttps://doi.org/10.1145/3568025openalex-snapshot
Canonisation and Definability for Graphs of Bounded Rank Width
inferred← citeshttps://doi.org/10.1145/3665453.3665459openalex-snapshot
A Logic for P: Are we Nearly There Yet?
inferred← citeshttps://doi.org/10.46298/lmcs-20(2:3)2024openalex-snapshot
Inapproximability of Unique Games in Fixed-Point Logic with Counting
inferred← citeshttps://doi.org/10.48550/arxiv.1602.05409openalex-snapshot
Lasserre Lower Bounds and Definability of Semidefinite Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1811.04801openalex-snapshot
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties
inferred← citeshttps://doi.org/10.48550/arxiv.1910.11325openalex-snapshot
On the Weisfeiler-Leman Dimension of Fractional Packing
inferred← citeshttps://doi.org/10.5555/3329995.3330017openalex-snapshot
Definability of summation problems for abelian groups and semigroups
inferred← citeshttps://doi.org/10.5555/3329995.3330043openalex-snapshot
Definability of semidefinite programming and lasserre lower bounds for CSPs
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.