dblp.uni-trier.dewww.uni-trier.de

Stefan Szeider Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
59EEStefan Szeider: The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT. SAT 2009: 276-283
58EEMarko Samer, Stefan Szeider: Fixed-Parameter Tractability. Handbook of Satisfiability 2009: 425-454
57EEGregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound CoRR abs/0906.1356: (2009)
56EEGregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-2-SAT Above a Tight Lower Bound CoRR abs/0907.4573: (2009)
55EEMarko Samer, Stefan Szeider: Backdoor Sets of Quantified Boolean Formulas. J. Autom. Reasoning 42(1): 77-97 (2009)
54EEHajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 7(2): 147 (2009)
53EEHerbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider: Covering graphs with few complete bipartite subgraphs. Theor. Comput. Sci. 410(21-23): 2045-2053 (2009)
2008
52 Marko Samer, Stefan Szeider: Backdoor Trees. AAAI 2008: 363-368
51EEMarko Samer, Stefan Szeider: Tractable Cases of the Extended Global Cardinality Constraint. CATS 2008: 67-74
50EELuke Mathieson, Stefan Szeider: The Parameterized Complexity of Regular Subgraph Problems and Generalizations. CATS 2008: 79-86
49EELuke Mathieson, Stefan Szeider: Parameterized Graph Editing with Chosen Vertex Degrees. COCOA 2008: 13-22
48EEStefan Szeider: Monadic Second Order Logic on Graphs with Local Cardinality Constraints. MFCS 2008: 601-612
47EEStefan Szeider: Parameterized SAT. Encyclopedia of Algorithms 2008
46EEGregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica 52(2): 133-152 (2008)
45EEGeorg Gottlob, Stefan Szeider: Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems. Comput. J. 51(3): 303-325 (2008)
44EEHajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Preface. J. Discrete Algorithms 6(4): 539 (2008)
2007
43EEMichael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen: On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA 2007: 366-377
42EEStefan S. Dantchev, Barnaby Martin, Stefan Szeider: Parameterized Proof Complexity. FOCS 2007: 150-160
41EEHerbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider: Covering Graphs with Few Complete Bipartite Subgraphs. FSTTCS 2007: 340-351
40EEMarko Samer, Stefan Szeider: Algorithms for Propositional Model Counting. LPAR 2007: 484-498
39EEMarko Samer, Stefan Szeider: Backdoor Sets of Quantified Boolean Formulas. SAT 2007: 230-243
38EEStefan Szeider: Matched Formulas and Backdoor Sets. SAT 2007: 94-99
37EENaomi Nishimura, Prabhakar Ragde, Stefan Szeider: Solving #SAT using vertex covers. Acta Inf. 44(7-8): 509-523 (2007)
36EEStefan S. Dantchev, Barnaby Martin, Stefan Szeider: Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. Electronic Colloquium on Computational Complexity (ECCC) 14(001): (2007)
35EEGregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 41(3): 521-538 (2007)
2006
34 Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK King's College, London 2006
33EEGregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC 2006: 356-367
32EEMarko Samer, Stefan Szeider: Constraint Satisfaction with Bounded Treewidth Revisited. CP 2006: 499-513
31EEGregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. IWPEC 2006: 60-71
30EENaomi Nishimura, Prabhakar Ragde, Stefan Szeider: Solving #SAT Using Vertex Covers. SAT 2006: 396-409
29EEMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-width minimization is NP-hard. STOC 2006: 354-362
28EEGregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems CoRR abs/cs/0604095: (2006)
27EEMarko Samer, Stefan Szeider: Complexity and Applications of Edge-Induced Vertex-Cuts CoRR abs/cs/0607109: (2006)
26EEMarko Samer, Stefan Szeider: A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth CoRR abs/cs/0610174: (2006)
25EEShlomo Hoory, Stefan Szeider: A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable. SIAM J. Discrete Math. 20(2): 523-528 (2006)
24EEMichael R. Fellows, Stefan Szeider, Graham Wrightson: On finding short resolution refutations and small unsatisfiable subsets. Theor. Comput. Sci. 351(3): 351-359 (2006)
2005
23 Hajo Broersma, Matthew Johnson, Stefan Szeider: Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK King's College, London 2005
22EEStefan Szeider: Generalizations of matched CNF formulas. Ann. Math. Artif. Intell. 43(1): 223-238 (2005)
21EEGregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value CoRR abs/cs/0511030: (2005)
20EEMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Proving NP-hardness for clique-width I: non-approximability of sequential clique-width Electronic Colloquium on Computational Complexity (ECCC)(080): (2005)
19EEMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Proving NP-hardness for clique-width II: non-approximability of clique-width Electronic Colloquium on Computational Complexity (ECCC)(081): (2005)
18EEHerbert Fleischner, Stefan Szeider: On Edge-Colored Graphs Covered by Properly Colored Cycles. Graphs and Combinatorics 21(3): 301-306 (2005)
17EEStefan Szeider: Backdoor Sets for DLL Subsolvers. J. Autom. Reasoning 35(1-3): 73-88 (2005)
16EEShlomo Hoory, Stefan Szeider: Computing unsatisfiable k-SAT instances with few occurrences per variable. Theor. Comput. Sci. 337(1-3): 347-359 (2005)
15EEStefan Szeider: The Complexity of Resolution with Generalized Symmetry Rules. Theory Comput. Syst. 38(2): 171-188 (2005)
2004
14EEMichael R. Fellows, Stefan Szeider, Graham Wrightson: On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. IWPEC 2004: 223-234
13EEShlomo Hoory, Stefan Szeider: Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. SAT 2004
12EENaomi Nishimura, Prabhakar Ragde, Stefan Szeider: Detecting Backdoor Sets with Respect to Horn and Binary Clauses. SAT 2004
11 Stefan Szeider: On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors. Ars Comb. 73: (2004)
10EEStefan Szeider: Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. J. Comput. Syst. Sci. 69(4): 656-674 (2004)
2003
9EEStefan Szeider: Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable. COCOON 2003: 548-558
8EEStefan Szeider: On Fixed-Parameter Tractable Parameterizations of SAT. SAT 2003: 188-202
7EEStefan Szeider: The Complexity of Resolution with Generalized Symmetry Rules. STACS 2003: 475-486
6 Stefan Szeider: Finding paths in graphs avoiding forbidden transitions. Discrete Applied Mathematics 126(2-3): 261-273 (2003)
5EEStefan Szeider: Homomorphisms of conjunctive normal forms. Discrete Applied Mathematics 130(2): 351-365 (2003)
4EEStefan Szeider: Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable Electronic Colloquium on Computational Complexity (ECCC) 10(002): (2003)
2002
3 Herbert Fleischner, Oliver Kullmann, Stefan Szeider: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theor. Comput. Sci. 289(1): 503-516 (2002)
2001
2EEStefan Szeider: NP-Completeness of Refutability by Literal-Once Resolution. IJCAR 2001: 168-181
2000
1EEHerbert Fleischner, Stefan Szeider: Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference Electronic Colloquium on Computational Complexity (ECCC) 7(49): (2000)

