English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Strong Connectivity Augmentation is FPT

Vitting Klinkby, K., Misra, P., & Saurabh, S. (2021). Strong Connectivity Augmentation is FPT. In D. Marx (Ed.), Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (pp. 219-234). Philadelphia, PA: SIAM. doi:10.1137/1.9781611976465.15.

Item is

Basic

show hide
Genre: Conference Paper
Latex : Strong Connectivity Augmentation is {FPT}

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Vitting Klinkby, Kristine1, Author
Misra, Pranabendu2, Author           
Saurabh, Saket1, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 202020212021
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: SCAug21
DOI: 10.1137/1.9781611976465.15
 Degree: -

Event

show
hide
Title: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: Alexandria, VA, USA (Virtual Conference)
Start-/End Date: 2021-01-10 - 2021-01-13

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2021
Source Genre: Proceedings
 Creator(s):
Marx, Dániel1, Editor           
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 219 - 234 Identifier: ISBN: 978-1-61197-646-5