By Professor Serge Gaspers

Conference Papers

Gaspers S; Szeider S, 2011, 'Kernels for global constraints', in Ijcai International Joint Conference on Artificial Intelligence, pp. 540 - 545, http://dx.doi.org/10.5591/978-1-57735-516-8/IJCAI11-098

Gaspers S; Szeider S, 2011, 'The parameterized complexity of local consistency', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 302 - 316, http://dx.doi.org/10.1007/978-3-642-23786-7_24

Fellows MR; Gaspers S; Rosamond FA, 2010, 'Parameterizing by the number of numbers', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 123 - 134, http://dx.doi.org/10.1007/978-3-642-17493-3_13

Gaspers S; Mnich M, 2010, 'Feedback vertex sets in tournaments', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 267 - 277, http://dx.doi.org/10.1007/978-3-642-15775-2_23

Fernau H; Gaspers S; Raible D, 2010, 'Exact and parameterized algorithms for max internal spanning tree', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 100 - 111, http://dx.doi.org/10.1007/978-3-642-11409-0_9

Fürer M; Gaspers S; Kasiviswanathan SP, 2009, 'An exponential time 2-approximation algorithm for bandwidth', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 173 - 184, http://dx.doi.org/10.1007/978-3-642-11269-0_14

Fomin FV; Gaspers S; Saurabh S; Thomassé S, 2009, 'A linear vertex kernel for Maximum Internal Spanning Tree', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 275 - 282, http://dx.doi.org/10.1007/978-3-642-10631-6_29

Bessy S; Fomin FV; Gaspers S; Paul C; Perez A; Saurabh S; Thomasse S, 2009, 'Kernels for feedback arc set in tournaments', in Leibniz International Proceedings in Informatics Lipics, pp. 37 - 47, http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2009.2305

Gaspers S; Sorkin GB, 2009, 'A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between', in Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, pp. 606 - 615, http://dx.doi.org/10.1137/1.9781611973068.67

Fernau H; Gaspers S; Kratsch D; Liedloff M; Raible D, 2009, 'Exact exponential-time algorithms for finding bicliques in a graph', in 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization Ctw 2009 Proceedings of the Conference, pp. 205 - 209

Gaspers S; Kratsch D; Liedloff M, 2008, 'On independent sets and bicliques in graphs', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 171 - 182, http://dx.doi.org/10.1007/978-3-540-92248-3_16

Fomin FV; Gaspers S; Kratsch D; Liedloff M; Saurabh S, 2008, 'Iterative compression and exact algorithms', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 335 - 346, http://dx.doi.org/10.1007/978-3-540-85238-4_27

Gaspers S; Saurabh S; Stepanov AA, 2008, 'A moderately exponential time algorithm for full degree spanning tree', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 479 - 489, http://dx.doi.org/10.1007/978-3-540-79228-4_42

Fomin FV; Gaspers S; Saurabh S, 2007, 'Improved exact algorithms for counting 3- and 4-colorings', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 65 - 74, http://dx.doi.org/10.1007/978-3-540-73545-8_9

Fomin FV; Gaspers S; Saurabh S, 2006, 'Branching and treewidth based exact algorithms', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 16 - 25, http://dx.doi.org/10.1007/11940128_4

Gaspers S; Liedloff M, 2006, 'A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 78 - 89, http://dx.doi.org/10.1007/11917496_8

Gaspers S; Kratsch D; Liedloff M, 2006, 'Exponential time algorithms for the minimum dominating set problem on some graph classes', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 148 - 159, http://dx.doi.org/10.1007/11785293_16

Fomin FV; Gaspers S; Pyatkin AV, 2006, 'Finding a minimum feedback vertex set in time O(1.7548n)', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 184 - 191, http://dx.doi.org/10.1007/11847250_17

Conference Proceedings (Editor of)

Fernau H; Gaspers S; Klasing R, (eds.), 2024, 'SOFSEM 2024: Theory and Practice of Computer Science - 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19-23, 2024, Proceedings', Springer, Vol. 14519

Gaspers S; Walsh T, (ed.), 2017, 'Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings', Springer, Vol. 10491

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