Marko Samer

According to our database, Marko Samer authored at least 24 papers between 2003 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Fixed-Parameter Tractability.

Marko Samer, Stefan Szeider

Proceedings of the Handbook of Satisfiability - Second Edition, 2021

2010

On the distributivity of LTL specifications.

Marko Samer, Helmut Veith

ACM Trans. Comput. Log., 2010

2009

Fixed-Parameter Tractability.

Marko Samer, Stefan Szeider

Proceedings of the Handbook of Satisfiability, 2009

Encoding Treewidth into SAT.

Marko Samer, Helmut Veith

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008

A backtracking-based algorithm for hypertree decomposition.

Georg Gottlob, Marko Samer

ACM J. Exp. Algorithmics, 2008

Heuristic Methods for Hypertree Decomposition.

Artan Dermaku, Tobias Ganzow, Georg Gottlob, Benjamin J. McMahan, Nysret Musliu, Marko Samer

Proceedings of the MICAI 2008: Advances in Artificial Intelligence, 2008

Variable Dependencies of Quantified CSPs.

Marko Samer

Proceedings of the Logic for Programming, 2008

Tractable Cases of the Extended Global Cardinality Constraint.

Marko Samer, Stefan Szeider

Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

Backdoor Trees.

Marko Samer, Stefan Szeider

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

A Backtracking-Based Algorithm for Computing Hypertree-Decompositions

Georg Gottlob, Marko Samer

CoRR, 2007

Backdoor Sets of Quantified Boolean Formulas.

Marko Samer, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

On the Notion of Vacuous Truth.

Marko Samer, Helmut Veith

Proceedings of the Logic for Programming, 2007

Algorithms for Propositional Model Counting.

Marko Samer, Stefan Szeider

Proceedings of the Logic for Programming, 2007

2006

A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth

Marko Samer, Stefan Szeider

CoRR, 2006

Complexity and Applications of Edge-Induced Vertex-Cuts

Marko Samer, Stefan Szeider

CoRR, 2006

Constraint Satisfaction with Bounded Treewidth Revisited.

Marko Samer, Stefan Szeider

Proceedings of the Principles and Practice of Constraint Programming, 2006

2005

Hypertree Decompositions: Structure, Algorithms, and Applications.

Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

From Temporal Logic Queries to Vacuity Detection.

Marko Samer, Helmut Veith

Proceedings of the Verification of Infinite-State Systems with Applications to Security, 2005

Deterministic CTL Query Solving.

Marko Samer, Helmut Veith

Proceedings of the 12th International Symposium on Temporal Representation and Reasoning (TIME 2005), 2005

Hypertree-decomposition via Branch-decomposition.

Marko Samer

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

2004

A Syntactic Characterization of Distributive LTL Queries.

Marko Samer, Helmut Veith

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Parameterized Vacuity.

Marko Samer, Helmut Veith

Proceedings of the Formal Methods in Computer-Aided Design, 5th International Conference, 2004

Technology of Test-Case Generation.

Levi Lucio, Marko Samer

Proceedings of the Model-Based Testing of Reactive Systems, 2004

2003

Validity of CTL Queries Revisited.

Marko Samer, Helmut Veith

Proceedings of the Computer Science Logic, 17th International Workshop, 2003