On the public citation graph
On some connectivity properties of Eulerian graphs
0 signed · 128 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.1007/bf02066678openalex-snapshot
Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
inferredcites →https://doi.org/10.1287/opre.14.6.1121openalex-snapshot
Feasibility of Two Commodity Network Flows
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-0037(199909)34:2<102::aid-net3>3.0.co;2-xopenalex-snapshot
Analysis of LP relaxations for multiway and multicut problems
inferred← citeshttps://doi.org/10.1002/jgt.23192openalex-snapshot
Towards Nash‐Williams orientation conjecture for infinite graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190120314openalex-snapshot
Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
inferred← citeshttps://doi.org/10.1002/jgt.3190180204openalex-snapshot
Short cycle covers of cubic graphs
inferred← citeshttps://doi.org/10.1002/mana.19790930116openalex-snapshot
Eine Reduktionsmethode für den Kantenzusammenhang in Graphen
inferred← citeshttps://doi.org/10.1006/eujc.1997.0154openalex-snapshot
Minimum 0-Extensions of Graph Metrics
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/3-540-61310-2_34openalex-snapshot
Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
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-031-22543-7_6openalex-snapshot
Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial Time Approximation Within a Constant Ratio
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_3openalex-snapshot
A Better-Than-1.6-Approximation for Prize-Collecting TSP
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_45openalex-snapshot
Plane Gossip: Approximating Rumor Spread in Planar Graphs
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-85363-3_32openalex-snapshot
On the Query Complexity of Testing Orientations for Being Eulerian
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_11openalex-snapshot
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_19openalex-snapshot
A 2log2(n)-Approximation Algorithm for Directed Tour Cover
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-10217-2_16openalex-snapshot
Edge-Simple Circuits through 10 Ordered Vertices in Square Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_10openalex-snapshot
An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_18openalex-snapshot
Min-Max Results in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_27openalex-snapshot
On Element-Connectivity Preserving Graph Simplification
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_48openalex-snapshot
An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/bf01226062openalex-snapshot
�ber die Maximalzahl kantendisjunkterA- Wege
inferred← citeshttps://doi.org/10.1007/bf01580607openalex-snapshot
Survivable networks, linear programming relaxations and the parsimonious property
inferred← citeshttps://doi.org/10.1007/bf01581152openalex-snapshot
Minimum cost multiflows in undirected networks
inferred← citeshttps://doi.org/10.1007/bf01581256openalex-snapshot
A note on the prize collecting traveling salesman problem
inferred← citeshttps://doi.org/10.1007/bf01585735openalex-snapshot
Minimum-weight two-connected spanning networks
inferred← citeshttps://doi.org/10.1007/bf01608533openalex-snapshot
Metrics with finite sets of primitive extensions
inferred← citeshttps://doi.org/10.1007/bf02523685openalex-snapshot
Primal-dual approximation algorithms for integral flow and multicut in trees
inferred← citeshttps://doi.org/10.1007/bf02614372openalex-snapshot
Multiflows and disjoint paths of minimum total cost
inferred← citeshttps://doi.org/10.1007/jhep06(2021)024openalex-snapshot
Holographic entanglement negativity and replica symmetry breaking
inferred← citeshttps://doi.org/10.1007/pl00009811openalex-snapshot
A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations
inferred← citeshttps://doi.org/10.1007/s00220-019-03510-8openalex-snapshot
Bit Threads and Holographic Monogamy
inferred← citeshttps://doi.org/10.1007/s00224-008-9141-yopenalex-snapshot
A Fast Algorithm for the Path 2-Packing Problem
inferred← citeshttps://doi.org/10.1007/s00453-017-0293-5openalex-snapshot
An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/s00493-013-2633-7openalex-snapshot
Decomposing graphs into paths of fixed length
inferred← citeshttps://doi.org/10.1007/s00493-015-3173-0openalex-snapshot
Orientations of infinite graphs with prescribed edge-connectivity
inferred← citeshttps://doi.org/10.1007/s00493-017-3792-8openalex-snapshot
On the Size of K-Cross-Free Families
inferred← citeshttps://doi.org/10.1007/s10107-004-0506-yopenalex-snapshot
On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems
inferred← citeshttps://doi.org/10.1007/s10107-011-0506-7openalex-snapshot
Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
inferred← citeshttps://doi.org/10.1007/s10107-013-0713-5openalex-snapshot
Tree metrics and edge-disjoint $$S$$ S -paths
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-01683-6openalex-snapshot
A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem
inferred← citeshttps://doi.org/10.1007/s10107-025-02221-4openalex-snapshot
A better-than-1.6-approximation for prize-collecting TSP
inferred← citeshttps://doi.org/10.1007/s101070050033openalex-snapshot
Augmenting hypergraphs by edges of size two
inferred← citeshttps://doi.org/10.1007/s10878-007-9107-zopenalex-snapshot
Path packing and a related optimization problem
inferred← citeshttps://doi.org/10.1007/s10878-011-9377-3openalex-snapshot
Min-cost multiflows in node-capacitated undirected networks
inferred← citeshttps://doi.org/10.1007/s10878-011-9405-3openalex-snapshot
On the fractionality of the path packing problem
inferred← citeshttps://doi.org/10.1007/s10878-021-00772-8openalex-snapshot
Approximation algorithms with constant ratio for general cluster routing problems
inferred← citeshttps://doi.org/10.1007/s13278-022-00955-zopenalex-snapshot
Graph support measures and flows
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90052-lopenalex-snapshot
Short proofs on multicommodity flows and cuts
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90010-8openalex-snapshot
An algorithm for an Eulerian trail traversing specified edges in given order
inferred← citeshttps://doi.org/10.1016/0167-6377(95)00018-fopenalex-snapshot
Multiterminal flows and cuts
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.dam.2007.02.012openalex-snapshot
Free multiflows in bidirected and skew-symmetric graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113586openalex-snapshot
The Lov\'{a}sz-Cherkassky theorem for locally finite graphs with ends
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115039openalex-snapshot
Uniformly k-edge-connected graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.07.001openalex-snapshot
L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.104043openalex-snapshot
The Nash-Williams orientation theorem for graphs with countably many ends
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.115openalex-snapshot
Approximating the asymmetric profitable tour
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103604openalex-snapshot
The parameterized complexity of the survivable network design problem
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.07.002openalex-snapshot
A linear programming formulation of Mader's edge-disjoint paths problem
inferred← citeshttps://doi.org/10.1016/j.jctb.2009.03.001openalex-snapshot
Tight spans of distances and the dual fractionality of undirected multiflow problems
inferred← citeshttps://doi.org/10.1016/j.jctb.2013.05.003openalex-snapshot
Decomposing a graph into bistars
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.07.004openalex-snapshot
Strongly 2-connected orientations of graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.11.001openalex-snapshot
The Lovász-Cherkassky theorem in countable graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.09.004openalex-snapshot
Splitting-off in hypergraphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00045-9openalex-snapshot
Minimum weight (T, d)-joins and multi-joins
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00049-3openalex-snapshot
Minimum multiway cuts in trees
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70062-1openalex-snapshot
A Construction Method For Minimally K-Edge-Connected Graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70459-xopenalex-snapshot
On Connectivity Properties of Eulerian Digraphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70504-1openalex-snapshot
A Reduction Method for Edge-Connectivity in Graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70744-1openalex-snapshot
Certain Duality Principles in Integer Programming
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70822-7openalex-snapshot
Graph Theory and Integer Programming
inferred← citeshttps://doi.org/10.1016/s0167-6377(97)00032-1openalex-snapshot
The parsimonious property of cut covering problems and its applications
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80127-6openalex-snapshot
Chapter 10 Design of survivable networks
inferred← citeshttps://doi.org/10.1109/isit.2010.5513726openalex-snapshot
Perfect secrecy and combinatorial tree packing
inferred← citeshttps://doi.org/10.1109/ita.2010.5454101openalex-snapshot
Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing
inferred← citeshttps://doi.org/10.1109/tit.2006.874430openalex-snapshot
A unification of network coding and tree-packing (routing) theorems
inferred← citeshttps://doi.org/10.1112/tlm3.70001openalex-snapshot
The Lovász–Cherkassky theorem in infinite graphs
inferred← citeshttps://doi.org/10.1137/070697793openalex-snapshot
Network Failure Detection and Graph Connectivity
inferred← citeshttps://doi.org/10.1137/080717468openalex-snapshot
Short Cycle Covers of Graphs with Minimum Degree Three
inferred← citeshttps://doi.org/10.1137/090767054openalex-snapshot
Folder Complexes and Multiflow Combinatorial Dualities
inferred← citeshttps://doi.org/10.1137/1.9781611973730.19openalex-snapshot
Degree-3 Treewidth Sparsifiers
inferred← citeshttps://doi.org/10.1137/1.9781611977066.4openalex-snapshot
The Parameterized Complexity of the Survivable Network Design Problem
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/151004288openalex-snapshot
Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation
inferred← citeshttps://doi.org/10.1137/16m1080562openalex-snapshot
Odd Decompositions of Eulerian Graphs
inferred← citeshttps://doi.org/10.1137/20m1361857openalex-snapshot
Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity
inferred← citeshttps://doi.org/10.1137/22m1494804openalex-snapshot
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
inferred← citeshttps://doi.org/10.1137/s0036142993226983openalex-snapshot
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
inferred← citeshttps://doi.org/10.1137/s0895480195287723openalex-snapshot
On Integer Multiflow Maximization
inferred← citeshttps://doi.org/10.1142/s0219265910002763openalex-snapshot
CIRCUITS IN GRAPHS THROUGH A PRESCRIBED SET OF ORDERED VERTICES
inferred← citeshttps://doi.org/10.1145/1250790.1250878openalex-snapshot
Some new results on node-capacitated packing of A-paths
inferred← citeshttps://doi.org/10.1145/1806689.1806707openalex-snapshot
The maximum multiflow problems with bounded fractionality
inferred← citeshttps://doi.org/10.1145/2151171.2151178openalex-snapshot
On the query complexity of testing orientations for being Eulerian
inferred← citeshttps://doi.org/10.1145/3309715openalex-snapshot
Approaching 3/2 for the s - t -path TSP
inferred← citeshttps://doi.org/10.1145/3564246.3585159openalex-snapshot
An Improved Approximation Guarantee for Prize-Collecting TSP
inferred← citeshttps://doi.org/10.1287/moor.16.1.72openalex-snapshot
Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1287/moor.2013.0600openalex-snapshot
The Maximum Multiflow Problems with Bounded Fractionality
inferred← citeshttps://doi.org/10.1287/moor.22.1.90openalex-snapshot
Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost
inferred← citeshttps://doi.org/10.14711/thesis-b936938openalex-snapshot
Generalized minimum spanning tree problem
inferred← citeshttps://doi.org/10.15807/jorsj.53.149openalex-snapshot
A NOTE ON MULTIFLOW LOCKING THEOREM
inferred← citeshttps://doi.org/10.15826/umj.2023.1.012openalex-snapshot
FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM
inferred← citeshttps://doi.org/10.3390/a4010075openalex-snapshot
Approximating the Minimum Tour Cover of a Digraph
inferred← citeshttps://doi.org/10.33993/jnaat341-795openalex-snapshot
Approximation theory in combinatorial optimization. Application to the generalized minimum spanning tree problem
inferred← citeshttps://doi.org/10.3990/1.9789036517850openalex-snapshot
The generalized minimum spanning tree problem
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2015.316openalex-snapshot
Approximating the Generalized Terminal Backup Problem via Half-integral Multiflow Relaxation
inferred← citeshttps://doi.org/10.48550/arxiv.1001.0125openalex-snapshot
On Min-Cost Multiflow Problem in Node-Capacitated Undirected Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1101.2061openalex-snapshot
The graphs with the max-Mader-flow-min-multiway-cut property
inferred← citeshttps://doi.org/10.48550/arxiv.1707.03992openalex-snapshot
Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP
inferred← citeshttps://doi.org/10.48550/arxiv.2005.11912openalex-snapshot
Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP
inferred← citeshttps://doi.org/10.5555/320176.320224openalex-snapshot
On the parsimonious property of connectivity problems
inferred← citeshttps://doi.org/10.5555/982792.982803openalex-snapshot
Network failure detection and graph connectivity
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.