On the public citation graph

The perfectly Matchable Subgraph Polytope of an arbitrary graph

0 signed · 56 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.1002/net.3230130405openalex-snapshot

The perfectly matchable subgraph polytope of a bipartite graph

inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot

Paths, Trees, and Flowers

inferredcites →https://doi.org/10.1007/bfb0066196openalex-snapshot

Facets of I-matching polyhedra

inferredcites →https://doi.org/10.1016/0095-8956(71)90041-4openalex-snapshot

Perfect matchings of a graph

inferredcites →https://doi.org/10.1112/jlms/s1-22.2.107openalex-snapshot

The Factorization of Linear Graphs

inferredcites →https://doi.org/10.4153/cjm-1965-045-4openalex-snapshot

Paths, Trees, and Flowers

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.1002/9780470400531.eorms0262openalex-snapshot

Disjunctive Programming

inferred← citeshttps://doi.org/10.1007/11496915_6openalex-snapshot

A Combinatorial Algorithm to Find a Maximum Even Factor

inferred← citeshttps://doi.org/10.1007/3-540-45535-3_13openalex-snapshot

Bisubmodular Function Minimization

inferred← citeshttps://doi.org/10.1007/3-540-45586-8_2openalex-snapshot

Projection and Lifting in Combinatorial Optimization

inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_18openalex-snapshot

A Polytope for a Product of Real Linear Functions in 0/1 Variables

inferred← citeshttps://doi.org/10.1007/978-3-030-00148-3_2openalex-snapshot

The Convex Hull of a Disjunctive Set

inferred← citeshttps://doi.org/10.1007/978-3-030-00148-3_5openalex-snapshot

Disjunctive Programming and Extended Formulations

inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_1openalex-snapshot

Getting Started

inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_10openalex-snapshot

Semidefinite Bounds

inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_3openalex-snapshot

Linear Inequalities and Polyhedra

inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_4openalex-snapshot

Perfect Formulations

inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_7openalex-snapshot

Valid Inequalities for Structured Integer Programs

inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_8openalex-snapshot

Reformulations and Relaxations

inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_9openalex-snapshot

Enumeration

inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_31openalex-snapshot

On Polyhedra Related to Even Factors

inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_10openalex-snapshot

Disjunctive Programming

inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_40openalex-snapshot

A Faster Algorithm for the Maximum Even Factor Problem

inferred← citeshttps://doi.org/10.1007/bf01205074openalex-snapshot

b-matching degree-sequence polyhedra

inferred← citeshttps://doi.org/10.1007/bf01215915openalex-snapshot

The optimal path-matching problem

inferred← citeshttps://doi.org/10.1007/bf01580612openalex-snapshot

The convex hull of two core capacitated network design problems

inferred← citeshttps://doi.org/10.1007/bf01581694openalex-snapshot

A separation algorithm for the matchable set polytope

inferred← citeshttps://doi.org/10.1007/bf01582894openalex-snapshot

An analytical comparison of different formulations of the travelling salesman problem

inferred← citeshttps://doi.org/10.1007/bf02283693openalex-snapshot

Global optimization of a quadratic function subject to a bounded mixed integer consraint set

inferred← citeshttps://doi.org/10.1007/s00373-023-02719-8openalex-snapshot

Toric Rings of Perfectly Matchable Subgraph Polytopes

inferred← citeshttps://doi.org/10.1007/s00453-012-9642-6openalex-snapshot

Improved Algorithms for Even Factors and Square-Free Simple b-Matchings

inferred← citeshttps://doi.org/10.1007/s00454-022-00447-zopenalex-snapshot

PQ-Type Adjacency Polytopes of Join Graphs

inferred← citeshttps://doi.org/10.1007/s10288-010-0122-zopenalex-snapshot

Extended formulations in combinatorial optimization

inferred← citeshttps://doi.org/10.1007/s10479-005-3969-1openalex-snapshot

Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization

inferred← citeshttps://doi.org/10.1007/s10479-009-0623-3openalex-snapshot

Projecting systems of linear inequalities with binary variables

inferred← citeshttps://doi.org/10.1007/s10479-012-1269-0openalex-snapshot

Extended formulations in combinatorial optimization

inferred← citeshttps://doi.org/10.1016/0012-365x(92)00057-xopenalex-snapshot

Stable sets and polynomials

inferred← citeshttps://doi.org/10.1016/j.amc.2006.01.051openalex-snapshot

The maximum fuzzy weighted matching models and hybrid genetic algorithm

inferred← citeshttps://doi.org/10.1016/j.dam.2010.09.006openalex-snapshot

Matchability and k -maximal matchings

inferred← citeshttps://doi.org/10.1016/j.disc.2024.114018openalex-snapshot

Perfectly matchable set polynomials and h⁎-polynomials for stable set polytopes of complements of graphs

inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00199-9openalex-snapshot

An analytic symmetrization of max flow-min cut

inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00307-3openalex-snapshot

Discrete relaxations of combinatorial programs

inferred← citeshttps://doi.org/10.1016/s0167-8655(98)00008-7openalex-snapshot

A note on the weighted matching with penalty problem

inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00083-1openalex-snapshot

Projections of the capacitated network loading problem

inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80120-3openalex-snapshot

Chapter 3 Matching

inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01006-6openalex-snapshot

Chapter V Polyhedral combinatorics

inferred← citeshttps://doi.org/10.1023/a:1018368920203openalex-snapshot

Projection with a Minimal System of Inequalities

inferred← citeshttps://doi.org/10.1051/ro/2010004openalex-snapshot

Perfectly matchable subgraph problem on a bipartite graph

inferred← citeshttps://doi.org/10.1098/rsif.2025.0869openalex-snapshot

Elementary vectors reveal minimal interactions in microbial communities

inferred← citeshttps://doi.org/10.1109/sfcs.1996.548466openalex-snapshot

The optimal path-matching problem

inferred← citeshttps://doi.org/10.1137/0801013openalex-snapshot

Cones of Matrices and Set-Functions and 0–1 Optimization

inferred← citeshttps://doi.org/10.1137/s0895480103426339openalex-snapshot

Bisubmodular Function Minimization

inferred← citeshttps://doi.org/10.1137/s1052623402420346openalex-snapshot

Subset Algebra Lift Operators for 0-1 Integer Programming

inferred← citeshttps://doi.org/10.1287/moor.28.1.92.14263openalex-snapshot

A Separation Algorithm for b -Matching Degree-Sequence Polyhedra

inferred← citeshttps://doi.org/10.18154/rwth-2017-08718openalex-snapshot

Dekomposition von Ganzzahligen Programmen mit Matching Struktur

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.