| Publication | Date of Publication | Type |
|---|
| Minimal solutions of fuzzy relation equations via maximal independent elements | 2024-11-28 | Paper |
| Diversity of answers to conjunctive queries | 2024-10-08 | Paper |
| Fast parallel hypertree decompositions in logarithmic recursion depth | 2024-04-30 | Paper |
| Fractional covers of hypergraphs with bounded multi-intersection | 2023-10-26 | Paper |
| The HyperTrac project: recent progress and future research directions on hypergraph decompositions | 2022-12-21 | Paper |
| Complexity Analysis of Generalized and Fractional Hypertree Decompositions | 2022-12-08 | Paper |
| Fast and parallel decomposition of constraint satisfaction problems | 2022-09-29 | Paper |
| HyperBench | 2022-09-06 | Paper |
| Datalog: Bag Semantics via Set Semantics | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089208 | 2022-07-18 | Paper |
| A complexity theory for hard enumeration problems | 2019-09-19 | Paper |
| A Fuzzy Extension of Data Exchange | 2019-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553280 | 2018-11-02 | Paper |
| Limits of schema mappings | 2018-07-16 | Paper |
| Implementing Courcelle's Theorem in a declarative framework for dynamic programming | 2018-02-13 | Paper |
| Fuzzy data exchange | 2018-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5276202 | 2017-07-14 | Paper |
| On the Complexity of Enumerating the Answers to Well-designed Pattern Trees | 2017-07-14 | Paper |
| Limits of Schema Mappings. | 2017-07-14 | Paper |
| A complexity theory for hard enumeration problems | 2017-06-01 | Paper |
| The Challenge of Optional Matching in SPARQL | 2016-05-19 | Paper |
| Monadic datalog over finite structures of bounded treewidth | 2015-09-17 | Paper |
| The complexity of handling minimal solutions in logic-based abduction | 2015-07-15 | Paper |
| Tractable answer-set programming with weight constraints: bounded treewidth is not enough | 2014-04-17 | Paper |
| Tractable counting of the answers to conjunctive queries | 2014-01-20 | Paper |
| Belief revision within fragments of propositional logic | 2013-12-13 | Paper |
| Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem | 2013-12-10 | Paper |
| Relaxed notions of schema mapping equivalence revisited | 2013-08-23 | Paper |
| Towards fixed-parameter tractable algorithms for abstract argumentation | 2012-11-15 | Paper |
| Multicut on Graphs of Bounded Clique-Width | 2012-11-02 | Paper |
| The complexity of handling minimal solutions in logic-based abduction | 2011-05-11 | Paper |
| Counting and Enumeration Problems with Bounded Treewidth | 2011-01-07 | Paper |
| A dynamic-programming based ASP-solver | 2010-10-01 | Paper |
| Counting complexity of propositional abduction | 2010-08-18 | Paper |
| Multicut algorithms via tree decompositions | 2010-05-28 | Paper |
| Bounded treewidth as a key to tractability of knowledge representation and reasoning | 2010-03-16 | Paper |
| Towards practical feasibility of core computation in data exchange | 2010-03-09 | Paper |
| Belief Revision with Bounded Treewidth | 2009-11-10 | Paper |
| Complexity of counting the optimal solutions | 2009-09-10 | Paper |
| Foundations of Rule-Based Query Answering | 2009-02-17 | Paper |
| Fast Counting with Bounded Treewidth | 2009-01-27 | Paper |
| Towards Practical Feasibility of Core Computation in Data Exchange | 2009-01-27 | Paper |
| The complexity of XPath query evaluation and XML typing | 2008-12-21 | Paper |
| Model Representation over Finite and Infinite Signatures | 2008-10-30 | Paper |
| Counting Complexity of Minimal Cardinality and Minimal Weight Abduction | 2008-10-27 | Paper |
| Complexity of Counting the Optimal Solutions | 2008-07-10 | Paper |
| Model Representation over Finite and Infinite Signatures | 2007-12-12 | Paper |
| Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains | 2007-11-13 | Paper |
| Automated Deduction – CADE-20 | 2006-11-01 | Paper |
| On deciding subsumption problems | 2005-05-13 | Paper |
| Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4809059 | 2004-08-12 | Paper |
| On the complexity of equational problems in CNF | 2003-08-25 | Paper |
| Explicit versus implicit representations of subsets of the Herbrand universe. | 2003-01-21 | Paper |
| Working with ARMs: Complexity results on atomic representations of Herbrand models | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535802 | 2002-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754181 | 2001-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723900 | 2001-07-08 | Paper |
| Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503913 | 2001-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503912 | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263159 | 2000-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246970 | 2000-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263808 | 1999-09-22 | Paper |
