Five most important publications of Dániel Marx

Note: the copyright of the published papers is with the respective publishers. The papers are made available here to ensure the timely dissemination of scholarly information. The published versions of the papers may have gone through additional rounds of copyediting and proofreading.

Detailed list (with abstracts)

DBLP

  1. Can you beat treewidth?
    To appear in Theory of Computing.
    (Preliminary version in FOCS 2007.)
    [pdf] [BibTeX] [Google search]

  2. Closest substring problems with small distances.
    SIAM Journal on Computing, 38(4):1382-1410, 2008.
    (Preliminary version in FOCS 2005.)
    [pdf] [BibTeX] [Google search] [Publisher's version]

  3. Size bounds and query plans for relational joins.
    In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), 739-748, 2008.
    (with: Albert Atserias, Martin Grohe)
    [pdf] [BibTeX] [Google search]

  4. On the optimality of planar and geometric approximation schemes.
    In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 338-348, 2007.
    [pdf] [BibTeX] [Google search]

  5. Constraint solving via fractional edge covers.
    In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), 289-298, 2006.
    (with: Martin Grohe)
    [pdf] [BibTeX] [Google search]

BackBack to homepage