On the public citation graph
On the integer-valued variables in the linear vertex packing problem
0 signed · 50 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/3-540-36478-1_3openalex-snapshot
Matching: A Well-Solved Class of Integer Linear Programs
inferredcites →https://doi.org/10.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/bf01593772openalex-snapshot
On the integer-valued variables in the linear vertex packing problem
inferredcites →https://doi.org/10.1515/9781400869930-015openalex-snapshot
ON MAXIMUM MATCHING, MINIMUM COVERING AND THEIR CONNECTIONS
inferredcites →https://doi.org/10.21236/ad0614578openalex-snapshot
PROGRAMMING IN NETWORKS AND GRAPHS
inferredcites →https://doi.org/10.2307/2005190openalex-snapshot
Proceedings of the Princeton Symposium on Mathematical Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118600245.ch8openalex-snapshot
Quadratic Optimization in 0–1 Variables
inferred← citeshttps://doi.org/10.1002/9781119005216.ch8openalex-snapshot
Quadratic Optimization in 0–1 Variables
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_27openalex-snapshot
Persistency of Linear Programming Relaxations for the Stable Set Problem
inferred← citeshttps://doi.org/10.1007/bf01581031openalex-snapshot
On the structure of all minimum cuts in a network and applications
inferred← citeshttps://doi.org/10.1007/bf01588228openalex-snapshot
Minimum node covers and 2-bicritical graphs
inferred← citeshttps://doi.org/10.1007/bf02612354openalex-snapshot
Roof duality, complementation and persistency in quadratic 0–1 optimization
inferred← citeshttps://doi.org/10.1007/bfb0120902openalex-snapshot
On the structure of all minimum cuts in a network and applications
inferred← citeshttps://doi.org/10.1007/s10107-004-0504-0openalex-snapshot
A polyhedral study of the generalized vertex packing problem
inferred← citeshttps://doi.org/10.1007/s10107-023-01977-xopenalex-snapshot
A theoretical and computational analysis of full strong-branching
inferred← citeshttps://doi.org/10.1007/s10288-018-0392-4openalex-snapshot
Linear and quadratic reformulations of nonlinear optimization problems in binary variables
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90273-dopenalex-snapshot
König-Egerváry graphs, 2-bicritical graphs and fractional matchings
inferred← citeshttps://doi.org/10.1016/0167-6377(85)90024-0openalex-snapshot
Random near-regular graphs and the node packing problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2010.03.003openalex-snapshot
Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times
inferred← citeshttps://doi.org/10.1016/j.cviu.2015.05.002openalex-snapshot
Higher order maximum persistency and comparison theorems
inferred← citeshttps://doi.org/10.1016/j.dam.2007.03.026openalex-snapshot
Crown reductions for the Minimum Weighted Vertex Cover problem
inferred← citeshttps://doi.org/10.1016/j.dam.2007.08.035openalex-snapshot
A network approach for specially structured linear programs arising in 0–1 quadratic optimization
inferred← citeshttps://doi.org/10.1016/j.disopt.2026.100955openalex-snapshot
Vertex packing linear programs and critical independent sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.09.011openalex-snapshot
Tractability of König edge deletion problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00341-9openalex-snapshot
Pseudo-Boolean optimization
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00181-xopenalex-snapshot
Pseudo-Hamiltonian-connected graphs
inferred← citeshttps://doi.org/10.1051/ro/1981150302131openalex-snapshot
Réductions et conditions d'optimalité dans le problème de l'ensemble stable de poids maximal
inferred← citeshttps://doi.org/10.1080/00207168208803311openalex-snapshot
Determining the number of internal stability of a graph
inferred← citeshttps://doi.org/10.1080/03155986.1982.11731876openalex-snapshot
Selected Applications of Minimum Cuts in Networks
inferred← citeshttps://doi.org/10.1109/cvpr.2014.152openalex-snapshot
Maximum Persistency in Energy Minimization
inferred← citeshttps://doi.org/10.1137/0603052openalex-snapshot
Vertices Belonging to All or to No Maximum Stable Sets of a Graph
inferred← citeshttps://doi.org/10.1145/2566616openalex-snapshot
Faster Parameterized Algorithms Using Linear Programming
inferred← citeshttps://doi.org/10.1145/2817460.2817503openalex-snapshot
Linear programming to approximate quadratic 0-1 maximization problems
inferred← citeshttps://doi.org/10.1287/ijoc.2021.1103openalex-snapshot
Estimating the Size of Branch-and-Bound Trees
inferred← citeshttps://doi.org/10.1287/moor.2022.0171openalex-snapshot
Persistency in Multilinear Optimization
inferred← citeshttps://doi.org/10.1287/moor.23.2.359openalex-snapshot
Persistency in 0-1 Polynomial Programming
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2012.338openalex-snapshot
LP can be a cure for Parameterized Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1203.0833openalex-snapshot
Faster Parameterized Algorithms using Linear Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1404.3653openalex-snapshot
Maximum Persistency in Energy Minimization
inferred← citeshttps://doi.org/10.48550/arxiv.1511.02591openalex-snapshot
Faster Randomized Branching Algorithms for $r$-SAT
inferred← citeshttps://doi.org/10.48550/arxiv.1811.04560openalex-snapshot
Tractability of Konig Edge Deletion Problems
inferred← citeshttps://doi.org/10.5772/54381openalex-snapshot
Parallel Robot Scheduling to Minimize Mean Tardiness with Unequal Release Date and Precedence Constraints Using a Hybrid Intelligent System
inferred← citeshttps://doi.org/10.7151/dmgt.2317openalex-snapshot
New results relating inependence and matchings
inferred← citeshttps://doi.org/10.7282/t3pz5bhqopenalex-snapshot
Algorithmic and complexity results for boolean and pseudo-boolean functions
showing the first 43 of 44 · page through all 44
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.