( en | de | ru )

 

Disambiguation of "Hecher, Markus"

Author of the publication

copydeleteadd this publication to your clipboard
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard.

, and . CoRR, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kurt Hecher

Birgit Hecher

Christine Hecher

Markus Markus

Markus Kurscheidt

Ökonomische Analyse von Sportgroßveranstaltungen: ein integrierter Evaluierungs- und Management-Ansatz am Beispiel von Fußball-Weltmeisterschaften. Uni Paderborn, (2007)
 

Other publications of authors with the same name

An SMT Approach to Fractional Hypertree Width., , , and . CP, volume 11008 of Lecture Notes in Computer Science, page 109-127. Springer, (2018)Exploiting Treewidth for Projected Model Counting and Its Limits., , , and . SAT, volume 10929 of Lecture Notes in Computer Science, page 165-184. Springer, (2018)Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology., , and . SAT, volume 12178 of Lecture Notes in Computer Science, page 343-360. Springer, (2020)The D-FLAT System for Dynamic Programming on Tree Decompositions., , , , , and . JELIA, volume 8761 of Lecture Notes in Computer Science, page 558-572. Springer, (2014)D-FLAT2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy., , , and . Fundam. Informaticae, 147 (1): 27-61 (2016)Counting Answer Sets via Dynamic Programming., , , and . CoRR, (2016)Treewidth-Aware Quantifier Elimination and Expansion for QCSP., , and . CP, volume 12333 of Lecture Notes in Computer Science, page 248-266. Springer, (2020)Grounding Planning Tasks Using Tree Decompositions and Iterated Solving., , , , , and . ICAPS, page 100-108. AAAI Press, (2023)Complications for Computational Experiments from Modern Processors., , , and . CP, volume 210 of LIPIcs, page 25:1-25:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation., , , and . IJCAI, page 3212-3220. ijcai.org, (2023)