Serge Gaspers

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 83

Top Venues

Publications

Serge Gaspers, Jerry Zirui Li
Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems. ICALP (2024)
Ayda Valinezhad Orang, Ali Dorri, Serge Gaspers, Sushmita Ruj
Blockchain-Enabled Private and Secure Task Allocation Framework. COMSNETS (2024)
Katie Clinch, Serge Gaspers, Abdallah Saffidine, Tiankuang Zhang
A Piecewise Approach for the Analysis of Exact Algorithms. CoRR (2024)
Serge Gaspers, Edward J. Lee
Faster Graph Coloring in Polynomial Space. Algorithmica 85 (2) (2023)
Serge Gaspers, Jerry Zirui Li
Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems. CoRR (2023)
Josh Smith, Hassan Jameel Asghar, Gianpaolo Gioiosa, Sirine Mrabet, Serge Gaspers, Paul Tyler
Making the Most of Parallel Composition in Differential Privacy. Proc. Priv. Enhancing Technol. 2022 (1) (2022)
Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
Stable matching with uncertain pairwise preferences. Theor. Comput. Sci. 909 (2022)
Serge Gaspers, Andrew Kaploun
Faster Algorithms for Weak Backdoors. AAAI (2022)
Josh Smith, Hassan Jameel Asghar, Gianpaolo Gioiosa, Sirine Mrabet, Serge Gaspers, Paul Tyler
Making the Most of Parallel Composition in Differential Privacy. CoRR (2021)
Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory Comput. Syst. 65 (2) (2021)
Haris Aziz, Serge Gaspers, Zhaohong Sun
Mechanism Design for School Choice with Soft Diversity Constraints. AAMAS (2020)
Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
Stable Matching with Uncertain Linear Preferences. Algorithmica 82 (5) (2020)
Haris Aziz, Serge Gaspers, Zhaohong Sun
Mechanism Design for School Choice with Soft Diversity Constraints. IJCAI (2020)
Haris Aziz, Serge Gaspers, Zhaohong Sun, Makoto Yokoo
Multiple Levels of Importance in Matching with Distributional Constraints: Extended Abstract. AAMAS (2020)
Haris Aziz, Serge Gaspers, Zhaohong Sun, Toby Walsh
From Matching with Diversity Constraints to Matching with Regional Quotas. CoRR (2020)
Serge Gaspers, Kamran Najeebullah
Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length. AAAI (2019)
Haris Aziz, Serge Gaspers, Zhaohong Sun, Toby Walsh
From Matching with Diversity Constraints to Matching with Regional Quotas. AAMAS (2019)
Serge Gaspers, Ray Li
Enumeration of Preferred Extensions in Almost Oriented Digraphs. MFCS (2019)
Serge Gaspers, Joshua Lau
Minimizing and Computing the Inverse Geodesic Length on Trees. ISAAC (2019)
Serge Gaspers, Shenwei Huang
-Free Graphs are 4-Colorable. SIAM J. Discret. Math. 33 (2) (2019)
Enrico H. Gerding, Alvaro Perez-Diaz, Haris Aziz, Serge Gaspers, Antonia Marcu, Nicholas Mattei, Toby Walsh
Fair Online Allocation of Perishable Goods and its Application to Electric Vehicle Charging. IJCAI (2019)
Serge Gaspers, Shenwei Huang, Daniël Paulusma
Colouring square-free graphs without long induced paths. J. Comput. Syst. Sci. 106 (2019)
Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw
On the Parameterized Cluster Editing with Vertex Splitting Problem. CoRR (2019)
Serge Gaspers, Ray Li
Enumeration of Preferred Extensions in Almost Oriented Digraphs. CoRR (2019)
Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
Exact Algorithms via Monotone Local Search. J. ACM 66 (2) (2019)
Serge Gaspers, Shenwei Huang
Linearly χ-bounding (P6, C4)-free graphs. J. Graph Theory 92 (3) (2019)
Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele
Turbocharging Treewidth Heuristics. Algorithmica 81 (2) (2019)
Serge Gaspers, Joshua Lau
Minimizing and Computing the Inverse Geodesic Length on Trees. CoRR (2018)
Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, Toby Walsh
Fixing balanced knockout and double elimination tournaments. Artif. Intell. 262 (2018)
Serge Gaspers, Joachim Gudmundsson, Michael Horton, Stefan Rümmele
When is Red-Blue Nonblocker Fixed-Parameter Tractable? LATIN (2018)
Serge Gaspers, Simon Mackenzie
On the number of minimal separators in graphs. J. Graph Theory 87 (4) (2018)
Haris Aziz, Jiayin Chen, Serge Gaspers, Zhaohong Sun
Stability and Pareto Optimality in Refugee Allocation Matchings. AAMAS (2018)
Serge Gaspers, Shenwei Huang, Daniël Paulusma
Colouring Square-Free Graphs without Long Induced Paths. STACS (2018)
Haris Aziz, Serge Gaspers, Edward J. Lee, Kamran Najeebullah
Defender Stackelberg Game with Inverse Geodesic Length as Utility Metric. AAMAS (2018)
Serge Gaspers, Shenwei Huang, Daniël Paulusma
Colouring Square-Free Graphs without Long Induced Paths. CoRR (2018)
Serge Gaspers, Stefan Rümmele, Abdallah Saffidine, Kevin Tran
Minesweeper with Limited Moves. AAAI (2018)
Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw
Cluster Editing with Vertex Splitting. ISCO (2018)
Stephen Finbow, Serge Gaspers, Margaret-Ellen Messinger, Paul Ottaway
A note on the eternal dominating set problem. Int. J. Game Theory 47 (2) (2018)
Serge Gaspers, Edward J. Lee
Exact Algorithms via Multivariate Subroutines. ICALP (2017)
Serge Gaspers, Edward J. Lee
Faster Graph Coloring in Polynomial Space. COCOON (2017)
Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
Stable Matching with Uncertain Pairwise Preferences. AAMAS (2017)
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
Backdoors into heterogeneous classes of SAT and CSP. J. Comput. Syst. Sci. 85 (2017)
Serge Gaspers, Edward J. Lee
Exact Algorithms via Multivariate Subroutines. CoRR (2017)
Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. CoRR (2017)
Serge Gaspers, Shenwei Huang
Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs. WG (2017)
Haris Aziz, Serge Gaspers, Kamran Najeebullah
Weakening Covert Networks by Minimizing Inverse Geodesic Length. IJCAI (2017)
Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine
The Parameterized Complexity of Positional Games. ICALP (2017)
Serge Gaspers, Gregory B. Sorkin
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets. ACM Trans. Algorithms 13 (4) (2017)
Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. ISAAC (2017)
Serge Gaspers, Shenwei Huang
Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs. CoRR (2017)
Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine
The Parameterized Complexity of Positional Games. CoRR (2017)
Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle
On Satisfiability Problems with a Linear Structure. CoRR (2016)
Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
Exact algorithms via monotone local search. STOC (2016)
Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
Stable Matching with Uncertain Linear Preferences. SAGT (2016)
Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch
Faster Algorithms to Enumerate Hypergraph Transversals. LATIN (2016)
Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle
On Satisfiability Problems with a Linear Structure. IPEC (2016)
Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele
Turbocharging Treewidth Heuristics. IPEC (2016)
Andrés Abeliuk, Haris Aziz, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, Toby Walsh
Interdependent Scheduling Games. IJCAI (2016)
Andrés Abeliuk, Haris Aziz, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, Toby Walsh
Interdependent Scheduling Games. CoRR (2016)
Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
Backdoors to q-Horn. Algorithmica 74 (1) (2016)
Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
Stable Matching with Uncertain Linear Preferences. CoRR (2016)
Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid
On the Complexity of Grammar-Based Compression over Fixed Alphabets. ICALP (2016)
Serge Gaspers, Edward J. Lee
Faster Graph Coloring in Polynomial Space. CoRR (2016)
Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
Exact Algorithms via Monotone Local Search. CoRR (2015)
Serge Gaspers, Simon Mackenzie
On the Number of Minimal Separators in Graphs. WG (2015)
Martin Aleksandrov, Haris Aziz, Serge Gaspers, Toby Walsh
Online Fair Division: analysing a Food Bank problem. CoRR (2015)
Serge Gaspers, Mathieu Liedloff, Maya Jakobine Stein, Karol Suchan
Complexity of splits reconstruction for low-degree trees. Discret. Appl. Math. 180 (2015)
Martin Aleksandrov, Haris Aziz, Serge Gaspers, Toby Walsh
Online Fair Division: Analysing a Food Bank Problem. IJCAI (2015)
Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Hanjo Täubig
Welfare Maximization in Fractional Hedonic Games. IJCAI (2015)
René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
Myhill-Nerode Methods for Hypergraphs. Algorithmica 73 (4) (2015)
Serge Gaspers, Gregory B. Sorkin
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets. ICALP (1) (2015)
Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh
Two desirable fairness concepts for allocation of indivisible objects under ordinal preferences. SIGecom Exch. 14 (2) (2015)
Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh
Manipulating the Probabilistic Serial Rule. CoRR (2015)
Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh
Manipulating the Probabilistic Serial Rule. AAMAS (2015)
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
Backdoors into Heterogeneous Classes of SAT and CSP. CoRR (2015)
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
On finding optimal polytrees. Theor. Comput. Sci. 592 (2015)
Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh
Equilibria Under the Probabilistic Serial Rule. CoRR (2015)
Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson
Augmenting Graphs to Minimize the Diameter. Algorithmica 72 (4) (2015)
Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh
Computational Aspects of Multi-Winner Approval Voting. AAMAS (2015)
Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh
Fair assignment of indivisible objects under ordinal preferences. Artif. Intell. 227 (2015)
Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh
Equilibria Under the Probabilistic Serial Rule. IJCAI (2015)
Serge Gaspers, Simon Mackenzie
On the Number of Minimal Separators in Graphs. CoRR (2015)
Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch
Faster algorithms to enumerate hypergraph transversals. CoRR (2015)
Serge Gaspers, Victor Naroditskiy, Nina Narodytska, Toby Walsh
Possible and necessary winner problem in social polls. AAMAS (2014)
Serge Gaspers, Stefan Szeider
Guarantees and limits of preprocessing in constraint satisfaction and reasoning. Artif. Intell. 216 (2014)
Serge Gaspers, Stefan Szeider
Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning. CoRR (2014)
Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh
Fair assignment of indivisible objects under ordinal preferences. AAMAS (2014)
Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, Toby Walsh
Fixing a Balanced Knockout Tournament. AAAI (2014)
Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh
Computational Aspects of Multi-Winner Approval Voting. CoRR (2014)
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
Backdoors into Heterogeneous Classes of SAT and CSP. AAAI (2014)
Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh
Computational Aspects of Multi-Winner Approval Voting. MPREF@AAAI (2014)
Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, Toby Walsh
Fixing a Balanced Knockout Tournament. MPREF@AAAI (2014)
Haris Aziz, Serge Gaspers, Nicholas Mattei, Nina Narodytska, Toby Walsh
Strategic aspects of the probabilistic serial rule for the allocation of goods. CoRR (2014)
Serge Gaspers, Gregory B. Sorkin
Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets. CoRR (2014)
Geoffrey Chu, Serge Gaspers, Nina Narodytska, Andreas Schutt, Toby Walsh
On the Complexity of Global Scheduling Constraints under Structural Restrictions. IJCAI (2013)
Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
Backdoors to q-Horn. STACS (2013)
Serge Gaspers, Matthias Mnich
Feedback Vertex Sets in Tournaments. J. Graph Theory 72 (1) (2013)
Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson
Augmenting Graphs to Minimize the Diameter. ISAAC (2013)
René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
Myhill-Nerode Methods for Hypergraphs. ISAAC (2013)
Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan
An exponential time 2-approximation algorithm for bandwidth. Theor. Comput. Sci. 511 (2013)

Serge Gaspers.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Serge Gaspers