On the public citation graph
Cut, Glue, & Cut: A Fast, Approximate Solver for Multicut Partitioning
0 signed · 60 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/j.1538-7305.1970.tb01770.xopenalex-snapshot
An Efficient Heuristic Procedure for Partitioning Graphs
inferredcites →https://doi.org/10.1007/978-3-540-45167-9_14openalex-snapshot
Comparing Clusterings by the Variation of Information
inferredcites →https://doi.org/10.1007/978-3-642-04295-9openalex-snapshot
Geometry of Cuts and Metrics
inferredcites →https://doi.org/10.1007/978-3-642-23094-3_3openalex-snapshot
Globally Optimal Image Partitioning by Multicuts
inferredcites →https://doi.org/10.1007/978-3-642-33712-3_56openalex-snapshot
Globally Optimal Closed-Surface Segmentation for Connectomics
inferredcites →https://doi.org/10.1007/978-3-642-33783-3_41openalex-snapshot
Fast Planar Correlation Clustering for Image Segmentation
inferredcites →https://doi.org/10.1007/978-3-642-39140-8_9openalex-snapshot
Break and Conquer: Efficient Correlation Clustering for Image Segmentation
inferredcites →https://doi.org/10.1007/s10107-004-0510-2openalex-snapshot
Greedy splitting algorithms for approximating multiway partition problems
inferredcites →https://doi.org/10.1007/s11263-015-0809-xopenalex-snapshot
A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems
inferredcites →https://doi.org/10.1023/b:mach.0000033116.57574.95openalex-snapshot
Correlation Clustering
inferredcites →https://doi.org/10.1090/s0002-9904-1976-14122-5openalex-snapshot
Every planar map is four colorable
inferredcites →https://doi.org/10.1109/cvpr.2007.383203openalex-snapshot
Optimizing Binary MRFs via Extended Roof Duality
inferredcites →https://doi.org/10.1109/cvpr.2013.175openalex-snapshot
A Comparative Study of Modern Inference Techniques for Discrete Energy Minimization Problems
inferredcites →https://doi.org/10.1109/iccv.2011.6126550openalex-snapshot
Probabilistic image segmentation with closedness constraints
inferredcites →https://doi.org/10.1109/tip.2012.2218822openalex-snapshot
Task-Specific Image Partitioning
inferredcites →https://doi.org/10.1109/tpami.2004.1262177openalex-snapshot
What energy functions can be minimized via graph cuts?
inferredcites →https://doi.org/10.1109/tpami.2011.280openalex-snapshot
Ensemble Segmentation Using Efficient Integer Linear Programming
inferredcites →https://doi.org/10.1145/1102351.1102379openalex-snapshot
Supervised clustering with support vector machines
inferredcites →https://doi.org/10.1215/ijm/1256049011openalex-snapshot
Every planar map is four colorable. Part I: Discharging
inferredcites →https://doi.org/10.48550/arxiv.0810.4401openalex-snapshot
Efficient Exact Inference in Planar Ising Models
inferredcites →https://doi.org/10.48550/arxiv.1112.2903openalex-snapshot
Large Scale Correlation Clustering Optimization
inferredcites →https://doi.org/10.48550/arxiv.1206.0111openalex-snapshot
OpenGM: A C++ Library for Discrete Graphical Models
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-20870-7_5openalex-snapshot
Solving Minimum Cost Lifted Multicut Problems by Node Agglomeration
inferred← citeshttps://doi.org/10.1007/978-3-030-69532-3_33openalex-snapshot
A Two-Stage Minimum Cost Multicut Approach to Self-supervised Multiple Person Tracking
inferred← citeshttps://doi.org/10.1007/978-3-030-90539-2_18openalex-snapshot
MSM: Multi-stage Multicuts for Scalable Image Clustering
inferred← citeshttps://doi.org/10.1007/978-3-031-16788-1_12openalex-snapshot
Optimizing Edge Detection for Image Segmentation with Multicut Penalties
inferred← citeshttps://doi.org/10.1007/978-3-031-26390-3_28openalex-snapshot
Learning to Solve Minimum Cost Multicuts Efficiently Using Edge-Weighted Graph Convolutional Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-11752-2_16openalex-snapshot
Asymmetric Cuts: Joint Image Labeling and Partitioning
inferred← citeshttps://doi.org/10.1007/978-3-319-46475-6_44openalex-snapshot
An Efficient Fusion Move Algorithm for the Minimum Cost Lifted Multicut Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-66709-6_9openalex-snapshot
A Comparative Study of Local Search Algorithms for Correlation Clustering
inferred← citeshttps://doi.org/10.1007/s10851-016-0659-3openalex-snapshot
Multicuts and Perturb & MAP for Probabilistic Graph Clustering
inferred← citeshttps://doi.org/10.1007/s10851-024-01201-1openalex-snapshot
A Graph Multi-separator Problem for Image Segmentation
inferred← citeshttps://doi.org/10.1007/s41095-016-0071-3openalex-snapshot
Feature-aligned segmentation using correlation clustering
inferred← citeshttps://doi.org/10.1088/1748-0221/18/07/p07013openalex-snapshot
Improving primary-vertex reconstruction with a minimum-cost lifted multicut graph partitioning algorithm
inferred← citeshttps://doi.org/10.1109/cvpr.2015.7298973openalex-snapshot
Fusion moves for correlation clustering
inferred← citeshttps://doi.org/10.1109/cvpr.2017.526openalex-snapshot
A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems
inferred← citeshttps://doi.org/10.1109/cvpr.2017.530openalex-snapshot
A Message Passing Algorithm for the Minimum Cost Multicut Problem
inferred← citeshttps://doi.org/10.1109/cvpr.2017.774openalex-snapshot
InstanceCut: From Edges to Instances with MultiCut
inferred← citeshttps://doi.org/10.1109/cvpr52688.2022.00802openalex-snapshot
RAMA: A Rapid Multicut Algorithm on GPU
inferred← citeshttps://doi.org/10.1109/iccv.2015.204openalex-snapshot
Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts
inferred← citeshttps://doi.org/10.1109/iccv.2015.374openalex-snapshot
Motion Trajectory Segmentation via Minimum Cost Multicuts
inferred← citeshttps://doi.org/10.1109/iccv.2017.503openalex-snapshot
Efficient Algorithms for Moral Lineage Tracing
inferred← citeshttps://doi.org/10.1109/iccvw.2017.7openalex-snapshot
Solving Large Multicut Problems for Connectomics via Domain Decomposition
inferred← citeshttps://doi.org/10.1109/icpr48806.2021.9412602openalex-snapshot
Learning Embeddings for Image Clustering: An Empirical Study of Triplet Loss Approaches
inferred← citeshttps://doi.org/10.1109/mlhpcai4s51975.2020.00009openalex-snapshot
A Benders Decomposition Approach to Correlation Clustering
inferred← citeshttps://doi.org/10.1109/tnnls.2015.2505181openalex-snapshot
Hierarchical Image Segmentation Using Correlation Clustering
inferred← citeshttps://doi.org/10.1109/tnnls.2024.3443413openalex-snapshot
Deep Graph Reinforcement Learning for Solving Multicut Problem
inferred← citeshttps://doi.org/10.1109/tpami.2018.2876253openalex-snapshot
Motion Segmentation & Multiple Object Tracking by Correlation Co-Clustering
inferred← citeshttps://doi.org/10.1109/tpami.2024.3409634openalex-snapshot
DeepMulticut: Deep Learning of Multicut Problem for Neuron Segmentation From Electron Microscopy Volume
inferred← citeshttps://doi.org/10.1111/cgf.12795openalex-snapshot
Towards Globally Optimal Normal Orientations for Large Point Clouds
inferred← citeshttps://doi.org/10.2312/pg.20161332openalex-snapshot
Interactive Multicut Video Segmentation
inferred← citeshttps://doi.org/10.48550/arxiv.1507.02407openalex-snapshot
Planar Ultrametric Rounding for Image Segmentation
inferred← citeshttps://doi.org/10.48550/arxiv.1607.06317openalex-snapshot
A Multi-cut Formulation for Joint Segmentation and Tracking of Multiple Objects
inferred← citeshttps://doi.org/10.48550/arxiv.1612.05441openalex-snapshot
A Message Passing Algorithm for the Minimum Cost Multicut Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1702.04111openalex-snapshot
Efficient Algorithms for Moral Lineage Tracing
inferred← citeshttps://doi.org/10.48550/arxiv.1902.05659openalex-snapshot
Massively Parallel Benders Decomposition for Correlation Clustering
inferred← citeshttps://doi.org/10.48550/arxiv.2002.01192openalex-snapshot
Unsupervised Multiple Person Tracking using AutoEncoder-Based Lifted Multicuts
inferred← citeshttps://doi.org/10.48550/arxiv.2105.07469openalex-snapshot
Uncertainty in Minimum Cost Multicuts for Image and Motion Segmentation
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.