Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Serge Gaspers
2010 – today
- 2013
[j16]Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff: Exact and Parameterized Algorithms for Max Internal Spanning Tree. Algorithmica 65(1): 95-128 (2013)- [j15]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A linear vertex kernel for maximum internal spanning tree. J. Comput. Syst. Sci. 79(1): 1-6 (2013)
- [j14]Serge Gaspers, Matthias Mnich: Feedback Vertex Sets in Tournaments. Journal of Graph Theory 72(1): 72-89 (2013)
- [c26]Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider: Backdoors to q-Horn. STACS 2013: 67-79
- [i22]Serge Gaspers, Victor Naroditskiy, Nina Narodytska, Toby Walsh: Possible and Necessary Winner Problem in Social Polls. CoRR abs/1302.1669 (2013)
- [i21]Serge Gaspers, Thomas Kalinowski, Nina Narodytska, Toby Walsh: Coalitional Manipulation for Schulze's Rule. CoRR abs/1304.0844 (2013)
- 2012
- [j13]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff: On Independent Sets and Bicliques in Graphs. Algorithmica 62(3-4): 637-658 (2012)
- [j12]Serge Gaspers, Mathieu Liedloff: A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discrete Mathematics & Theoretical Computer Science 14(1): 29-42 (2012)
- [j11]Serge Gaspers, Gregory B. Sorkin: A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. J. Comput. Syst. Sci. 78(1): 305-335 (2012)
- [j10]Michael R. Fellows, Serge Gaspers, Frances A. Rosamond: Parameterizing by the Number of Numbers. Theory Comput. Syst. 50(4): 675-693 (2012)
- [c25]Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider: On Finding Optimal Polytrees. AAAI 2012
- [c24]Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider: Don't Be Strict in Local Search! AAAI 2012
- [c23]Serge Gaspers, Stefan Szeider: Backdoors to Satisfaction. The Multivariate Algorithmic Revolution and Beyond 2012: 287-317
- [c22]
- [c21]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger: k-Gap Interval Graphs. LATIN 2012: 350-361
- [c20]
- [i20]
- [i19]
- [i18]
- [i17]Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider: Don't Be Strict in Local Search! CoRR abs/1208.1688 (2012)
- [i16]Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider: On Finding Optimal Polytrees. CoRR abs/1208.1692 (2012)
- [i15]René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond: How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding. CoRR abs/1211.1299 (2012)
- 2011
- [j9]Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé: Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. 77(6): 1071-1078 (2011)
- [c19]
- [c18]
- [c17]Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan: Complexity of Splits Reconstruction for Low-Degree Trees. WG 2011: 167-178
- [i14]
- [i13]
- [i12]
- [i11]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger: k-Gap Interval Graphs. CoRR abs/1112.3244 (2011)
- [i10]Serge Gaspers, Stefan Szeider: The Parameterized Complexity of Local Consistency. Electronic Colloquium on Computational Complexity (ECCC) 18: 71 (2011)
- 2010
- [b1]Serge Gaspers: Exponential Time Algorithms - Structures, Measures, and Bounds. VDM 2010, ISBN 978-3-639-21825-1, pp. 1-206
- [j8]Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat: Parallel cleaning of a network with brushes. Discrete Applied Mathematics 158(5): 467-478 (2010)
- [j7]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh: Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. 110(16): 702-706 (2010)
- [j6]Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff: Exact exponential-time algorithms for finding bicliques. Inf. Process. Lett. 111(2): 64-67 (2010)
- [j5]Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh: Iterative compression and exact algorithms. Theor. Comput. Sci. 411(7-9): 1045-1053 (2010)
- [c16]
- [c15]Michael R. Fellows, Serge Gaspers, Frances A. Rosamond: Parameterizing by the Number of Numbers. IPEC 2010: 123-134
- [i9]Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan: Complexity of Splits Reconstruction for Low-Degree Trees. CoRR abs/1007.1733 (2010)
- [i8]Michael R. Fellows, Serge Gaspers, Frances A. Rosamond: Parameterizing by the Number of Numbers. CoRR abs/1007.2021 (2010)
- [i7]Serge Gaspers, Mathieu Liedloff: A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. CoRR abs/1009.1381 (2010)
2000 – 2009
- 2009
- [j4]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov: On Two Techniques of Combining Branching and Treewidth. Algorithmica 54(2): 181-207 (2009)
- [j3]Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat: Clean the graph before you draw it! Inf. Process. Lett. 109(10): 463-467 (2009)
- [j2]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca: Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Transactions on Algorithms 6(1) (2009)
- [c14]Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible: Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW 2009: 205-209
- [c13]Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé: Kernels for Feedback Arc Set In Tournaments. FSTTCS 2009: 37-47
- [c12]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A Linear Vertex Kernel for Maximum Internal Spanning Tree. ISAAC 2009: 275-282
- [c11]Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan: An Exponential Time 2-Approximation Algorithm for Bandwidth. IWPEC 2009: 173-184
- [c10]Serge Gaspers, Gregory B. Sorkin: A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. SODA 2009: 606-615
- [c9]Henning Fernau, Serge Gaspers, Daniel Raible: Exact and Parameterized Algorithms for Max Internal Spanning Tree. WG 2009: 100-111
- [i6]
- [i5]Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan: An Exponential Time 2-Approximation Algorithm for Bandwidth. CoRR abs/0906.1953 (2009)
- [i4]Serge Gaspers, Gregory B. Sorkin: A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. CoRR abs/0906.3527 (2009)
- [i3]Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé: Kernels for Feedback Arc Set In Tournaments. CoRR abs/0907.2165 (2009)
- [i2]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A Linear Vertex Kernel for Maximum Internal Spanning Tree. CoRR abs/0907.3208 (2009)
- 2008
- [j1]Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon: On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica 52(2): 293-307 (2008)
- [c8]Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh: Iterative Compression and Exact Algorithms. MFCS 2008: 335-346
- [c7]Serge Gaspers, Saket Saurabh, Alexey A. Stepanov: A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. TAMC 2008: 479-489
- [c6]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff: On Independent Sets and Bicliques in Graphs. WG 2008: 171-182
- [i1]Henning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov: Exact Exponential Time Algorithms for Max Internal Spanning Tree. CoRR abs/0811.1875 (2008)
- 2007
- [c5]Fedor V. Fomin, Serge Gaspers, Saket Saurabh: Improved Exact Algorithms for Counting 3- and 4-Colorings. COCOON 2007: 65-74
- 2006
- [c4]Fedor V. Fomin, Serge Gaspers, Saket Saurabh: Branching and Treewidth Based Exact Algorithms. ISAAC 2006: 16-25
- [c3]Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin: Finding a Minimum Feedback Vertex Set in Time O (1.7548n). IWPEC 2006: 184-191
- [c2]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff: Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. SWAT 2006: 148-159
- [c1]Serge Gaspers, Mathieu Liedloff: A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. WG 2006: 78-89
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-03 21:43 CEST by the dblp team