Stefan Szeider

2008
42	EE	Georg Gottlob, Stefan Szeider: Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems. Comput. J. 51(3): 303-325 (2008)
2007
41	EE	Michael 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
40	EE	Stefan S. Dantchev, Barnaby Martin, Stefan Szeider: Parameterized Proof Complexity. FOCS 2007: 150-160
39	EE	Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider: Covering Graphs with Few Complete Bipartite Subgraphs. FSTTCS 2007: 340-351
38	EE	Marko Samer, Stefan Szeider: Algorithms for Propositional Model Counting. LPAR 2007: 484-498
37	EE	Marko Samer, Stefan Szeider: Backdoor Sets of Quantified Boolean Formulas. SAT 2007: 230-243
36	EE	Stefan Szeider: Matched Formulas and Backdoor Sets. SAT 2007: 94-99
35	EE	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Solving #SAT using vertex covers. Acta Inf. 44(7-8): 509-523 (2007)
34	EE	Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 41(3): 521-538 (2007)
2006
33		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
32	EE	Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC 2006: 356-367
31	EE	Marko Samer, Stefan Szeider: Constraint Satisfaction with Bounded Treewidth Revisited. CP 2006: 499-513
30	EE	Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. IWPEC 2006: 60-71
29	EE	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Solving #SAT Using Vertex Covers. SAT 2006: 396-409
28	EE	Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-width minimization is NP-hard. STOC 2006: 354-362
27	EE	Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems CoRR abs/cs/0604095: (2006)
26	EE	Marko Samer, Stefan Szeider: Complexity and Applications of Edge-Induced Vertex-Cuts CoRR abs/cs/0607109: (2006)
25	EE	Marko Samer, Stefan Szeider: A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth CoRR abs/cs/0610174: (2006)
24	EE	Michael 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
22	EE	Stefan Szeider: Generalizations of matched CNF formulas. Ann. Math. Artif. Intell. 43(1): 223-238 (2005)
21	EE	Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value CoRR abs/cs/0511030: (2005)
20	EE	Michael 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)
19	EE	Michael 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)
18	EE	Herbert Fleischner, Stefan Szeider: On Edge-Colored Graphs Covered by Properly Colored Cycles. Graphs and Combinatorics 21(3): 301-306 (2005)
17	EE	Stefan Szeider: Backdoor Sets for DLL Subsolvers. J. Autom. Reasoning 35(1-3): 73-88 (2005)
16	EE	Shlomo Hoory, Stefan Szeider: Computing unsatisfiable k-SAT instances with few occurrences per variable. Theor. Comput. Sci. 337(1-3): 347-359 (2005)
15	EE	Stefan Szeider: The Complexity of Resolution with Generalized Symmetry Rules. Theory Comput. Syst. 38(2): 171-188 (2005)
2004
14	EE	Michael R. Fellows, Stefan Szeider, Graham Wrightson: On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. IWPEC 2004: 223-234
13	EE	Shlomo Hoory, Stefan Szeider: Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. SAT 2004
12	EE	Naomi 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)
10	EE	Stefan Szeider: Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. J. Comput. Syst. Sci. 69(4): 656-674 (2004)
2003
9	EE	Stefan Szeider: Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable. COCOON 2003: 548-558
8	EE	Stefan Szeider: On Fixed-Parameter Tractable Parameterizations of SAT. SAT 2003: 188-202
7	EE	Stefan 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)
5	EE	Stefan Szeider: Homomorphisms of conjunctive normal forms. Discrete Applied Mathematics 130(2): 351-365 (2003)
4	EE	Stefan 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
2	EE	Stefan Szeider: NP-Completeness of Refutability by Literal-Once Resolution. IJCAR 2001: 168-181
2000
1	EE	Herbert 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

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

Colors in the list of coauthors