On the public citation graph
Cuts, matrix completions and graph rigidity
0 signed · 86 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.1002/net.3230130202openalex-snapshot
Steiner trees, partial 2–trees, and minimum IFI networks
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-1-4757-2878-1_17openalex-snapshot
A Tabu Based Pattern Search Method for the Distance Geometry Problem
inferredcites →https://doi.org/10.1007/978-3-642-04295-9openalex-snapshot
Geometry of Cuts and Metrics
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01420337openalex-snapshot
A note on extreme positive definite matrices
inferredcites →https://doi.org/10.1007/bf01534980openalex-snapshot
On graphs and rigidity of plane skeletal structures
inferredcites →https://doi.org/10.1007/bf01580600openalex-snapshot
On cuts and matchings in planar graphs
inferredcites →https://doi.org/10.1007/bf02063286openalex-snapshot
Über eine Punktverteilung auf der Kugel
inferredcites →https://doi.org/10.1007/bf02574037openalex-snapshot
Problems of distance geometry and convex properties of quadratic maps
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02614433openalex-snapshot
An exact duality theory for semidefinite programming and its complexity implications
inferredcites →https://doi.org/10.1007/bf03220000openalex-snapshot
Extreme points of a convex subset of the cone of positive semidefinite matrices
inferredcites →https://doi.org/10.1016/0012-365x(85)90051-2openalex-snapshot
Decomposition by clique separators
inferredcites →https://doi.org/10.1016/0012-365x(95)00107-8openalex-snapshot
Structural conditions for cycle completable graphs
inferredcites →https://doi.org/10.1016/0022-247x(65)90125-3openalex-snapshot
Topology of series-parallel networks
inferredcites →https://doi.org/10.1016/0024-3795(84)90207-6openalex-snapshot
Positive definite completions of partial Hermitian matrices
inferredcites →https://doi.org/10.1016/0024-3795(90)90006-xopenalex-snapshot
Extremal correlation matrices
inferredcites →https://doi.org/10.1016/0024-3795(93)90234-fopenalex-snapshot
The real positive definite completion problem for a simple cycle
inferredcites →https://doi.org/10.1016/0024-3795(95)00271-ropenalex-snapshot
On a positive semidefinite relaxation of the cut polytope
inferredcites →https://doi.org/10.1016/0024-3795(95)00741-5openalex-snapshot
The real positive semidefinite completion problem for series-parallel graphs
inferredcites →https://doi.org/10.1016/0165-6147(89)90173-9openalex-snapshot
Distance geometry and molecular conformation
inferredcites →https://doi.org/10.1016/s0024-3795(97)83714-7openalex-snapshot
A connection between positive semidefinite and Euclidean distance matrix completion problems
inferredcites →https://doi.org/10.1016/s0169-7161(82)02016-1openalex-snapshot
13 Theory of multidimensional scaling
inferredcites →https://doi.org/10.1017/cbo9780511662041.002openalex-snapshot
Matroids and Rigid Structures
inferredcites →https://doi.org/10.1023/a:1018363021404openalex-snapshot
An Interior-Point Method for Approximate Positive Semidefinite Completions
inferredcites →https://doi.org/10.1038/sj.jors.2600538openalex-snapshot
Annotated Bibliographies in Combinatorial Optimization
inferredcites →https://doi.org/10.1080/00029890.1981.11995175openalex-snapshot
Rigid and Flexible Frameworks
inferredcites →https://doi.org/10.1080/03081089508818392openalex-snapshot
The Euclidean distance completion problem: cycle completability
inferredcites →https://doi.org/10.1090/dimacs/020/04openalex-snapshot
Maximum cuts and large bipartite subgraphs
inferredcites →https://doi.org/10.1090/fic/018openalex-snapshot
Topics in Semidefinite and Interior-Point Methods
inferredcites →https://doi.org/10.1090/fic/018/05openalex-snapshot
A tour d’horizon on positive semidefinite and Euclidean distance matrix completion problems
inferredcites →https://doi.org/10.1090/memo/0584openalex-snapshot
The real positive definite completion problem: cycle completability
inferredcites →https://doi.org/10.1090/psapm/040/1059486openalex-snapshot
Matrix completion problems: a survey
inferredcites →https://doi.org/10.1090/s0002-9947-1938-1501980-0openalex-snapshot
Metric spaces and positive definite functions
inferredcites →https://doi.org/10.1109/sfcs.1979.39openalex-snapshot
Some theoretical aspects of position-location problems
inferredcites →https://doi.org/10.1126/science.2911719openalex-snapshot
Protein Structure Determination in Solution by Nuclear Magnetic Resonance Spectroscopy
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0221008openalex-snapshot
Conditions for Unique Graph Realizations
inferredcites →https://doi.org/10.1137/0805002openalex-snapshot
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
inferredcites →https://doi.org/10.1137/0805040openalex-snapshot
The Molecule Problem: Exploiting Structure in Global Optimization
inferredcites →https://doi.org/10.1137/1.9781611970791openalex-snapshot
Interior-Point Polynomial Algorithms in Convex Programming
inferredcites →https://doi.org/10.1137/s0895479892240683openalex-snapshot
A Note on Extreme Correlation Matrices
inferredcites →https://doi.org/10.1137/s0895479893249757openalex-snapshot
The Euclidian Distance Matrix Completion Problem
inferredcites →https://doi.org/10.1145/195058.195216openalex-snapshot
.879-approximation algorithms for MAX CUT and MAX 2SAT
inferredcites →https://doi.org/10.1145/62212.62252openalex-snapshot
Forests, frames, and games: algorithms for matroid sums and applications
inferredcites →https://doi.org/10.2140/pjm.1980.90.27openalex-snapshot
When is a bipartite graph a rigid framework?
inferredcites →https://doi.org/10.2307/1968652openalex-snapshot
Sur La Definition Axiomatique D'Une Classe D'Espaces Vectoriels Distancies Applicables Vectoriellement Sur L'Espace de Hilbert
inferredcites →https://doi.org/10.2307/1968654openalex-snapshot
Remarks to Maurice Frechet's Article ``Sur La Definition Axiomatique D'Une Classe D'Espace Distances Vectoriellement Applicable Sur L'Espace De Hilbert
inferredcites →https://doi.org/10.5860/choice.27-0916openalex-snapshot
Distance geometry and molecular conformation
inferredcites →https://doi.org/10.6028/jres.069b.004openalex-snapshot
Minimum partition of a matroid into independent subsets
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-1-4612-1384-0_17openalex-snapshot
Conditional and Partial Correlation For Graphical Uncertainty Models
inferred← citeshttps://doi.org/10.1007/978-1-4614-5128-0_13openalex-snapshot
DC Programming Approaches for Distance Geometry Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-5284-7_11openalex-snapshot
D.C. Programming Approach to the Multidimensional Scaling Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_400-1openalex-snapshot
Molecular Distance Geometry Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-97846-8_8openalex-snapshot
EDM Completions and Bar Frameworks
inferred← citeshttps://doi.org/10.1007/978-3-319-97846-8_9openalex-snapshot
Local and Infinitesimal Rigidities
inferred← citeshttps://doi.org/10.1007/s10208-014-9240-xopenalex-snapshot
The Euclidean Distance Degree of an Algebraic Variety
inferred← citeshttps://doi.org/10.1007/s10208-023-09637-4openalex-snapshot
Computational Complexity of Decomposing a Symmetric Matrix as a Sum of Positive Semidefinite and Diagonal Matrices
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2011.12.012openalex-snapshot
Modular Truss-Z system for self-supporting skeletal free-form pedestrian networks
inferred← citeshttps://doi.org/10.1016/j.jfa.2022.109593openalex-snapshot
Phase retrieval of complex and vector-valued functions
inferred← citeshttps://doi.org/10.1016/j.laa.2010.04.012openalex-snapshot
A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00066-5openalex-snapshot
Graph rigidity via Euclidean distance matrices
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00281-0openalex-snapshot
On rigidity and realizability of weighted graphs
inferred← citeshttps://doi.org/10.1016/s0024-3795(03)00507-xopenalex-snapshot
A parameterization of positive definite matrices in terms of partial correlation vines
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00352-3openalex-snapshot
Semidefinite programming for discrete optimization and matrix completion problems
inferred← citeshttps://doi.org/10.1109/acc.2003.1243403openalex-snapshot
Cooperative control of multi-vehicle systems using cost graphs and optimization
inferred← citeshttps://doi.org/10.1109/cdc.2002.1184493openalex-snapshot
Distributed structural stabilization and tracking for formations of dynamic multi-agents
inferred← citeshttps://doi.org/10.1137/120875909openalex-snapshot
Euclidean Distance Geometry and Applications
inferred← citeshttps://doi.org/10.1137/15m103710xopenalex-snapshot
Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
inferred← citeshttps://doi.org/10.1137/17m1122049openalex-snapshot
Weak Rigidity Theory and Its Application to Formation Stabilization
inferred← citeshttps://doi.org/10.1137/s0895479899352689openalex-snapshot
Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems
inferred← citeshttps://doi.org/10.1137/s1052623400366218openalex-snapshot
Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
inferred← citeshttps://doi.org/10.1137/s1052623498342794openalex-snapshot
Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
inferred← citeshttps://doi.org/10.1587/transinf.e95.d.2599openalex-snapshot
Fast and Accurate PSD Matrix Estimation by Row Reduction
inferred← citeshttps://doi.org/10.4171/pm/1881openalex-snapshot
Euclidean distance matrices, semidefinite programming and sensor network localization
inferred← citeshttps://doi.org/10.48550/arxiv.1309.0049openalex-snapshot
The Euclidean distance degree of an algebraic variety
inferred← citeshttps://doi.org/10.5802/ojmo.18openalex-snapshot
Cycle-based formulations in Distance Geometry
inferred← citeshttps://doi.org/10.70675/562d6294z3740z4f80z9c00z3d4d297d74cbopenalex-snapshot
Algorithmic configuration by learning and optimization
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.