Skip to main content

Publications

Clear selection
Clear selection
2018

In: INFOCOM IEEE Communications Society, Honolulu (HI), pp. 1412-1420.

Bloom Filter with a False Positive Free Zone

Authors
Kiss, Sándor
Hosszu, Éva
Tapolcai, János
Rónyai, Lajos
Rottenstreich, O
Read more
2018

In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018 Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 27:1-27:15.

Finding list homomorphisms from bounded-treewidth graphs to reflexive graphs: A complete complexity characterization

Authors
Egri, L
Marx, Dániel
Rzazewski, P
Read more
2018

In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) IEEE Computer Society, New York (N.Y.), pp. 474-484.

On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs

Authors
Marx, Dániel
Pilipczuk, M
Pilipczuk, M
Read more
2018

ALGORITHMICA, xx (x)., pp. 1-18. ISSN 0178-4617

Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs

Authors
Bacsó, Gábor
Lokshtanov, D
Marx, Dániel
Pilipczuk, M
Tuza, Zsolt
Read more
2018

ALGORITHMICA, 80 (2)., pp. 560-575. ISSN 0178-4617

Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields

Authors
Ivanyos, Gábor
Karpinski, M
Santha, M
Saxena, N
Shparlinski, IE
Read more