-
1
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
Published 2024“…In: 46th international colloquium on automata, languages, and programming, ICALP 2019, July 9–12, 2019, Patras, Greece, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2019]. …”
Get full text
Article -
2
-
3
The complexity of general-valued constraint satisfaction problems seen from the other side
Published 2022“…ACM, 54 (2007), 1], and Atserias, Bulatov, and Dalmau [Proceedings of the 34th International Colloquium on Automata, Languages and Programming, Springer, New York, 2007, pp. 279--290] establish the precise borderline of polynomial-time solvability (subject to complexity-theoretic assumptions) and of solvability by bounded-consistency algorithms (unconditionally) as bounded treewidth modulo homomorphic equivalence. …”
Journal article -
4
Subspace designs based on algebraic function fields
Published 2018Get full text
Get full text
Journal Article -
5
-
6
Towards optimal set-disjointness and set-intersection data structures
Published 2021“…© Tsvi Kopelowitz and Virginia Vassilevska Williams; licensed under Creative Commons License CC-BY 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). …”
Get full text
Article -
7
Conditionally optimal approximation algorithms for the girth of a directed graph
Published 2021“…© Mina Dalirrooyfard and Virginia Vassilevska Williams; licensed under Creative Commons License CC-BY 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). …”
Get full text
Article