Serge Gaspers
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
57
Venues
19
Active years
2006–2026
Best venue rank
A*
Where they publish
Papers
57 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Faster Exponential-Time Approximate Counting via Bounded Self-Reductions. | Katie Clinch, Serge Gaspers, Simon Mackenzie, Qi Wang |
| 2025 | WALCOM | A Piecewise Approach for the Analysis of Exact Algorithms. | Katie Clinch, Serge Gaspers, Zixu He, Abdallah Saffidine, Tiankuang Zhang |
| 2024 | COMSNETS | Blockchain-Enabled Private and Secure Task Allocation Framework. | Ayda Valinezhad Orang, Ali Dorri, Serge Gaspers, Sushmita Ruj |
| 2024 | ICALP | Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems. | Serge Gaspers, Jerry Zirui Li |
| 2022 | AAAI | Faster Algorithms for Weak Backdoors. | Serge Gaspers, Andrew Kaploun |
| 2020 | IJCAI | Mechanism Design for School Choice with Soft Diversity Constraints. | Haris Aziz, Serge Gaspers, Zhaohong Sun |
| 2019 | AAAI | Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length. | Serge Gaspers, Kamran Najeebullah |
| 2019 | IJCAI | Fair Online Allocation of Perishable Goods and its Application to Electric Vehicle Charging. | Enrico H. Gerding, Alvaro Perez-Diaz, Haris Aziz, Serge Gaspers, Antonia Marcu, Nicholas Mattei, Toby Walsh |
| 2019 | ISAAC | Minimizing and Computing the Inverse Geodesic Length on Trees. | Serge Gaspers, Joshua Lau |
| 2019 | MFCS | Enumeration of Preferred Extensions in Almost Oriented Digraphs. | Serge Gaspers, Ray Li |
| 2018 | AAAI | Minesweeper with Limited Moves. | Serge Gaspers, Stefan Rmmele, Abdallah Saffidine, Kevin Tran |
| 2018 | LATIN | When is Red-Blue Nonblocker Fixed-Parameter Tractable? | Serge Gaspers, Joachim Gudmundsson, Michael Horton, Stefan Rmmele |
| 2018 | STACS | Colouring Square-Free Graphs without Long Induced Paths. | Serge Gaspers, Shenwei Huang, Danil Paulusma |
| 2017 | COCOON | Faster Graph Coloring in Polynomial Space. | Serge Gaspers, Edward J. Lee |
| 2017 | ICALP | The Parameterized Complexity of Positional Games. | douard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rmmele, Abdallah Saffidine |
| 2017 | ICALP | Exact Algorithms via Multivariate Subroutines. | Serge Gaspers, Edward J. Lee |
| 2017 | IJCAI | Weakening Covert Networks by Minimizing Inverse Geodesic Length. | Haris Aziz, Serge Gaspers, Kamran Najeebullah |
| 2017 | ISAAC | Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. | Serge Gaspers, Joachim Gudmundsson, Julin Mestre, Stefan Rmmele |
| 2017 | WG | Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs. | Serge Gaspers, Shenwei Huang |
| 2016 | ICALP | On the Complexity of Grammar-Based Compression over Fixed Alphabets. | Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid |
| 2016 | IJCAI | Interdependent Scheduling Games. | Andrs Abeliuk, Haris Aziz, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, Toby Walsh |
| 2016 | LATIN | Faster Algorithms to Enumerate Hypergraph Transversals. | Manfred Cochefert, Jean-Franois Couturier, Serge Gaspers, Dieter Kratsch |
| 2016 | STOC | Exact algorithms via monotone local search. | Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh |
| 2016 | SAGT | Stable Matching with Uncertain Linear Preferences. | Haris Aziz, Pter Bir, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari |
| 2015 | ICALP | Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets. | Serge Gaspers, Gregory B. Sorkin |
| 2015 | IJCAI | Online Fair Division: Analysing a Food Bank Problem. | Martin Aleksandrov, Haris Aziz, Serge Gaspers, Toby Walsh |
| 2015 | IJCAI | Welfare Maximization in Fractional Hedonic Games. | Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julin Mestre, Hanjo Tubig |
| 2015 | IJCAI | Equilibria Under the Probabilistic Serial Rule. | Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh |
| 2015 | WG | On the Number of Minimal Separators in Graphs. | Serge Gaspers, Simon Mackenzie |
| 2014 | AAAI | Computational Aspects of Multi-Winner Approval Voting. | Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh |
| 2014 | AAAI | Fixing a Balanced Knockout Tournament. | Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, Toby Walsh |
| 2014 | AAAI | Fixing a Balanced Knockout Tournament. | Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, Toby Walsh |
| 2014 | AAAI | Backdoors into Heterogeneous Classes of SAT and CSP. | Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivn |
| 2013 | AAAI | Ties Matter: Complexity of Manipulation when Tie-Breaking with a Random Vote. | Haris Aziz, Serge Gaspers, Nicholas Mattei, Nina Narodytska, Toby Walsh |
| 2013 | FOCS | Strong Backdoors to Bounded Treewidth SAT. | Serge Gaspers, Stefan Szeider |
| 2013 | IJCAI | On the Complexity of Global Scheduling Constraints under Structural Restrictions. | Geoffrey Chu, Serge Gaspers, Nina Narodytska, Andreas Schutt, Toby Walsh |
| 2013 | ISAAC | Myhill-Nerode Methods for Hypergraphs. | Ren van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond |
| 2013 | ISAAC | Augmenting Graphs to Minimize the Diameter. | Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson |
| 2013 | STACS | Backdoors to q-Horn. | Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider |
| 2012 | AAAI | On Finding Optimal Polytrees. | Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider |
| 2012 | AAAI | Don't Be Strict in Local Search! | Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider |
| 2012 | ICALP | Backdoors to Acyclic SAT. | Serge Gaspers, Stefan Szeider |
| 2012 | LATIN | k-Gap Interval Graphs. | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger |
| 2012 | SAT | Strong Backdoors to Nested Satisfiability. | Serge Gaspers, Stefan Szeider |
| 2011 | CP | The Parameterized Complexity of Local Consistency. | Serge Gaspers, Stefan Szeider |
| 2011 | IJCAI | Kernels for Global Constraints. | Serge Gaspers, Stefan Szeider |
| 2011 | WG | Complexity of Splits Reconstruction for Low-Degree Trees. | Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan |
| 2010 | ESA | Feedback Vertex Sets in Tournaments. | Serge Gaspers, Matthias Mnich |
| 2009 | ISAAC | A Linear Vertex Kernel for Maximum Internal Spanning Tree. | Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stphan Thomass |
| 2009 | SODA | A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. | Serge Gaspers, Gregory B. Sorkin |
| 2009 | WG | Exact and Parameterized Algorithms for Max Internal Spanning Tree. | Henning Fernau, Serge Gaspers, Daniel Raible |
| 2008 | MFCS | Iterative Compression and Exact Algorithms. | Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh |
| 2008 | TAMC | A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. | Serge Gaspers, Saket Saurabh, Alexey A. Stepanov |
| 2008 | WG | On Independent Sets and Bicliques in Graphs. | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff |
| 2007 | COCOON | Improved Exact Algorithms for Counting 3- and 4-Colorings. | Fedor V. Fomin, Serge Gaspers, Saket Saurabh |
| 2006 | ISAAC | Branching and Treewidth Based Exact Algorithms. | Fedor V. Fomin, Serge Gaspers, Saket Saurabh |
| 2006 | WG | A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. | Serge Gaspers, Mathieu Liedloff |