Skip to main content

Publications

2016

SIAM JOURNAL ON DISCRETE MATHEMATICS, 30 (1)., pp. 141-153. ISSN 0895-4801

Lehman's Theorem and the Directed Steiner Tree Problem

Authors
Abdi, A
Feldmann, Andreas Emil
Guenin, B
Konemann, J
Sanita, L
Read more
2016

In: 28th European Summer School in Logic, Language and Information, ESSLLI 2016, DSALT: Distributional Semantics and Linguistic Theory, 2016.08.15-2016.08.26, Bolzano.

Denoising composition in distributional semantics

Authors
Borbély, Gábor
Kornai, András
Kracht, M
Nemeskey, Dávid Márk
Read more
2016

LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 9941 L, pp. 74-84. ISSN 0302-9743

Packing and covering immersion models of planar subcubic graphs

Authors
Giannopoulou, AC
Kwon, O-joung
Raymond, J-F
Thilikos, DM
Read more
2016

Cognitive Neurodynamics ISSN 1871-4080

Parameterizable consensus connectomes from the Human Connectome Project: the Budapest Reference Connectome Server v3.0

Authors
Szalkai, Balázs
Kerepesi, Csaba
Varga, Bálint
Grolmusz, Vince
Read more
2016

In: 25th International Joint Conference on Artificial Intelligence, IJCAI 2016 IJCAI International Joint Conference on Artificial Intelligence (2016-J) IJCAI, New York, pp. 109-115. ISSN 1045-0823

The complexity of playing durak

Authors
Bonnet, Édouard
Editors
Kambhampati, S
Read more
2016

In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 Leibniz International Proceedings in Informatics, LIPIcs (47) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 28:1-28:13. ISSN 1868-8969

Packing groups of items into multiple knapsacks

Authors
Chen, Lin
Zhang, G
Editors
Vollmer, H
Ollinger, N
Read more
2016

Archives of Virology, 161 (3)., pp. 721-724. ISSN 0304-8608

Giant viruses of the Kutch Desert

Authors
Kerepesi, Csaba
Grolmusz, Vince
Read more
1998

In: Proceedings of the ninth annual ACM-SIAM symposium on discrete algorithms. San Francisco, 1998..

Augmenting undirected edge-connectivity in Ő(n2) time

Authors
Benczúr, András
Karger, DR
Read more
2016

In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 Leibniz International Proceedings in Informatics, LIPIcs (47) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 22:1-22:14. ISSN 1868-8969

Time-approximation trade-offs for inapproximable problems

Authors
Bonnet, Édouard
Lampis, M
Paschos, V T
Editors
Ollinger, N
Vollmer, H
Read more
2016

ACM TRANSACTIONS ON ALGORITHMS, 12 (3)., pp. 41. ISSN 1549-6325

On Problems as Hard as CNF-SAT

Authors
Cygan, M
Dell, H
Lokshtanov, D
Marx, Dániel
Nederlof, J
Read more