Carving width (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Carving width" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

3semanticscholar.org

11^th place

8^th place

3ams.org

451^st place

277^th place

2arxiv.org

69^th place

59^th place

1berkeley.edu

580^th place

462^nd place

1psu.edu

207^th place

136^th place

ams.org

mathscinet.ams.org

Belmonte, Rémy; van 't Hof, Pim; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. (2013), "Characterizing graphs of small carving-width", Discrete Applied Mathematics, 161 (13–14): 1888–1893, doi:10.1016/j.dam.2013.02.036, MR 3056995
Arora, Sanjeev; Rao, Satish; Vazirani, Umesh (2009), "Expander flows, geometric embeddings and graph partitioning" (PDF), Journal of the ACM, 56 (2): A5:1–A5:37, doi:10.1145/1502793.1502794, MR 2535878, S2CID 263871111
Oum, Sang-il (2009), "Computing rank-width exactly", Information Processing Letters, 109 (13): 745–748, CiteSeerX 10.1.1.483.6708, doi:10.1016/j.ipl.2009.03.018, MR 2527717

arxiv.org

Khuller, Samir; Raghavachari, Balaji; Young, Neal (April 1994), "Designing multi-commodity flow trees", Information Processing Letters, 50 (1): 49–55, arXiv:cs/0205077, doi:10.1016/0020-0190(94)90044-2
Eppstein, David (2018), "The effect of planarization on width", Journal of Graph Algorithms & Applications, 22 (3): 461–481, arXiv:1708.05155, doi:10.7155/jgaa.00468, S2CID 28517765

berkeley.edu

people.eecs.berkeley.edu

Arora, Sanjeev; Rao, Satish; Vazirani, Umesh (2009), "Expander flows, geometric embeddings and graph partitioning" (PDF), Journal of the ACM, 56 (2): A5:1–A5:37, doi:10.1145/1502793.1502794, MR 2535878, S2CID 263871111

doi.org

Seymour, Paul D.; Thomas, Robin (1994), "Call routing and the ratcatcher", Combinatorica, 14 (2): 217–241, doi:10.1007/BF01215352, S2CID 7508434
Belmonte, Rémy; van 't Hof, Pim; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. (2013), "Characterizing graphs of small carving-width", Discrete Applied Mathematics, 161 (13–14): 1888–1893, doi:10.1016/j.dam.2013.02.036, MR 3056995
Khuller, Samir; Raghavachari, Balaji; Young, Neal (April 1994), "Designing multi-commodity flow trees", Information Processing Letters, 50 (1): 49–55, arXiv:cs/0205077, doi:10.1016/0020-0190(94)90044-2
Arora, Sanjeev; Rao, Satish; Vazirani, Umesh (2009), "Expander flows, geometric embeddings and graph partitioning" (PDF), Journal of the ACM, 56 (2): A5:1–A5:37, doi:10.1145/1502793.1502794, MR 2535878, S2CID 263871111
Thilikos, Dimitrios M.; Serna, Maria J.; Bodlaender, Hans L. (2000), "Constructive linear time algorithms for small cutwidth and carving-width", in Lee, D. T.; Teng, Shang-Hua (eds.), Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, Lecture Notes in Computer Science, vol. 1969, Springer, pp. 192–203, doi:10.1007/3-540-40996-3_17, ISBN 978-3-540-41255-7
Oum, Sang-il (2009), "Computing rank-width exactly", Information Processing Letters, 109 (13): 745–748, CiteSeerX 10.1.1.483.6708, doi:10.1016/j.ipl.2009.03.018, MR 2527717
Eppstein, David (2018), "The effect of planarization on width", Journal of Graph Algorithms & Applications, 22 (3): 461–481, arXiv:1708.05155, doi:10.7155/jgaa.00468, S2CID 28517765

psu.edu

citeseerx.ist.psu.edu

Oum, Sang-il (2009), "Computing rank-width exactly", Information Processing Letters, 109 (13): 745–748, CiteSeerX 10.1.1.483.6708, doi:10.1016/j.ipl.2009.03.018, MR 2527717

semanticscholar.org

api.semanticscholar.org

Seymour, Paul D.; Thomas, Robin (1994), "Call routing and the ratcatcher", Combinatorica, 14 (2): 217–241, doi:10.1007/BF01215352, S2CID 7508434
Arora, Sanjeev; Rao, Satish; Vazirani, Umesh (2009), "Expander flows, geometric embeddings and graph partitioning" (PDF), Journal of the ACM, 56 (2): A5:1–A5:37, doi:10.1145/1502793.1502794, MR 2535878, S2CID 263871111
Eppstein, David (2018), "The effect of planarization on width", Journal of Graph Algorithms & Applications, 22 (3): 461–481, arXiv:1708.05155, doi:10.7155/jgaa.00468, S2CID 28517765