Bounded expansion (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Bounded expansion" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

6ams.org

451^st place

277^th place

5arxiv.org

69^th place

59^th place

4semanticscholar.org

11^th place

8^th place

2harvard.edu

18^th place

17^th place

1maastrichtuniversity.nl

low place

1epfl.ch

4,521^st place

4,877^th place

1sarielhp.org

low place

ams.org

mathscinet.ams.org

Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), "5.5 Classes with Bounded Expansion", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, pp. 104–107, doi:10.1007/978-3-642-27875-4, ISBN 978-3-642-27874-7, MR 2920058.
Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Wood, David R. (2012), "Characterisations and examples of graph classes with bounded expansion", European Journal of Combinatorics, 33 (3): 350–373, arXiv:0902.3265, doi:10.1016/j.ejc.2011.09.008, MR 2864421, S2CID 2633083.
Dvořák, Zdeněk; Norin, Sergey (2016), "Strongly sublinear separators and polynomial expansion", SIAM Journal on Discrete Mathematics, 30 (2): 1095–1101, arXiv:1504.04821, doi:10.1137/15M1017569, MR 3504982, S2CID 27395359
Grigoriev, Alexander; Bodlaender, Hans L. (2007), "Algorithms for graphs embeddable with few crossings per edge", Algorithmica, 49 (1): 1–11, doi:10.1007/s00453-007-0010-x, MR 2344391, S2CID 8174422.
Miller, Gary L.; Teng, Shang-Hua; Thurston, William; Vavasis, Stephen A. (1997), "Separators for sphere-packings and nearest neighbor graphs", Journal of the ACM, 44 (1): 1–29, doi:10.1145/256292.256294, MR 1438463.
Dvořák, Zdeněk; Kráľ, Daniel; Thomas, Robin (2010), "Deciding first-order properties for sparse graphs", Proc. 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), IEEE Computer Soc., Los Alamitos, CA, pp. 133–142, MR 3024787.

arxiv.org

Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Wood, David R. (2012), "Characterisations and examples of graph classes with bounded expansion", European Journal of Combinatorics, 33 (3): 350–373, arXiv:0902.3265, doi:10.1016/j.ejc.2011.09.008, MR 2864421, S2CID 2633083.
Dvořák, Zdeněk; Norin, Sergey (2016), "Strongly sublinear separators and polynomial expansion", SIAM Journal on Discrete Mathematics, 30 (2): 1095–1101, arXiv:1504.04821, doi:10.1137/15M1017569, MR 3504982, S2CID 27395359
Dujmović, Vida; Eppstein, David; Wood, David R. (2015), "Genus, treewidth, and local crossing number", Proc. 23rd Int. Symp. Graph Drawing (GD 2015), arXiv:1506.04380, Bibcode:2015arXiv150604380D.
Dujmović, Vida; Sidiropoulos, Anastasios; Wood, David R. (2015), 3-Monotone Expanders, arXiv:1501.05020, Bibcode:2015arXiv150105020D
Har-Peled, Sariel; Quanrud, Kent (2015), "Approximation algorithms for polynomial-expansion and low-density graphs", Algorithms - ESA 2015, Lecture Notes in Computer Science, vol. 9294, Springer-Verlag, pp. 717–728, arXiv:1501.00721, doi:10.1007/978-3-662-48350-3_60, ISBN 978-3-662-48349-7.

