Marko Samer

Recent Publications

Fixed-Parameter Tractability
2021, Technical report AC-TR-21-004, Algorithms and Complexity Group, TU Wien.
Note: Chapter 17, Handbook of Satisfiability, 2nd Edition, 2021
Fixed-Parameter Tractability
Chapter in Handbook of Satisfiability, 2nd Edition (Armin Biere and Marijn Heule and Hans van Maaren and Toby Walsh), pages 693-736, 2021, IOS Press.
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences, volume 76, number 2, pages 103-114, 2010.
Backdoor Trees
AAAI 08, Twenty-Third Conference on Artificial Intelligence, Chicago, Illinois, July 13-17, 2008, pages 363-368, 2008, AAAI Press.
Tractable Cases of the Extended Global Cardinality Constraint
Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008 (J. Harland and P. Manyem), volume 77 of Conferences in Research and Practice in Information Technology, pages 67-74, 2008, Australian Computer Society.
Algorithms for Propositional Model Counting
Proceedings of LPAR 2007, 14th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, October 15-19, 2007 Yerevan, Armenia, volume 4790 of Lecture Notes in Computer Science, pages 484-498, 2007, Springer Verlag.
Backdoor Sets of Quantified Boolean Formulas
Proceedings of SAT 2007, Tenth International Conference on Theory and Applications of Satisfiability Testing, May 28-31, 2007, Lisbon, Portugal, (J. Marques-Silva and K. A. Sakallah), volume 4501 of Lecture Notes in Computer Science, pages 230-243, 2007.
Constraint satisfaction with bounded treewidth revisited
Proceedings of CP 2006 , Twelfth International Conference on Principles and Practice of Constraint Programming, September 24-29, 2006, Nantes, France, volume 4204 of Lecture Notes in Computer Science, pages 499-513, 2006.
Note: Full version appeared in Constraints