Stefan Szeider

	2012
101		Luke Mathieson, Stefan Szeider: Editing graphs to satisfy degree constraints: A parameterized approach. J. Comput. Syst. Sci. 78(1): 179-191 (2012)
	2011
100		Stefan Szeider: Limits of Preprocessing. AAAI 2011
99		Serge Gaspers, Stefan Szeider: The Parameterized Complexity of Local Consistency. CP 2011: 302-316
98		Sebastian Ordyniak, Stefan Szeider: Augmenting Tractable Fragments of Abstract Argumentation. IJCAI 2011: 1033-1038
97		Serge Gaspers, Stefan Szeider: Kernels for Global Constraints. IJCAI 2011: 540-545
96		Johannes Klaus Fichte, Stefan Szeider: Backdoors to Tractable Answer-Set Programming. IJCAI 2011: 863-868
95		Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider: Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). SAT 2011: 47-60
94		Stefan Szeider: Monadic second order logic on graphs with local cardinality constraints. ACM Trans. Comput. Log. 12(2): 12 (2011)
93		Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-r-SAT Above a Tight Lower Bound. Algorithmica 61(3): 638-655 (2011)
92		Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider: Algorithms and complexity results for persuasive argumentation. Artif. Intell. 175(9-10): 1722-1736 (2011)
91		Serge Gaspers, Stefan Szeider: Kernels for Global Constraints CoRR abs/1104.2541: (2011)
90		Johannes Klaus Fichte, Stefan Szeider: Backdoors to Tractable Answer-Set Programming CoRR abs/1104.2788: (2011)
89		Sebastian Ordyniak, Stefan Szeider: Augmenting Tractable Fragments of Abstract Argumentation CoRR abs/1104.2842: (2011)
88		Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider: Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II) CoRR abs/1104.4279: (2011)
87		Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider: Algorithms and Complexity Results for Persuasive Argumentation CoRR abs/1104.4290: (2011)
86		Stefan Szeider: Limits of Preprocessing CoRR abs/1104.5566: (2011)
85		Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo: Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming CoRR abs/1106.3527: (2011)
84		Stefan Szeider: Not So Easy Problems for Tree Decomposable Graphs CoRR abs/1107.1177: (2011)
83		Serge Gaspers, Stefan Szeider: Backdoors to Acyclic SAT CoRR abs/1110.6384: (2011)
82		Serge Gaspers, Stefan Szeider: Backdoors to Satisfaction CoRR abs/1110.6387: (2011)
81		Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger: k-Gap Interval Graphs CoRR abs/1112.3244: (2011)
80		Stefan S. Dantchev, Barnaby Martin, Stefan Szeider: Parameterized Proof Complexity. Computational Complexity 20(1): 51-85 (2011)
79		Marko Samer, Stefan Szeider: Tractable cases of the extended global cardinality constraint. Constraints 16(1): 1-24 (2011)
78		Stefan Szeider: The parameterized complexity of k-flip local search for SAT and MAX SAT. Discrete Optimization 8(1): 139-145 (2011)
77		Serge Gaspers, Stefan Szeider: The Parameterized Complexity of Local Consistency. Electronic Colloquium on Computational Complexity (ECCC) 18: 71 (2011)
76		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. Inf. Comput. 209(2): 143-153 (2011)
75		Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Syst. Sci. 77(2): 422-429 (2011)
	2010
74		Ofer Strichman, Stefan Szeider: Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings Springer 2010
73		Wolfgang Dvorák, Stefan Szeider, Stefan Woltran: Reasoning in Argumentation Frameworks of Bounded Clique-Width. COMMA 2010: 219-230
72		Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider: Algorithms and Complexity Results for Persuasive Argumentation. COMMA 2010: 311-322
71		Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider: Satisfiability of Acyclic and Almost Acyclic CNF Formulas. FSTTCS 2010: 84-95
70		Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo: Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. IPEC 2010: 158-169
69		Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran: Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. KR 2010
68		Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-r-SAT Above a Tight Lower Bound. SODA 2010: 511-517
67		Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos: On Contracting Graphs to Fixed Pattern Graphs. SOFSEM 2010: 503-514
66		Sebastian Ordyniak, Stefan Szeider: Algorithms and Complexity Results for Exact Bayesian Structure Learning. UAI 2010: 401-408
65		Marko Samer, Stefan Szeider: Constraint satisfaction with bounded treewidth revisited. J. Comput. Syst. Sci. 76(2): 103-114 (2010)
64		Marko Samer, Stefan Szeider: Algorithms for propositional model counting. J. Discrete Algorithms 8(1): 50-64 (2010)
63		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 8(2): 101 (2010)
	2009
