default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarko Samer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[p2]Marko Samer, Stefan Szeider
:
Fixed-Parameter Tractability. Handbook of Satisfiability 2021: 693-736
2010 – 2019
- 2011
- [j6]Marko Samer, Stefan Szeider:
Tractable cases of the extended global cardinality constraint. Constraints An Int. J. 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): 20:1-20:26 (2010)
2000 – 2009
- 2009
- [j2]Marko Samer, Stefan Szeider:
Backdoor Sets of Quantified Boolean Formulas. J. Autom. Reason. 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 J. Exp. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
