Publications Teaching Short CV
	Dr Marko Samer Formal Methods in Systems Engineering Department of Computer Science TU Vienna, Austria Tel.: ++43 (0)1 58801 18443 E-Mail: marko.samer (at) tuwien.ac.at Position Assistant (Postdoc) Interests Computational reasoning, formal logic, complexity theory, algorithm design and analysis
	Peer-Reviewed Journals Tractable Cases of the Extended Global Cardinality Constraint with Stefan Szeider. Constraints. To appear.   [ Abstract | BibTeX | Preliminary version ] On the Distributivity of LTL Specifications with Helmut Veith. ACM Transactions on Computational Logic (TOCL). To appear.   [ Abstract | BibTeX | Preliminary version ] Constraint Satisfaction with Bounded Treewidth Revisited with Stefan Szeider. Journal of Computer and System Sciences (JCSS) 76(2):103-114, 2010.   [ Abstract | BibTeX | Preliminary version ] Algorithms for Propositional Model Counting with Stefan Szeider. Journal of Discrete Algorithms (JDA) 8(1):50-64, 2010.   [ Abstract | BibTeX | Preliminary version ] Backdoor Sets of Quantified Boolean Formulas with Stefan Szeider. Journal of Automated Reasoning (JAR) 42(1):77-97, 2009.   [ Abstract | BibTeX | Preliminary version ] A Backtracking-Based Algorithm for Hypertree Decomposition with Georg Gottlob. ACM Journal of Experimental Algorithmics (JEA) 13:1.1-1.19, 2008.   [ Abstract | BibTeX ]   Peer-Reviewed Conferences Encoding Treewidth into SAT with Helmut Veith. 12th International Conference on Theory and Applications of Satisfiability Testing (SAT’09), volume 5584 of LNCS, pages 45-50. © Springer-Verlag, 2009.   [ Abstract | BibTeX ] Variable Dependencies of Quantified CSPs 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR’08), volume 5330 of LNCS, pages 512-527. © Springer-Verlag, 2008.   [ Abstract | BibTeX ] Backdoor Trees with Stefan Szeider. 23rd AAAI Conference on Artificial Intelligence (AAAI’08), pages 363-368. © AAAI Press, 2008.   [ Abstract | BibTeX ] Tractable Cases of the Extended Global Cardinality Constraint with Stefan Szeider. 14th Computing: The Australasian Theory Symposium (CATS’08), Theory of Computing 2008, volume 77 of CRPIT, pages 67-74. © Australian Computer Society, 2008.   [ Abstract | BibTeX | Full version ] Algorithms for Propositional Model Counting with Stefan Szeider. 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR’07), volume 4790 of LNCS, pages 484-498. © Springer-Verlag, 2007.   [ Abstract | BibTeX | Full version ] Backdoor Sets of Quantified Boolean Formulas with Stefan Szeider. 10th International Conference on Theory and Applications of Satisfiability Testing (SAT’07), volume 4501 of LNCS, pages 230-243. © Springer-Verlag, 2007.   [ Abstract | BibTeX | Full version ] Constraint Satisfaction with Bounded Treewidth Revisited with Stefan Szeider. 12th International Conference on Principles and Practice of Constraint Programming (CP’06), volume 4204 of LNCS, pages 499-513. © Springer-Verlag, 2006 .  [ Abstract | BibTeX | Erratum | Full version ] Hypertree-decomposition via Branch-decomposition 19th International Joint Conference on Artificial Intelligence (IJCAI’05), pages 1535-1536, © Professional Book Center, 2005.   [ Abstract | BibTeX ] Deterministic CTL Query Solving with Helmut Veith. 12th International Symposium on Temporal Representation and Reasoning (TIME’05), pages 156-165. © IEEE Computer Society, 2005.   [ Abstract | BibTeX ] Parameterized Vacuity with Helmut Veith. 5th International Conference on Formal Methods in Computer-Aided Design (FMCAD’04), volume 3312 of LNCS, pages 322-336. © Springer-Verlag, 2004.   [ Abstract | BibTeX ] A Syntactic Characterization of Distributive LTL Queries with Helmut Veith. 31st International Colloquium on Automata, Languages and Programming (ICALP’04), volume 3142 of LNCS, pages 1099-1110. © Springer-Verlag, 2004.   [ Abstract | BibTeX | Full version ] Validity of CTL Queries Revisited with Helmut Veith. 12th Annual Conference of the European Association for Computer Science Logic (CSL’03), volume 2803 of LNCS, pages 470-483. © Springer-Verlag, 2003.   [ Abstract | BibTeX ]   Invited Papers Heuristic Methods for Hypertree Decomposition with Artan Dermaku, Tobias Ganzow, Georg Gottlob, Ben McMahan, and Nysret Musliu. 7th Mexican International Conference on Artificial Intelligence (MICAI’08), volume 5317 of LNCS, pages 1-11. © Springer-Verlag, 2008.   [ Abstract | BibTeX ] On the Notion of Vacuous Truth with Helmut Veith. 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR’07), volume 4790 of LNCS, pages 2-14. © Springer-Verlag, 2007.   [ Abstract | BibTeX ] Hypertree Decompositions: Structure, Algorithms, and Applications with Georg Gottlob, Martin Grohe, Nysret Musliu, and Francesco Scarcello. 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG’05), volume 3787 of LNCS, pages 1-15. © Springer-Verlag, 2005.   [ Abstract | BibTeX ]   Book Chapters Fixed-Parameter Tractability with Stefan Szeider. In Armin Biere et al., editors, Handbook of Satisfiability, Part 1: Theory and Algorithms, chapter 13, volume 185 of Frontiers in Artificial Intelligence and Applications, pages 425-454. © IOS Press, 2009.   [ Abstract | BibTeX ] From Temporal Logic Queries to Vacuity Detection with Helmut Veith. In Edmund M. Clarke et al., editors, Verification of Infinite-State Systems with Applications to Security, volume 1 of NATO Security through Science Series D: Information and Communication Security, pages 149-167. © IOS Press, 2006.   [ Abstract | BibTeX ] Technology of Test-Case Generation with Levi Lúcio. In Manfred Broy et al., editors, Model-Based Testing of Reactive Systems, volume 3472 of LNCS, chapter 12, pages 323-354. © Springer-Verlag, 2005.   [ Abstract | BibTeX ]
	Summer Term 2010    (TU Vienna) Efficient Decision Procedures Seminar on Principles of Scientific Work   Winter Term 2009    (TU Darmstadt) Efficient Decision Procedures   Summer Term 2009    (TU Darmstadt) Seminar on Logic and Complexity   Winter Term 2008    (TU Darmstadt) Efficient Decision Procedures   Epiphany Term 2008    (Durham University) Advanced Topics in AI    (Substitute teaching) Automated Reasoning    (Substitute teaching)   Winter Term 2001    (TU Vienna) Logic Programming    (Teaching assistant)   Winter Term 2000    (TU Vienna) Logic Programming    (Teaching assistant)   Winter Term 1999    (TU Vienna) Logic Programming    (Teaching assistant)
	since 03/2010 Faculty post-doc position    (TU Vienna) 01/2010 Habilitation in theoretical computer science    (TU Darmstadt) 10/2008 – 02/2010 Faculty post-doc position    (TU Darmstadt) 10/2006 – 09/2008 Post-doc researcher    (Durham University) 10/2004 – 08/2006 Post-doc researcher    (TU Vienna) 11/2004 PhD in computer science    (TU Vienna)
	Last update on March 18, 2010.