- J38Josh Smith, Hassan Jameel Asghar, Gianpaolo Gioiosa, Sirine Mrabet, Serge Gaspers, and Paul Tyler. Making the Most of Parallel Composition in Differential Privacy. Proceedings on Privacy Enhancing Technologies 2022(1): 253-273, 2022. [doi]
- J37Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, and Baharak Rastegari. Stable Matching with Uncertain Pairwise Preferences. Theoretical Computer Science 909: 1-11, 2022. [doi]
- C72Serge Gaspers and Andrew Kaploun. Faster Algorithms for Weak Backdoors. AAAI 2022: Proceedings of the 36th AAAI Conference on Artificial Intelligence. To appear.
- J36Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, and Markus L. Schmid. On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory of Computing Systems 65(2): 344-409, 2021. [doi]
- J35
- C71Haris Aziz, Serge Gaspers, and Zhaohong Sun. Mechanism Design for School Choice with Soft Diversity Constraints. IJCAI 2020: Proceedings of the 29th International Joint Conference on Artificial Intelligence. IJCAI, pages 153-159. [doi]
- C70Haris Aziz, Serge Gaspers, Zhaohong Sun, and Makoto Yokoo. Multiple Levels of Importance in Matching with Distributional Constraints. AAMAS 2020: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems. IFAAMAS, pages 1759-1761. [url]
- C69Haris Aziz, Serge Gaspers, and Zhaohong Sun. Mechanism Design for School Choice with Soft Diversity Constraints. AAMAS 2020: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems. IFAAMAS, pages 1756-1758. [url]
- J34
- J33
- J32Serge Gaspers and Shenwei Huang. Linearly χ-Bounding (P6,C4)-Free Graphs. Journal of Graph Theory 92(3): 322-342, 2019. [arXiv]
- J31
- J30Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre and Stefan Rümmele. Turbocharging Treewidth Heuristics. Algorithmica 81(2): 439-475, 2019. [doi]
- C68
- C67
- C66Enrico H. Gerding, Alvaro Perez-Diaz, Haris Aziz, Serge Gaspers, Antonia Marcu, Nicholas Mattei, and Toby Walsh. Fair Online Allocation of Perishable Goods and its Application to Electric Vehicle Charging. IJCAI 2019: Proceedings of the 28th International Joint Conference on Artificial Intelligence. IJCAI, pages 5569-5575. [doi]
- C65Haris Aziz, Serge Gaspers, Zhaohong Sun, and Toby Walsh. From Matching with Diversity Constraints to Matching with Regional Quotas. AAMAS 2019: Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems. IFAAMAS, pages 377-385. [url]
- C64Serge Gaspers and Kamran Najeebullah. Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length. AAAI 2019: Proceedings of the 33rd AAAI Conference on Artificial Intelligence. AAAI press, pages 533-540. [doi]
- J29Stephen Finbow, Serge Gaspers, Margaret-Ellen Messinger, and Paul Ottaway. A note on the eternal dominating set problem. International Journal of Game Theory 47(2): 543-555, 2018. [doi]
- J28Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, and Toby Walsh. Fixing balanced knockout and double elimination tournaments. Artificial Intelligence 262: 1-14, 2018 [doi]
- J27
- C63Faisal Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, and Peter Shaw. Cluster Editing with Vertex Splitting. ISCO 2018: Proceedings of the 5th International Symposium on Combinatorial Optimization. Springer LNCS 10856, pages 1-13. [doi]
- C62Haris Aziz, Jiayin Chen, Serge Gaspers, and Zhaohong Sun. Stability and Pareto Optimality in Refugee Allocation Matchings. AAMAS 2018: Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems. IFAAMAS / ACM, pages 964-972. [url]
- C61Haris Aziz, Serge Gaspers, Edward J. Lee, and Kamran Najeebullah. Defender Stackelberg Game with Inverse Geodesic Length as Utility Metric. AAMAS 2018: Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems. IFAAMAS / ACM, pages 694-702. [url]
- C60Serge Gaspers, Shenwei Huang, and Daniël Paulusma. Colouring Square-Free Graphs without Long Induced Paths. STACS 2018: Proceedings of the 35th International Symposium on Theoretical Aspects of Computer Science. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs 96, pages 35:1-35:15. [doi] [arXiv]
- C59Serge Gaspers, Joachim Gudmundsson, Michael Horton, and Stefan Rümmele. When is Red-Blue Nonblocker FPT? LATIN 2018: Proceedings of the 13th Latin American Theoretical Informatics Symposium. Springer LNCS 10807, pages 515-528. [doi]
- C58Serge Gaspers, Stefan Rümmele, Abdallah Saffidine, and Kevin Tran. Minesweeper with Limited Moves. AAAI 2018: Proceedings of the 32nd AAAI Conference on Artificial Intelligence. AAAI press, pages 2652-2658. [url]
- J26
- J25
- C57Serge Gaspers, Joachim Gudmundsson, Julian Mestre and Stefan Rümmele. Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. ISAAC 2017: Proceedings of the 28th International Symposium on Algorithms and Computation. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs 92, pages 37:1-37:13. [doi] [arXiv]
- C56
- C55Haris Aziz, Serge Gaspers, and Kamran Najeebullah. Weakening Covert Networks by Minimizing Inverse Geodesic Length. IJCAI 2017: Proceedings of the 26th International Joint Conference on Artificial Intelligence. IJCAI, pages 779-785. [doi]
- C54
- C53
- C52Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, and Abdallah Saffidine. The Parameterized Complexity of Positional Games. ICALP 2017: Proceedings of the 44th International Colloquium on Automata, Languages and Programming, Track A. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs 80, 90:1--90:14. [doi] [arXiv]
- C51Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, and Baharak Rastegari. Stable Matching with Uncertain Pairwise Preferences. AAMAS 2017: Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems. ACM, pages 344-352. [url]
- P4Serge Gaspers, Sebastian Ordyniak, and Stefan Szeider. Backdoor Sets for CSP. In Andrei A. Krokhin and Stanislav Zivny, editors, The Constraint Satisfaction Problem: Complexity and Approximability, Dagstuhl Follow-Ups 7, pages 137-157, 2017. [doi]
- E1Serge Gaspers and Toby Walsh. Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings. Lecture Notes in Computer Science 10491, Springer 2017, ISBN 978-3-319-66262-6. [doi]
- J24
- C50Serge Gaspers, Christos Papadimitriou, Sigve Hortemo Sæther and Jan Arne Telle. On Satisfiability Problems with a Linear Structure. IPEC 2016: Proceedings of the 11th International Symposium on Parameterized and Exact Computation. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs 63, pages 14:1-14:14. [doi] [arXiv]
- C49Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre and Stefan Rümmele. Turbocharging Treewidth Heuristics. IPEC 2016: Proceedings of the 11th International Symposium on Parameterized and Exact Computation. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs 63, pages 13:1-13:13. [doi]
- C48
- C47Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, and Markus L. Schmid. On the Complexity of Grammar-Based Compression over Fixed Alphabets. ICALP 2016: Proceedings of the 43rd International Colloquium on Automata, Languages and Programming, Track B, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs 55, pages 122:1-122:14. [doi] [LIPIcs]
- C46Andrés Abeliuk, Haris Aziz, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, and Toby Walsh. Interdependent Scheduling Games. IJCAI 2016: Proceedings of the 25th International Joint Conference on Artificial Intelligence, IJCAI/AAAI Press, pages 2-9. [url] [arXiv]
- C45
- C44
- P3Serge Gaspers. Backdoors to SAT. In Ming-Yang Kao, editor, Encyclopedia of Algorithms, Springer, pages 167-170, 2016. [doi]
- J23
- J22
- J21
- J20
- J19
- C43
- C42
- C41
- C40Martin Aleksandrov, Haris Aziz, Serge Gaspers, and Toby Walsh. Online Fair Division: analysing a Food Bank problem. IJCAI 2015: Proceedings of the 24th International Joint Conference on Artificial Intelligence (computational sustainability track), AAAI Press, pages 2540-2546 (Outstanding Student Paper Award). [url] [arXiv]
- C39
- C38
- C37
- O3Haris Aziz, Serge Gaspers, Simon Mackenzie, and Toby Walsh. Two Desirable Fairness Concepts for Allocation of Indivisible Objects under Ordinal Preferences. ACM SIGECOM Exchanges, volume 14.2, 2015. [url]
- J18
- C36
- C35
- C34
- C33
- J17
- J16
- J15
- J14
- C32
- C31
- C30
- C29Geoffrey Chu, Serge Gaspers, Nina Narodytska, Andreas Schutt, and Toby Walsh. On the complexity of global scheduling constraints under structural restrictions. IJCAI 2013: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, AAAI Press / IJCAI, pages 503-509. [url] [pdf]
- C28
- C27
- C26
- C25
- O2Haris Aziz, Serge Gaspers, Nicholas Mattei, Nina Narodytska, and Toby Walsh. Algorithmic Decision Theory @ NICTA. AAAI 2013 Video Competition and IJCAI 2013 Video Competition, 2013. Received the most educational video award at IJCAI 2013. [mp4]
- J13
- J12
- J11
- J10
- C24
- C23
- C22
- C21
- C20Fedor V. Fomin, Serge Gaspers, Petr Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, and Yngve Villanger. k-Gap Interval Graphs. LATIN 2012: Proceedings of the 10th Latin American Theoretical Informatics Symposium, Springer LNCS 7256, pages 350-361. [doi] [arXiv] [pdf]
- P2Serge Gaspers and Stefan Szeider. Backdoors to Satisfaction. In Hans L. Bodlaender, Rodney G. Downey, Fedor V. Fomin, Dániel Marx, editors, The Multivariate Algorithmic Revolution and Beyond: Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, Springer LNCS 7370, pages 287-317, 2012. [doi] [arXiv]
- I1Serge Gaspers. From edge-disjoint paths to independent paths. Computing Research Repository, ArXiv Report CoRR abs/1203.4483 (2012). [arXiv]
- J9
- C19
- C18
- C17
- P1Michael R. Fellows, Serge Gaspers, and Frances Rosamond. Multivariate Complexity Theory. In Edward K. Blum and Alfred V. Aho, editors, Computer Science: The Hardware, Software and Heart of It, chapter 13, pages 269-293. Springer, December 2011. [doi]
- B1Serge Gaspers. Exponential Time Algorithms: Structures, Measures, and Bounds. VDM Verlag Dr. Mueller e.K., ISBN 978-3-639-21825-1, 216 pages, February 2010. [pdf screen] [pdf print] [Amazon]
- J8
- J7
- J6
- J5
- C16
- C15
- J4
- J3
- J2
- C14Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, and Stéphan Thomassé. Kernels for Feedback Arc Set In Tournaments. FSTTCS 2009: Proceedings of the 29th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs 4, pages 37 - 47. [doi] [arXiv] [pdf]
- C13
- C12
- C11
- C10Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, and Daniel Raible. Exact exponential-time algorithms for finding bicliques in a graph. CTW 2009: Proceedings of the 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization, Ecole Polytechnique and CNAM, pages 205 - 209. [url] [pdf]
- C9
- O1Serge Gaspers. Measure & Conquer for Parameterized Branching Algorithms. Parameterized Complexity News: Newsletter of the Parameterized Complexity Community, September 2009. [pdf]
- PhDSerge Gaspers. Exponential Time Algorithms: Structures, Measures, and Bounds. PhD thesis, December 2008, University of Bergen, Norway. Advisor: Fedor V. Fomin; Committee: Thore Husfedt, Ryan Williams, and Dag Haugland. [handle] [pdf screen] [pdf print]
- J1
- C8
- C7
- C6
- C5
- C4
- C3
- C2
- C1
- M2Serge Gaspers. Algorithmes exponentiels. Master Thesis (DEA Informatique de Lorraine), June 2005, Ecole Doctorale IAEM Lorraine, (in French). Advisor: Dieter Kratsch, LITA, University of Metz (now called University of Lorraine), France. [pdf]
- M1Serge Gaspers. Algorithmes pour le problème de domination d'un graphe. Maîtrise Thesis (Maîtrise Informatique), June 2004, (in French). Advisor: Dieter Kratsch, LITA, University of Metz (now called University of Lorraine), France. [pdf]
- DUTSerge Gaspers. Création d'un Firewall. Mémoire de fin d'études (DUT en Informatique), June 2002, (in French). Advisor: Paul Yans, Centre Universitaire de Luxembourg (now called University of Luxembourg), Luxembourg.