( en | de | ru )

 

Disambiguation of "Samer, Marko"

Author of the publication

copydeleteadd this publication to your clipboard
A Backtracking-Based Algorithm for Computing Hypertree-Decompositions

, and . CoRR, (2007)

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.

Marko Samer

Stefan Samerski

Eduard Sämer

Lothar Samerski

Josef Samereier

 

Other publications of authors with the same name

Tractable cases of the extended global cardinality constraint., and . Constraints An Int. J., 16 (1): 1-24 (2011)A Syntactic Characterization of Distributive LTL Queries., and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 1099-1110. Springer, (2004)Hypertree-decomposition via Branch-decomposition.. IJCAI, page 1535-1536. Professional Book Center, (2005)Fixed-Parameter Tractability., and . Handbook of Satisfiability, volume 336 of Frontiers in Artificial Intelligence and Applications, IOS Press, (2021)Tractable Cases of the Extended Global Cardinality Constraint., and . CATS, volume 77 of CRPIT, page 67-74. Australian Computer Society, (2008)Constraint Satisfaction with Bounded Treewidth Revisited., and . CP, volume 4204 of Lecture Notes in Computer Science, page 499-513. Springer, (2006)On the Notion of Vacuous Truth., and . LPAR, volume 4790 of Lecture Notes in Computer Science, page 2-14. Springer, (2007)Validity of CTL Queries Revisited., and . CSL, volume 2803 of Lecture Notes in Computer Science, page 470-483. Springer, (2003)From Temporal Logic Queries to Vacuity Detection., and . VISSAS, volume 1 of NATO Security through Science Series D: Information and Communication Security, page 149-167. IOS Press, (2005)Variable Dependencies of Quantified CSPs.. LPAR, volume 5330 of Lecture Notes in Computer Science, page 512-527. Springer, (2008)