A Tighter Insertion-Based Approximation of the Crossing Number-Reference-Cited by-同舟云学术

A Tighter Insertion-Based Approximation of the Crossing Number

Published:2011 Issue: Volume: Page:122-134
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Chimani Markus,Hliněný Petr

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22006-7_11

Reference24 articles.

1. Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. J. ACM 56, 5:1–5:37 (2009)

2. Bienstock, D., Monma, C.L.: On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica 5(1), 93–109 (1990)

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

4. Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number hard. In: Proc. SoCG 2010, pp. 68–76. ACM, New York (2010)

5. Chimani, M.: Computing Crossing Numbers. PhD thesis, TU Dortmund, Germany (2008), http://www.ae.uni-jena.de/alenmedia/dokumente/ComputingCrossingNumbers_PhDthesis_Chimani_pdf.pdf

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

1. Minimizing an Uncrossed Collection of Drawings;Lecture Notes in Computer Science;2023

2. A subpolynomial approximation algorithm for graph crossing number in low-degree graphs;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

3. Towards Better Approximation of Graph Crossing Number;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11

4. On maximum common subgraph problems in series–parallel graphs;European Journal of Combinatorics;2018-02

5. A tighter insertion-based approximation of the crossing number;Journal of Combinatorial Optimization;2016-05-25