ORCID as entered in ROS

Select Publications
Gaspers S; Huang S; Paulusma D, 2018, 'Colouring square-free graphs without long induced paths', in Niedermeier R; Vallée B (ed.), Leibniz International Proceedings in Informatics, LIPIcs, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Caen, France, pp. 35:1 - 35:15, presented at 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Caen, France, 28 February 2018 - 03 March 2018, http://dx.doi.org/10.4230/LIPIcs.STACS.2018.35
Abu-Khzam FN; Egan J; Gaspers S; Shaw A; Shaw P, 2018, 'Cluster editing with vertex splitting', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 1 - 13, http://dx.doi.org/10.1007/978-3-319-96151-4_1
Gaspers S; Gudmundsson J; Horton M; Rümmele S, 2018, 'When is red-blue nonblocker fixed-parameter tractable?', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 515 - 528, http://dx.doi.org/10.1007/978-3-319-77404-6_38
Gaspers S; Lee EJ, 2017, 'Faster Graph Coloring in Polynomial Space', in Cao Y; Chen J (ed.), COCOON, Springer, Hong Kong, China, pp. 371 - 383, presented at COCOON 2017 - 23rd International Conference on Computing and Combinatorics, Hong Kong, China, 03 August 2017 - 05 August 2017, http://dx.doi.org/10.1007/978-3-319-62389-4_31
Gaspers S; Lee EJ, 2017, 'Exact Algorithms via Multivariate Subroutines', in Chatzigiannakis I; Indyk P; Kuhn F; Muscholl A (eds.), Proceedings of ICALP 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Warsaw, Poland, pp. 69:1 - 69:13, presented at ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming, Warsaw, Poland, 10 July 2017 - 14 July 2017, http://dx.doi.org/10.4230/LIPIcs.ICALP.2017.69
Bonnet E; Gaspers S; Lambilliotte A; Rümmele S; Saffidine A; Ruemmele S, 2017, 'The Parameterized Complexity of Positional Games', in Leibniz International Proceedings in Informatics, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Warsaw, Poland, pp. 90:1 - 90:14, presented at ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming, Warsaw, Poland, 10 July 2017 - 14 July 2017, http://dx.doi.org/10.4230/LIPIcs.ICALP.2017.90
Gaspers S; Huang S, 2017, 'Linearly χ -Bounding (P
Aziz H; Biro P; Fleiner T; Gaspers S; de Haan R; Mattei N; Rastegari B, 2017, 'Stable Matching with Uncertain Pairwise Preferences', in Larson K; Winikoff M; Das S; Durfee EH (eds.), Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, ACM, Sao Paulo, Brazil, pp. 344 - 352, presented at AAMAS 2017 - 16th Conference on Autonomous Agents and MultiAgent Systems, Sao Paulo, Brazil, 08 May 2017 - 12 May 2017, http://dx.doi.org/10.1016/j.tcs.2022.01.028
Gaspers S; Rümmele S; Saffidine A; Tran K, 2017, 'Minesweeper with limited moves', in 32nd AAAI Conference on Artificial Intelligence, AAAI 2018, Association for the Advancement of Artificial Intelligence, New Orleans, Louisiana, USA, pp. 860 - 867, presented at Thirty-Second AAAI Conference on Artificial Intelligence, New Orleans, Louisiana, USA, 02 February 2017 - 07 February 2017, https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/17407/15768
Aziz H; Gaspers S; Najeebullah K, 2017, 'Weakening covert networks by minimizing inverse geodesic length', in IJCAI International Joint Conference on Artificial Intelligence, pp. 779 - 785, http://dx.doi.org/10.24963/ijcai.2017/108
Aziz H; Biró P; Gaspers S; de Haan R; Mattei N; Rastegari B, 2016, 'Stable matching with uncertain linear preferences', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), SPRINGER INT PUBLISHING AG, Liverpool, UK, pp. 195 - 206, presented at Algorithmic Game Theory - 9th International Symposium (SAGT 2016), Liverpool, UK, 19 September 2016 - 21 September 2016, http://dx.doi.org/10.1007/978-3-662-53354-3_16
Gaspers S; Papadimitriou C; Saether SH; Telle JA, 2016, 'On Satisfiability Problems with a Linear Structure', in Leibniz International Proceedings in Informatics, LIPIcs, Aarhus, Denmark, presented at 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Aarhus, Denmark, 24 August 2016 - 26 August 2016
Gaspers S; Gudmundsson J; Jones M; Mestre J; Ruemmele S, 2016, 'Turbocharging Treewidth Heuristics', in Guo J; Hermelin D (ed.), Leibniz International Proceedings in Informatics, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Aarhus, Denmark, pp. 13:1 - 13:1, presented at 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, Aarhus, Denmark, 24 August 2016 - 26 August 2016, http://dx.doi.org/10.4230/LIPIcs.IPEC.2016.13
Casel K; Fernau H; Gaspers S; Gras B; Schmid ML, 2016, 'On the complexity of grammar-based compression over fixed alphabets', in Chatzigiannakis I; Mitzenmacher M; Rabani Y; Sangiorgi D (eds.), Leibniz International Proceedings in Informatics, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Rome, Italy, pp. 122:1 - 122:1, presented at 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Rome, Italy, 11 July 2016 - 15 July 2016, http://dx.doi.org/10.4230/lipics.icalp.2016.122
Abeliuk A; Aziz H; Berbeglia G; Gaspers S; Kalina P; Mattei N; Peters D; Stursberg P; Van Hentenryck P; Walsh T, 2016, 'Interdependent scheduling games', in IJCAI International Joint Conference on Artificial Intelligence, pp. 2 - 9, http://dx.doi.org/10.26190/unsworks/27610
Cochefert M; Couturier J-F; Gaspers S; Kratsch D, 2016, 'Faster Algorithms to Enumerate Hypergraph Transversals.', in Kranakis E; Navarro G; Chávez E (eds.), LATIN, Springer, pp. 306 - 318, https://doi.org/10.1007/978-3-662-49529-2
Abeliuk A; Aziz H; Berbeglia G; Gaspers S; Kalina P; Mattei N; Peters D; Stursberg P; Hentenryck PV; Walsh T, 2016, 'Interdependent Scheduling Games.', in Kambhampati S (ed.), IJCAI, IJCAI/AAAI Press, pp. 2 - 9, http://www.ijcai.org/Proceedings/2016
Gaspers S; Papadimitriou CH; Sæther SH; Telle JA, 2016, 'On Satisfiability Problems with a Linear Structure.', in Guo J; Hermelin D (ed.), IPEC, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 14:1 - 14:1, http://www.dagstuhl.de/dagpub/978-3-95977-023-1
Aziz H; Gaspers S; Gudmundsson J; Mestre J; Täubig H, 2015, 'Welfare maximization in fractional hedonic games', in IJCAI International Joint Conference on Artificial Intelligence, pp. 461 - 467
Aziz H; Gaspers S; Gudmundsson J; Mackenzie S; Mattei N; Walsh T, 2015, 'Computational Aspects of Multi-Winner Approval Voting.', in Weiss G; Yolum P; Bordini RH; Elkind E (eds.), AAMAS, ACM, pp. 107 - 115, http://dl.acm.org/citation.cfm?id=2772879
Aziz H; Gaspers S; Mackenzie S; Mattei N; Narodytska N; Walsh T, 2015, 'Equilibria Under the Probabilistic Serial Rule.', in Yang Q; Wooldridge MJ (ed.), IJCAI, AAAI Press, pp. 1105 - 1112, http://ijcai.org/proceedings/2015
Aziz H; Gaspers S; Mackenzie S; Mattei N; Narodytska N; Walsh T, 2015, 'Manipulating the Probabilistic Serial Rule.', in Weiss G; Yolum P; Bordini RH; Elkind E (eds.), AAMAS, ACM, pp. 1451 - 1459, http://dl.acm.org/citation.cfm?id=2772879
Gaspers S; Mackenzie S, 2015, 'On the Number of Minimal Separators in Graphs.', in Mayr EW (ed.), WG, Springer, pp. 116 - 121, https://doi.org/10.1007/978-3-662-53174-7
Aleksandrov M; Aziz H; Gaspers S; Walsh T, 2015, 'Online Fair Division: Analysing a Food Bank Problem.', in Yang Q; Wooldridge MJ (ed.), IJCAI, AAAI Press, pp. 2540 - 2546, http://ijcai.org/proceedings/2015
Gaspers S; Sorkin GB, 2015, 'Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets.', in Halldórsson MM; Iwama K; Kobayashi N; Speckmann B (eds.), ICALP (1), Springer, pp. 567 - 579, https://doi.org/10.1007/978-3-662-47672-7
Gaspers S; Misra N; Ordyniak S; Szeider S; Zivny S, 2014, 'Backdoors into Heterogeneous Classes of SAT and CSP', in PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE, CANADA, Quebec City, pp. 2652 - 2658, presented at 28th AAAI Conference on Artificial Intelligence, CANADA, Quebec City, 27 July 2014 - 31 July 2014
Gaspers S; Naroditskiy V; Narodytska N; Walsh T, 2014, 'Possible and Necessary Winner Problem in Social Polls (extended abstract)', Saint Paul, presented at roceedings of the 2013 international conference on Autonomous agents and multi-agent system, Saint Paul, 06 May 2014 - 10 May 2014, http://dl.acm.org/citation.cfm?id=2485106
Aziz H; Gaspers S; Mackenzie S; Walsh T, 2014, 'Fair Assignment Of Indivisible Objects Under Ordinal Preferences', in AAMAS'14: PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, ASSOC COMPUTING MACHINERY, FRANCE, Paris, pp. 1305 - 1312, presented at International Conference on Autonomous Agents and Multiagent Systems (AAMAS), FRANCE, Paris, 05 May 2014 - 09 May 2014
Gaspers S; Misra N; Ordyniak S; Szeider S; Živný S, 2014, 'Backdoors into heterogeneous classes of SAT and CSP', in Proceedings of the National Conference on Artificial Intelligence, pp. 2652 - 2658
Aziz H; Gaspers S; Mackenzie S; Walsh T, 2014, 'Fair assignment of indivisible objects under ordinal preferences', in Bazzan ALC; Huhns MN; Lomuscio A; Scerri P (eds.), 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014, Elsevier, pp. 1305 - 1312, http://dx.doi.org/10.1016/j.artint.2015.06.002
Aziz H; Gaspers S; Mackenzie S; Mattei N; Stursberg P; Walsh T, 2014, 'Fixing a balanced knockout tournament', in Proceedings of the National Conference on Artificial Intelligence, pp. 552 - 558
Gaspers S; Naroditskiy V; Narodytska N; Walsh T, 2014, 'Possible and necessary winner problem in social polls', in 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014, pp. 613 - 620
Frati F; Gaspers S; Gudmundsson J; Mathieson L, 2013, 'Augmenting Graphs to Minimize the Diameter', Springer, pp. 383 - 393, presented at ISAAC 2013: 24th Annual International Symposium on Algorithms and Computation, 16 December 2013 - 18 December 2013, http://dx.doi.org/10.1007/978-3-642-45030-3_36
van Bevern R; Fellows MR; Gaspers S; Rosamond FA, 2013, 'Myhill-Nerode Methods for Hypergraphs', in Algorithms and Computation, Springer, pp. 372 - 382, presented at ISAAC 2013: 24th Annual International Symposium on Algorithms and Computation, 16 December 2013 - 18 December 2013, http://dx.doi.org/10.1007/978-3-642-45030-3_35
Chu G; Gaspers S; Narodytska N; Schutt A; Walsh T, 2013, 'On the complexity of global scheduling constraints under structural restrictions', in IJCAI International Joint Conference on Artificial Intelligence, pp. 503 - 509
Gaspers S; Szeider S, 2013, 'Strong Backdoors to Bounded Treewidth SAT', in Reingold O (ed.), Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on, Berkeley, CA, USA, presented at FOCS 2013: 54th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA, USA, 27 October 2013 - 29 October 2013
Aziz H; Gaspers S; Mattei N; Narodytska N; Walsh T, 2013, 'Ties matter: Complexity of manipulation when tie-breaking with a random vote', in desJardins, M; Littman M (ed.), Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013, Bellevue, Washington, USA, pp. 74 - 80, presented at 27th AAAI Conference on Artificial Intelligence, AAAI 2013, Bellevue, Washington, USA, 14 July 2013 - 18 July 2013, http://dblp.uni-trier.de/db/conf/aaai/aaai2013.html#AzizGMNW13
Gaspers S; Kim EJ; Ordyniak S; Saurabh S; Szeider S, 2013, 'Don't Be Strict in Local Search!', in Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, AAAI Press, Bellevue, WAshington, USA, pp. 486 - 492, presented at Twenty-Seventh Conference on Artificial Intelligence (AAAI-13), Bellevue, WAshington, USA, 14 July 2013 - 18 July 2013, https://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/4929/5228
Gaspers S; Koivisto M; Liedloff M; Ordyniak S; Szeider S, 2013, 'On Finding Optimal Polytrees', in Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, AAAI Press, Bellevue, WAshington, USA, pp. 750 - 756, presented at Twenty-Seventh Conference on Artificial Intelligence (AAAI-13), Bellevue, WAshington, USA, 14 July 2013 - 18 July 2013, https://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/4927/5266
Gaspers S; Ordyniak S; Ramanujan MS; Saurabh S; Szeider S, 2013, 'Backdoors to q-Horn', Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 67 - 79, presented at 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Dagstuhl, Germany, 27 February 2013 - 02 March 2013, http://dx.doi.org/10.4230/LIPIcs.STACS.2013.67
Gaspers S; Kalinowski T; Narodytska N; Walsh T, 2013, 'Coalitional manipulation for Schulze's rule.', in Gini ML; Shehory O; Ito T; Jonker CM (eds.), AAMAS, IFAAMAS, pp. 431 - 438, http://dl.acm.org/citation.cfm?id=2484920
Gaspers S; Szeider S, 2012, 'Backdoors to Acyclic SAT', in Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), LNCS 7391, Springer, Warwick, UK, pp. 363 - 374, presented at International Colloquium on Automata, Languages and Programming, Warwick, UK, 09 July 2012 - 13 July 2012, http://dx.doi.org/10.1007/978-3-642-31594-7_31
Gaspers S; Szeider S, 2012, 'Strong backdoors to nested satisfiability', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7317 LNCS, Springer Verlag, Trento, Italy, pp. 72 - 85, presented at 15th International Conference on Theory and Applications of Satisfiability Testing, SAT 2012, Trento, Italy, 17 June 2012 - 20 June 2012, http://dx.doi.org/10.1007/978-3-642-31612-8_7
Fomin FV; Gaspers S; Fomin FV; Suchan K; Szeider S; van Leeuwen EJ; Vatshelle M; Villanger Y, 2012, 'k-Gap Interval Graphs', in Proceedings of the 10th Latin American Symposium on Theoretical Informatics, Springer, Berlin, pp. 350 - 361, presented at 10th Latin American Symposium on Theoretical Informatics, Arequipa, Peru, 16 April 2012 - 20 April 2012, http://dx.doi.org/10.1007/978-3-642-29344-3_30
Gaspers S; Liedloff M; Stein M; Suchan K, 2011, 'Complexity of splits reconstruction for low-degree trees', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 167 - 178, http://dx.doi.org/10.1007/978-3-642-25870-1_16
Gaspers S; Szeider S, 2011, 'Kernels for global constraints', in IJCAI International Joint Conference on Artificial Intelligence, pp. 540 - 545, http://dx.doi.org/10.5591/978-1-57735-516-8/IJCAI11-098
Gaspers S; Szeider S, 2011, 'The parameterized complexity of local consistency', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 302 - 316, http://dx.doi.org/10.1007/978-3-642-23786-7_24
Fellows MR; Gaspers S; Rosamond FA, 2010, 'Parameterizing by the number of numbers', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 123 - 134, http://dx.doi.org/10.1007/978-3-642-17493-3_13
Gaspers S; Mnich M, 2010, 'Feedback vertex sets in tournaments', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 267 - 277, http://dx.doi.org/10.1007/978-3-642-15775-2_23
Fernau H; Gaspers S; Raible D, 2010, 'Exact and parameterized algorithms for max internal spanning tree', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 100 - 111, http://dx.doi.org/10.1007/978-3-642-11409-0_9