Coauthor Index

1Hajo Broersma (H. J. Broersma) [23] [34] [44] [54]
2Stefan S. Dantchev [34] [36] [42] [44] [54]
3Michael R. Fellows (Mike Fellows) [14] [19] [20] [24] [29] [43]
4Herbert Fleischner [1] [3] [18] [41] [53]
5Fedor V. Fomin [43]
6Georg Gottlob [45]
7Gregory Gutin [21] [28] [31] [33] [35] [46] [56] [57]
8Shlomo Hoory [13] [16] [25]
9Matt Johnson (Matthew Johnson) [44] [54]
10Matthew Johnson [23] [34]
11Eun Jung Kim [56] [57]
12Oliver Kullmann [3]
13Daniel Lokshtanov [43]
14Barnaby Martin [36] [42]
15Luke Mathieson [49] [50]
16Egbert Mujuni [41] [53]
17Naomi Nishimura [12] [30] [37]
18Daniël Paulusma [41] [53]
19Arash Rafiey [21] [33] [35]
20Prabhakar Ragde [12] [30] [37]
21Frances A. Rosamond [19] [20] [29] [43]
22Udi Rotics [19] [20] [29]
23Marko Samer [26] [27] [32] [39] [40] [51] [52] [55] [58]
24Saket Saurabh [43]
25Carsten Thomassen [43]
26Graham Wrightson [14] [24]
27Anders Yeo [21] [28] [31] [33] [35] [46] [56] [57]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)