TU Wien Informatics

Stefan Szeider

Univ.Prof. Mag.rer.nat. Dr.rer.nat.

Research Focus

Research Areas

  • Combinatorial Optimization, Automated Reasoning, Algorithms, satisfiability, computational complexity, Fixed Parameter Tractability, Constraint satisfaction, Artificial Intelligence, Networks
Stefan Szeider

About

Design and analysis of efficient algorithms for the solution of hard problems that arise in logic, artificial intelligence, and networks. Theory and Application of SAT (satisfiability) and constraint satisfaction methods. Establishment of theoretical limits for algorithmic techniques.

Roles

  • Head of Research Unit
    Algorithms and Complexity, E192-01
  • Full Professor
    Algorithms and Complexity, E192-01
  • Research Focus Coordinator
    Logic and Computation
  • Faculty Council
    Principal Member
  • Curriculum Commission for Informatics
    Substitute Member
  • Curriculum Commission for Business Informatics
    Substitute Member

2018

2017

2016

  • Capturing Structure in SAT and Related Problems / S. Szeider / Talk: Theoretical Foundations of SAT Solving Workshop, Toronto, Kanada (invited); 2016-08-15 - 2016-08-19
  • Capturing Structure in SAT and Related Problems / S. Szeider / Keynote Lecture: International Workshop on Graph Structure and Satisfiability Testing, Bordeaux, France (invited); 2016-07-04
  • Meta-kernelization with structural parameters / R. Ganian, F. Slivovsky, S. Szeider / Journal of Computer and System Sciences, 82 (2016), 333 - 346
  • Backdoors to q-Horn / S. Gaspers, S. Ordyniak, M. S. Ramanujan, S. Saurabh, S. Szeider / Algorithmica (online), 74 (2016), 540 - 557
  • Soundness of Q-resolution with dependency schemes / F. Slivovsky, S. Szeider / Theoretical Computer Science, 612 (2016), 83 - 101
  • Quantified conjunctive queries on partially ordered sets / S. Bova, R. Ganian, S. Szeider / Theoretical Computer Science, 618 (2016), 72 - 84
  • Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics / R. de Haan, S. Szeider / Talk: 15th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), Kapstadt, Südafrika; 2016-04-25 - 2016-04-29; in: "Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning - KR 2016", (2016), ISBN: 978-1-57735-755-1; 453 - 462
  • Long Distance Q-Resolution with Dependency Schemes / T. Peitl, F. Slivovsky, S. Szeider / Talk: Theory and Application of Satisfiability Testing -- SAT, Bordeaux, France; 2016-07-05 - 2016-07-08; in: "Proceedings of SAT 2016: Theory and Applications of Satisfiability Testing - SAT 2016", (2016), ISBN: 978-3-319-40969-6; 500 - 518
  • A SAT Approach to Branchwidth / N. Lodha, S. Ordyniak, S. Szeider / Talk: Theory and Application of Satisfiability Testing -- SAT, Bordeaux, France; 2016-07-05 - 2016-07-08; in: "Proceedings of SAT 2016: Theory and Applications of Satisfiability Testing - SAT 2016", (2016), ISBN: 978-3-319-40969-6; 179 - 195
  • On Existential MSO and its Relation to ETH / R. Ganian, R. de Haan, I. Kanj, S. Szeider / Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Krakau, Polen; 2016-08-22 - 2016-08-26; in: "Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science", (2016), ISBN: 978-3-95977-016-3; 1 - 14
  • Backdoors to Tractable Valued CSP / R. Ganian, M. S. Ramanujan, S. Szeider / Talk: International Conference on Principles and Practice of Constraint Programming (CP), Toulouse, Frankreich; 2016-09-05 - 2016-09-09; in: "Principles and Practice of Constraint Programming (Proceedings of 22nd CP)", LNCS, 9898 (2016), ISBN: 978-3-319-44952-4; 233 - 250
  • Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting / R. Ganian, M. S. Ramanujan, S. Szeider / Talk: ACM-SIAM Symposium on Discrete Algorithms (SODA), Arlington, VA, USA; 2016-01-10 - 2016-01-12; in: "Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms", (2016), ISBN: 978-1-61197-433-1; 1670 - 1681
  • Polynomial-Time Construction of Optimal MPI Derived Datatype Trees / R. Ganian, M. Kalany, S. Szeider, J. Träff / Talk: IEEE 30th International Parallel and Distributed Processing Symposium (IPDPS 2016), Chicago, Illinois, USA; 2016-05-23 - 2016-05-27; in: "Proceedings of the IEEE 30th International Parallel and Distributed Processing Symposium (IPDPS 2016)", IEEE Computer Society, (2016), ISBN: 978-1-5090-2140-6; 638 - 647
  • Backdoor Trees for Answer Set Programming / J. Fichte, S. Szeider / Report No. DBAI-TR-2016-98, 2016; 24 pages

