Crossing minimization in perturbed drawings-Reference-Cited by-同舟云学术

Crossing minimization in perturbed drawings

Published:2020-06-12 Issue:2 Volume:40 Page:279-302
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Fulek Radoslav^ORCID,Tóth Csaba D.

Funder

Austrian Science Fund

Division of Computing and Communication Foundations

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

https://link.springer.com/content/pdf/10.1007/s10878-020-00586-0.pdf

Reference24 articles.

1. Akitaya HA, Aloupis G, Erickson J, Tóth CD (2017) Recognizing weakly simple polygons. Discrete Comput Geom 58(4):785–821. https://doi.org/10.1007/s00454-017-9918-3

2. Akitaya HA, Fulek R, Tóth CD (2018) Recognizing weak embeddings of graphs. In Proceedings 29th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 274–292. SIAM. https://doi.org/10.1137/1.9781611975031.20

3. Angelini P, Da Lozzo G (2019) Clustered planarity with pipes. Algorithmica 81(6):2484–2526. https://doi.org/10.1007/s00453-018-00541-w

4. Angelini P, Da Lozzo G, Di Battista G, Frati F (2017) Strip planarity testing for embedded planar graphs. Algorithmica 77(4):1022–1059. https://doi.org/10.1007/s00453-016-0128-9

5. Cabello S (2013) Hardness of approximation for crossing number. Discrete Comput Geom 49(2):348–358. https://doi.org/10.1007/s00454-012-9440-6

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

1. Solving the incremental graph drawing problem by multiple neighborhood solution-based tabu search algorithm;Expert Systems with Applications;2024-03