By Professor Serge Gaspers

Preprints

Clinch K; Gaspers S; He Z; Saffidine A; Zhang T, 2024, A Piecewise Approach for the Analysis of Exact Algorithms, http://arxiv.org/abs/2402.10015v3

Gaspers S; Li JZ, 2023, Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems, http://arxiv.org/abs/2311.08042v1

Aziz H; Gaspers S; Sun Z; Walsh T, 2020, From Matching with Diversity Constraints to Matching with Regional Quotas, http://arxiv.org/abs/2002.06748v1

Gaspers S; Li R, 2019, Enumeration of Preferred Extensions in Almost Oriented Digraphs, http://arxiv.org/abs/1907.01006v1

Gaspers S; Huang S, 2018, $(2P_2,K_4)$-Free Graphs are 4-Colorable, http://arxiv.org/abs/1807.05547v2

Gaspers S; Huang S; Paulusma D, 2018, Colouring Square-Free Graphs without Long Induced Paths, http://arxiv.org/abs/1805.08270v1

Bonnet É; Gaspers S; Lambilliotte A; Rümmele S; Saffidine A, 2017, The Parameterized Complexity of Positional Games, http://arxiv.org/abs/1704.08536v1

Gaspers S; Papadimitriou C; Saether SH; Telle JA, 2016, On Satisfiability Problems with a Linear Structure, http://arxiv.org/abs/1602.07876v1

Fomin FV; Gaspers S; Lokshtanov D; Saurabh S, 2015, Exact Algorithms via Monotone Local Search, http://arxiv.org/abs/1512.01621v1

Back to profile page