Keyword

balanced separators

Description: Balanced separators are vertex or edge sets whose removal divides a graph into components of bounded size, enabling structural analysis and algorithms.
OpenAlex ID: keywords/balanced-separators
1995 · Nathan Linial, Eran London, et al. · COMBINATORICA · 1,109
2009 · Sanjeev Arora, Satish Rao, et al. · Journal of the ACM · 614
2004 · Sanjeev Arora, Satish Rao, et al. · ACM Symposium on Theory of Computing (STOC) · 372
2007 · Sanjeev Arora, Satyen Kale · ACM Symposium on Theory of Computing (STOC) · 238
2007 · Alexander Grigoriev, Hans L. Bodlaender · Algorithmica · 161
2012 · Lorenzo Orecchia, Sushant Sachdeva, et al. · ACM Symposium on Theory of Computing (STOC) · 143
2012 · Prasad Raghavendra, David Steurer, et al. · IEEE Conference on Computational Complexity (CCC) · 129
2016 · Sanjeev Arora, Satyen Kale · Journal of the ACM · 120
2009 · Prasad Raghavendra, David Steurer · Annual Symposium on Foundations of Computer Science · 110
2017 · Raghavendra, Prasad, Weitz, Benjamin · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 106
2010 · Aleksander Madry · Annual Symposium on Foundations of Computer Science · 103
2013 · Tsz Chiu Kwok, Lap Chi Lau, et al. · ACM Symposium on Theory of Computing (STOC) · 100
2013 · Ryan O'Donnell, Yuan Zhou · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 96
2004 · S. Arora, E. Hazan, et al. · Annual Symposium on Foundations of Computer Science · 73
2016 · Lee, James R. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 60
2006 · Hans L. Bodlaender, Fedor V. Fomin, et al. · Lecture notes in computer science · 60
2011 · Lorenzo Orecchia, Nisheeth K. Vishnoi · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 58
2010 · Sanjeev Arora, Elad Hazan, et al. · SIAM Journal on Computing · 57
2012 · Hans L. Bodlaender, Fedor V. Fomin, et al. · ACM Transactions on Algorithms · 55
2022 · Dániel Marx, Michał Pilipczuk · ACM Transactions on Algorithms · 49
1997 · Dieter Kratsch, Ton Kloks, et al. · Discrete Applied Mathematics · 49
2015 · Aaron Schild, Christian Sommer · Lecture notes in computer science · 48
2015 · Zdeněk Dvořák · European Journal of Combinatorics · 36
2024 · Peter Gartland, Daniel Lokshtanov, et al. · ACM Symposium on Theory of Computing (STOC) · 33
Works count: 163
Citation count: 4,821
Year
Topic
Type