On the public citation graph
Min-Max Graph Partitioning and Small Set Expansion
0 signed · 42 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.1006/jcss.1999.1687openalex-snapshot
An Improved Approximation Algorithm for MULTIWAY CUT
inferredcites →https://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferredcites →https://doi.org/10.1007/s00224-006-1350-7openalex-snapshot
Balanced Graph Partitioning
inferredcites →https://doi.org/10.1016/s0166-218x(02)00394-3openalex-snapshot
On cutting a few vertices from a graph
inferredcites →https://doi.org/10.1016/s0304-3975(00)00143-2openalex-snapshot
Min–max-boundary domain decomposition
inferredcites →https://doi.org/10.1137/s0097539794285983openalex-snapshot
An O (log k ) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
inferredcites →https://doi.org/10.1137/s0097539796308217openalex-snapshot
Fast Approximate Graph Partitioning Algorithms
inferredcites →https://doi.org/10.1142/s1793525309000096openalex-snapshot
ECONOMICAL TORIC SPINES VIA CHEEGER'S INEQUALITY
inferredcites →https://doi.org/10.1145/1355734.1355737openalex-snapshot
Rethinking virtual network embedding
inferredcites →https://doi.org/10.1145/1400181.1400204openalex-snapshot
Geometry, flows, and graph-partitioning algorithms
inferredcites →https://doi.org/10.1145/331524.331526openalex-snapshot
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
inferredcites →https://doi.org/10.1287/moor.1030.0086openalex-snapshot
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4432openalex-snapshot
An efficient iterative graph data processing framework based on bulk synchronous parallel model
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_4openalex-snapshot
Tree t-Spanners of a Graph: Minimizing Maximum Distances Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_2openalex-snapshot
Min-Max Correlation Clustering via MultiCut
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_25openalex-snapshot
Fixed Parameter Approximation Scheme for Min-Max k-Cut
inferred← citeshttps://doi.org/10.1007/978-3-319-59250-3_12openalex-snapshot
Local Guarantees in Graph Cuts and Clustering
inferred← citeshttps://doi.org/10.1007/s00453-022-00983-3openalex-snapshot
$$\ell _p$$-Norm Multiway Cut
inferred← citeshttps://doi.org/10.1007/s00493-023-00021-yopenalex-snapshot
Min–Max Partitioning of Hypergraphs and Symmetric Submodular Functions
inferred← citeshttps://doi.org/10.1007/s10107-022-01842-3openalex-snapshot
Fixed parameter approximation scheme for min-max k-cut
inferred← citeshttps://doi.org/10.1016/j.cor.2017.05.016openalex-snapshot
An exact algorithm for Min-Max hyperstructure equipartition with a connected constraint
inferred← citeshttps://doi.org/10.1016/j.dam.2022.11.018openalex-snapshot
Polynomial-time data reduction for weighted problems beyond additive goal functions
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.08.032openalex-snapshot
Hardness and Efficiency on Minimizing Maximum Distances for Graphs With Few P4's and (k,ℓ)-graphs
inferred← citeshttps://doi.org/10.1016/j.eswa.2022.118077openalex-snapshot
A memetic algorithm based on edge-state learning for max-cut
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.01.003openalex-snapshot
Parameterized algorithms for min-max multiway cut and list digraph homomorphism
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.115047openalex-snapshot
On the complexity of minimizing energy consumption of partitioning DAG tasks
inferred← citeshttps://doi.org/10.1070/sm8903openalex-snapshot
Minimum nonuniform graph partitioning with unrelated weights
inferred← citeshttps://doi.org/10.1109/icdcs63083.2025.00035openalex-snapshot
Efficient Joint Communication and Computation Placement for Large-scale SNN Simulation on Supercomputers
inferred← citeshttps://doi.org/10.1109/isorc.2016.22openalex-snapshot
Fast and Dynamic Resource Provisioning for Quality Critical Cloud Applications
inferred← citeshttps://doi.org/10.1137/1.9781611974782.56openalex-snapshot
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion
inferred← citeshttps://doi.org/10.1137/1.9781611976465.132openalex-snapshot
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.1145/3501304openalex-snapshot
Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems
inferred← citeshttps://doi.org/10.1145/3618260.3649747openalex-snapshot
Approximating Small Sparse Cuts
inferred← citeshttps://doi.org/10.22331/q-2022-05-13-711openalex-snapshot
Connectivity constrains quantum codes
inferred← citeshttps://doi.org/10.4213/sm8903openalex-snapshot
Задача минимального неравномерного разбиения графа на части c несвязанными весами
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2020.27openalex-snapshot
Planted Models for the Densest $k$-Subgraph Problem
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.101openalex-snapshot
On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1510.01520openalex-snapshot
Spectral Properties of Laplacian and Stochastic Diffusion Process for Edge Expansion in Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1511.03229openalex-snapshot
Learning Communities in the Presence of Errors
inferred← citeshttps://doi.org/10.48550/arxiv.1907.00117openalex-snapshot
Min-Max Correlation Clustering via MultiCut
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.