On the public citation graph
Augmenting Graphs to Meet Edge-Connectivity Requirements
0 signed · 245 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.3230010108openalex-snapshot
Minimal k‐arc connected graphs
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.1002/net.3230190112openalex-snapshot
The minimum augmentation of any graph to a K‐edge‐connected graph
inferredcites →https://doi.org/10.1007/bf01589418openalex-snapshot
Generalized polymatroids and submodular flows
inferredcites →https://doi.org/10.1007/bf02579270openalex-snapshot
How to make a digraph strongly connected
inferredcites →https://doi.org/10.1016/0022-0000(87)90038-9openalex-snapshot
Edge-connectivity augmentation problems
inferredcites →https://doi.org/10.1016/0024-3795(89)90469-2openalex-snapshot
An application of submodular flows
inferredcites →https://doi.org/10.1016/0166-218x(90)90116-topenalex-snapshot
A smallest augmentation to 3-connect a graph
inferredcites →https://doi.org/10.1016/b978-0-444-86893-0.50021-8openalex-snapshot
GENERALIZED POLYMATROIDS
inferredcites →https://doi.org/10.1016/s0167-5060(08)70504-1openalex-snapshot
A Reduction Method for Edge-Connectivity in Graphs
inferredcites →https://doi.org/10.1016/s0195-6698(82)80009-7openalex-snapshot
Konstruktion aller n-fach kantenzusammenhängenden Digraphen
inferredcites →https://doi.org/10.1073/pnas.48.7.1142openalex-snapshot
THE MAXIMUM CONNECTIVITY OF A GRAPH
inferredcites →https://doi.org/10.1109/fscs.1990.89592openalex-snapshot
A fast algorithm for optimally increasing the edge-connectivity
inferredcites →https://doi.org/10.1109/tct.1970.1083185openalex-snapshot
Connectivity considerations in the design of survivable networks
inferredcites →https://doi.org/10.1112/jlms/s2-17.3.369openalex-snapshot
A Minimax Theorem for Directed Graphs
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1287/opre.29.6.1039openalex-snapshot
Feature Article—The Ellipsoid Method: A Survey
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199907)31:3<179::aid-jgt3>3.0.co;2-7openalex-snapshot
Extremal graphs in connectivity augmentation
inferred← citeshttps://doi.org/10.1002/jgt.10104openalex-snapshot
Highly edge‐connected detachments of graphs and digraphs
inferred← citeshttps://doi.org/10.1002/jgt.20157openalex-snapshot
A characterization of weakly four‐connected graphs
inferred← citeshttps://doi.org/10.1002/jgt.21643openalex-snapshot
Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph
inferred← citeshttps://doi.org/10.1002/jgt.22020openalex-snapshot
Characterization of Digraphic Sequences with Strongly Connected Realizations
inferred← citeshttps://doi.org/10.1002/net.20072openalex-snapshot
Design of Survivable Networks: A survey
inferred← citeshttps://doi.org/10.1002/net.20316openalex-snapshot
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
inferred← citeshttps://doi.org/10.1002/net.4openalex-snapshot
Multigraph augmentation under biconnectivity and general edge‐connectivity requirements
inferred← citeshttps://doi.org/10.1006/jagm.1998.0983openalex-snapshot
Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time
inferred← citeshttps://doi.org/10.1006/jagm.1999.1005openalex-snapshot
Two-Connected Augmentation Problems in Planar Graphs
inferred← citeshttps://doi.org/10.1006/jagm.1999.1040openalex-snapshot
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
inferred← citeshttps://doi.org/10.1006/jagm.2000.1093openalex-snapshot
Augmenting Undirected Edge Connectivity in Õ(n2) Time
inferred← citeshttps://doi.org/10.1006/jagm.2000.1119openalex-snapshot
Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
inferred← citeshttps://doi.org/10.1007/11602613_9openalex-snapshot
Minimizing a Monotone Concave Function with Laminar Covering Constraints
inferred← citeshttps://doi.org/10.1007/11786986_39openalex-snapshot
Tight Approximation Algorithm for Connectivity Augmentation Problems
inferred← citeshttps://doi.org/10.1007/11970125_15openalex-snapshot
Network Design with Edge-Connectivity and Degree Constraints
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_14openalex-snapshot
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_27openalex-snapshot
A Near Optimal Algorithm for Vertex Connectivity Augmentation
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_28openalex-snapshot
Simultaneous Augmentation of Two Graphs to an ℓEdge-Connected Graph and a Biconnected Graph
inferred← citeshttps://doi.org/10.1007/3-540-44666-4_13openalex-snapshot
A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_14openalex-snapshot
The (σ + 1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_21openalex-snapshot
Independence Free Graphs and Vertex connectivity Augmentation
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_12openalex-snapshot
On the Minimum Local-Vertex-Connectivity Augmentation in Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_30openalex-snapshot
Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_10openalex-snapshot
Approximation Algorithms for Restoration Capacity Planning
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_36openalex-snapshot
Augmenting a(k—1)-Vertex-ConnectedMultigraph to an ℓ-Edge-Connected and k-Vertex-Connected Multigraph
inferred← citeshttps://doi.org/10.1007/3-540-48518-x_12openalex-snapshot
Algorithms for Restoration Planning in a Telecommunications Network
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_21openalex-snapshot
Edge-Splitting Problems with Demands
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_18openalex-snapshot
k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_19openalex-snapshot
Polyhedral Structure of Submodular and Posi-modular Systems
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_59openalex-snapshot
Increasing the vertex-connectivity in directed graphs
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_181openalex-snapshot
Computing all small cuts in undirected networks
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_184openalex-snapshot
Minimum augmentation to k-edge-connect specified vertices of a graph
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_363openalex-snapshot
The polyhedral approach to the maximum planar subgraph problem: New chances for related problems
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_68openalex-snapshot
A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_69openalex-snapshot
How to make a strongly connected digraph two-connected
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_166openalex-snapshot
A polyhedral approach to planar augmentation and related problems
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/3-540-63890-3_12openalex-snapshot
Augmenting edge and vertex connectivities simultaneously
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_8openalex-snapshot
Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_15openalex-snapshot
Polyhedral Approaches to the Design of Survivable Networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_17openalex-snapshot
Plane Geometric Graph Augmentation: A Generic Perspective
inferred← citeshttps://doi.org/10.1007/978-1-4614-3906-6_7openalex-snapshot
Robustness and Strong Attack Tolerance of Low-Diameter Networks
inferred← citeshttps://doi.org/10.1007/978-1-4757-3171-2_11openalex-snapshot
A Fully Polynomial Approximation Scheme for the Euclidean Steiner Augmentation Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_25openalex-snapshot
A New Contraction Technique with Applications to Congruency-Constrained Cuts
inferred← citeshttps://doi.org/10.1007/978-3-030-57796-4_47openalex-snapshot
Reliable Network Design Considering Cost to Decrease Failure Probability of Simultaneous Failure
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_22openalex-snapshot
Realization Problems on Reachability Sequences
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_1openalex-snapshot
Relaxed and Approximate Graph Realizations
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_5openalex-snapshot
Composed Degree-Distance Realizations of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-22050-0_8openalex-snapshot
Fault-Tolerant Graph Realizations in the Congested Clique
inferred← citeshttps://doi.org/10.1007/978-3-031-24848-1_6openalex-snapshot
Fault-Tolerant Graph Realizations in the Congested Clique, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_9openalex-snapshot
Augmenting Plane Straight-Line Graphs to Meet Parity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_28openalex-snapshot
Realizing Temporal Transportation Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_3openalex-snapshot
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_37openalex-snapshot
Posimodular Function Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-30559-0_30openalex-snapshot
Edge-Connectivity Augmentation and Network Matrices
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_6openalex-snapshot
Edge-Connection of Graphs, Digraphs, and Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_23openalex-snapshot
Subgraph Induced Planar Connectivity Augmentation
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_43openalex-snapshot
Augmenting Local Edge-Connectivity between Vertices and Vertex Subsets in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_28openalex-snapshot
A New Approach to Splitting-Off
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_22openalex-snapshot
Edge-Connectivity Augmentations of Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_6openalex-snapshot
A Survey on Covering Supermodular Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-85221-6_4openalex-snapshot
Variations for Lovász’ Submodular Ideas
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_12openalex-snapshot
Inapproximability of Survivable Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_22openalex-snapshot
A Graph Reduction Step Preserving Element-Connectivity and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_22openalex-snapshot
Approximating Node-Connectivity Augmentation Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_91openalex-snapshot
Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_8openalex-snapshot
Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_8openalex-snapshot
Connectivity and Depth First Search
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_61openalex-snapshot
Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_66openalex-snapshot
Parameterized Algorithms to Preserve Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_15openalex-snapshot
Approximating Source Location and Star Survivable Network Problems
inferred← citeshttps://doi.org/10.1007/bf01680371openalex-snapshot
On balanced edge connectivity and applications to some bottleneck augmentation problems in networks
inferred← citeshttps://doi.org/10.1007/bf03167307openalex-snapshot
Structures of subpartitions related to a submodular function minimization
inferred← citeshttps://doi.org/10.1007/s00224-008-9149-3openalex-snapshot
Network Design with Edge-Connectivity and Degree Constraints
inferred← citeshttps://doi.org/10.1007/s00224-020-10025-6openalex-snapshot
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/s00373-010-1005-yopenalex-snapshot
Splitting Off Operation for Binary Matroids and its Applications
inferred← citeshttps://doi.org/10.1007/s00453-008-9178-yopenalex-snapshot
Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/s00453-011-9538-xopenalex-snapshot
Approximating Node-Connectivity Augmentation Problems
inferred← citeshttps://doi.org/10.1007/s00453-011-9551-0openalex-snapshot
Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three
inferred← citeshttps://doi.org/10.1007/s00453-012-9724-5openalex-snapshot
Augmenting Edge-Connectivity between Vertex Subsets
inferred← citeshttps://doi.org/10.1007/s00453-019-00613-5openalex-snapshot
Making Bidirected Graphs Strongly Connected
inferred← citeshttps://doi.org/10.1007/s00453-021-00829-4openalex-snapshot
The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects
inferred← citeshttps://doi.org/10.1007/s00453-021-00910-yopenalex-snapshot
Posimodular Function Optimization
inferred← citeshttps://doi.org/10.1007/s00453-022-00959-3openalex-snapshot
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements
inferred← citeshttps://doi.org/10.1007/s00453-022-01055-2openalex-snapshot
Composed Degree-Distance Realizations of Graphs
inferred← citeshttps://doi.org/10.1007/s00493-012-2548-8openalex-snapshot
A unifying approach to splitting-off
inferred← citeshttps://doi.org/10.1007/s10107-019-01426-8openalex-snapshot
Shorter tours and longer detours: uniform covers and a bit beyond
inferred← citeshttps://doi.org/10.1007/s10107-020-01498-xopenalex-snapshot
A new contraction technique with applications to congruency-constrained cuts
inferred← citeshttps://doi.org/10.1007/s10107-021-01711-5openalex-snapshot
Decreasing minimization on M-convex sets: algorithms and applications
inferred← citeshttps://doi.org/10.1007/s10878-012-9523-6openalex-snapshot
Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
inferred← citeshttps://doi.org/10.1007/s10878-016-0023-yopenalex-snapshot
Augmenting weighted graphs to establish directed point-to-point connectivity
inferred← citeshttps://doi.org/10.1007/s11424-010-9280-5openalex-snapshot
Testing k-edge-connectivity of digraphs
inferred← citeshttps://doi.org/10.1007/s12572-019-00244-7openalex-snapshot
On some combinatorial problems in cographs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90158-popenalex-snapshot
Submodular functions in graph theory
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50003-8openalex-snapshot
10.1016/b978-044488002-4/50003-8
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.03.011openalex-snapshot
Strongly connectable digraphs and non-transitive dice
inferred← citeshttps://doi.org/10.1016/j.cosrev.2023.100556openalex-snapshot
A survey of parameterized algorithms and the complexity of edge modification
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100867openalex-snapshot
Interdiction in network maximum flow and related problems: A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.017openalex-snapshot
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.04.016openalex-snapshot
Minimizing a monotone concave function with laminar covering constraints
inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.046openalex-snapshot
Edge-splittings preserving local edge-connectivity of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.09.012openalex-snapshot
Covering symmetric semi-monotone functions
inferred← citeshttps://doi.org/10.1016/j.dam.2009.12.011openalex-snapshot
Local edge-connectivity augmentation in hypergraphs is NP-complete
inferred← citeshttps://doi.org/10.1016/j.disc.2003.07.003openalex-snapshot
On the minor-minimal 2-connected graphs having a fixed minor
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.054openalex-snapshot
Edge-connectivity augmentation of graphs over symmetric parity families
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114837openalex-snapshot
On arborescence packing augmentation in hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.03.002openalex-snapshot
An algorithm to increase the node-connectivity of a digraph by one
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.08.002openalex-snapshot
Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.03.014openalex-snapshot
Vertex fusion under distance constraints
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.002openalex-snapshot
Connectivity augmentation in planar straight line graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.029openalex-snapshot
Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.08.003openalex-snapshot
Covering symmetric supermodular functions with graph edges: A short proof of a theorem of Benczúr and Frank
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.05.002openalex-snapshot
Tight approximation algorithm for connectivity augmentation problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.10.001openalex-snapshot
Path-contractions, edge deletions and connectivity preservation
inferred← citeshttps://doi.org/10.1016/j.jctb.2004.01.004openalex-snapshot
Independence free graphs and vertex connectivity augmentation
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.09.004openalex-snapshot
Splitting-off in hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jda.2006.03.005openalex-snapshot
On shredders and vertex connectivity augmentation
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.036openalex-snapshot
Inapproximability of survivable networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.020openalex-snapshot
Vertex-weighted realizations of graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.034openalex-snapshot
Realization problems on reachability sequences
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114097openalex-snapshot
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115508openalex-snapshot
Temporal graph realization from fastest paths
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00229-2openalex-snapshot
Edge splitting and connectivity augmentation in directed hypergraphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00291-7openalex-snapshot
Splitting off edges between two subsets preserving the edge-connectivity of the graph
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00114-8openalex-snapshot
A note on minimizing submodular functions
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00246-8openalex-snapshot
Polyhedral structure of submodular and posi-modular systems
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00332-2openalex-snapshot
Augmenting trees so that every three vertices lie on a cycle
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00214-1openalex-snapshot
Bipartition constrained edge-splitting in directed graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00319-5openalex-snapshot
Increasing digraph arc-connectivity by arc addition, reversal and complement
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.1016/s0166-218x(02)00570-xopenalex-snapshot
Pushdown–reduce: an algorithm for connectivity augmentation and poset covering problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00580-2openalex-snapshot
On the minimum local-vertex-connectivity augmentation in graphs
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00222-5openalex-snapshot
A primal–dual schema based approximation algorithm for the element connectivity problem
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80127-6openalex-snapshot
Chapter 10 Design of survivable networks
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80158-1openalex-snapshot
Connectivity Augmentation of Graphs
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)81016-8openalex-snapshot
Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs
inferred← citeshttps://doi.org/10.1023/a:1009739202898openalex-snapshot
Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs
inferred← citeshttps://doi.org/10.1023/a:1009746026508openalex-snapshot
A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity
inferred← citeshttps://doi.org/10.1023/a:1009884922499openalex-snapshot
Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph
inferred← citeshttps://doi.org/10.1080/02331939608844244openalex-snapshot
A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows
inferred← citeshttps://doi.org/10.1109/focs.2008.28openalex-snapshot
Degree Bounded Network Design with Metric Costs
inferred← citeshttps://doi.org/10.1109/globecom54140.2023.10437754openalex-snapshot
Efficient Routing Method for Reducing Significant Outages in Optical Networks
inferred← citeshttps://doi.org/10.1109/icde.2012.42openalex-snapshot
Reducing Uncertainty of Low-Sampling-Rate Trajectories
inferred← citeshttps://doi.org/10.1109/infocom.2018.8485859openalex-snapshot
Optimizing Network Reliability via Best-First Search over Decision Diagrams
inferred← citeshttps://doi.org/10.1109/infocom42981.2021.9488782openalex-snapshot
Grafting Arborescences for Extra Resilience of Fast Rerouting Schemes
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10228897openalex-snapshot
A Fast and Exact Evaluation Algorithm for the Expected Number of Connected Nodes: an Enhanced Network Reliability Measure
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00026openalex-snapshot
Distributed Graph Realizations
inferred← citeshttps://doi.org/10.1109/iscas.1993.394225openalex-snapshot
Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph
inferred← citeshttps://doi.org/10.1109/iscas.1993.394287openalex-snapshot
Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph
inferred← citeshttps://doi.org/10.1109/iscas.1993.693150openalex-snapshot
Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph
inferred← citeshttps://doi.org/10.1109/iscas.2000.858823openalex-snapshot
k-edge-connectivity augmentation problem with upper bounds on edge multiplicity
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492466openalex-snapshot
A representation of cuts within 6/5 times the edge connectivity with applications
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646137openalex-snapshot
Edge-connectivity augmentation preserving simplicity
inferred← citeshttps://doi.org/10.1109/ssdm.1997.621180openalex-snapshot
Security problems for statistical databases with general cell suppressions
inferred← citeshttps://doi.org/10.1109/tnet.2007.902680openalex-snapshot
Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-hop Networks
inferred← citeshttps://doi.org/10.1137/090746495openalex-snapshot
Degree Bounded Network Design with Metric Costs
inferred← citeshttps://doi.org/10.1137/1.9781611973075.123openalex-snapshot
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph
inferred← citeshttps://doi.org/10.1137/100787507openalex-snapshot
Augmenting Undirected Node-Connectivity by One
inferred← citeshttps://doi.org/10.1137/100790239openalex-snapshot
Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities
inferred← citeshttps://doi.org/10.1137/100794560openalex-snapshot
Parameterized Complexity of Arc-Weighted Directed Steiner Problems
inferred← citeshttps://doi.org/10.1137/120882147openalex-snapshot
A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests
inferred← citeshttps://doi.org/10.1137/140972858openalex-snapshot
The Generalized Terminal Backup Problem
inferred← citeshttps://doi.org/10.1137/15100583xopenalex-snapshot
Approximating Minimum Cost Connectivity Orientation and Augmentation
inferred← citeshttps://doi.org/10.1137/17m1146233openalex-snapshot
Structured Connectivity Augmentation
inferred← citeshttps://doi.org/10.1137/20m1326489openalex-snapshot
Efficiently Realizing Interval Sequences
inferred← citeshttps://doi.org/10.1137/23m1574245openalex-snapshot
Edge-Connectivity Augmentation of Simple Graphs
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/s0895480100380112openalex-snapshot
Directed Network Design with Orientation Constraints
inferred← citeshttps://doi.org/10.1137/s0895480194271323openalex-snapshot
Computing All Small Cuts in an Undirected Network
inferred← citeshttps://doi.org/10.1137/s0895480196303216openalex-snapshot
Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time
inferred← citeshttps://doi.org/10.1137/s0895480197318878openalex-snapshot
Edge-Connectivity Augmentation Preserving Simplicity
inferred← citeshttps://doi.org/10.1137/s0895480197324700openalex-snapshot
Edge-Connectivity Augmentation with Partition Constraints
inferred← citeshttps://doi.org/10.1137/s0895480198341511openalex-snapshot
Detachment of Vertices of Graphs Preserving Edge-Connectivity
inferred← citeshttps://doi.org/10.1137/s0895480199363933openalex-snapshot
Detachments Preserving Local Edge-Connectivity of Graphs
inferred← citeshttps://doi.org/10.1137/s0895480199364483openalex-snapshot
Constrained Edge-Splitting Problems
inferred← citeshttps://doi.org/10.1145/1282380.1282407openalex-snapshot
Reliability as an interdomain service
inferred← citeshttps://doi.org/10.1145/1282427.1282407openalex-snapshot
Reliability as an interdomain service
inferred← citeshttps://doi.org/10.1145/1361192.1361197openalex-snapshot
Primal-dual approach for directed vertex connectivity augmentation and generalizations
inferred← citeshttps://doi.org/10.1145/1644015.1644020openalex-snapshot
Approximating connectivity augmentation problems
inferred← citeshttps://doi.org/10.1145/174652.174654openalex-snapshot
Biconnectivity approximations and graph carvings
inferred← citeshttps://doi.org/10.1145/1806689.1806767openalex-snapshot
Augmenting undirected node-connectivity by one
inferred← citeshttps://doi.org/10.1145/2700210openalex-snapshot
Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
inferred← citeshttps://doi.org/10.1145/2764909openalex-snapshot
The Minset-Poset Approach to Representations of Graph Connectivity
inferred← citeshttps://doi.org/10.1145/3519935.3520038openalex-snapshot
Edge connectivity augmentation in near-linear time
inferred← citeshttps://doi.org/10.1145/938985.939016openalex-snapshot
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
inferred← citeshttps://doi.org/10.1186/s13660-017-1544-3openalex-snapshot
Degree sequence for k-arc strongly connected multiple digraphs
inferred← citeshttps://doi.org/10.1201/9781351235426-13openalex-snapshot
Node-Connectivity Survivable Network Problems
inferred← citeshttps://doi.org/10.1287/moor.2017.0881openalex-snapshot
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings
inferred← citeshttps://doi.org/10.1287/moor.2017.0883openalex-snapshot
Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs
inferred← citeshttps://doi.org/10.1364/jocn.520509openalex-snapshot
Routing problem for reducing significant outages in optical networks and its system analysis
showing the first 200 of 224 · page through all 224
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.