Print preview VALIDITY EXPIRED personal data approved: 2014. III. 25. Publications |
2013
from data base, 2014. III. 25. |
Atserias A, Grohe M, Marx D: Size bounds and query plans for relational joins, SIAM JOURNAL ON COMPUTING 42: (4) pp. 1737-1767. type of document: Journal paper/Article impact factor: 0.803* language: English DOI |
2013
from data base, 2014. III. 25. |
Chitnis R, Hajiaghayi M, Marx D: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset, SIAM JOURNAL ON COMPUTING 42: (4) pp. 1674-1696. type of document: Journal paper/Article impact factor: 0.803* language: English DOI |
2013
from data base, 2014. III. 25. |
Marx D: Tractable hypergraph properties for constraint satisfaction and conjunctive queries, JOURNAL OF THE ACM 60: (6) pp. 1-51. Paper 42. type of document: Journal paper/Article impact factor: 2.370* language: English DOI |
2013
from data base, 2014. III. 25. |
Cygan M, Marx D, Pilipczuk M, Pilipczuk M: The planar directed k -Vertex-Disjoint Paths problem is fixed-parameter tractable, In: Reingold O (szerk.) 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS). Los Alamitos: IEEE, 2013. pp. 197-206. type of document: Part of book/Proceedings Paper language: English DOI |
2012
from data base, 2014. III. 25. |
Grohe M, Marx D: Structure theorem and isomorphism test for graphs with excluded topological subgraphs, In: Karloff Howard J, Pitassi Toniann (szerk.) 44th Annual ACM Symposium on Theory of Computing, STOC '12. New York: ACM Press, 2012. pp. 173-192. type of document: Part of book/Proceedings Paper language: English DOI |
2011
from data base, 2014. III. 25. |
Grohe M, Kawarabayashi K-I, Marx D, Wollan P: Finding topological subgraphs is fixed-parameter tractable, In: Vadhan S (szerk.) 43rd ACM Symposium on Theory of Computing, STOC'11. New York: ACM Press, 2011. pp. 479-488. type of document: Part of book/Proceedings Paper language: English DOI |
2011
from data base, 2014. III. 25. |
Marx D, Razgon I: Fixed-parameter tractability of multicut parameterized by the size of the cutset, In: Vadhan S (szerk.) 43rd ACM Symposium on Theory of Computing, STOC'11. New York: ACM Press, 2011. pp. 469-478. type of document: Part of book/Proceedings Paper language: English DOI |
2011
from data base, 2014. III. 25. |
Bateni M, Hajiaghayi M, Marx D: Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth, JOURNAL OF THE ACM 58: (5) 37 p. Paper 21. type of document: Journal paper/Article impact factor: 2.353 language: English DOI |
2010
from data base, 2014. III. 25. |
Bulatov AA, Marx D: Constraint satisfaction problems and global cardinality constraints, COMMUNICATIONS OF THE ACM 53: (9) pp. 99-106. type of document: Journal paper/Article impact factor: 2.353 language: English DOI |
2008
from data base, 2014. III. 25. |
Marx D: Closest substring problems with small distances, SIAM JOURNAL ON COMPUTING 38: (4) pp. 1382-1410. type of document: Journal paper/Article impact factor: 1.459 language: English DOI |
| Number of independent citations to these publications: | 0 |
|
|