Publications

2018

Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl

45th International Colloquium on Automata, Languages, and Programming, ICALP 2018

Authors

Chatzigiannakis, I

Kaklamanis, C

Marx, Dániel

Sannella, D

Editors

Chatzigiannakis, I

Kaklamanis, C

Marx, Dániel

Sannella, D

2018

In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 Society for Industrial and Applied Mathematics (SIAM), Philadelphia (PA), pp. 2357-2376.

Algorithms based on ∗-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing

Authors

Ivanyos, Gábor

Qiao, Y.

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

2018

In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 53:1-53:15.

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy

Authors

Agrawal, Akanksha

Jain, P

Kanesh, L

Lokshtanov, D

Saurabh, S

2018

ACTA CYBERNETICA, 23 (4)., pp. 1039-1054. ISSN 0324-721X

An Efficient Method to Reduce the Size of Consistent Decision Tables

Authors

Demetrovics, János

Quang, Hoang Minh

Thi, Vu Duc

Anh, Nguyen Viet

2018

In: Proceedings of the ACM Recommender Systems Challenge 2018 on - RecSys Challenge '18, pp. 1-4.

Efficient K-NN for Playlist Continuation

Authors

Kelen, Domokos Miklós

Berecz, Dániel

Béres, Ferenc

Benczúr, András, ifj

2018

In: 25th Annual EurOMA Conference. To Serve, To Produce and to Servitize in the Era of Networks, Big Data and Analytics, 2018.06.24-2018.06.26, Budapest.