On the public citation graph

https://doi.org/10.4086/toc.2006.v002a013

0 signed · 107 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-36379-3_33openalex-snapshot
Cluster Graph Modification Problems
inferredcites →https://doi.org/10.1007/b11961openalex-snapshot
Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science,…
inferredcites →https://doi.org/10.1007/b13632openalex-snapshot
Algorithms - ESA 2003
inferredcites →https://doi.org/10.1007/s101070050100openalex-snapshot
On maximization of quadratic form over intersection of ellipsoids with common center
inferredcites →https://doi.org/10.1016/j.jcss.2004.10.012openalex-snapshot
Clustering with qualitative information
inferredcites →https://doi.org/10.1023/b:mach.0000033116.57574.95openalex-snapshot
Correlation Clustering
inferredcites →https://doi.org/10.1089/106652799318274openalex-snapshot
Clustering Gene Expression Patterns
inferredcites →https://doi.org/10.1109/focs.2004.39openalex-snapshot
Maximizing Quadratic Programs: Extending Grothendieck's Inequality
inferredcites →https://doi.org/10.1109/focs.2004.49openalex-snapshot
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
inferredcites →https://doi.org/10.1109/sfcs.1998.743497openalex-snapshot
A randomized approximation scheme for metric MAX-CUT
inferredcites →https://doi.org/10.1109/sfcs.2005.57openalex-snapshot
On Non-Approximability for Quadratic Programs
inferredcites →https://doi.org/10.1109/sffcs.1999.814587openalex-snapshot
A sublinear time approximation scheme for clustering in metric spaces
inferredcites →https://doi.org/10.1145/1060590.1060664openalex-snapshot
Quadratic forms on graphs
inferredcites →https://doi.org/10.1145/1060590.1060675openalex-snapshot
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1145/780542.780550openalex-snapshot
Approximation schemes for clustering problems
inferredcites →https://doi.org/10.5555/982792.982866openalex-snapshot
Correlation Clustering: maximizing agreements via semidefinite programming

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-22629-9_21openalex-snapshot
A 2-Approximation Algorithm for the Graph 2-Clustering Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-27195-4_15openalex-snapshot
Approximation Algorithm for the Correlation Clustering Problem with Non-uniform Hard Constrained Cluster Sizes
inferred← citeshttps://doi.org/10.1007/978-3-030-57602-8_9openalex-snapshot
Approximation Algorithm for the Balanced 2-correlation Clustering Problem on Well-Proportional Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-16224-4_4openalex-snapshot
An Approximation Algorithm for Graph Clustering with Clusters of Bounded Sizes
inferred← citeshttps://doi.org/10.1007/978-3-031-47859-8_23openalex-snapshot
On Cluster Editing Problem with Clusters of Small Sizes
inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_9openalex-snapshot
A Fast Branching Algorithm for Cluster Vertex Deletion
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_34openalex-snapshot
Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes
inferred← citeshttps://doi.org/10.1007/978-3-319-39630-9_3openalex-snapshot
Clique Editing to Support Case Versus Control Discrimination
inferred← citeshttps://doi.org/10.1007/978-3-319-44914-2_3openalex-snapshot
Short Survey on Graph Correlation Clustering with Minimization Criteria
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_4openalex-snapshot
A More Effective Linear Kernelization for Cluster Editing
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_12openalex-snapshot
On Finding Graph Clusterings with Maximum Modularity
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_61openalex-snapshot
Fixed-Parameter Algorithms for Cluster Vertex Deletion
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_26openalex-snapshot
A Local-Search 2-Approximation for 2-Correlation-Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_4openalex-snapshot
Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_31openalex-snapshot
Dynamics in Network Interaction Games
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_17openalex-snapshot
Clustering with Diversity
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_3openalex-snapshot
Improved Approximation Algorithms for Bipartite Correlation Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-35452-6_16openalex-snapshot
On the Min-Max 2-Cluster Editing Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-53914-5_30openalex-snapshot
Restoring: A Greedy Heuristic Approach Based on Neighborhood for Correlation Clustering
inferred← citeshttps://doi.org/10.1007/978-981-96-1490-5_4openalex-snapshot
Approximation Algorithms on Linear Equalities and Inequalities Mod p
inferred← citeshttps://doi.org/10.1007/s00224-008-9150-xopenalex-snapshot
Fixed-Parameter Algorithms for Cluster Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00224-015-9631-7openalex-snapshot
A Fast Branching Algorithm for Cluster Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00446-012-0171-yopenalex-snapshot
Dynamics in network interaction games
inferred← citeshttps://doi.org/10.1007/s00453-014-9874-8openalex-snapshot
Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions
inferred← citeshttps://doi.org/10.1007/s00453-021-00816-9openalex-snapshot
Correlation Clustering in Data Streams
inferred← citeshttps://doi.org/10.1007/s10044-017-0598-7openalex-snapshot
Scalability of correlation clustering
inferred← citeshttps://doi.org/10.1007/s10589-017-9893-xopenalex-snapshot
Branch-and-price for p-cluster editing
inferred← citeshttps://doi.org/10.1007/s10878-013-9665-1openalex-snapshot
A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks
inferred← citeshttps://doi.org/10.1007/s10878-016-0059-zopenalex-snapshot
Parameterized algorithms for min–max 2-cluster editing
inferred← citeshttps://doi.org/10.1007/s10878-020-00612-1openalex-snapshot
Approximation algorithms for two variants of correlation clustering problem
inferred← citeshttps://doi.org/10.1007/s10994-009-5158-yopenalex-snapshot
Ensemble clustering using semidefinite programming with applications
inferred← citeshttps://doi.org/10.1007/s13675-017-0082-6openalex-snapshot
Evaluating balancing on social networks through the efficient solution of correlation clustering problems
inferred← citeshttps://doi.org/10.1007/s40305-022-00418-4openalex-snapshot
Approximation Algorithms on k-Correlation Clustering
inferred← citeshttps://doi.org/10.1007/s41060-016-0005-2openalex-snapshot
Bounded correlation clustering
inferred← citeshttps://doi.org/10.1016/j.artint.2015.07.001openalex-snapshot
Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability
inferred← citeshttps://doi.org/10.1016/j.artint.2017.04.005openalex-snapshot
Constrained coalition formation on valuation structures: Formal framework, applications, and islands of tractability
inferred← citeshttps://doi.org/10.1016/j.dam.2016.10.026openalex-snapshot
Branch-and-cut approaches for p -Cluster Editing
inferred← citeshttps://doi.org/10.1016/j.eswa.2016.06.033openalex-snapshot
Rare category exploration via wavelet analysis: Theory and applications
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.06.004openalex-snapshot
A note on the inapproximability of correlation clustering
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106193openalex-snapshot
A simple and improved parameterized algorithm for bicluster editing
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.04.015openalex-snapshot
Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters
inferred← citeshttps://doi.org/10.1016/j.socnet.2018.08.007openalex-snapshot
Partitioning signed networks using relocation heuristics, tabu search, and variable neighborhood search
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.021openalex-snapshot
A more effective linear kernelization for cluster editing
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.022openalex-snapshot
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters
inferred← citeshttps://doi.org/10.1063/1.4965325openalex-snapshot
A local search for a graph clustering problem
inferred← citeshttps://doi.org/10.1088/1751-8113/42/34/345003openalex-snapshot
Correlation clustering on networks
inferred← citeshttps://doi.org/10.1109/ccdc.2008.4597772openalex-snapshot
Approach to SOM based correlation clustering
inferred← citeshttps://doi.org/10.1109/dsaa.2014.7058069openalex-snapshot
Interactive correlation clustering
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00068openalex-snapshot
Correlation Clustering with Sherali-Adams
inferred← citeshttps://doi.org/10.1109/icassp.2014.6855219openalex-snapshot
Sharp performance bounds for graph clustering via convex optimization
inferred← citeshttps://doi.org/10.1109/iccsp.2017.8286447openalex-snapshot
Community detection based on graph models of data
inferred← citeshttps://doi.org/10.1109/icdm.2011.114openalex-snapshot
Overlapping Correlation Clustering
inferred← citeshttps://doi.org/10.1109/icdmw.2013.99openalex-snapshot
Optimal Correlation Clustering via MaxSAT
inferred← citeshttps://doi.org/10.1109/ifita.2010.170openalex-snapshot
A Fixed-Parameter Tractable Algorithm for Correlation Clustering with l Clusters
inferred← citeshttps://doi.org/10.1109/ndt.2009.5272169openalex-snapshot
Approximation algorithm for correlation clustering
inferred← citeshttps://doi.org/10.1109/tkde.2007.190689openalex-snapshot
On Modularity Clustering
inferred← citeshttps://doi.org/10.1134/s1064226915120177openalex-snapshot
Combinatorial clustering: Literature review, methods, examples
inferred← citeshttps://doi.org/10.1134/s1990478916030042openalex-snapshot
Graph clustering with a constraint on cluster sizes
inferred← citeshttps://doi.org/10.1134/s1990478919030153openalex-snapshot
The Branch and Cut Method for the Clique Partitioning Problem
inferred← citeshttps://doi.org/10.1134/s1990478920030084openalex-snapshot
2-Approximation Algorithms for Two Graph Clustering Problems
inferred← citeshttps://doi.org/10.1137/1.9781611977585.ch12openalex-snapshot
Voting algorithms for unique games on complete graphs
inferred← citeshttps://doi.org/10.1137/110820555openalex-snapshot
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs
inferred← citeshttps://doi.org/10.1142/s0129183108012984openalex-snapshot
MOLECULAR DYNAMICS APPROACH TO CORRELATION CLUSTERING
inferred← citeshttps://doi.org/10.1145/1376916.1376945openalex-snapshot
Approximation algorithms for co-clustering
inferred← citeshttps://doi.org/10.1145/1388240.1388242openalex-snapshot
Theory research at Google
inferred← citeshttps://doi.org/10.1145/1536414.1536458openalex-snapshot
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
inferred← citeshttps://doi.org/10.1145/1552291.1552292openalex-snapshot
An online blog reading system by topic clustering and personalized ranking
inferred← citeshttps://doi.org/10.1145/2339530.2339735openalex-snapshot
Chromatic correlation clustering
inferred← citeshttps://doi.org/10.1145/2728170openalex-snapshot
Chromatic Correlation Clustering
inferred← citeshttps://doi.org/10.1145/2736277.2741629openalex-snapshot
Improved Theoretical and Practical Guarantees for Chromatic Correlation Clustering
inferred← citeshttps://doi.org/10.1145/2746539.2746604openalex-snapshot
Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
inferred← citeshttps://doi.org/10.1145/3340531.3411896openalex-snapshot
Semi-Supervised Max-Sum Clustering
inferred← citeshttps://doi.org/10.1145/3618260.3649712openalex-snapshot
Combinatorial Correlation Clustering
inferred← citeshttps://doi.org/10.1201/9781315383149-16openalex-snapshot
References
inferred← citeshttps://doi.org/10.13140/rg.2.1.1297.1043openalex-snapshot
Online Algorithms for Graph Partitioning into Cliques
inferred← citeshttps://doi.org/10.1504/ijmheur.2014.063141openalex-snapshot
Iterative merging heuristics for correlation clustering
inferred← citeshttps://doi.org/10.2200/s01163ed1v01y202201dmk019openalex-snapshot
Correlation Clustering
inferred← citeshttps://doi.org/10.22331/q-2022-04-13-687openalex-snapshot
Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach
inferred← citeshttps://doi.org/10.3115/1611638.1611641openalex-snapshot
Bounding and comparing methods for correlation clustering beyond ILP
inferred← citeshttps://doi.org/10.4108/icst.infoscale2008.3549openalex-snapshot
Efficient Query Routing by Improved Peer Description in P2P Networks
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2486openalex-snapshot
Online Correlation Clustering
inferred← citeshttps://doi.org/10.48550/arxiv.1012.3011openalex-snapshot
An Improved Algorithm for Bipartite Correlation Clustering
inferred← citeshttps://doi.org/10.48550/arxiv.1110.2136openalex-snapshot
Active Learning Using Smooth Relative Regret Approximations with Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1301.4769openalex-snapshot
A Correlation Clustering Approach to Link Classification in Signed Networks -- Full Version --
inferred← citeshttps://doi.org/10.48550/arxiv.1302.4549openalex-snapshot
Breaking the Small Cluster Barrier of Graph Clustering
inferred← citeshttps://doi.org/10.48550/arxiv.1611.09030openalex-snapshot
A modelling and computational study of the frustration index in signed networks
inferred← citeshttps://doi.org/10.48550/arxiv.2106.07255openalex-snapshot
Federated Myopic Community Detection with One-shot Communication
inferred← citeshttps://doi.org/10.5445/ir/1000005777openalex-snapshot
On Modularity - NP-Completeness and Beyond
inferred← citeshttps://doi.org/10.5815/ijitcs.2017.03.08openalex-snapshot
Priority Based New Approach for Correlation Clustering
inferred← citeshttps://doi.org/10.70675/909bbe94z5fa8z4ba3z80bbzc56545575d65openalex-snapshot
Characterizing edges in signed and vector-valued graphs
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.