Small set expansion hypothesis (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Small set expansion hypothesis" in English language version.

refsWebsite

Global rank English rank

8doi.org

2^nd place

5ams.org

451^st place

277^th place

3arxiv.org

69^th place

59^th place

1boazbarak.org

low place

1berkeley.edu

580^th place

462^nd place

1semanticscholar.org

11^th place

8^th place

1rutgers.edu

1,999^th place

1,355^th place

1nasonline.org

3,325^th place

2,396^th place

1weizmann.ac.il

4,983^rd place

8,002^nd place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Feige, Uriel; Hajiaghayi, Mohammadtaghi; Lee, James R. (2008), "Improved approximation algorithms for minimum weight vertex separators", SIAM Journal on Computing, 38 (2): 629–657, doi:10.1137/05064299X, MR 2411037
Wu, Yu; Austrin, Per; Pitassi, Toniann; Liu, David (2014), "Inapproximability of treewidth, one-shot pebbling, and related layout problems", Journal of Artificial Intelligence Research, 49: 569–600, doi:10.1613/jair.4030, MR 3195329
Manurangsi, Pasin (2018), "Inapproximability of maximum biclique problems, minimum $k$ -cut and densest at-least- $k$ -subgraph from the small set expansion hypothesis", Algorithms, 11 (1): P10:1–P10:22, arXiv:1705.03581, doi:10.3390/a11010010, MR 3758880
Gandhi, Rajiv; Kortsarz, Guy (2015), "On set expansion problems and the small set expansion conjecture" (PDF), Discrete Applied Mathematics, 194: 93–101, doi:10.1016/j.dam.2015.05.028, MR 3391764
Bansal, Nikhil; Feige, Uriel; Krauthgamer, Robert; Makarychev, Konstantin; Nagarajan, Viswanath; Naor, Joseph; Schwartz, Roy (2014), "Min-max graph partitioning and small set expansion" (PDF), SIAM Journal on Computing, 43 (2): 872–904, doi:10.1137/120873996, MR 3504685

arxiv.org (Global: 69^th place; English: 59^th place)

Raghavendra, Prasad; Steurer, David; Tulsiani, Madhur (2012), "Reductions between expansion problems", Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26–29, 2012, IEEE Computer Society, pp. 64–73, arXiv:1011.2586, doi:10.1109/CCC.2012.43, ISBN 978-0-7695-4708-4
Bafna, Mitali; Barak, Boaz; Kothari, Pravesh K.; Schramm, Tselil; Steurer, David (2021), "Playing unique games on certified small-set expanders", in Khuller, Samir; Williams, Virginia Vassilevska (eds.), STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21–25, 2021, Association for Computing Machinery, pp. 1629–1642, arXiv:2006.09969, doi:10.1145/3406325.3451099, ISBN 978-1-4503-8053-9
Manurangsi, Pasin (2018), "Inapproximability of maximum biclique problems, minimum $k$ -cut and densest at-least- $k$ -subgraph from the small set expansion hypothesis", Algorithms, 11 (1): P10:1–P10:22, arXiv:1705.03581, doi:10.3390/a11010010, MR 3758880

berkeley.edu (Global: 580^th place; English: 462^nd place)

people.eecs.berkeley.edu

Raghavendra, Prasad; Steurer, David (2010), "Graph expansion and the unique games conjecture", in Schulman, Leonard J. (ed.), Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5–8 June 2010 (PDF), Association for Computing Machinery, pp. 755–764, doi:10.1145/1806689.1806792, ISBN 978-1-4503-0050-6, S2CID 1601199

boazbarak.org (Global: low place; English: low place)

Barak, Boaz (2016), "SOS Lecture 6: The SOS approach to refuting the UGC" (PDF), Lecture notes on "Proofs, beliefs and algorithms through the lens of Sum of Squares", retrieved 2023-03-14

doi.org (Global: 2^nd place; English: 2^nd place)

Raghavendra, Prasad; Steurer, David (2010), "Graph expansion and the unique games conjecture", in Schulman, Leonard J. (ed.), Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5–8 June 2010 (PDF), Association for Computing Machinery, pp. 755–764, doi:10.1145/1806689.1806792, ISBN 978-1-4503-0050-6, S2CID 1601199
Raghavendra, Prasad; Steurer, David; Tulsiani, Madhur (2012), "Reductions between expansion problems", Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26–29, 2012, IEEE Computer Society, pp. 64–73, arXiv:1011.2586, doi:10.1109/CCC.2012.43, ISBN 978-0-7695-4708-4
Bafna, Mitali; Barak, Boaz; Kothari, Pravesh K.; Schramm, Tselil; Steurer, David (2021), "Playing unique games on certified small-set expanders", in Khuller, Samir; Williams, Virginia Vassilevska (eds.), STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21–25, 2021, Association for Computing Machinery, pp. 1629–1642, arXiv:2006.09969, doi:10.1145/3406325.3451099, ISBN 978-1-4503-8053-9
Feige, Uriel; Hajiaghayi, Mohammadtaghi; Lee, James R. (2008), "Improved approximation algorithms for minimum weight vertex separators", SIAM Journal on Computing, 38 (2): 629–657, doi:10.1137/05064299X, MR 2411037
Wu, Yu; Austrin, Per; Pitassi, Toniann; Liu, David (2014), "Inapproximability of treewidth, one-shot pebbling, and related layout problems", Journal of Artificial Intelligence Research, 49: 569–600, doi:10.1613/jair.4030, MR 3195329
Manurangsi, Pasin (2018), "Inapproximability of maximum biclique problems, minimum $k$ -cut and densest at-least- $k$ -subgraph from the small set expansion hypothesis", Algorithms, 11 (1): P10:1–P10:22, arXiv:1705.03581, doi:10.3390/a11010010, MR 3758880
Gandhi, Rajiv; Kortsarz, Guy (2015), "On set expansion problems and the small set expansion conjecture" (PDF), Discrete Applied Mathematics, 194: 93–101, doi:10.1016/j.dam.2015.05.028, MR 3391764
Bansal, Nikhil; Feige, Uriel; Krauthgamer, Robert; Makarychev, Konstantin; Nagarajan, Viswanath; Naor, Joseph; Schwartz, Roy (2014), "Min-max graph partitioning and small set expansion" (PDF), SIAM Journal on Computing, 43 (2): 872–904, doi:10.1137/120873996, MR 3504685

nasonline.org (Global: 3,325^th place; English: 2,396^th place)

2018 Michael and Sheila Held Prize: Prasad Raghavendra and David Steurer, National Academy of Sciences, retrieved 2023-11-23

rutgers.edu (Global: 1,999^th place; English: 1,355^th place)

sites.rutgers.edu

Gandhi, Rajiv; Kortsarz, Guy (2015), "On set expansion problems and the small set expansion conjecture" (PDF), Discrete Applied Mathematics, 194: 93–101, doi:10.1016/j.dam.2015.05.028, MR 3391764

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Raghavendra, Prasad; Steurer, David (2010), "Graph expansion and the unique games conjecture", in Schulman, Leonard J. (ed.), Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5–8 June 2010 (PDF), Association for Computing Machinery, pp. 755–764, doi:10.1145/1806689.1806792, ISBN 978-1-4503-0050-6, S2CID 1601199

weizmann.ac.il (Global: 4,983^rd place; English: 8,002^nd place)

wisdom.weizmann.ac.il

Bansal, Nikhil; Feige, Uriel; Krauthgamer, Robert; Makarychev, Konstantin; Nagarajan, Viswanath; Naor, Joseph; Schwartz, Roy (2014), "Min-max graph partitioning and small set expansion" (PDF), SIAM Journal on Computing, 43 (2): 872–904, doi:10.1137/120873996, MR 3504685

Small set expansion hypothesis (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

berkeley.edu (Global: 580th place; English: 462nd place)