Contact

All Stories

  1. Generative Datalog with Stable Negation

    Article • June 2023, ACM (Association for Computing Machinery)

    Dr Mario Alviano, Matthias Lanzinger

  2. The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree

    Article • June 2023, ACM (Association for Computing Machinery)

    Matthias Lanzinger

  3. Incremental Updates of Generalized Hypertree Decompositions

    Article • ACM Journal of Experimental Algorithmics, December 2022, ACM (Association for Computing Machinery)

    Matthias Lanzinger

  4. Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth

    Article • June 2022, ACM (Association for Computing Machinery)

    Reinhard Pichler, Matthias Lanzinger

  5. The Complexity of Conjunctive Queries with Degree 2

    Article • June 2022, ACM (Association for Computing Machinery)

    Matthias Lanzinger

  6. Complexity Analysis of Generalized and Fractional Hypertree Decompositions

    Article • Journal of the ACM, October 2021, ACM (Association for Computing Machinery)

    Matthias Lanzinger

  7. Guaranteed polynomial time answering of database queries that include negation.

    Article • June 2021, ACM (Association for Computing Machinery)

    Matthias Lanzinger