Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams

Jacques Dark, Christian Konrad

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

Original languageEnglish
Title of host publication35th Computational Complexity Conference (CCC 2020)
PublisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany
Pages1-14
Number of pages14
Volume169
ISBN (Print)978-3-95977-156-6
DOIs
Publication statusPublished - 28 Jul 2020
EventComputational Complexity Conference - online
Duration: 28 Jul 202031 Jul 2020
Conference number: 35

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
ISSN (Electronic)1868-8969

Conference

ConferenceComputational Complexity Conference
Abbreviated titleCCC
Period28/07/2031/07/20

Cite this