Marko Samer

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2011
j6		Marko Samer, Stefan Szeider: Tractable cases of the extended global cardinality constraint. Constraints 16(1): 1-24 (2011)
	2010
j5		Marko Samer, Stefan Szeider: Constraint satisfaction with bounded treewidth revisited. J. Comput. Syst. Sci. 76(2): 103-114 (2010)
j4		Marko Samer, Stefan Szeider: Algorithms for propositional model counting. J. Discrete Algorithms 8(1): 50-64 (2010)
j3		Marko Samer, Helmut Veith: On the distributivity of LTL specifications. ACM Trans. Comput. Log. 11(3) (2010)
	2009
j2		Marko Samer, Stefan Szeider: Backdoor Sets of Quantified Boolean Formulas. J. Autom. Reasoning 42(1): 77-97 (2009)
c17		Marko Samer, Helmut Veith: Encoding Treewidth into SAT. SAT 2009: 45-50
p1		Marko Samer, Stefan Szeider: Fixed-Parameter Tractability. Handbook of Satisfiability 2009: 425-454
	2008
j1		Georg Gottlob, Marko Samer: A backtracking-based algorithm for hypertree decomposition. ACM Journal of Experimental Algorithmics 13 (2008)
c16		Marko Samer, Stefan Szeider: Backdoor Trees. AAAI 2008: 363-368
c15		Marko Samer, Stefan Szeider: Tractable Cases of the Extended Global Cardinality Constraint. CATS 2008: 67-74
c14		Marko Samer: Variable Dependencies of Quantified CSPs. LPAR 2008: 512-527
c13		Artan Dermaku, Tobias Ganzow, Georg Gottlob, Benjamin J. McMahan, Nysret Musliu, Marko Samer: Heuristic Methods for Hypertree Decomposition. MICAI 2008: 1-11
	2007
c12		Marko Samer, Helmut Veith: On the Notion of Vacuous Truth. LPAR 2007: 2-14
c11		Marko Samer, Stefan Szeider: Algorithms for Propositional Model Counting. LPAR 2007: 484-498
c10		Marko Samer, Stefan Szeider: Backdoor Sets of Quantified Boolean Formulas. SAT 2007: 230-243
i3		Georg Gottlob, Marko Samer: A Backtracking-Based Algorithm for Computing Hypertree-Decompositions. CoRR abs/cs/0701083 (2007)
	2006
c9		Marko Samer, Stefan Szeider: Constraint Satisfaction with Bounded Treewidth Revisited. CP 2006: 499-513
i2		Marko Samer, Stefan Szeider: Complexity and Applications of Edge-Induced Vertex-Cuts. CoRR abs/cs/0607109 (2006)
i1		Marko Samer, Stefan Szeider: A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth. CoRR abs/cs/0610174 (2006)
	2005
c8		Marko Samer: Hypertree-decomposition via Branch-decomposition. IJCAI 2005: 1535-1536
c7		Marko Samer, Helmut Veith: Deterministic CTL Query Solving. TIME 2005: 156-165
c6		Marko Samer, Helmut Veith: From Temporal Logic Queries to Vacuity Detection. VISSAS 2005: 149-167
c5		Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello: Hypertree Decompositions: Structure, Algorithms, and Applications. WG 2005: 1-15
	2004
c4		Levi Lucio, Marko Samer: Technology of Test-Case Generation. Model-Based Testing of Reactive Systems 2004: 323-354
c3		Marko Samer, Helmut Veith: Parameterized Vacuity. FMCAD 2004: 322-336
c2		Marko Samer, Helmut Veith: A Syntactic Characterization of Distributive LTL Queries. ICALP 2004: 1099-1110
	2003
c1		Marko Samer, Helmut Veith: Validity of CTL Queries Revisited. CSL 2003: 470-483

Coauthor Index

1	Artan Dermaku	[c13]
2	Tobias Ganzow	[c13]
3	Georg Gottlob	[j1] [c13] [i3] [c5]
4	Martin Grohe	[c5]
5	Levi Lucio	[c4]
6	Benjamin J. McMahan	[c13]
7	Nysret Musliu	[c13] [c5]
8	Francesco Scarcello	[c5]
9	Stefan Szeider	[j6] [j5] [j4] [j2] [p1] [c16] [c15] [c11] [c10] [c9] [i2] [i1]
10	Helmut Veith	[j3] [c17] [c12] [c7] [c6] [c3] [c2] [c1]

Last update Sun May 26 05:31:39 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page