By Professor Serge Gaspers

Preprints

Clinch K; Gaspers S; Mackenzie S; Wang Q, 2026, Faster Exponential-Time Approximate Counting via Bounded Self-Reductions, http://dx.doi.org/10.48550/arxiv.2607.06393

Gaspers S; He TZ; Mackenzie S, 2026, NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing, http://dx.doi.org/10.48550/arxiv.2508.05597

Clinch K; Gaspers S; He TZ; Mackenzie S; Zhang T, 2025, A Faster Randomized Algorithm for Vertex Cover: An Automated Approach, http://dx.doi.org/10.48550/arxiv.2510.09027

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

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

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

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

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

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

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

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

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

Gaspers S; Mackenzie S, 2015, On the Number of Minimal Separators in Graphs, https://arxiv.org/abs/1503.01203v2

Back to profile page