On the public citation graph
Optimal Mixed Graph Augmentation
0 signed · 32 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.3230150409openalex-snapshot
Strongly connected orientations of mixed multigraphs
inferredcites →https://doi.org/10.1002/net.3230160207openalex-snapshot
The minimum augmentation of a directed tree to a k ‐edge‐connected directed graph
inferredcites →https://doi.org/10.1080/00029890.1980.11995131openalex-snapshot
Robbins's Theorem for Mixed Multigraphs
inferredcites →https://doi.org/10.1137/0210019openalex-snapshot
Approximation Algorithms for Several Graph Augmentation Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4821442openalex-extracted
On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_77openalex-snapshot
On finding a smallest augmentation to biconnect a graph (Extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_185openalex-snapshot
Total protection of analytic invariant information in cross tabulated tables
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_150openalex-snapshot
Optimal bi-level augmentation for selective! enhancing graph connectivity with applications
inferred← citeshttps://doi.org/10.1007/978-0-387-39934-8_17openalex-snapshot
Twinless Strongly Connected Components
inferred← citeshttps://doi.org/10.1007/bfb0009497openalex-snapshot
Optimal augmentation for bipartite componentwise biconnectivity in linear time
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90038-7openalex-snapshot
Fast parallel strong orientation of mixed graphs and related augmentation problems
inferred← citeshttps://doi.org/10.1016/j.cor.2006.09.007openalex-snapshot
Statistical confidentiality: Optimization techniques to protect tables
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00349-3openalex-snapshot
Graph connectivity and its augmentation: applications of MA orderings
inferred← citeshttps://doi.org/10.1023/a:1009712000657openalex-snapshot
Efficient Detection and Protection of Information in Cross Tabulated Tables II: Minimal Linear Invariants
inferred← citeshttps://doi.org/10.1109/fscs.1990.89592openalex-snapshot
A fast algorithm for optimally increasing the edge-connectivity
inferred← citeshttps://doi.org/10.1109/fscs.1990.89593openalex-snapshot
Augmenting graphs to meet edge-connectivity requirements
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185418openalex-snapshot
A linear time algorithm for triconnectivity augmentation
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267817openalex-snapshot
On four-connecting a triconnected graph
inferred← citeshttps://doi.org/10.1109/ssdm.1997.621180openalex-snapshot
Security problems for statistical databases with general cell suppressions
inferred← citeshttps://doi.org/10.1137/0217034openalex-snapshot
A Graph Theoretic Approach to Statistical Data Security
inferred← citeshttps://doi.org/10.1137/0222056openalex-snapshot
Finding a Smallest Augmentation to Biconnect a Graph
inferred← citeshttps://doi.org/10.1137/0405003openalex-snapshot
Augmenting Graphs to Meet Edge-Connectivity Requirements
inferred← citeshttps://doi.org/10.1137/0406037openalex-snapshot
Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test
inferred← citeshttps://doi.org/10.1137/s0036142993226983openalex-snapshot
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
inferred← citeshttps://doi.org/10.1137/s0097539792234226openalex-snapshot
A Fast Algorithm for Optimally Increasing the Edge Connectivity
inferred← citeshttps://doi.org/10.1137/s0097539793253589openalex-snapshot
Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables
inferred← citeshttps://doi.org/10.1137/s0097539797332275openalex-snapshot
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
inferred← citeshttps://doi.org/10.1137/s0895480193243274openalex-snapshot
Data Security Equals Graph Connectivity
inferred← citeshttps://doi.org/10.1145/258533.258550openalex-snapshot
General techniques for comparing unrooted evolutionary trees
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0101032openalex-snapshot
Total Protection of Analytic Invariant Information in Cross Tabulated Tables
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.