2015

2014

2013

  • SAT Approach to Clique-Width / St. Szeider / Talk: Workshop on Graph Classes, Optimization, and Width Parameters (GROW), Santorini Island, Greece; 2013-10-09 - 2013-10-11
  • Parameterized Complexity / St. Szeider / Keynote Lecture: the International SAT/SMT Summer School, Espoo, Finland (invited); 2013-07-03 - 2013-07-05
  • MFCS & CSL 2010 Satellite Workshops: Selected Papers, Fundamenta Informaticae 123 / A. Kucera, I. Potapov, A. Ciabattoni, St. Szeider, R. Freivalds / IOS Press, 2013, ISSN: 0169-2968
  • Parameterized and Exact Computation, 8th International Symposium, IPEC 2013 (LNCS 8246) / G. Gutin, St. Szeider / in series "Lecture Notes in Computer Science", series editor: Springer Verlag; Springer-Verlag, 2013, ISBN: 978-3-319-03898-8
  • Parameterized Complexity Results for Exact Bayesian Network Structure Learning / S. Ordyniak, St. Szeider / Journal of Artificial Intelligence Research, 46 (2013), 263 - 302
  • Satisfiability of acyclic and almost acyclic CNF formulas / S. Ordyniak, D. Paulusma, St. Szeider / Theoretical Computer Science, 481 (2013), 85 - 99
  • The Parameterized Complexity of Constraint Satisfaction and Reasoning / St. Szeider / Keynote Lecture: International Conference on Applications of Declarative Programming and Knowledge Management, Vienna, Austria (invited); 2011-09-28 - 2011-09-30; in: "19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011)", H. Tompits (ed.); Springer / LNCS, 7773 (2013), 27 - 37
  • Capturing Structure in Hard Combinatorial Problems. / St. Szeider / Keynote Lecture: The IEEE International Conference on Tools with Artificial Intelligence, Special Track on SAT and CSP Technologies (ICTAI), Washington D.C., USA (invited); 2013-11-04 - 2013-11-06; in: "Proceedings of the International Conference on Tools with Artificial Intelligence (ICTAI)", (2013)
  • Strong Backdoors to Bounded Treewidth SAT / S. Gaspers, St. Szeider / Talk: FOCS, the Annual Symposium on Foundations of Computer Science, Berkeley, CA, USA; 2013-10-27 - 2013-10-29; in: "Proceedings FOCS 2013, The 54th Annual Symposium on Foundations of Computer Science", O. Reingold (ed.); IEEE, (2013), 489 - 498
  • Variable Dependencies and Q-Resolution / F. Slivovsky, St. Szeider / Talk: International Workshop on Quantified Boolean Formulas, Helsinki, Finland; 2013-06-09; in: "International Workshop on Quantified Boolean Formulas 2013 Informal Workshop Report", F. Lonsing, M. Seidl (ed.); (2013), 22 - 29
  • Revisiting Space in Proof Complexity: Treewidth and Pathwidth / M. Müller, St. Szeider / Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Klosterneuburg, Austria; 2013-08-26 - 2013-08-30; in: "The 38th International Symposium on Mathematical Foundations of Computer Science, Proceedings", K. Chatterjee, J. Sgall (ed.); Springer / LNCS, 8087 (2013), ISBN: 978-3-642-40312-5; 704 - 716
  • Model Counting for Formulas of Bounded Clique-Width / F. Slivovsky, St. Szeider / Talk: International Symposium on Algorithms and Computation (ISAAC), Hong Kong; 2013-12-16 - 2013-12-18; in: "Algorithms and Computation: 24th International Symposium, ISAAC 2013", L. Cai, S. Cheng, T. Lam (ed.); Springer / LNCS, 8283 (2013), ISBN: 978-3-642-45029-7; 677 - 687
  • Backdoors to q-Horn / S. Gaspers, S. Ordyniak, M. Ramanujan, S. Saurabh, St. Szeider / Talk: Symposium on Theoretical Aspects of Computer Science (STACS), Kiel, Germany; 2013-02-27 - 2013-03-02; in: "30th Symposium on Theoretical Aspects of Computer Science (STACS´13)", N. Portier, T. Wilke (ed.); Dagstuhl Publishing, 20 (2013), ISBN: 978-3-939897-50-7; 67 - 79
  • Model Counting for CNF Formulas of Bounded Modular Treewidth / D. Paulusma, F. Slivovsky, St. Szeider / Talk: Symposium on Theoretical Aspects of Computer Science (STACS), Kiel, Germany; 2013-02-27 - 2013-03-02; in: "30th Symposium on Theoretical Aspects of Computer Science (STACS´13)", N. Portier, T. Wilke (ed.); Dagstuhl Publishing, 20 (2013), ISBN: 978-3-939897-50-7; 55 - 66
  • Parameterized Complexity and Kernel Bounds for Hard Planning Problems / C. Bäckström, P. Jonsson, S. Ordyniak, St. Szeider / Talk: Conference on Algorithms and Complexity, Barcelona, Spain; 2013-05-22 - 2013-05-24; in: "Algorithms and Complexity, 8th International Conference, CIAC 2013, Proceedings.", P. Spirakis, M. Serna (ed.); Springer / LNCS, 7878 (2013), ISBN: 978-3-642-38232-1; 13 - 24
  • Upper and Lower Bounds for Weak Backdoor Set Detection / N. Misra, S. Ordyniak, V. Raman, St. Szeider / Talk: International Conference on Theory and Applications of Satisfiability Testing (SAT), Helsinki, Finland; 2013-07-08 - 2013-07-12; in: "Theory and Applications of Satisfiability Testing - SAT 2013", M. Järvisalo, A. Van Gelder (ed.); Springer / LNCS, 7962 (2013), ISBN: 978-3-642-39070-8; 394 - 402
  • A SAT Approach to Clique-Width / M. Heule, St. Szeider / Talk: International Conference on Theory and Applications of Satisfiability Testing (SAT), Helsinki, Finland; 2013-07-08 - 2013-07-12; in: "Theory and Applications of Satisfiability Testing - SAT 2013", M. Järvisalo, A. Van Gelder (ed.); Springer / LNCS, 7962 (2013), ISBN: 978-3-642-39070-8; 318 - 334
  • Local Backbones / R. de Haan, I. Kanj, St. Szeider / Talk: International Conference on Theory and Applications of Satisfiability Testing (SAT), Helsinki, Finland; 2013-07-08 - 2013-07-12; in: "Theory and Applications of Satisfiability Testing - SAT 2013", M. Järvisalo, A. Van Gelder (ed.); LNCS / Springer, 7962 (2013), ISBN: 978-3-642-39070-8; 377 - 393
  • Meta-kernelization with Structural Parameters / R. Ganian, F. Slivovsky, St. Szeider / Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Klosterneuburg, Austria; 2013-08-26 - 2013-08-30; in: "The 38th International Symposium on Mathematical Foundations of Computer Science, Proceedings", K. Chatterjee, J. Sgall (ed.); Springer / LNCS, 8087 (2013), ISBN: 978-3-642-40312-5; 457 - 468
  • On the Subexponential Time Complexity of CSP / I. Kanj, St. Szeider / Talk: AAAI Conference, Bellevue, WA, USA; 2013-07-14 - 2013-07-18; in: "Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI´13)", M. desJardins, M. Littman (ed.); AAAI Press, (2013), ISBN: 978-1-57735-615-8; 459 - 465
  • Backdoors to Normality for Disjunctive Logic Programs / J. Fichte, St. Szeider / Talk: AAAI Conference, Bellevue, WA, USA; 2013-07-14 - 2013-07-18; in: "Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI´13)", M. desJardins, M. Littman (ed.); AAAI Press, (2013), ISBN: 978-1-57735-615-8; 320 - 327
  • Parameterized Complexity Results for Plan Reuse / R. de Haan, A. Roubickova, St. Szeider / Talk: AAAI Conference, Bellevue, WA, USA; 2013-07-14 - 2013-07-18; in: "Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI´13)", M. desJardins, M. Littman (ed.); AAAI Press, (2013), ISBN: 978-1-57735-615-8; 224 - 231
  • Backdoors to Abduction / A. Pfandler, St. Rümmele, St. Szeider / Talk: Twenty-third International Conference on Artificial Intelligence (IJCAI-13), Peking, China; 2013-08-03 - 2013-08-09; in: "Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence", F. Rossi (ed.); AAAI Press, (2013), ISBN: 978-1-57735-633-2; 1046 - 1052

