Bundled Crossings Revisited-Reference-Cited by-同舟云学术

Bundled Crossings Revisited

Published:2019 Issue: Volume: Page:63-77
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Chaplick Steven^ORCID,van Dijk Thomas C.^ORCID,Kryven Myroslav,Park Ji-won,Ravsky Alexander,Wolff Alexander^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-35802-0_5

Reference26 articles.

1. Lecture Notes in Computer Science;MJ Alam,2016

2. Arroyo, A., Bensmail, J., Richter, R.B.: Extending drawings of graphs to arrangements of pseudolines. ArXiv report (2018). https://arxiv.org/abs/1804.09317

3. Bannister, M.J., Eppstein, D.: Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth. J. Graph Algorithms Appl. 22(4), 577–606 (2018). https://doi.org/10.7155/jgaa.00479

4. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996). https://doi.org/10.1137/S0097539793251219

5. Chaplick, S., van Dijk, T.C., Kryven, M., won Park, J., Ravsky, A., Wolff, A.: Bundled crossings revisited. ArXiv report (2019). https://arxiv.org/abs/1812.04263

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parameterized analysis and crossing minimization problems;Computer Science Review;2022-08

2. Approximating the Bundled Crossing Number;WALCOM: Algorithms and Computation;2022

3. Stable visualization of connected components in dynamic graphs;Information Visualization;2020-11-24

4. Crossing Layout in Non-planar Graph Drawings;Beyond Planar Graphs;2020