doi.org

Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), "5.5 Classes with Bounded Expansion", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, pp. 104–107, doi:10.1007/978-3-642-27875-4, ISBN 978-3-642-27874-7, MR 2920058.
Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Wood, David R. (2012), "Characterisations and examples of graph classes with bounded expansion", European Journal of Combinatorics, 33 (3): 350–373, arXiv:0902.3265, doi:10.1016/j.ejc.2011.09.008, MR 2864421, S2CID 2633083.
Dvořák, Zdeněk; Norin, Sergey (2016), "Strongly sublinear separators and polynomial expansion", SIAM Journal on Discrete Mathematics, 30 (2): 1095–1101, arXiv:1504.04821, doi:10.1137/15M1017569, MR 3504982, S2CID 27395359
Grigoriev, Alexander; Bodlaender, Hans L. (2007), "Algorithms for graphs embeddable with few crossings per edge", Algorithmica, 49 (1): 1–11, doi:10.1007/s00453-007-0010-x, MR 2344391, S2CID 8174422.
Fox, Jacob; Pach, János (2009), "A separator theorem for string graphs and its applications" (PDF), Combinatorics, Probability and Computing, 19 (3): 371, doi:10.1017/s0963548309990459, S2CID 5705145.
Miller, Gary L.; Teng, Shang-Hua; Thurston, William; Vavasis, Stephen A. (1997), "Separators for sphere-packings and nearest neighbor graphs", Journal of the ACM, 44 (1): 1–29, doi:10.1145/256292.256294, MR 1438463.
Har-Peled, Sariel; Quanrud, Kent (2015), "Approximation algorithms for polynomial-expansion and low-density graphs", Algorithms - ESA 2015, Lecture Notes in Computer Science, vol. 9294, Springer-Verlag, pp. 717–728, arXiv:1501.00721, doi:10.1007/978-3-662-48350-3_60, ISBN 978-3-662-48349-7.

epfl.ch

infoscience.epfl.ch

Fox, Jacob; Pach, János (2009), "A separator theorem for string graphs and its applications" (PDF), Combinatorics, Probability and Computing, 19 (3): 371, doi:10.1017/s0963548309990459, S2CID 5705145.

harvard.edu

ui.adsabs.harvard.edu

Dujmović, Vida; Eppstein, David; Wood, David R. (2015), "Genus, treewidth, and local crossing number", Proc. 23rd Int. Symp. Graph Drawing (GD 2015), arXiv:1506.04380, Bibcode:2015arXiv150604380D.
Dujmović, Vida; Sidiropoulos, Anastasios; Wood, David R. (2015), 3-Monotone Expanders, arXiv:1501.05020, Bibcode:2015arXiv150105020D

maastrichtuniversity.nl

cris.maastrichtuniversity.nl

Grigoriev, Alexander; Bodlaender, Hans L. (2007), "Algorithms for graphs embeddable with few crossings per edge", Algorithmica, 49 (1): 1–11, doi:10.1007/s00453-007-0010-x, MR 2344391, S2CID 8174422.

sarielhp.org

Har-Peled, Sariel; Quanrud, Kent (2015), "Approximation algorithms for polynomial-expansion and low-density graphs", Algorithms - ESA 2015, Lecture Notes in Computer Science, vol. 9294, Springer-Verlag, pp. 717–728, arXiv:1501.00721, doi:10.1007/978-3-662-48350-3_60, ISBN 978-3-662-48349-7.

semanticscholar.org

api.semanticscholar.org

Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Wood, David R. (2012), "Characterisations and examples of graph classes with bounded expansion", European Journal of Combinatorics, 33 (3): 350–373, arXiv:0902.3265, doi:10.1016/j.ejc.2011.09.008, MR 2864421, S2CID 2633083.
Dvořák, Zdeněk; Norin, Sergey (2016), "Strongly sublinear separators and polynomial expansion", SIAM Journal on Discrete Mathematics, 30 (2): 1095–1101, arXiv:1504.04821, doi:10.1137/15M1017569, MR 3504982, S2CID 27395359
Grigoriev, Alexander; Bodlaender, Hans L. (2007), "Algorithms for graphs embeddable with few crossings per edge", Algorithmica, 49 (1): 1–11, doi:10.1007/s00453-007-0010-x, MR 2344391, S2CID 8174422.
Fox, Jacob; Pach, János (2009), "A separator theorem for string graphs and its applications" (PDF), Combinatorics, Probability and Computing, 19 (3): 371, doi:10.1017/s0963548309990459, S2CID 5705145.