Planarity testing (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Planarity testing" in English language version.

refsWebsite

Global rank English rank

19doi.org

2^nd place

9semanticscholar.org

11^th place

8^th place

2handle.net

102^nd place

76^th place

2arxiv.org

69^th place

59^th place

1uni-koeln.de

2,455^th place

3,121^st place

1psu.edu

207^th place

136^th place

1bl.uk

1,234^th place

779^th place

1web.archive.org

1^st place

1archive.org

6^th place

1jgaa.info

low place

1harvard.edu

18^th place

17^th place

1uni-konstanz.de

low place

8,610^th place

1ogdf.net

low place

1boost.org

low place

archive.org

Taylor, Martyn G. (2012). Planarity Testing by Path Addition (Ph.D.). University of Kent. Archived from the original on 2016-03-05. Alt URL

arxiv.org

de Fraysseix, H.; Ossona de Mendez, P.; Rosenstiehl, P. (2006), "Trémaux Trees and Planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1030, arXiv:math/0610935, Bibcode:2006math.....10935D, doi:10.1142/S0129054106004248, S2CID 40107560.
Holm, Jacob; Rotenberg, Eva (2020). "Fully-dynamic planarity testing in polylogarithmic time". In Makarychev, Konstantin; Makarychev, Yury; Tulsiani, Madhur; Kamath, Gautam; Chuzhoy, Julia (eds.). Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020. Association for Computing Machinery. pp. 167–180. arXiv:1911.03449. doi:10.1145/3357713.3384249.

bl.uk

ethos.bl.uk

Taylor, Martyn G. (2012). Planarity Testing by Path Addition (Ph.D.). University of Kent. Archived from the original on 2016-03-05. Alt URL

boost.org

"Boost Graph Library: Boyer-Myrvold Planarity Testing/Embedding - 1.40.0".

doi.org

Hopcroft, John; Tarjan, Robert E. (1974), "Efficient planarity testing", Journal of the Association for Computing Machinery, 21 (4): 549–568, doi:10.1145/321850.321852, hdl:1813/6011, S2CID 6279825.
Mehlhorn, Kurt; Mutzel, Petra (1996), "On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm" (PDF), Algorithmica, 16 (2): 233–242, doi:10.1007/bf01940648, hdl:11858/00-001M-0000-0014-B51D-B, S2CID 10014462
Mehlhorn, Kurt; Näher, Stefan (1995), "LEDA: A library of efficient data types and algorithms", Communications of the ACM, 38 (1): 96–102, CiteSeerX 10.1.1.54.9556, doi:10.1145/204865.204889, S2CID 2560175
Even, Shimon; Tarjan, Robert E. (1976), "Computing an st-numbering", Theoretical Computer Science, 2 (3): 339–344, doi:10.1016/0304-3975(76)90086-4.
Chiba, N.; Nishizeki, T.; Abe, A.; Ozawa, T. (1985), "A linear algorithm for embedding planar graphs using PQ–trees", Journal of Computer and System Sciences, 30 (1): 54–76, doi:10.1016/0022-0000(85)90004-2.
Shih, W. K.; Hsu, W. L. (1999), "A new planarity test", Theoretical Computer Science, 223 (1–2): 179–191, doi:10.1016/S0304-3975(98)00120-0.
Boyer, John M.; Myrvold, Wendy J. (2004), "On the cutting edge: simplified O(n) planarity by edge addition" (PDF), Journal of Graph Algorithms and Applications, 8 (3): 241–273, doi:10.7155/jgaa.00091.
de Fraysseix, H.; Ossona de Mendez, P.; Rosenstiehl, P. (2006), "Trémaux Trees and Planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1030, arXiv:math/0610935, Bibcode:2006math.....10935D, doi:10.1142/S0129054106004248, S2CID 40107560.
Chimani, M.; Mutzel, P.; Schmidt, J. M. (2008). "Efficient extraction of multiple Kuratowski subdivisions". Proc. 15th Int. Symp. Graph Drawing (GD'07). Lecture Notes in Computer Science. Vol. 4875. Sydney, Australia: Springer-Verlag. pp. 159–170. doi:10.1007/978-3-540-77537-9_17. ISBN 978-3-540-77536-2..
Williamson, S. G. (1984), "Depth First Search and Kuratowski Subgraphs", Journal of the ACM, 31 (4): 681–693, doi:10.1145/1634.322451, S2CID 8348222
Schmidt, Jens M. (2014), "The Mondshein Sequence", Automata, Languages, and Programming; Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP'14), Lecture Notes in Computer Science, vol. 8572, pp. 967–978, doi:10.1007/978-3-662-43948-7_80, ISBN 978-3-662-43947-0
La Poutré, Johannes A. (1994), "Alpha algorithms for incremental planarity testing", Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing (STOC), pp. 706–715, doi:10.1145/195058.195439, S2CID 16799743
Di Battista, Giuseppe; Tamassia, Roberto (1996), "on-line maintenance of triconnected components with SPQR-trees", Algorithmica, 15 (4): 302–318, doi:10.1007/BF01961541, S2CID 7838334
Tamassia, Roberto (1996), "On-line planar graph embedding", Journal of Algorithms, 21 (2): 201–239, doi:10.1006/jagm.1996.0044
Westbrook, Jeffery (1992), "Fast Incremental Planarity Testing", Automata, Languages and Programming, 19th International Colloquium, ICALP92, doi:10.1007/3-540-55719-9_86
Pătrașcu, Mihai; Demaine, Erik (2004), "Lower Bounds for Dynamic Connectivity", Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 546–553, doi:10.1145/1007352.1007435, ISBN 1581138520, S2CID 2121130
Holm, Jacob; Rotenberg, Eva (2020). "Fully-dynamic planarity testing in polylogarithmic time". In Makarychev, Konstantin; Makarychev, Yury; Tulsiani, Madhur; Kamath, Gautam; Chuzhoy, Julia (eds.). Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020. Association for Computing Machinery. pp. 167–180. arXiv:1911.03449. doi:10.1145/3357713.3384249.
Eppstein, David; Galil, Zvi; Italiano, Giuseppe; Spencer, Thomas (1996), "Separator based sparsification: I. planarity testing and minimum spanning trees", Journal of Computer and System Sciences, doi:10.1006/jcss.1996.0002
Galil, Zvi; Italiano, Giuseppe; Sarnak, Neil (1999), "Fully dynamic planarity testing with applications", Journal of the ACM, 46: 28–91, doi:10.1145/300515.300517, S2CID 7009330

handle.net

hdl.handle.net

Hopcroft, John; Tarjan, Robert E. (1974), "Efficient planarity testing", Journal of the Association for Computing Machinery, 21 (4): 549–568, doi:10.1145/321850.321852, hdl:1813/6011, S2CID 6279825.
Mehlhorn, Kurt; Mutzel, Petra (1996), "On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm" (PDF), Algorithmica, 16 (2): 233–242, doi:10.1007/bf01940648, hdl:11858/00-001M-0000-0014-B51D-B, S2CID 10014462

harvard.edu

ui.adsabs.harvard.edu

de Fraysseix, H.; Ossona de Mendez, P.; Rosenstiehl, P. (2006), "Trémaux Trees and Planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1030, arXiv:math/0610935, Bibcode:2006math.....10935D, doi:10.1142/S0129054106004248, S2CID 40107560.

jgaa.info

Boyer, John M.; Myrvold, Wendy J. (2004), "On the cutting edge: simplified O(n) planarity by edge addition" (PDF), Journal of Graph Algorithms and Applications, 8 (3): 241–273, doi:10.7155/jgaa.00091.

ogdf.net

"OGDF - Open Graph Drawing Framework: Start".

psu.edu

citeseerx.ist.psu.edu

Mehlhorn, Kurt; Näher, Stefan (1995), "LEDA: A library of efficient data types and algorithms", Communications of the ACM, 38 (1): 96–102, CiteSeerX 10.1.1.54.9556, doi:10.1145/204865.204889, S2CID 2560175

semanticscholar.org

api.semanticscholar.org

Hopcroft, John; Tarjan, Robert E. (1974), "Efficient planarity testing", Journal of the Association for Computing Machinery, 21 (4): 549–568, doi:10.1145/321850.321852, hdl:1813/6011, S2CID 6279825.
Mehlhorn, Kurt; Mutzel, Petra (1996), "On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm" (PDF), Algorithmica, 16 (2): 233–242, doi:10.1007/bf01940648, hdl:11858/00-001M-0000-0014-B51D-B, S2CID 10014462
Mehlhorn, Kurt; Näher, Stefan (1995), "LEDA: A library of efficient data types and algorithms", Communications of the ACM, 38 (1): 96–102, CiteSeerX 10.1.1.54.9556, doi:10.1145/204865.204889, S2CID 2560175
de Fraysseix, H.; Ossona de Mendez, P.; Rosenstiehl, P. (2006), "Trémaux Trees and Planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1030, arXiv:math/0610935, Bibcode:2006math.....10935D, doi:10.1142/S0129054106004248, S2CID 40107560.
Williamson, S. G. (1984), "Depth First Search and Kuratowski Subgraphs", Journal of the ACM, 31 (4): 681–693, doi:10.1145/1634.322451, S2CID 8348222
La Poutré, Johannes A. (1994), "Alpha algorithms for incremental planarity testing", Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing (STOC), pp. 706–715, doi:10.1145/195058.195439, S2CID 16799743
Di Battista, Giuseppe; Tamassia, Roberto (1996), "on-line maintenance of triconnected components with SPQR-trees", Algorithmica, 15 (4): 302–318, doi:10.1007/BF01961541, S2CID 7838334
Pătrașcu, Mihai; Demaine, Erik (2004), "Lower Bounds for Dynamic Connectivity", Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 546–553, doi:10.1145/1007352.1007435, ISBN 1581138520, S2CID 2121130
Galil, Zvi; Italiano, Giuseppe; Sarnak, Neil (1999), "Fully dynamic planarity testing with applications", Journal of the ACM, 46: 28–91, doi:10.1145/300515.300517, S2CID 7009330

uni-koeln.de

kups.ub.uni-koeln.de

Mehlhorn, Kurt; Mutzel, Petra (1996), "On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm" (PDF), Algorithmica, 16 (2): 233–242, doi:10.1007/bf01940648, hdl:11858/00-001M-0000-0014-B51D-B, S2CID 10014462

uni-konstanz.de

Brandes, Ulrik (2009), The left-right planarity test (PDF).

web.archive.org

Taylor, Martyn G. (2012). Planarity Testing by Path Addition (Ph.D.). University of Kent. Archived from the original on 2016-03-05. Alt URL