2012

  • Parameterized Complexity Results for Probabilistic Network Structure Learning / St. Szeider / Keynote Lecture: Workshop on Applications of Parameterized Algorithms and Complexit, Warwick, UK (invited); 2012-07-08
  • The Parameterized Complexity of Propositional Satisfiability / St. Szeider / Keynote Lecture: Statistical Mechanics of Unsatisfiability and Glasses, Ferry Stockholm-Mariehamn and Hotel Arkipelag, Mariehamn, Åland (invited); 2012-05-23 - 2012-05-26
  • Parameterized Complexity / St. Szeider / Keynote Lecture: The Logic and Interactions Winter School, CIRM, Marseille, France (invited); 2012-01-30 - 2012-02-03
  • The Added Value of Argumentation / S. Modgil, F. Toni, F. Bex, I. Bratko, C. I. Chesnevar, W. Dvorak, M. A. Falappa, X. Fan, S. Gaggl, A. J. Garcia, M. P. Gonzalez, Th. F. Gordon, J. Leite, M. Mozina, Ch. Reed, G. Simari, St. Szeider, P. Torroni, S. Woltran / in: "Agreement Technologies", S. Ossowski (ed.); Springer Netherlands, Dordrecht, 2012, ISBN: 978-94-007-5582-6, 357 - 403
  • Backdoors to Satisfaction / S. Gaspers, St. Szeider / in: "The Multivariate Algorithmic Revolution and Beyond Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday", H.L. Bodlaender, R. Downey, F. Fomin, D. Marx (ed.); Springer LNCS, Berlin / Heidelberg, 2012, ISBN: 978-3-642-30890-1, 287 - 317
  • Fourth International Conference on Computational Models of Argument (COMMA 2012) / B. Verheij, St. Szeider, S. Woltran / in series "Computational Models of Argument", series editor: J. Breuker, N. Guarino, J. Liu, R. de Mántaras, R. Mizoguchi, M. Musen, S. Pal, N. Zhong; IOS Press, Amsterdam, 2012, ISBN: 1614991103
  • Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough / R. Pichler, St. Rümmele, St. Szeider, S. Woltran / Theory and Practice of Logic Programming, FirstView Article (2012), July; 1 - 24
  • Editing Graphs to Satisfy Degree Constraints: A Parameterized Approach / L. Mathieson, St. Szeider / Journal of Computer and System Sciences, Vol. 78 (2012), No. 1; 179 - 191
  • On Graph Contractions and Induced Minors / P. Hof, M. Kaminski, D. Paulusma, St. Szeider, D. Thilikos / Discrete Applied Mathematics, Vol. 160 (2012), No. 6; 799 - 809
  • Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming / G. Gutin, Ej Kim, A. Soleimanfallah, St. Szeider, A. Yeo / Algorithmica, Vol. 64 (2012), No. 1; 112 - 125
  • Augmenting Tractable Fragments of Abstract Argumentation / W. Dvorak, S. Ordyniak, St. Szeider / Artificial Intelligence, 186 (2012), 186; 157 - 173
  • Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough / R. Pichler, St. Rümmele, St. Szeider, S. Woltran / CoRR - Computing Research Repository, 1204.3040 (2012), abs/1204.3040; 20 pages
  • On Finding Optimal Polytrees / S. Gaspers, M. Koivisto, M. Liedloff, S. Ordyniak, St. Szeider / Talk: AAAI Conference, Toronto, Ontario, Canada; 2012-07-22 - 2012-07-26; in: "Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012)", J. Hoffmann, B. Selman (ed.); AAAI Press, (2012), 750 - 756
  • Don´t Be Strict in Local Search! / S. Gaspers, Ej Kim, S. Ordyniak, S. Saurabh, St. Szeider / Talk: AAAI Conference, Toronto, Ontario, Canada; 2012-07-22 - 2012-07-26; in: "Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012)", J. Hoffmann, B. Selman (ed.); AAAI Press, (2012), 486 - 492
  • Abstract Argumentation via Monadic Second Order Logic / W. Dvorak, St. Szeider, S. Woltran / Talk: International Conference on Scalable Uncertainty Management (SUM), Marburg, Germany; 2012-09-17 - 2012-09-19; in: "Proceedings of Sixth International Conference on Scalable Uncertainty Management (SUM 2012)", E. Hüllermeier, S. Link, T. Fober, B. Seeger (ed.); Lecture Notes in Computer Science / Springer, 7520 (2012), ISBN: 978-3-642-33361-3; 85 - 98
  • The Complexity of Planning Revisited - A Parameterized Analysis / C. Bäckström, Y. Chen, P. Jonsson, S. Ordyniak, St. Szeider / Talk: AAAI Conference, Toronto, Ontario, Canada; 2012-07-22 - 2012-07-26; in: "Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012)", J. Hoffmann, B. Selman (ed.); AAAI Press, (2012), 1735 - 1741
  • Strong Backdoors to Nested Satisfiability / S. Gaspers, St. Szeider / Talk: International Conference on Theory and Applications of Satisfiability Testing (SAT), Trento, Italy; 2012-06-17 - 2012-06-20; in: "Proceedings of the Fifteen International Conference on Theory and Applications of Satisfiability Testing (SAT 2012)", A. Cimatti, R. Sebastiani (ed.); LNCS / Springer, 7317 (2012), ISBN: 978-3-642-31611-1; 58 - 71
  • Backdoors to Acyclic SAT / S. Gaspers, St. Szeider / Talk: International Colloquium on Automata, Languages and Programming (ICALP), Warwick, UK; 2012-07-09 - 2012-07-13; in: "Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012)", Springer-Verlag, Lecture Notes in Computer Science / Vol. 7391 (2012), ISBN: 978-3-642-31593-0; 363 - 374
  • k-Gap Interval Graphs / F. Fomin, S. Gaspers, P. Golovach, K. Suchan, St. Szeider, E. van Leeuwen, M. Vatshelle, Y. Villanger / Talk: Latin American Theoretical Informatics Symposium, Arequipa, Peru; 2012-04-16 - 2012-04-20; in: "Proceedings of the 10th Latin American Theoretical Informatics Symposium (LATIN 2012)", D. Fernández-Baca (ed.); Lecture Notes in Computer Science / Springer, 7256 (2012), ISBN: 978-3-642-29343-6; 350 - 361
  • Computing Resolution-Path Dependencies in Linear Time / F. Slivovsky, St. Szeider / Talk: International Conference on Theory and Applications of Satisfiability Testing (SAT), Trento, Italy; 2012-06-17 - 2012-06-20; in: "Proceedings of the Fifteen International Conference on Theory and Applications of Satisfiability Testing (SAT 2012)", A. Cimatti, R. Sebastiani (ed.); LNCS / Springer, 7317 (2012), ISBN: 978-3-642-31611-1; 58 - 71
  • Backdoors to Normality for Disjunctive Logic Programs / J. Fichte, St. Szeider / Talk: 5th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), Edinburgh; 2012-09-04; in: "Proceedings of the 5th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012)", Y. Lierler, M. Fink (ed.); (2012), 99 - 113
  • Abstract Argumentation via Monadic Second Order Logic. / W. Dvorak, St. Szeider, S. Woltran / Report No. DBAI-TR-2012-79, 2012; 21 pages

