Crossing Number in Slightly Superexponential Time (Extended Abstract)

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (3 more authors) (2025) Crossing Number in Slightly Superexponential Time (Extended Abstract). In: Azar, Y. and Panigrahi, D., (eds.) Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM-SIAM Symposium on Discrete Algorithms (SODA25), 12-15 Jan 2025, New Orleans, Louisiana, U.S.A.. SIAM , pp. 1412-1424. ISBN 978-1-61197-832-2

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Editors:
  • Azar, Y.
  • Panigrahi, D.
Copyright, Publisher and Additional Information:

This is an author produced version of a proceedings paper published in ACM-SIAM Symposium on Discrete Algorithms (SODA25), made available under the terms of the Creative Commons Attribution License (CC-BY), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited.
Dates:
  • Published: 7 January 2025
  • Published (online): 7 January 2025
  • Accepted: 4 October 2024
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Algorithms & Complexity
Depositing User: Symplectic Publications
Date Deposited: 03 Jan 2025 13:04
Last Modified: 07 Feb 2025 16:10
Status: Published
Publisher: SIAM
Identification Number: 10.1137/1.9781611978322.44
Open Archives Initiative ID (OAI ID):

Download

Export

Statistics


CORE (COnnecting REpositories)