Serge Gaspers

	2012
51		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
50		Serge Gaspers, Dieter Kratsch, Mathieu Liedloff: On Independent Sets and Bicliques in Graphs. Algorithmica 62(3-4): 637-658 (2012)
49		Serge Gaspers, Stefan Szeider: Strong Backdoors to Nested Satisfiability CoRR abs/1202.4331: (2012)
48		Serge Gaspers: From edge-disjoint paths to independent paths CoRR abs/1203.4483: (2012)
47		Serge Gaspers, Stefan Szeider: Strong Backdoors to Bounded Treewidth SAT CoRR abs/1204.6233: (2012)
46		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)
45		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)
44		Michael R. Fellows, Serge Gaspers, Frances A. Rosamond: Parameterizing by the Number of Numbers. Theory Comput. Syst. 50(4): 675-693 (2012)
	2011
43		Serge Gaspers, Stefan Szeider: The Parameterized Complexity of Local Consistency. CP 2011: 302-316
42		Serge Gaspers, Stefan Szeider: Kernels for Global Constraints. IJCAI 2011: 540-545
41		Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan: Complexity of Splits Reconstruction for Low-Degree Trees. WG 2011: 167-178
40		Serge Gaspers, Stefan Szeider: Kernels for Global Constraints CoRR abs/1104.2541: (2011)
39		Serge Gaspers, Stefan Szeider: Backdoors to Acyclic SAT CoRR abs/1110.6384: (2011)
38		Serge Gaspers, Stefan Szeider: Backdoors to Satisfaction CoRR abs/1110.6387: (2011)
37		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)
36		Serge Gaspers, Stefan Szeider: The Parameterized Complexity of Local Consistency. Electronic Colloquium on Computational Complexity (ECCC) 18: 71 (2011)
35		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)
	2010
34		Serge Gaspers: Exponential Time Algorithms - Structures, Measures, and Bounds. VDM 2010: 1-206
33		Serge Gaspers, Matthias Mnich: Feedback Vertex Sets in Tournaments. ESA (1) 2010: 267-277
32		Michael R. Fellows, Serge Gaspers, Frances A. Rosamond: Parameterizing by the Number of Numbers. IPEC 2010: 123-134
31		Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan: Complexity of Splits Reconstruction for Low-Degree Trees CoRR abs/1007.1733: (2010)
30		Michael R. Fellows, Serge Gaspers, Frances A. Rosamond: Parameterizing by the Number of Numbers CoRR abs/1007.2021: (2010)
29		Serge Gaspers, Mathieu Liedloff: A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set CoRR abs/1009.1381: (2010)
28		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)
27		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)
26		Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff: Exact exponential-time algorithms for finding bicliques. Inf. Process. Lett. 111(2): 64-67 (2010)
25		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)
	2009
24		Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible: Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW 2009: 205-209
23		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
22		Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A Linear Vertex Kernel for Maximum Internal Spanning Tree. ISAAC 2009: 275-282
21		Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan: An Exponential Time 2-Approximation Algorithm for Bandwidth. IWPEC 2009: 173-184
20		Serge Gaspers, Gregory B. Sorkin: A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. SODA 2009: 606-615
19		Henning Fernau, Serge Gaspers, Daniel Raible: Exact and Parameterized Algorithms for Max Internal Spanning Tree. WG 2009: 100-111
18		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)
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] [23] [35]
2	Daniel Binkele-Raible (Daniel Raible)	[6] [19] [24] [26]
3	Michael R. Fellows (Mike Fellows)	[30] [32] [44]
4	Henning Fernau	[6] [19] [24] [26]
5	Fedor V. Fomin	[3] [4] [5] [7] [10] [12] [13] [17] [22] [23] [25] [27] [35] [37] [51]
6	Martin Fürer	[15] [21]
7	Petr A. Golovach	[27] [37] [51]
8	Shiva Prasad Kasiviswanathan	[15] [21]
9	Dieter Kratsch	[2] [8] [10] [18] [24] [25] [27] [50]
10	Erik Jan van Leeuwen	[37] [51]
11	Mathieu Liedloff	[1] [2] [8] [10] [18] [24] [25] [26] [29] [31] [41] [46] [50]
12	Margaret-Ellen Messinger	[11] [28]
13	Matthias Mnich	[16] [33]
14	Richard J. Nowakowski	[11] [28]
15	Christophe Paul	[13] [23] [35]
16	Anthony Perez	[13] [23] [35]
17	Pawel Pralat	[11] [28]
18	Artem V. Pyatkin	[3] [7]
19	Igor Razgon	[7]
20	Frances A. Rosamond	[30] [32] [44]
21	Saket Saurabh	[4] [5] [9] [10] [12] [13] [17] [22] [23] [25] [27] [35]
22	Gregory B. Sorkin	[14] [20] [45]
23	Maya Jakobine Stein (Maya Stein)	[31] [41]
24	Alexey A. Stepanov	[6] [9] [17]
25	Karol Suchan	[31] [37] [41] [51]
26	Stefan Szeider	[36] [37] [38] [39] [40] [42] [43] [47] [49] [51]
27	Stéphan Thomassé	[12] [13] [22] [23] [35]
28	Ioan Todinca	[18]
29	Martin Vatshelle	[37] [51]
30	Yngve Villanger	[37] [51]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page