On the public citation graph
An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms
0 signed · 35 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.3230220307openalex-snapshot
The optimal partitioning of networks
inferred← citeshttps://doi.org/10.1002/sat.1514openalex-snapshot
Rethinking LEO constellations routing
inferred← citeshttps://doi.org/10.1007/11744085_46openalex-snapshot
Multi-way Clustering Using Super-Symmetric Non-negative Tensor Factorization
inferred← citeshttps://doi.org/10.1007/3-540-53832-1_39openalex-snapshot
Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_60openalex-snapshot
The approximation of maximum subgraph problems
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_4openalex-snapshot
Some open problems in approximation
inferred← citeshttps://doi.org/10.1007/s00037-006-0210-9openalex-snapshot
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
inferred← citeshttps://doi.org/10.1007/s00224-006-1349-0openalex-snapshot
The Effect of Faults on Network Expansion
inferred← citeshttps://doi.org/10.1007/s00778-019-00556-xopenalex-snapshot
A survey of community search over big graphs
inferred← citeshttps://doi.org/10.1007/s11081-026-10118-0openalex-snapshot
Faster and better quality conductance solutions with the incremental parametric cut algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90126-gopenalex-snapshot
A linear time algorithm for graph partition problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.08.012openalex-snapshot
Spectral methods for graph clustering – A survey
inferred← citeshttps://doi.org/10.1016/j.osn.2008.02.003openalex-snapshot
Physical topology design for all-optical networks
inferred← citeshttps://doi.org/10.1023/a:1021390231133openalex-snapshot
Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection
inferred← citeshttps://doi.org/10.1073/pnas.1301111110openalex-snapshot
From the physics of interacting polymers to optimizing routes on the London Underground
inferred← citeshttps://doi.org/10.1109/asms/spsc55670.2022.9914743openalex-snapshot
Rethinking LEO Constellations Routing with the Unsplittable Multi-Commodity Flows Problem
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646130openalex-snapshot
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743489openalex-snapshot
Random projection: a new approach to VLSI layout
inferred← citeshttps://doi.org/10.1109/superc.1992.236711openalex-snapshot
Towards a fast implementation of spectral nested dissection
inferred← citeshttps://doi.org/10.1109/tac.2020.3036288openalex-snapshot
Distributed Balancing Under Flow Constraints Over Arbitrary Communication Topologies
inferred← citeshttps://doi.org/10.1109/tac.2021.3137150openalex-snapshot
Finite-Time Distributed Flow Balancing
inferred← citeshttps://doi.org/10.1137/1.9780898718805.ch13openalex-snapshot
13. On the Expansion of Graphs of 0/1-Polytopes
inferred← citeshttps://doi.org/10.1137/1.9781611973075.30openalex-snapshot
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic
inferred← citeshttps://doi.org/10.1145/100216.100257openalex-snapshot
Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities
inferred← citeshttps://doi.org/10.1145/3579312openalex-snapshot
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks
inferred← citeshttps://doi.org/10.11606/d.45.2012.tde-22012013-160000openalex-snapshot
O problema do multicorte dirigido mínimo
inferred← citeshttps://doi.org/10.11606/t.55.2010.tde-17052010-155334openalex-snapshot
Metaheurísticas para o problema de agrupamento de dados em grafo
inferred← citeshttps://doi.org/10.1201/b11644-17openalex-snapshot
Algorithmic and Statistical Perspectives on Large-Scale Data Analysis
inferred← citeshttps://doi.org/10.1214/009117906000000719openalex-snapshot
Optimal flow through the disordered lattice
inferred← citeshttps://doi.org/10.15607/rss.2023.xix.060openalex-snapshot
Motion Planning (In)feasibility Detection using a Prior Roadmap via Path and Cut Search
inferred← citeshttps://doi.org/10.15625/1813-9663/31/1/4108openalex-snapshot
A survey on graph partitioning approach to spectral clustering
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.