Serge Gaspers

	2009
19		Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible: Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW 2009: 205-209
18		Serge Gaspers, Gregory B. Sorkin: A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. SODA 2009: 606-615
17		Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov: On Two Techniques of Combining Branching and Treewidth. Algorithmica 54(2): 181-207 (2009)
16		Serge Gaspers, Matthias Mnich: On Feedback Vertex Sets in Tournaments CoRR abs/0905.0567: (2009)
15		Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan: An Exponential Time 2-Approximation Algorithm for Bandwidth CoRR abs/0906.1953: (2009)
14		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)
13		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)
12		Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A Linear Vertex Kernel for Maximum Internal Spanning Tree CoRR abs/0907.3208: (2009)
11		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)
	2008
10		Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh: Iterative Compression and Exact Algorithms. MFCS 2008: 335-346
9		Serge Gaspers, Saket Saurabh, Alexey A. Stepanov: A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. TAMC 2008: 479-489
8		Serge Gaspers, Dieter Kratsch, Mathieu Liedloff: On Independent Sets and Bicliques in Graphs. WG 2008: 171-182
7		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)
6		Henning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov: Exact Exponential Time Algorithms for Max Internal Spanning Tree CoRR abs/0811.1875: (2008)
	2007
5		Fedor V. Fomin, Serge Gaspers, Saket Saurabh: Improved Exact Algorithms for Counting 3- and 4-Colorings. COCOON 2007: 65-74
	2006
4		Fedor V. Fomin, Serge Gaspers, Saket Saurabh: Branching and Treewidth Based Exact Algorithms. ISAAC 2006: 16-25
3		Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin: Finding a Minimum Feedback Vertex Set in Time O (1.7548n). IWPEC 2006: 184-191
2		Serge Gaspers, Dieter Kratsch, Mathieu Liedloff: Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. SWAT 2006: 148-159
1		Serge Gaspers, Mathieu Liedloff: A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. WG 2006: 78-89

Coauthor Index

1	Stéphane Bessy	[13]
2	Henning Fernau	[6] [19]
3	Fedor V. Fomin	[3] [4] [5] [7] [10] [12] [13] [17]
4	Martin Fürer	[15]
5	Shiva Prasad Kasiviswanathan	[15]
6	Dieter Kratsch	[2] [8] [10] [19]
7	Mathieu Liedloff	[1] [2] [8] [10] [19]
8	Margaret-Ellen Messinger	[11]
9	Matthias Mnich	[16]
10	Richard J. Nowakowski	[11]
11	Christophe Paul	[13]
12	Anthony Perez	[13]
13	Pawel Pralat	[11]
14	Artem V. Pyatkin	[3] [7]
15	Daniel Raible	[6] [19]
16	Igor Razgon	[7]
17	Saket Saurabh	[4] [5] [9] [10] [12] [13] [17]
18	Gregory B. Sorkin	[14] [18]
19	Alexey A. Stepanov	[6] [9] [17]
20	Stéphan Thomassé	[12] [13]

Colors in the list of coauthors