Parameterized streaming : maximal matching and vertex cover
- Submitting institution
-
The University of Warwick
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 5889
- Type
- E - Conference contribution
- DOI
-
10.1137/1.9781611973730.82
- Title of conference / published proceedings
- ACM SIAM Symposium on Discrete Algorithms (SODA)
- First page
- 1234
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- January
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
D - Data Science, Systems and Security
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Funded by an ERC consolidator grant and published at the top conference in algorithms, this work is responsible for launching a line of research on the newly introduced notion of parameterized streaming, such as Huang and Peng's work on single-pass o(n) space algorithms in the dynamic streaming model (Algorithmica, 2018), and dynamic algorithms for feedback vertex set and k-path due to Alman, Mnich and Williams (ACM Trans. Algorithms 2020). It is used for providing tight bounds on matchings in several subsequent works by Assadi and Khanna (ACM/SIAM SODA 2016, ACM SPAA 2017, ACM/SIAM SODA 2017, ACM/SIAM SODA 2019).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -