( en | de | ru )

 

Disambiguation of "Hecher, Markus"

Author of the publication

copydeleteadd this publication to your clipboard
Default Logic and Bounded Treewidth.

, , and . CoRR, (2017)

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

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)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)Treewidth-Aware Quantifier Elimination and Expansion for QCSP., , and . CP, volume 12333 of Lecture Notes in Computer Science, page 248-266. Springer, (2020)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)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)On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth., , and . ECAI, volume 372 of Frontiers in Artificial Intelligence and Applications, page 247-254. IOS Press, (2023)D-FLAT2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy., , , and . Fundam. Informaticae, 147 (1): 27-61 (2016)Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation., , , and . IJCAI, page 3212-3220. ijcai.org, (2023)Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF., , , , and . LICS, page 1-14. IEEE, (2023)