62		Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. IWPEC 2009: 234-245
61		Stefan Szeider: The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT. SAT 2009: 276-283
60		Marko Samer, Stefan Szeider: Fixed-Parameter Tractability. Handbook of Satisfiability 2009: 425-454
59		Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound CoRR abs/0906.1356: (2009)
58		Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-2-SAT Above a Tight Lower Bound CoRR abs/0907.4573: (2009)
57		Marko Samer, Stefan Szeider: Backdoor Sets of Quantified Boolean Formulas. J. Autom. Reasoning 42(1): 77-97 (2009)
56		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 7(2): 147 (2009)
55		Stefan Szeider: Matched Formulas and Backdoor Sets. JSAT 6(1-3): 1-12 (2009)
54		Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-Width is NP-Complete. SIAM J. Discrete Math. 23(2): 909-939 (2009)
53		Herbert 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
51		Marko Samer, Stefan Szeider: Tractable Cases of the Extended Global Cardinality Constraint. CATS 2008: 67-74
50		Luke Mathieson, Stefan Szeider: The Parameterized Complexity of Regular Subgraph Problems and Generalizations. CATS 2008: 79-86
49		Luke Mathieson, Stefan Szeider: Parameterized Graph Editing with Chosen Vertex Degrees. COCOA 2008: 13-22
48		Stefan Szeider: Monadic Second Order Logic on Graphs with Local Cardinality Constraints. MFCS 2008: 601-612
47		Stefan Szeider: Parameterized SAT. Encyclopedia of Algorithms 2008
46		Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica 52(2): 133-152 (2008)
45		Georg Gottlob, Stefan Szeider: Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems. Comput. J. 51(3): 303-325 (2008)
44		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Preface. J. Discrete Algorithms 6(4): 539 (2008)
	2007
43		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
42		Stefan S. Dantchev, Barnaby Martin, Stefan Szeider: Parameterized Proof Complexity. FOCS 2007: 150-160
41		Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider: Covering Graphs with Few Complete Bipartite Subgraphs. FSTTCS 2007: 340-351
40		Marko Samer, Stefan Szeider: Algorithms for Propositional Model Counting. LPAR 2007: 484-498
39		Marko Samer, Stefan Szeider: Backdoor Sets of Quantified Boolean Formulas. SAT 2007: 230-243
38		Stefan Szeider: Matched Formulas and Backdoor Sets. SAT 2007: 94-99
37		Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Solving #SAT using vertex covers. Acta Inf. 44(7-8): 509-523 (2007)
36		Stefan 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)
35		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
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
33		Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC 2006: 356-367
32		Marko Samer, Stefan Szeider: Constraint Satisfaction with Bounded Treewidth Revisited. CP 2006: 499-513
31		Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. IWPEC 2006: 60-71
30		Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Solving #SAT Using Vertex Covers. SAT 2006: 396-409
29		Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-width minimization is NP-hard. STOC 2006: 354-362
28		Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems CoRR abs/cs/0604095: (2006)
27		Marko Samer, Stefan Szeider: Complexity and Applications of Edge-Induced Vertex-Cuts CoRR abs/cs/0607109: (2006)
26		Marko Samer, Stefan Szeider: A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth CoRR abs/cs/0610174: (2006)
25		Shlomo Hoory, Stefan Szeider: A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable. SIAM J. Discrete Math. 20(2): 523-528 (2006)
24		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		Stefan Szeider: Generalizations of matched CNF formulas. Ann. Math. Artif. Intell. 43(1): 223-238 (2005)
21		Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value CoRR abs/cs/0511030: (2005)
20		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		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		Herbert Fleischner, Stefan Szeider: On Edge-Colored Graphs Covered by Properly Colored Cycles. Graphs and Combinatorics 21(3): 301-306 (2005)
17		Stefan Szeider: Backdoor Sets for DLL Subsolvers. J. Autom. Reasoning 35(1-3): 73-88 (2005)
16		Shlomo Hoory, Stefan Szeider: Computing unsatisfiable k-SAT instances with few occurrences per variable. Theor. Comput. Sci. 337(1-3): 347-359 (2005)
15		Stefan Szeider: The Complexity of Resolution with Generalized Symmetry Rules. Theory Comput. Syst. 38(2): 171-188 (2005)
	2004
