Stefan Szeider
Head of Group; Univ.-Prof. Dr.
Stefan Szeider is a full professor at TU Wien, Vienna, Austria, and head of the Algorithms and Complexity Group.
He is a co-chair of the Vienna Center for Logic and Algorithms (VCLA), debuty speaker of the Doctoral Program Logical Methods in Computer Science (LogiCS), coordinator of the research focus Logic and Computation (one of the four research foci at the Faculty of Informatics), and scientific co-organizer of the Vienna Gödel Lectures.
Szeider has been the principle investigator of several research projects, including an ERC Starting Grant and projects from the EPSRC (UK), the Nuffield Foundation (UK), the FWF (Austria), and the WWTF (Austria). Szeider, whose Erdős Number is 2, has published over 150 articles in scientific journals and conference proceedings.
In his research, Szeider combines algorithmic and logic-based methods for the efficient solution of hard problems that arise in Artificial Intelligence, Automated Reasoning, and Combinatorial Optimziation, complemented by complexity-theoretic methods for establishing theoretical limits and lower bounds.
orcid.org/0000-0001-8994-1656
Academic Activities
- Head of the Algorithms and Complexity Group, Faculty of Informatics, TU Wien
- Chair of the Vienna Center for Logic and Algorithms (VCLA)
- Speaker of the doctoral program Logical Methods in Computer Science (LogiCS)
- Chair of the Selection Committee for the Heinz Zemanek Dissertation Price of the Austrian Computer Society
- Co-organizer of the Vienna Gödel Lectures
Editorial Work
- Associate Editor of the Journal of Computer and System Sciences.
- Editor of the Journal of Artficial Intelligence Research (JAIR).
- Editor of the Journal of Discrete Algorithms (2014--2018).
- Editor of Fundamenta Informaticae (2012--2018).
- Guest editor of Algorithmica, Special Issue on Parameterized and Exact Computation, 2015.
- Co-editor of the Proceedings of IPEC 2013, 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, Lecture Notes in Computer Science, Volume 8246, Springer Verlag 2013.
- Co-editor of the Proceedings of COMMA 2012, the 4th International Conference on Computational Models of Argument. Frontiers in Artificial Intelligence and Applications 245, IOS Press 2012.
- Co-editor of the Proceedings of SAT 2010, the 13th International Conference on Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science, Volume 6175, Springer Verlag 2010.
- Co-editor of the Proceedings of ACiD 2005, ACiD 2006, and ACiD 2007, the First, Second, and Third Workshop on Algorithms and Complexity in Durham, College Publications, London, 2005, 2006, and, 2007, respectively.
Talks and Presentations
(Selection)
- Keynote speaker at the 9. Informatiktag, TU Wien, Vienna, Austria, September 28, 2017.
- Invited speaker at the 19th ÖMG-DMV Mathematics Congress 2017, Section "Discrete Mathematics and Theoretical Computer Science", University of Salzburg, September 11-15, 2017.
- Invited speaker at the Gutin-60 Conference, Royal Holloway, University of London, January 7-8, 2017.
- Invited speaker at the Workshop on Theoretical Foundations of SAT Solving, The Fields Institute, Toronto, Ontario, Canada, August 15 - 19, 2016.
- Invited keynote speaker at the International Workshop on Graph Structure and Satisfiability Testing, associate workshop of SAT 2016, Bordeaux, France, July 4, 2016.
- Invited tutorial speaker at IPEC 2014, the 9th International Symposium on Parameterized and Exact Computation, part of ALGO 2014, Wroclaw, Poland, September 10-12, 2014.
- Invited speaker at PCCR 2014, the 2nd Workshop on the Parameterized Complexity of Computational Reasoning, part of FLoC 2014, Vienna, Austria, July 17-18, 2014.
- Invited keynote speaker at IEEE-ICTAI 2013, the IEEE International Conference on Tools with Artificial Intelligence, Special Track on SAT and CSP Technologies, Washington, D.C., USA, November 4-6, 2013.
- Invited lecturer at SAT/SMT 2013, the Third International SAT/SMT Summer School 2013, Espoo, Finland, July 3-5, 2013.
- Invited speaker at APAC 2012, the first workshop on Applications of Parameterized Algorithms and Complexity, an affiliated workshop of ICALP 2012, Warwick, UK, July 8, 2012.
- Invited speaker at the workshop on Statistical Mechanics of Unsatisfiability and Glasses, Mariehamn, Finland, 23-26 May 2012.
- Invited tutorial speaker at LI 2012, the Logic and Interactions Winter School at CIRM, Marseille, France, 30 January - 2 March, 2012.
- Invited plenary speaker at INAP 2011/WLP 2011, The 19th International Conference on Applications of Declarative Programming and Knowledge Management, and The 25th Workshop on Logic Programming, Vienna, Austria, 28-30 September 2011.
- Invited plenary speaker at JFPC/JIAF 2011, the 7th French Conference on Constraint Programming and the 5th French Conference on Artificial Intelligence, Lyon, France, 8-10 June, 2011.
- Invited speaker at ARW 2009, the Automated Reasoning Workshop 2009, Department of Computer Science, University of Liverpool, UK, 21-22 April 2009.
Conference Activities
- Program committees: CP 2020, IJCAI-PRICAI 2020 (senior program committee member), SAT 2020, CPAIOR 2020, SoCS 2019, CP 2019, IJCAI 2019 (senior program committee member), ICALP 2019, SAT 2018, IJCAI-ECAI 2018 (senior program committee member), SAT 2017, IPEC 2016, STACS 2016, SAT 2016, BeyondNP 2016, IJCAI 2016 (senior program committee member), SAT 2015, IJCAI 2015 (senior program committee member), ECAI 2014, SAT 2014, STAIRS 2014, ECAI 2014, ISAIM 2014, IPEC 2013 (program committee co-chair), SAT 2013, CP 2013 (senior program committee member), QBF 2013, IJCAI 2013 (senior program committee member), CP 2012, AAAI 2012, MEMICS 2012, SAT 2012, SAT 2011, NECTAR 2011, MFCS 2010, ISAIM 2010, NECTAR 2010, SAT 2010 (program committee co-chair), IWPEC 2009, IJCAI 2009, SAT 2009, CATS 2009, ASCW 2009, IWPEC 2008, AAAI 2008, SAT 2008, SAT 2007, SAT 2006, WADS 2005, SAT 2005.
- Senior program committee member of IJCAI-PRICAI 2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, July 11-17, 2020, Yokohama, Japan
- IJCAI-ECAI 2018, the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence, July 13-19 2018, Stockholm, Sweden
- Co-Chair of GROW 2019, the 9th Workshop on Graph Classes, Optimization, and Width Parameters, TU Wien, Vienna, September 23-26, 2019, Austria
- Senior program committee member of IJCAI-ECAI 2018, the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence, July 13-19 2018, Stockholm, Sweden
- Senior program committee member of IJCAI-ECAI 2018, the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence, July 13-19 2018, Stockholm, Sweden
- Chair of the Organization Committee of ALGO 2017, the leading international gathering of researchers on Algorithms in Europe.
- Co-organiser of the Workshop on Recent Trends in Knowledge Compilation, September 17-22, 2017, Schloss Dagstuhl, Wadern, Germany.
- Member of the steering committee of IPEC, the International Symposium on Parameterized and Exact Computation (2011-2015).
- Member of the steering committe of SAT, the International Conference on Theory and Applications of Satisfiability Testing (2010-2014).
- Senior program committee member of IJCAI 2016, the 25th International Joint Conference on Artificial Intelligence, New York City, NY, USA, July 9-15, 2016.
- Co-chair of the Symposium on New Frontiers in Knowledge Compilation, TU Wien, Vienna, Austria, June 4-6, 2015.
- Senior program committee member of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence, KR Track, Buenos Aires, Argentina, 25 July-1 August 2015.
- Workshop Chair of FLoC 2014, the Sixth Federated Logic Conference (FLoC 2014), July 12-24, 2014, as part of the Vienna Summer of Logic (VSL), the largest logic event in history, with over 2000 participants. FLoC 2014 hosted 74 workshops featuring over 800 talks and presentations.
- Program co-chair of IPEC 2013, International Symposium on Parameterized and Exact Computation, affiliated with ALGO 2013, September 4-6, 2013, Sophia Antipolis, France
- Co-chair of the First Symposium on Structure in Hard Combinatorial Problems, TU Wien, Vienna, Austria, May 16-18, 2013
- Senior program committee member of CP 2013, The 19th International Conference on Principles and Practice of Constraint Programming, Uppsala, Sweden September 16-20, 2013.
- Senior program committee member of IJCAI 2013, The 23rd International Joint Conference on Artificial Intelligence IJCAI-13, Beijing, China August 5-9, 2013.
- Conference co-chair of COMMA 2012, the Fourth International Conference on Computational Models of Argument, September 10-12, 2012, TU Wien, Vienna, Austria.
- Chair of WorKer 2011, the Third Workshop on Kernelization, September 2-4, 2011, TU Wien, Vienna, Austria.
- Chair of PCCR 2010, the first workshop on the Parameterized Complexity of Computational Reasoning, Satellite Workshop of the federated MFCS & CSL 2010 conference, Brno, Czech Republic, 28 August 2010.
- Co-chair of SAT 2010, Thirteenth International Conference on Theory and Applications of Satisfiability Testing, July 11-14, 2010, Edinburgh, UK, part of FLOC 2010, The Federated Logic Conference 2010.
Publications
Most publications are also listed at the DBLP Computer Science Bibliography and at Google Scholar
195 results
| 2020 | |
| [195] | On Existential MSO and its Relation to ETH ACM Transactions on Computation Theory, 2020. Note: to appear |
| [194] | A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), 2020, Springer Verlag. Note: to appear |
| [193] | Short Q-Resolution Proofs with Homomorphisms Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), 2020, Springer Verlag. Note: to appear |
| [192] | Computing Optimal Hypertree Decompositions Proceedings of ALENEX 2020, the 22nd Workshop on Algorithm Engineering and Experiments (Guy Blelloch, Irene Finocchi, eds.), pages 1–11, 2020, Society for Industrial and Applied Mathematics (SIAM). |
| [191] | Threshold Treewidth and Hypertree Width Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, 2020. Note: to appear |
| [190] | Fixed-Parameter Tractability of Dependency QBF with Structural Parameters Principles of Knowledge Representation and Reasoning: Proceedings of the Seventeenth International Conference, KR 2020, 2020. Note: to appear |
| [189] | On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Dimension The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020, pages 3906–3913, 2020, AAAI Press. |
| 2019 | |
| [188] | Dependency Learning for QBF Journal Artificial Intelligence Research, volume 65, pages 180–208, 2019. |
| [187] | Long-Distance Q-Resolution with Dependency Schemes Journal of Automated Reasoning, volume 63, number 1, pages 127–155, 2019. |
| [186] | On the Parameterized Complexity of (k,s)-SAT Information Processing Letters, volume 143, pages 34–36, 2019. |
| [185] | A SAT Approach to Branchwidth ACM Transactions on Computational Logic, volume 20, number 3, pages 15:1–15:24, 2019. |
| [184] | Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy MDPI Algorithms, volume 12, number 9, pages 1–28, 2019. |
| [183] | Proof Complexity of Fragments of Long-Distance Q-resolution Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 319–335, 2019, Springer Verlag. |
| [182] | Combining Resolution-Path Dependencies with Dependency Learning Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 306–318, 2019, Springer Verlag. |
| [181] | A Join-Based Hybrid Parameter for Constraint Satisfaction Proceedings of CP 2019, the 25th International Conference on Principles and Practice of Constraint Programming (Thomas Schiex, Simon de Givry, eds.), volume 11802 of Lecture Notes in Computer Science, pages 195–212, 2019, Springer Verlag. |
| [180] | SAT-Encodings for Treecut Width and Treedepth Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments (Stephen G. Kobourov, Henning Meyerhenke, eds.), pages 117–129, 2019, Society for Industrial and Applied Mathematics (SIAM). |
| [179] | The Parameterized Complexity of Cascading Portfolio Scheduling Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems, 2019. Note: To appear |
| 2018 | |
| [178] | Meta-kernelization using well-structured modulators Discr. Appl. Math., volume 248, pages 153–167, 2018. |
| [177] | Solving Problems on Graphs of High Rank-Width Algorithmica, volume 80, number 2, pages 742–771, 2018. |
| [176] | Polynomial-Time Validation of QCDCL Certificates Proceedings of SAT 2018, the 21st International Conference on Theory and Applications of Satisfiability Testing, Part of FLoC 2018, July 9–12, 2018, Oxford, UK (Olaf Beyersdorff, Christoph M. Wintersteiger, eds.), volume 10929 of Lecture Notes in Computer Science, pages 253–269, 2018, Springer Verlag. |
| [175] | Portfolio-Based Algorithm Selection for Circuit QBFs QBF Workshop, 2018. |
| [174] | Portfolio-Based Algorithm Selection for Circuit QBFs Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker, ed.), volume 11008 of Lecture Notes in Computer Science, pages 195–209, 2018, Springer Verlag. |
| [173] | Sum-of-Products with Default Values: Algorithms and Complexity Results Proceedings of ICTAI 2018, the 30th IEEE International Conference on Tools with Artificial Intelligence (Lefteri H. Tsoukalas, Éric Grégoire, Miltiadis Alamaniotis, eds.), pages 733–737, 2018, IEEE. |
| [172] | Parameterized Algorithms for the Matrix Completion Problem Proceeding of ICML, the Thirty-fifth International Conference on Machine Learning, Stockholm, July 10–15, 2018, pages 1642–1651, 2018, JMLR.org. Note: ISSN: 1938-7228 |
| [171] | An SMT Approach to Fractional Hypertree Width Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker, ed.), volume 11008 of Lecture Notes in Computer Science, pages 109–127, 2018, Springer Verlag. |
| [170] | Portfolio Solvers for QDIMACS and QCIR 2018. Note: QBF Evaluation at SAT |
| 2017 | |
| [169] | The Treewidth of Proofs Information and Computation, volume 255, pages 147–164, 2017. |
| [168] | On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances ACM Transactions on Computational Logic, volume 18, number 3, pages Art. 21, 46, 2017. |
| [167] | Backdoors into heterogeneous classes of SAT and CSP Journal of Computer and System Sciences, volume 85, pages 38–56, 2017. |
| [166] | Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting ACM Transactions on Algorithms, volume 13, number 2, pages 29:1–29:32, 2017. |
| [165] | Parameterized Complexity Classes Beyond Para-NP Journal of Computer and System Sciences, volume 87, pages 16–57, 2017. |
| [164] | Backdoor Sets for CSP Chapter in The Constraint Satisfaction Problem: Complexity and Approximability (Andrei A. Krokhin, Stanislav Zivny, eds.), volume 7 of Dagstuhl Follow-Ups, pages 137–157, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [163] | Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, pages 3929–3935, 2017. |
| [162] | Dependency learning for QBF Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 298–313, 2017, Springer Verlag. |
| [161] | A SAT Approach to Branchwidth Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (Carles Sierra, ed.), pages 4894–4898, 2017, ijcai.org. Note: Sister Conference Best Paper Track |
| [160] | SAT-Encodings for Special Treewidth and Pathwidth Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 429–445, 2017, Springer Verlag. |
| [159] | New Width Parameters for Model Counting Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 38–52, 2017, Springer Verlag. |
| [158] | Backdoor Treewidth for SAT Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 20–37, 2017, Springer Verlag. |
| [157] | Combining Treewidth and Backdoors for CSP 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Heribert Vollmer, Brigitte Vallée, eds.), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pages 36:1–36:17, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [156] | Backdoor Trees for Answer Set Programming Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning, ASPOCP@LPNMR 2017, Espoo, Finland, July 3, 2017. (Bart Bogaerts, Amelia Harrison, eds.), volume 1868 of CEUR Workshop Proceedings, 2017, CEUR-WS.org. |
| [155] | SAT-Based Local Improvement for Finding Tree Decompositions of Small Width Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 401–411, 2017, Springer Verlag. |
| [154] | Circuit Treewidth, Sentential Decision, and Query Compilation Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017 (Emanuel Sallinger, Jan Van den Bussche, Floris Geerts, eds.), pages 233–246, 2017, Assoc. Comput. Mach., New York. |
| 2016 | |
| [153] | Quantifier reordering for QBF Journal of Automated Reasoning, volume 56, number 4, pages 459–477, 2016. |
| [152] | Soundness of Q-resolution with dependency schemes Theoretical Computer Science, volume 612, pages 83–101, 2016. |
| [151] | Model Counting for CNF Formulas of Bounded Modular Treewidth Algorithmica, volume 76, number 1, pages 168–194, 2016. |
| [150] | Backdoors to q-Horn Algorithmica, volume 74, number 1, pages 540–557, 2016. |
| [149] | Meta-Kernelization with Structural Parameters Journal of Computer and System Sciences, volume 82, number 2, pages 333–346, 2016. |
| [148] | Quantified Conjunctive Queries on Partially Ordered Sets Theoretical Computer Science, volume 618, pages 72–84, 2016. |
| [147] | Model Checking Existential Logic on Partially Ordered Sets ACM Transactions on Computational Logic, volume 17, number 2, 2016. |
| [146] | Long Distance Q-Resolution with Dependency Schemes Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 500–518, 2016, Springer Verlag. |
| [145] | A SAT Approach to Branchwidth Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 179–195, 2016, Springer Verlag. |
| [144] | Backdoors to Tractable Valued CSP Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings (Michel Rueher, ed.), volume 9892 of Lecture Notes in Computer Science, pages 233–250, 2016, Springer Verlag. |
| [143] | Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 1670–1681, 2016. |
| [142] | Polynomial-Time Construction of Optimal MPI Derived Datatype Trees 2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, May 23-27, 2016, pages 638–647, 2016, IEEE Computer Society. |
| [141] | On Existential MSO and its Relation to ETH 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), pages 42:1–42:14, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [140] | Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics Proceedings of KR 2016, the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning, Cape Town, South Africa, April 25-29, 2016 (Chitta Baral, James P. Delgrande, Frank Wolter, eds.), pages 453–462, 2016, AAAI Press. |
| [139] | Positive and Negative Results for Parameterized Compilability 2016, Technical report AC-TR-16-003, Algorithms and Complexity Group, TU Wien. |
| 2015 | |
| [138] | Backdoors to Tractable Answer Set Programming Artificial Intelligence, volume 220, pages 64–103, March 2015. |
| [137] | Parameterized and subexponential-time complexity of satisfiability problems and applications Theoretical Computer Science, volume 607, pages 282–295, 2015. |
| [136] | A SAT Approach to Clique-Width ACM Transactions on Computational Logic, volume 16, number 3, pages 24, 2015. |
| [135] | On finding optimal polytrees Theoretical Computer Science, volume 592, pages 49–58, 2015. |
| [134] | Backdoors to Normality for Disjunctive Logic Programs ACM Transactions on Computational Logic, volume 17, number 1, 2015. |
| [133] | On the Subexponential-Time Complexity of CSP Journal Artificial Intelligence Research, volume 52, pages 203–234, 2015. |
| [132] | A complete parameterized complexity analysis of bounded planning Journal of Computer and System Sciences, volume 81, number 7, pages 1311–1332, 2015. |
| [131] | Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sn\ve\vzkou, Czech Republic, January 24-29, 2015. Proceedings, volume 8939 of Lecture Notes in Computer Science, pages 217–229, January 2015, Springer Verlag. |
| [130] | Community Structure Inspired Algorithms for SAT and #SAT 18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), September 24-27, 2015, Austin, Texas (Marijn Heule, Sean Weaver, eds.), pages 223-237, 2015, Springer Verlag. |
| [129] | Algorithmic Applications of Tree-Cut Width Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, volume 9235 of Lecture Notes in Computer Science, pages 348–360, 2015, Springer Verlag. |
| [128] | Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Proceedings of AAMAS 2015, the 14th International Conference on Autonomous Agents and Multiagent Systems (Gerhard Weiss, Pinar Yolum, Rafael H. Bordini, Edith Elkind, eds.), pages 127–136, 2015, IFAAMAS/ACM. |
| [127] | Meta-Kernelization using Well-Structured Modulators Parameterized and Exact Computation - 10th International Symposium, IPEC 2014, Patras, Greece, September 16-18, 2015. Revised Selected Papers (Thore Husfeldt, Iyad A. Kanj, eds.), volume 43 of LIPIcs, pages 114–126, 2015. |
| [126] | Solving Problems on Graphs of High Rank-Width Algorithms and Data Structures Symposium (WADS 2015), August 5-7, 2015, University of Victoria, BC, Canada, pages 314–326, 2015, Springer Verlag. |
| 2014 | |
| [125] | Tractable answer-set programming with weight constraints: bounded treewidth is not enough Theory Pract. Log. Program., volume 14, number 2, pages 141-164, 2014. |
| [124] | Guarantees and limits of preprocessing in constraint satisfaction and reasoning Artificial Intelligence, volume 216, pages 1-19, 2014. |
| [123] | Variable Dependencies and Q-Resolution Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings (Carsten Sinz, Uwe Egly, eds.), volume 8561 of Lecture Notes in Computer Science, pages 269–284, 2014, Springer Verlag. |
| [122] | Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings (Zhao Zhang, Lidong Wu, Wen Xu, Ding-Zhu Du, eds.), volume 8881 of Lecture Notes in Computer Science, pages 637–651, 2014, Springer Verlag. |
| [121] | Backdoors into Heterogeneous Classes of SAT and CSP Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27-31, 2014, Québec City, Québec, Canada. (Carla E. Brodley, Peter Stone, eds.), pages 2652-2658, 2014, AAAI Press. |
| [120] | Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Proceedings of ComSoc'14, Fifth International Workshop on Computational Social Choice Pittsburgh, Pennsylvania, June 23-25, 2014, pages 127–136, 2014. |
| [119] | Fixed-Parameter Tractable Reductions to SAT Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings (Uwe Egly, Carsten Sinz, eds.), volume 8561 of Lecture Notes in Computer Science, pages 85-102, 2014, Springer Verlag. |
| [118] | The Parameterized Complexity of Reasoning Problems Beyond NP Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014 (Chitta Baral, Giuseppe De Giacomo, Thomas Eiter, eds.), pages 82–91, 2014, AAAI Press. |
| [117] | Subexponential Time Complexity of CSP with Global Constraints Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings (Barry O'Sullivan, ed.), volume 8656 of Lecture Notes in Computer Science, pages 272-288, 2014, Springer Verlag. |
| [116] | Small Unsatisfiable Subsets in Constraint Satisfaction 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, November 10-12, 2014, pages 429–436, 2014, IEEE. |
| [115] | Quantified Conjunctive Queries on Partially Ordered Sets Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 122–134, 2014, Springer Verlag. |
| [114] | Model checking existential logic on partially ordered sets Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014 (Thomas A. Henzinger, Dale Miller, eds.), pages 21:1–21:10, 2014, ACM. |
| [113] | Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy 2014, Technical report TR14-143, Electronic Colloquium on Computational Complexity (ECCC). |
| 2013 | |
| [112] | Parameterized Complexity Results for Exact Bayesian Network Structure Learning Journal Artificial Intelligence Research, volume 46, pages 263-302, 2013. |
| [111] | Satisfiability of acyclic and almost acyclic CNF formulas Theoretical Computer Science, volume 481, pages 85-99, 2013. |
| [110] | Capturing Structure in Hard Combinatorial Problems 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, Herndon, VA, USA, November 4-6, 2013, pages 897-898, 2013. Note: invited keynote talk |
| [109] | The Parameterized Complexity of Constraint Satisfaction and Reasoning Applications of Declarative Programming and Knowledge Management - 19th International Conference, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers (Hans Tompits, Salvador Abreu, Johannes Oetsch, Jörg Pührer, Dietmar Seipel, Masanobu Umeda, Armin Wolf, eds.), volume 7773 of Lecture Notes in Computer Science, pages 27-37, 2013, Springer Verlag. |
| [108] | Model Counting for Formulas of Bounded Clique-Width Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam, eds.), volume 8283 of Lecture Notes in Computer Science, pages 677-687, 2013, Springer Verlag. |
| [107] | Backdoors to Abduction Proceedings of IJCAI 2013, the 23th International Joint Conference on Artificial Intelligence, August 3-9, 2013, Beijing, China, 2013. |
| [106] | Model Counting for CNF Formulas of Bounded Modular Treewidth 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier, Thomas Wilke, eds.), volume 20 of LIPIcs, pages 55-66, 2013, Leibniz-Zentrum fuer Informatik. |
| [105] | Revisiting Space in Proof Complexity: Treewidth and Pathwidth Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 704-716, 2013, Springer Verlag. |
| [104] | Upper and Lower Bounds for Weak Backdoor Set Detection Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 394-402, 2013, Springer Verlag. |
| [103] | The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation Theory and Applications of Formal Argumentation - Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers (Elizabeth Black, Sanjay Modgil, Nir Oren, eds.), volume 8306 of Lecture Notes in Computer Science, pages 158-175, 2013, Springer Verlag. |
| [102] | On the Subexponential Time Complexity of CSP Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 459-465, 2013, The AAAI Press. |
| [101] | A SAT Approach to Clique-Width Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 318-334, 2013, Springer Verlag. |
| [100] | Strong Backdoors to Bounded Treewidth SAT 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 489-498, 2013, IEEE Computer Society. |
| [99] | Backdoors to q-Horn 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier, Thomas Wilke, eds.), volume 20 of LIPIcs, pages 67-79, 2013, Leibniz-Zentrum fuer Informatik. |
| [98] | Meta-kernelization with Structural Parameters Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 457-468, 2013, Springer Verlag. |
| [97] | Backdoors to Normality for Disjunctive Logic Programs Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 320-337, 2013, The AAAI Press. |
| [96] | Parameterized Complexity Results for Plan Reuse Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 224-231, 2013, The AAAI Press. |
| [95] | Local Backbones Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 377-393, 2013, Springer Verlag. |
| [94] | Parameterized Complexity and Kernel Bounds for Hard Planning Problems Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings (Paul G. Spirakis, Maria J. Serna, eds.), volume 7878 of Lecture Notes in Computer Science, pages 13-24, 2013, Springer Verlag. |
| 2012 | |
| [93] | On graph contractions and induced minors Discr. Appl. Math., volume 160, number 6, pages 799-809, 2012. |
| [92] | Editing graphs to satisfy degree constraints: a parameterized approach Journal of Computer and System Sciences, volume 78, number 1, pages 179-191, 2012. |
| [91] | Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming Algorithmica, volume 64, number 1, pages 112-125, 2012. |
| [90] | Augmenting tractable fragments of abstract argumentation Artificial Intelligence, volume 186, pages 157-173, 2012. |
| [89] | Computing Resolution-Path Dependencies in Linear Time Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti, Roberto Sebastiani, eds.), volume 7317 of Lecture Notes in Computer Science, pages 58-71, 2012, Springer Verlag. |
| [88] | Strong Backdoors to Nested Satisfiability Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti, Roberto Sebastiani, eds.), volume 7317 of Lecture Notes in Computer Science, pages 72-85, 2012, Springer Verlag. |
| [87] | Backdoors to Acyclic SAT Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I (Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer, eds.), volume 7391 of Lecture Notes in Computer Science, pages 363-374, 2012, Springer Verlag. |
| [86] | Backdoors to Satisfaction The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday (Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx, eds.), volume 7370 of Lecture Notes in Computer Science, pages 287-317, 2012, Springer Verlag. |
| [85] | On Finding Optimal Polytrees Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. |
| [84] | Don't Be Strict in Local Search! Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. |
| [83] | k-Gap Interval Graphs LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings (David Fernández-Baca, ed.), volume 7256 of Lecture Notes in Computer Science, pages 350-361, 2012, Springer Verlag. |
| [82] | Abstract Argumentation via Monadic Second Order Logic Scalable Uncertainty Management - 6th International Conference, SUM 2012, Marburg, Germany, September 17-19, 2012. Proceedings (Eyke Hüllermeier, Sebastian Link, Thomas Fober, Bernhard Seeger, eds.), volume 7520 of Lecture Notes in Computer Science, pages 85-98, 2012, Springer Verlag. |
| [81] | The Complexity of Planning Revisited - A Parameterized Analysis Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. |
| [80] | Backdoors to Tractable Answer-Set Programming 2012, Technical report 1104.2788, Arxiv.org. Note: Extended and updated version of a paper that appeared in the proceedings of IJCAI 2011, the 22nd International Joint Conference on Artificial Intelligence |
| 2011 | |
| [79] | The parameterized complexity of k-flip local search for SAT and MAX SAT Discrete Optim., volume 8, number 1, pages 139-145, 2011. |
| [78] | Monadic Second Order Logic on Graphs with Local Cardinality Constraints ACM Transactions on Computational Logic, volume 12, number 2, pages article 12, 2011. |
| [77] | Tractable cases of the extended global cardinality constraint Constraints, volume 16, number 1, pages 1-24, 2011. |
| [76] | Algorithms and Complexity Results for Persuasive Argumentation Artificial Intelligence, volume 175, pages 1722-1736, 2011. |
| [75] | A probabilistic approach to problems parameterized above or below tight bounds Journal of Computer and System Sciences, volume 77, number 2, pages 422-429, 2011. |
| [74] | On the complexity of some colorful problems parameterized by treewidth Information and Computation, volume 209, number 2, pages 143-153, 2011. |
| [73] | Parameterized Proof Complexity Computational Complexity, volume 20, number 1, pages 51-85, 2011. |
| [72] | Solving MAX-r-SAT above a tight lower bound Algorithmica, volume 61, number 3, pages 638-655, 2011. |
| [71] | Limits of Preprocessing Proceedings of the Twenty-Fifth Conference on Artificial Intelligence, AAAI 2011, pages 93-98, 2011, AAAI Press, Menlo Park, California. |
| [70] | Augmenting Tractable Fragments of Abstract Argumentation Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 (Toby Walsh, ed.), pages 1033-1038, 2011, AAAI Press/IJCAI. |
| [69] | Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings (Karem A. Sakallah, Laurent Simon, eds.), volume 6695 of Lecture Notes in Computer Science, pages 47-60, 2011, Springer Verlag. |
| [68] | Kernels for Global Constraints IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011 (Toby Walsh, ed.), pages 540-545, 2011, IJCAI/AAAI. |
| [67] | The Parameterized Complexity of Local Consistency Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP 2011) (Jimmy Ho-Man Lee, ed.), volume 6876 of Lecture Notes in Computer Science, pages 302-316, 2011, Springer Verlag. |
| [66] | Backdoors to Tractable Answer-Set Programming Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 (Toby Walsh, ed.), pages 863-868, 2011, AAAI Press/IJCAI. |
| [65] | Backdoors to Satisfaction October 2011, Technical report 1110.6387, Arxiv.org. |
| [64] | Backdoors to Acyclic SAT October 2011, Technical report 1110.6384, Arxiv.org. |
| 2010 | |
| [63] | Constraint satisfaction with bounded treewidth revisited Journal of Computer and System Sciences, volume 76, number 2, pages 103-114, 2010. |
| [62] | Algorithms for propositional model counting J. Discrete Algorithms, volume 8, number 1, pages 50-64, 2010. |
| [61] | Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010 (Fangzhen Lin, Ulrike Sattler, Miroslaw Truszczynski, eds.), 2010, AAAI Press. |
| [60] | Algorithms and Complexity Results for Exact Bayesian Structure Learning Proceedings of UAI 2010, The 26th Conference on Uncertainty in Artificial Intelligence, Catalina Island, California, USA, July 8-11, 2010 (Peter Grünwald, Peter Spirtes, eds.), 2010, AUAI Press, Corvallis, Oregon. |
| [59] | Satisfiability of Acyclic and Almost Acyclic CNF Formulas IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India (Kamal Lodaya, Meena Mahajan, eds.), volume 8 of LIPIcs, pages 84-95, 2010, Leibniz-Zentrum fuer Informatik. |
| [58] | Algorithms and Complexity Results for Persuasive Argumentation Computational Models of Argumentation, Proceedings of COMMA 2010 (Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Guillermo R. Simari, eds.), volume 216 of Frontiers in Artificial Intelligence and Applications, pages 311-322, 2010. |
| [57] | On Contracting Graphs to Fixed Pattern Graphs SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings (Jan van Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe, eds.), volume 5901 of Lecture Notes in Computer Science, pages 503-514, 2010, Springer Verlag. |
| [56] | Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings (Venkatesh Raman, Saket Saurabh, eds.), volume 6478 of Lecture Notes in Computer Science, pages 158-169, 2010, Springer Verlag. |
| [55] | Reasoning in Argumentation Frameworks of Bounded Clique-Width Computational Models of Argumentation, Proceedings of COMMA 2010 (Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Guillermo R. Simari, eds.), volume 216 of Frontiers in Artificial Intelligence and Applications, pages 219-230, 2010. |
| [54] | Solving MAX-r-SAT Above a Tight Lower Bound Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 (Moses Charikar, ed.), pages 511-517, 2010, Society for Industrial and Applied Mathematics (SIAM). |
| 2009 | |
| [53] | Matched Formulas and Backdoor Sets J on Satisfiability, Boolean Modeling and Computation, volume 6, pages 1-12, 2009. |
| [52] | Backdoor sets of quantified Boolean formulas Journal of Automated Reasoning, volume 42, number 1, pages 77-97, 2009. |
| [51] | Covering graphs with few complete bipartite subgraphs Theoretical Computer Science, volume 410, number 21-23, pages 2045-2053, 2009. |
| [50] | Clique-width is NP-complete SIAM J. Discrete Math., volume 23, number 2, pages 909-939, 2009. |
| [49] | Fixed-Parameter Tractability Chapter in Handbook of Satisfiability (Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, eds.), pages 425-454, 2009, IOS Press. |
| [48] | The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings (Oliver Kullmann, ed.), volume 5584 of Lecture Notes in Computer Science, pages 276-283, 2009, Springer Verlag. |
| [47] | A Probabilistic Approach to Problems Parameterized above or below Tight Bounds Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers (Jianer Chen, Fedor V. Fomin, eds.), volume 5917 of Lecture Notes in Computer Science, pages 234-245, 2009, Springer Verlag. |
| 2008 | |
| [46] | Fixed-parameter complexity of minimum profile problems Algorithmica, volume 52, number 2, pages 133-152, 2008. |
| [45] | Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems The Computer Journal, volume 51, number 3, pages 303-325, 2008. Note: Survey paper |
| [44] | Parameterized SAT Chapter in Encyclopedia of Algorithms (Ming-Yang Kao, ed.), 2008, Springer Verlag. |
| [43] | Not So Easy Problems For Tree Decomposable Graphs (invited talk) ICDM 2008, International Conference on Discrete Mathematics, June 6-10, 2008, Mysore, India, Proceedings, pages 161-171, 2008. |
| [42] | Monadic Second Order Logic on Graphs with Local Cardinality Constraints Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, volume 5162 of Lecture Notes in Computer Science, pages 601-612, 2008, Springer Verlag. |
| [41] | Backdoor Trees AAAI 08, Twenty-Third Conference on Artificial Intelligence, Chicago, Illinois, July 13-17, 2008, pages 363-368, 2008, AAAI Press. |
| [40] | Tractable Cases of the Extended Global Cardinality Constraint Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008 (J. Harland, P. Manyem, eds.), volume 77 of Conferences in Research and Practice in Information Technology, pages 67-74, 2008, Australian Computer Society. |
| [39] | Parameterized Graph Editing with Chosen Vertex Degrees Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings (Boting Yang, Ding-Zhu Du, Cao An Wang, eds.), volume 5165 of Lecture Notes in Computer Science, pages 13-22, 2008, Springer Verlag. |
| [38] | The Parameterized Complexity of Regular Subgraph Problems and Generalizations Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008 (J. Harland, P. Manyem, eds.), volume 77 of Conferences in Research and Practice in Information Technology, pages 79-86, 2008, Australian Computer Society. |
| 2007 | |
| [37] | Solving #SAT using Vertex Covers Acta Informatica, volume 44, number 7-8, pages 509-523, 2007. |
| [36] | The Linear Arrangement Problem Parameterized Above Guaranteed Value Theory Comput. Syst., volume 41, pages 521-538, 2007. |
| [35] | Without Loss of Generality - Symmetric Reasoning for Resolution Systems (Invited Talk) Proceedings of SymCon'07, Seventh International Workshop on Symmetry and Constraint Satisfaction Problems, satellite workshop of CP 2007, September 23, 2007, Providence, RI, USA (B. Benhamou, ed.), pages 5-8, 2007. |
| [34] | Matched Formulas and Backdoor Sets Proceedings of SAT 2007, Tenth International Conference on Theory and Applications of Satisfiability Testing, May 28-31, 2007, Lisbon, Portugal, (J. Marques-Silva, K. A. Sakallah, eds.), volume 4501 of Lecture Notes in Computer Science, pages 94-99, 2007. |
| [33] | Algorithms for Propositional Model Counting Proceedings of LPAR 2007, 14th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, October 15-19, 2007 Yerevan, Armenia, volume 4790 of Lecture Notes in Computer Science, pages 484-498, 2007, Springer Verlag. |
| [32] | Backdoor Sets of Quantified Boolean Formulas Proceedings of SAT 2007, Tenth International Conference on Theory and Applications of Satisfiability Testing, May 28-31, 2007, Lisbon, Portugal, (J. Marques-Silva, K. A. Sakallah, eds.), volume 4501 of Lecture Notes in Computer Science, pages 230–243, 2007. |
| [31] | Covering Graphs with Few Complete Bipartite Subgraphs FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings (Vikraman Arvind, Sanjiva Prasad, eds.), volume 4855 of Lecture Notes in Computer Science, pages 340-351, 2007, Springer Verlag. |
| [30] | On the Complexity of Some Colorful Problems Parameterized by Treewidth Proceedings of COCOA 2007, Combinatorial Optimization and Applications, First International Conference, Xi'an, China, August 14-16, 2007, volume 4616 of Lecture Notes in Computer Science, pages 366-377, 2007, Springer Verlag. |
| [29] | Parameterized Proof Complexity Proceedings of the 48th Annual Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, pages 150-160, 2007, IEEE Press. |
| 2006 | |
| [28] | A note on unsatisfiable k-CNF formulas with few occurrences per variable SIAM J. Discrete Math., volume 20, number 2, pages 523-528, 2006. |
| [27] | On Finding Short Resolution Refutations and Small Unsatisfiable Subsets Theoretical Computer Science, volume 351, number 3, pages 351-359, 2006. |
| [26] | Constraint satisfaction with bounded treewidth revisited Proceedings of CP 2006 , Twelfth International Conference on Principles and Practice of Constraint Programming, September 24-29, 2006, Nantes, France, volume 4204 of Lecture Notes in Computer Science, pages 499-513, 2006. Note: Full version appeared in Constraints |
| [25] | Solving #SAT using Vertex Covers Proceedings of SAT 2006, Ninth International Conference on Theory and Applications of Satisfiability Testing, August 12-15, 2006, Seattle, Washington, USA, volume 4121 of Lecture Notes in Computer Science, pages 396-409, 2006. |
| [24] | Fixed-Parameter Complexity of Minimum Profile Problems Proceedings of IWPEC 2006, 2nd International Workshop on Parameterized and Exact Computation, volume 4169 of Lecture Notes in Computer Science, pages 60-71, 2006, Springer Verlag. |
| [23] | The Linear Arrangement Problem Parameterized Above Guaranteed Value Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings (Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano, eds.), volume 3998 of Lecture Notes in Computer Science, pages 356-367, 2006, Springer Verlag. |
| [22] | Clique-width Minimization is NP-hard Proceedings of STOC 2006; the 38th ACM Symposium on Theory of Computing, Seattle, Washington, USA, pages 354-362, 2006, Assoc. Comput. Mach., New York. |
| 2005 | |
| [21] | The Complexity of Resolution with Generalized Symmetry Rules Theory Comput. Syst., volume 38, number 2, pages 171-188, 2005. |
| [20] | Backdoor Sets for DLL Subsolvers Journal of Automated Reasoning, volume 35, number 1-3, pages 73-88, 2005. Note: Reprinted as Chapter 4 of the book SAT 2005 - Satisfiability Research in the Year 2005, edited by E. Giunchiglia and T. Walsh, Springer Verlag, 2006 |
| [19] | Generalizations of matched CNF formulas Ann. Math. Artif. Intell., volume 43, number 1-4, pages 223-238, 2005. |
| [18] | Computing unsatisfiable k-SAT instances with few occurrences per variable Theoretical Computer Science, volume 337, number 1-3, pages 347-359, 2005. Note: Supplementary material is available at https://www.ac.tuwien.ac.at/files/pub/HoorySzeider05.tar.gz |
| [17] | On Edge-Colored Graphs Covered by Properly Colored Cycles Graphs and Combinatorics, volume 21, number 3, pages 301-206, 2005. |
| 2004 | |
| [16] | Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable Journal of Computer and System Sciences, volume 69, number 4, pages 656-674, 2004. |
| [15] | On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors Ars Combinatoria, volume 73, pages 53-64, 2004. |
| [14] | On fixed-parameter tractable parameterizations of SAT Theory and Applications of Satisfiability, 6th International Conference, SAT 2003, Selected and Revised Papers (Enrico Giunchiglia, Armando Tacchella, eds.), volume 2919 of Lecture Notes in Computer Science, pages 188-202, 2004, Springer Verlag. |
| [13] | The Parameterized Complexity of SAT Backdoors Computing: The Australasian Theory Symposium (CATS 2004) (Mike Atkinson, ed.), pages 252-261, 2004. Note: Informal Proceedings |
| [12] | Detecting Backdoor Sets with Respect to Horn and Binary Clauses Proceedings of SAT 2004 (Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May, 2004, Vancouver, BC, Canada), pages 96-103, 2004. |
| [11] | Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings, 2004. |
| [10] | On Finding Short Resolution Refutations and Small Unsatisfiable Subsets 1st International Workshop on Parameterized and Exact Computation (IWPEC 2004) (Rod Downey, Michael Fellows, Frank Dehne, eds.), volume 3162 of Lecture Notes in Computer Science, pages 223-234, 2004, Springer Verlag. |
| 2003 | |
| [9] | Homomorphisms of Conjunctive Normal Forms Discr. Appl. Math., volume 130, number 2, pages 351-365, 2003. |
| [8] | Finding paths in graphs avoiding forbidden transitions Discr. Appl. Math., volume 126, number 2-3, pages 239-251, 2003. |
| [7] | Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable Proceedings of the 9th International Computing and Combinatorics Conference (COCOON'03) (T. Warnow, B. Zhu, eds.), volume 2697 of Lecture Notes in Computer Science, pages 548-558, 2003, Springer Verlag. |
| [6] | The complexity of resolution with generalized symmetry rules Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS'03) (Helmut Alt, Michel Habib, eds.), volume 2607 of Lecture Notes in Computer Science, pages 475-486, 2003. |
| [5] | Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable 2003, Technical report TR03-002, Revision 1, Electronic Colloquium on Computational Complexity (ECCC). |
| 2002 | |
| [4] | Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference Theoretical Computer Science, volume 289, number 1, pages 503-516, 2002. |
| [3] | Generalizations of matched CNF formulas Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002) Cincinnati, Ohio, USA, May 6-9, 2002 (John Franco, ed.), pages 292-307, May 2002. |
| 2001 | |
| [2] | NP-Completeness of Refutability by Literal-Once Resolution IJCAR 2001, Proceedings of the International Joint Conference on Automated Reasoning (R. Goré, A. Leitsch, T. Nipkow, eds.), volume 2083 of Lecture Notes in Artificial Intelligence, pages 168-181, 2001, Springer Verlag. |
| [1] | Conjunctive Normal Forms with Bounded Deficiency September 2001, PhD thesis, University of Vienna. |
Doctoral Students
- Tomas Peitl, completed 2019, thesis title: Advanced Dependency Analysis for QBF.
- Neha Lodha, completed 2019, thesis title: SAT Approach to Decomposition. Now: Mondi Group, Austria
- Eduard Eiben, completed 2018, thesis title: Exploiting New Types of Structure for Fixed-Parameter Tractability. Now: Royal Holloway, University of London, UK
- Ronald de Haan, completed 2016, thesis title: Parameterized Complexity in the Polynomial Hierarchy. Now: University of Amsterdam , the Netherlands
- Johannes Fichte, completed 2015, thesis title: Backdoors to Tractability of Disjunctive Answer Set Programming. Now: TU Dresden, Germany
- Friedrich Slivovsky, completed 2015, thesis title: Structure in #SAT and QBF. Now: TU Wien, Austria
- Luke Mathieson, completed 2010, thesis title: The Parameterized Complexity of Degree Constrained Editing Problems. Now: UT Sydney, Australia
In Media and News
(Mostly in German)
- Interview for Profil Medien Spezial 2019, Article "Vielleicht Pandoras Box", October, 2019.
- Interview in the Austrian newspaper "die Presse", Article "Brücke zwischen Analog und Digital", September 27, 2019. See also "The World's Largest Human Sorting Network'' on TU-Wien Informatics website, and "Weltrekord: Größtes menschliches Sortiernetzwerk" on TU-Wien news.
- Interview for weekly Newspaper "Furche", Article "Raus aus der Blase", August 14, 2019
- Video Interview at the Science Festival "Lange Nacht der Forschung" by Austrian Ministry for Science and Eduaction, April 13, 2018
- Radio Interview on Austrian Public Radio Ö1, Digital.Leben on "The malicious Use or Artificial Intelligence" , April 4, 2018
- Interview in "Kurier" Newspaper Article: Silicon Valley macht Universitäten KI-Talente abspenstig, November 3, 2017
- Live TV Studio Interview, W24, Thema Algorithmen, September 14, 2017
- Interview in Futurezone Technology News: Es fehlt die menschliche Kontrolle, September 4, 2017
- Fakultät für Informatik News: Wissenschaft im Grünen, April 25, 2017
- Informatik Austria, Informatiker der Woche, August 24, 2016
- Ö1 Radiokolleg, Die Macht der Prognosen, September 24, 2015
- profil.at Cover, Logik, die wichtigste Wissenschaft der Welt, July 7, 2014
- Ö1, Die Physikalische Soiree, Lösbarkeit von Problemen, January 7, 2013
- Fututurezone.at, Algorithmen Bestimmen unser Leben, February 8, 2012
- Der Standard, Intelligenz ohne Moral ist unlogisch, January 31, 2012
Contact Information
Address:
Stefan Szeider
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria
| Room: | HC0401 (how to get there) |
| Phone: | +43(1)58801–192100 |
| Email: | sz@ac.tuwien.ac.at |
Tweets
