By Professor Serge Gaspers

Conference Papers

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

Back to profile page