14		Michael R. Fellows, Stefan Szeider, Graham Wrightson: On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. IWPEC 2004: 223-234
13		Shlomo Hoory, Stefan Szeider: Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. SAT 2004
12		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		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		Stefan Szeider: Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable. COCOON 2003: 548-558
8		Stefan Szeider: On Fixed-Parameter Tractable Parameterizations of SAT. SAT 2003: 188-202
7		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		Stefan Szeider: Homomorphisms of conjunctive normal forms. Discrete Applied Mathematics 130(2): 351-365 (2003)
4		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		Stefan Szeider: NP-Completeness of Refutability by Literal-Once Resolution. IJCAR 2001: 168-181
	2000
1		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	Noga Alon	[68] [93]
2	Hajo Broersma (H. J. Broersma)	[23] [34] [44] [56] [63]
3	Stefan S. Dantchev	[34] [36] [42] [44] [56] [63] [80]
4	Wolfgang Dvorák	[73]
5	Michael R. Fellows (Mike Fellows)	[14] [19] [20] [24] [29] [43] [54] [76]
6	Johannes Klaus Fichte	[90] [96]
7	Herbert Fleischner	[1] [3] [18] [41] [53]
8	Fedor V. Fomin	[43] [76] [81]
9	Serge Gaspers	[77] [81] [82] [83] [91] [97] [99]
10	Petr A. Golovach	[81]
11	Georg Gottlob	[45]
12	Gregory Gutin	[21] [28] [31] [33] [35] [46] [58] [59] [62] [68] [70] [75] [85] [93]
13	Pim van 't Hof	[67]
14	Shlomo Hoory	[13] [16] [25]
15	Matthew Johnson	[23] [34] [44] [56] [63]
16	Marcin Jakub Kaminski (Marcin Kaminski)	[67]
17	Eun Jung Kim	[58] [59] [62] [68] [70] [72] [75] [85] [87] [92] [93]
18	Oliver Kullmann	[3]
19	Erik Jan van Leeuwen	[81]
20	Daniel Lokshtanov	[43] [76]
21	Barnaby Martin	[36] [42] [80]
22	Luke Mathieson	[49] [50] [101]
23	Egbert Mujuni	[41] [53]
24	Naomi Nishimura	[12] [30] [37]
25	Sebastian Ordyniak	[66] [71] [72] [87] [88] [89] [92] [95] [98]
26	Daniël Paulusma	[41] [53] [67] [71] [88] [95]
27	Reinhard Pichler	[69]
28	Arash Rafiey	[21] [33] [35]
29	Prabhakar Ragde	[12] [30] [37]
30	Frances A. Rosamond	[19] [20] [29] [43] [54] [76]
31	Udi Rotics	[19] [20] [29] [54]
32	Stefan Rümmele	[69]
33	Marko Samer	[26] [27] [32] [39] [40] [51] [52] [57] [60] [64] [65] [79]
34	Saket Saurabh	[43] [76]
35	Arezou Soleimanfallah	[70] [85]
36	Ofer Strichman	[74]
37	Karol Suchan	[81]
38	Dimitrios M. Thilikos	[67]
39	Carsten Thomassen	[43] [76]
40	Martin Vatshelle	[81]
41	Yngve Villanger	[81]
42	Stefan Woltran	[69] [73]
43	Graham Wrightson	[14] [24]
44	Anders Yeo	[21] [28] [31] [33] [35] [46] [58] [59] [62] [68] [70] [75] [85] [93]

Colors in the list of coauthors

Last update Tue Feb 14 23:09:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page