We stand with Ukraine

We stand with Ukraine

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.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2021

Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

,

Proceedings of the Handbook of Satisfiability - Second Edition, 2021

2011

Tractable cases of the extended global cardinality constraint.

[BibT_eX]

[DOI]

,

Constraints An Int. J., 2011

2010

On the distributivity of LTL specifications.

[BibT_eX]

[DOI]

,

ACM Trans. Comput. Log., 2010

Algorithms for propositional model counting.

[BibT_eX]

[DOI]

,

J. Discrete Algorithms, 2010

Constraint satisfaction with bounded treewidth revisited.

[BibT_eX]

[DOI]

,

J. Comput. Syst. Sci., 2010

2009

Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

,

Proceedings of the Handbook of Satisfiability, 2009

Backdoor Sets of Quantified Boolean Formulas.

[BibT_eX]

[DOI]

,

J. Autom. Reason., 2009

Encoding Treewidth into SAT.

[BibT_eX]

[DOI]

,

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008

A backtracking-based algorithm for hypertree decomposition.

[BibT_eX]

[DOI]

,

ACM J. Exp. Algorithmics, 2008

Heuristic Methods for Hypertree Decomposition.

[BibT_eX]

[DOI]

,

,

,

Benjamin J. McMahan

,

,

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

Variable Dependencies of Quantified CSPs.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

Backdoor Trees.

[BibT_eX]

[DOI]

,

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

2007

A Backtracking-Based Algorithm for Computing Hypertree-Decompositions

[BibT_eX]

[DOI]

,

CoRR, 2007

On the Notion of Vacuous Truth.

[BibT_eX]

[DOI]

,

Proceedings of the Logic for Programming, 2007

2006

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

[BibT_eX]

[DOI]

,

CoRR, 2006

Complexity and Applications of Edge-Induced Vertex-Cuts

[BibT_eX]

[DOI]

,

CoRR, 2006

2005

Hypertree Decompositions: Structure, Algorithms, and Applications.

[BibT_eX]

[DOI]

,

,

,

,

Francesco Scarcello

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

From Temporal Logic Queries to Vacuity Detection.

[BibT_eX]

,

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

Deterministic CTL Query Solving.

[BibT_eX]

[DOI]

,

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

Hypertree-decomposition via Branch-decomposition.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

,

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

Parameterized Vacuity.

[BibT_eX]

[DOI]

,

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

Technology of Test-Case Generation.

[BibT_eX]

[DOI]

,

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

2003

Validity of CTL Queries Revisited.

[BibT_eX]

[DOI]

,

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

Loading...