2011

2010

  • Theory and Applications of Satisfiability Testing - SAT 2010 / O. Strichman, St. Szeider / Springer, Edinburgh, UK, 2010, ISBN: 978-3-642-14185-0
  • Constraint Satisfaction with Bounded Treewidth Revisited / M. Samer, St. Szeider / Journal of Computer and System Sciences, 76 (2010), 2; 103 - 114
  • Journal of Discrete Algorithms 8(2) - Editorial / H. Broersma, S. Dantchev, M. Johnson, St. Szeider / Journal of Discrete Algorithms, 8 (2010), 2; 101
  • Algorithms for Propositional Model Counting / M. Samer, St. Szeider / Journal of Discrete Algorithms, 8 (2010), 1; 50 - 64
  • Algorithms and Complexity Results for Exact Bayesian Structure Learning / S. Ordyniak, St. Szeider / Poster: Conference on Uncertainty in Artificial Intelligence (UAI), Catalina Island, California, USA; 2010-07-08 - 2010-07-11; in: "Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010)", P. Grünwald, P. Spirtes (ed.); AUAI Press, (2010), ISBN: 978-0-9749039-6-5; 401 - 408
  • Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough / R. Pichler, St. Rümmele, St. Szeider, S. Woltran / Talk: Principles of Knowledge Representation and Reasoning (KR), Toronto, Kanda; 2010-05-09 - 2010-05-13; in: "Proc. of KR 2010", F. Lin, U. Sattler, M. Truszczynski (ed.); AAAI Press, (2010), ISBN: 978-1-57735-452-9; Paper ID 71, 10 pages
  • Not So Easy Problems For Tree Decomposable Graphs / St. Szeider / Talk: International Conference on Discrete Mathematics, Mysore, India; 2008-06-06 - 2008-06-10; in: "Selected and revised papers of ICDM 2008", Ramanujan Mathematical Society (RMS), Lecture Notes Series no. 13 (2010), 179 - 190
  • Reasoning in Argumentation Frameworks of Bounded Clique-Width / W. Dvorak, St. Szeider, S. Woltran / Talk: COMMA - International Conference on Computational Models of Argument, Desenzano del Garda, Italy; 2010-09-08 - 2010-09-10; in: "Proceedings of COMMA 2010", P. Baroni, F. Cerutti, M. Giacomin, G. Simari (ed.); IOS Press, Frontiers in Artificial Intelligence and Applications 216 (2010), ISBN: 978-1-60750-618-8; 219 - 230
  • Algorithms and Complexity Results for Persuasive Argumentation / E. Kim, S. Ordyniak, St. Szeider / Talk: COMMA - International Conference on Computational Models of Argument, Desenzano del Garda, Italy; 2010-09-08 - 2010-09-10; in: "Proceedings of Third International Conference on Computational Models of Argument (COMMA 2010)", P. Baroni, F. Cerutti, M. Giacomin, G. Simari (ed.); IOS Press, Frontiers in Artificial Intelligence and Applications 216 (2010), ISBN: 978-1-60750-618-8; 311 - 322
  • Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming / G. Gutin, E. Kim, A. Soleimanfallah, St. Szeider, A. Yeo / Talk: International Symposium on Parameterized and Exact Computation (IPEC), Chennai, India; 2010-12-13 - 2010-12-15; in: "Parameterized and Exact Computation, 5th International Symposium, IPEC 2010", V. Raman, S. Saurabh (ed.); Springer, Lncs 6478/2010 (2010), 158 - 169
  • Satisfiability of Acyclic and Almost Acyclic CNF Formulas / S. Ordyniak, D. Paulusma, St. Szeider / Talk: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Chennai, India; 2010-12-15 - 2010-12-18; in: "IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)", K. Lodaya, M. Mahajan (ed.); Leibniz International Proceedings in Informatics (LIPIcs), (2010), ISSN: 1868-8969; 84 - 95
  • On Contracting Graphs to Fixed Pattern Graphs / P. Van´t Hof, M. Kaminski, D. Paulusma, St. Szeider, D. Thilikos / Talk: International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Spindlerův Mlýn, Czech Republic; 2010-01-23 - 2010-01-29; in: "36th International Conference on Current Trends in Theory and Practice of Computer Science", Springer, LNCS 5901 (2010), ISBN: 978-3-642-11265-2; 503 - 514
  • Solving MAX-r-SAT Above a Tight Lower Bound / N. Alon, G. Gutin, E. Kim, St. Szeider, A. Yeo / Talk: ACM-SIAM Symposium on Discrete Algorithms (SODA), Austin, Texas, USA; 2010-01-17 - 2010-01-19; in: "Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms", M. Charikar (ed.); ACM-SIAM, (2010), 511 - 517

 

  • The Parameterized Complexity of Reasoning Problems / ERC Europäischer Forschungsrat / 2010

Soon, this page will include additional information such as reference projects, activities as journal reviewer and editor, memberships in councils and committees, and other research activities.

Until then, please visit Stefan Szeider’s research profile in TISS .