On the public citation graph

Alternating cycle-free matchings

https://doi.org/10.1007/bf00383169
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.1007/3-540-51498-8_7openalex-snapshot
The jump number problem for biconvex graphs and rectangle covers of rectangular regions
inferredcites →https://doi.org/10.1007/978-94-009-5315-4_2openalex-snapshot
Algorithmic Aspects of Comparability Graphs and Interval Graphs
inferredcites →https://doi.org/10.1007/978-94-009-5315-4_6openalex-snapshot
A Graph-Theoretic Approach to the Jump-Number Problem
inferredcites →https://doi.org/10.1007/bf00340778openalex-snapshot
A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
inferredcites →https://doi.org/10.1007/bf01788689openalex-snapshot
Optimizing weakly triangulated graphs
inferredcites →https://doi.org/10.1007/bf02579161openalex-snapshot
Perfect matchings in hexagonal systems
inferredcites →https://doi.org/10.1016/0012-365x(83)90154-1openalex-snapshot
Characterizations of strongly chordal graphs
inferredcites →https://doi.org/10.1016/0022-0000(86)90018-8openalex-snapshot
Chordality properties on graphs and minimal conceptual connections in semantic data models
inferredcites →https://doi.org/10.1016/0095-8956(74)90094-xopenalex-snapshot
The intersection graphs of subtrees in trees are exactly the chordal graphs
inferredcites →https://doi.org/10.1016/0095-8956(86)90043-2openalex-snapshot
Distance-hereditary graphs
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70060-8openalex-snapshot
The Jump Number of Dags and Posets: An Introduction
inferredcites →https://doi.org/10.1016/s0304-0208(08)73832-5openalex-snapshot
Comparability Invariants
inferredcites →https://doi.org/10.1090/s0002-9939-1982-0660592-3openalex-snapshot
Minimizing Setups for Cycle-Free Ordered Sets
inferredcites →https://doi.org/10.1090/s0002-9939-1983-0715851-3openalex-snapshot
Optimal Linear Extensions by Interchanging Chains
inferredcites →https://doi.org/10.1137/0217032openalex-snapshot
Distance-Hereditary Graphs, Steiner Trees, and Connected Domination

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-387-25592-3_4openalex-snapshot
The Maximum Independent Set Problem and Augmenting Graphs
inferred← citeshttps://doi.org/10.1007/11917496_28openalex-snapshot
Flexible Matchings
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_46openalex-snapshot
A Notion of Cross-Perfect Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_10openalex-snapshot
Flip Distances Between Graph Orientations
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_25openalex-snapshot
On the Complexity of Minimum Maximal Uniquely Restricted Matching
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_4openalex-snapshot
Combinatorics and Algorithms for Quasi-chain Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-18530-4_6openalex-snapshot
On Minimally Non-firm Binary Matrices
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_20openalex-snapshot
The Jump Number Problem: Exact and Parameterized
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_31openalex-snapshot
Jump Number of Two-Directional Orthogonal Ray Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-21518-6_9openalex-snapshot
On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_20openalex-snapshot
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition
inferred← citeshttps://doi.org/10.1007/bf00385814openalex-snapshot
Cycle-free partial orders and chordal comparability graphs
inferred← citeshttps://doi.org/10.1007/bfb0019434openalex-snapshot
The computation of the jump number of convex graphs
inferred← citeshttps://doi.org/10.1007/s00373-012-1230-7openalex-snapshot
On Unicyclic Graphs with Uniquely Restricted Maximum Matchings
inferred← citeshttps://doi.org/10.1007/s00453-021-00810-1openalex-snapshot
Independent Sets and Hitting Sets of Bicolored Rectangular Families
inferred← citeshttps://doi.org/10.1007/s00453-022-01019-6openalex-snapshot
Combinatorics and Algorithms for Quasi-Chain Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00350-ropenalex-snapshot
On edge perfectness and classes of bipartite graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90111-2openalex-snapshot
Computing the jump number on semi-orders is polynomial
inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.039openalex-snapshot
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
inferred← citeshttps://doi.org/10.1016/j.dam.2022.05.012openalex-snapshot
Positive matching decompositions of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.06.019openalex-snapshot
The difficulty of beating the Taxman
inferred← citeshttps://doi.org/10.1016/j.disc.2004.02.008openalex-snapshot
Chordal bipartite graphs of bounded tree- and clique-width
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.03.001openalex-snapshot
The bipartite margin shop and maximum red matchings free of blue–red alternating cycles
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.06.003openalex-snapshot
Connected matchings in chordal bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.055openalex-snapshot
Unicycle graphs and uniquely restricted maximum matchings
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.013openalex-snapshot
NP-hard graph problems and boundary classes of graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.05.036openalex-snapshot
On the complexity of minimum maximal uniquely restricted matching
inferred← citeshttps://doi.org/10.1016/j/ipl.2003.08.006openalex-snapshot
A notion of cross-perfect bipartite graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00398-6openalex-snapshot
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00039-0openalex-snapshot
Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70395-9openalex-snapshot
Matching and Vertex Packing: How “hard” are They?
inferred← citeshttps://doi.org/10.1023/a:1006437630359openalex-snapshot
On the Jump Number Problem in Hereditary Classes of Bipartite Graphs
inferred← citeshttps://doi.org/10.1023/a:1024417802690openalex-snapshot
A Weighted Version of the Jump Number Problem on Two-Dimensional Orders is NP-Complete
inferred← citeshttps://doi.org/10.1080/15627020.2021.1885990openalex-snapshot
Stakeholders’ perceptions of mammal occurrence and abundance on agricultural properties bordering the Boland Mountain Complex, South Africa
inferred← citeshttps://doi.org/10.1109/aspdac.2006.1594648openalex-snapshot
Efficient static timing analysis using a unified framework for false paths and multi-cycle paths
inferred← citeshttps://doi.org/10.1109/iccad.2005.1560123openalex-snapshot
Improving the efficiency of static timing analysis with false paths
inferred← citeshttps://doi.org/10.1145/1118299.1118317openalex-snapshot
Efficient static timing analysis using a unified framework for false paths and multi-cycle paths
inferred← citeshttps://doi.org/10.1145/1377836.1377838openalex-snapshot
Fast exact and heuristic methods for role minimization problems
inferred← citeshttps://doi.org/10.1145/3115936.3115944openalex-snapshot
Parallel Sparse PLUQ Factorization modulo p
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.