Exact Crossing Number Parameterized by Vertex Cover-Reference-Cited by-同舟云学术

Exact Crossing Number Parameterized by Vertex Cover

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

Author:

Hliněný Petr^ORCID,Sankaran Abhisekh

Publisher

Springer International Publishing

Link

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

Reference20 articles.

1. Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28(2), 300–343 (1984)

2. Biedl, T.C., Chimani, M., Derka, M., Mutzel, P.: Crossing number for graphs with bounded pathwidth. In: ISAAC 2017. LIPIcs, vol. 92, pp. 13:1–13:13. Schloss Dagstuhl (2017)

3. Cabello, S.: Hardness of approximation for crossing number. Discrete Comput. Geom. 49(2), 348–358 (2013)

4. Lecture Notes in Computer Science;S Cabello,2009

5. Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM J. Comput. 42(5), 1803–1829 (2013)

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

1. Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge;International Journal of Foundations of Computer Science;2023-09-29

2. Grid recognition: Classical and parameterized computational perspectives;Journal of Computer and System Sciences;2023-09

3. Parameterized complexity of graph planarity with restricted cyclic orders;Journal of Computer and System Sciences;2023-08

4. Vertex-Bipartition: A Unified Approach for Kernelization of Graph Linear Layout Problems Parameterized by Vertex Cover;International Journal of Foundations of Computer Science;2023-05-09

5. Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs;Lecture Notes in Computer Science;2023