×
Compute Distance To:
Author ID: gaspers.serge Recent zbMATH articles by "Gaspers, Serge"
Published as: Gaspers, Serge
External Links: MGP
all top 5

Co-Authors

0 single-authored
15 Fomin, Fedor V.
15 Saurabh, Saket
13 Liedloff, Mathieu
10 Szeider, Stefan
8 Kratsch, Dieter
6 Gudmundsson, Joachim
5 Aziz, Haris
5 Fellows, Michael Ralph
5 Fernau, Henning
5 Huang, Shenwei
5 Ordyniak, Sebastian
5 Rosamond, Frances A.
5 Rümmele, Stefan
4 MacKenzie, Simon
4 Mattei, Nicholas
4 Sorkin, Gregory B.
4 Thomassé, Stéphan
3 Biró, Peter
3 de Haan, Ronald
3 Messinger, Margaret-Ellen
3 Mestre, Julián
3 Rastegari, Baharak
3 Suchan, Karol
3 Walsh, Toby
2 Bessy, Stéphane
2 Binkele-Raible, Daniel
2 Casel, Katrin
2 Frati, Fabrizio
2 Fürer, Martin
2 Golovach, Petr A.
2 Gras, Benjamin
2 Jones, Mitchell
2 Kasiviswanathan, Shiva Prasad
2 Lee, Edward J.
2 Lokshtanov, Daniel
2 Mathieson, Luke
2 Mnich, Matthias
2 Nowakowski, Richard Joseph
2 Paul, Christophe
2 Paulusma, Daniël
2 Perez, Anthony
2 Prałat, Paweł
2 Pyatkin, Artem V.
2 Ramanujan, M. S.
2 Schmid, Markus L.
2 Stein, Maya Jakobine
2 Stepanov, Alexey A.
2 van Bevern, René
1 Abu-Khzam, Faisal N.
1 Bonnet, Edouard
1 Cochefert, Manfred
1 Couturier, Jean-Francois
1 Downey, Rodney Graham
1 Egan, Judith
1 Finbow, Stephen
1 Fleiner, Tamás
1 Horton, Michael
1 Koivisto, Mikko
1 Lambilliotte, Antonin
1 Misra, Neeldhara
1 Ottaway, Paul
1 Papadimitriou, Christos Harilaos
1 Raible, Daniel
1 Razgon, Igor
1 Sæther, Sigve Hortemo
1 Saffidine, Abdallah
1 Shaw, Alexis
1 Stursberg, Paul
1 Telle, Jan Arne
1 Todinca, Ioan
1 Van Leeuwen, Erik Jan
1 Vatshelle, Martin
1 Villanger, Yngve
1 Živný, Stanislav

Publications by Year

Citations contained in zbMATH Open

67 Publications have been cited 472 times in 355 Documents Cited by Year
On two techniques of combining branching and treewidth. Zbl 1185.68475
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Stepanov, Alexey A.
42
2009
On the minimum feedback vertex set problem: Exact and enumeration algorithms. Zbl 1170.68029
Fomin, Fedor V.; Gaspers, Serge; Pyatkin, Artem V.; Razgon, Igor
37
2008
Exact and parameterized algorithms for Max Internal Spanning Tree. Zbl 1259.05159
Binkele-Raible, Daniel; Fernau, Henning; Gaspers, Serge; Liedloff, Mathieu
21
2013
Kernels for feedback arc set in tournaments. Zbl 1235.05134
Bessy, Stéphane; Fomin, Fedor V.; Gaspers, Serge; Paul, Christophe; Perez, Anthony; Saurabh, Saket; Thomassé, Stéphan
20
2011
Exact algorithms via monotone local search. Zbl 1375.68185
Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket
18
2016
A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between. Zbl 1238.68066
Gaspers, Serge; Sorkin, Gregory B.
18
2012
A linear vertex kernel for maximum internal spanning tree. Zbl 1258.05117
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Thomassé, Stéphan
17
2013
Backdoors to satisfaction. Zbl 1358.68133
Gaspers, Serge; Szeider, Stefan
16
2012
On independent sets and bicliques in graphs. Zbl 1202.05096
Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu
14
2008
Augmenting graphs to minimize the diameter. Zbl 1319.68156
Frati, Fabrizio; Gaspers, Serge; Gudmundsson, Joachim; Mathieson, Luke
12
2015
Clean the graph before you draw it! Zbl 1209.68369
Gaspers, Serge; Messinger, Margaret-Ellen; Nowakowski, Richard J.; Prałat, Paweł
12
2009
Feedback vertex sets in tournaments. Zbl 1259.05070
Gaspers, Serge; Mnich, Matthias
11
2013
Parallel cleaning of a network with brushes. Zbl 1185.90024
Gaspers, Serge; Messinger, Margaret-Ellen; Nowakowski, Richard J.; Prałat, Paweł
10
2010
Fair assignment of indivisible objects under ordinal preferences. Zbl 1346.68106
Aziz, Haris; Gaspers, Serge; Mackenzie, Simon; Walsh, Toby
10
2015
Finding a minimum feedback vertex set in time \(\mathcal{O} (1.7548^n)\). Zbl 1154.05327
Fomin, Fedor V.; Gaspers, Serge; Pyatkin, Artem V.
10
2006
On independent sets and bicliques in graphs. Zbl 1239.05101
Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu
9
2012
An exponential time 2-approximation algorithm for bandwidth. Zbl 1273.68408
Fürer, Martin; Gaspers, Serge; Kasiviswanathan, Shiva Prasad
9
2009
Iterative compression and exact algorithms. Zbl 1186.68187
Fomin, Fedor V.; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket
9
2010
Parameterizing by the number of numbers. Zbl 1253.68173
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.
8
2012
Exponential time algorithms for the minimum dominating set problem on some graph classes. Zbl 1300.05300
Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Todinca, Ioan
7
2009
Backdoors into heterogeneous classes of SAT and CSP. Zbl 1356.68097
Gaspers, Serge; Misra, Neeldhara; Ordyniak, Sebastian; Szeider, Stefan; Živný, Stanislav
7
2017
Branching and treewidth based exact algorithms. Zbl 1135.68513
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket
7
2006
Exact and parameterized algorithms for Max Internal Spanning Tree. Zbl 1273.68167
Fernau, Henning; Gaspers, Serge; Raible, Daniel
7
2010
Stable matching with uncertain linear preferences. Zbl 1403.91254
Aziz, Haris; Biró, Péter; Gaspers, Serge; de Haan, Ronald; Mattei, Nicholas; Rastegari, Baharak
6
2016
Parameterized algorithm for eternal vertex cover. Zbl 1234.68150
Fomin, Fedor V.; Gaspers, Serge; Golovach, Petr A.; Kratsch, Dieter; Saurabh, Saket
6
2010
A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs. Zbl 1167.05331
Gaspers, Serge; Liedloff, Mathieu
6
2006
Exact exponential-time algorithms for finding bicliques. Zbl 1259.05160
Binkele-Raible, Daniel; Fernau, Henning; Gaspers, Serge; Liedloff, Mathieu
5
2010
Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets. Zbl 1436.68393
Gaspers, Serge; Sorkin, Gregory B.
5
2015
A branch-and-reduce algorithm for finding a minimum independent dominating set. Zbl 1283.05203
Gaspers, Serge; Liedloff, Mathieu
5
2012
A linear vertex kernel for Maximum Internal Spanning Tree. Zbl 1272.05197
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Thomassé, Stéphan
5
2009
Parameterizing by the number of numbers. Zbl 1309.68092
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.
5
2010
Turbocharging treewidth heuristics. Zbl 1398.68490
Gaspers, Serge; Gudmundsson, Joachim; Jones, Mitchell; Mestre, Julián; Rümmele, Stefan
5
2017
Exponential time algorithms for the minimum dominating set problem on some graph classes. Zbl 1141.68529
Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu
5
2006
A note on the eternal dominating set problem. Zbl 1416.91058
Finbow, Stephen; Gaspers, Serge; Messinger, Margaret-Ellen; Ottaway, Paul
5
2018
Backdoors to acyclic SAT. Zbl 1272.68373
Gaspers, Serge; Szeider, Stefan
4
2012
Kernels for feedback arc set in tournaments. Zbl 1248.68235
Bessy, Stéphane; Fomin, Fedor V.; Gaspers, Serge; Paul, Christophe; Perez, Anthony; Saurabh, Saket; Thomassé, Stéphan
4
2009
Feedback vertex sets in tournaments. Zbl 1287.05051
Gaspers, Serge; Mnich, Matthias
4
2010
A moderately exponential time algorithm for full degree spanning tree. Zbl 1139.68391
Gaspers, Serge; Saurabh, Saket; Stepanov, Alexey A.
4
2008
Fixing balanced knockout and double elimination tournaments. Zbl 1451.68129
Aziz, Haris; Gaspers, Serge; Mackenzie, Simon; Mattei, Nicholas; Stursberg, Paul; Walsh, Toby
4
2018
On satisfiability problems with a linear structure. Zbl 1398.68235
Gaspers, Serge; Papadimitriou, Christos H.; Sæther, Sigve Hortemo; Telle, Jan Arne
4
2017
On the number of minimal separators in graphs. Zbl 1386.05093
Gaspers, Serge; Mackenzie, Simon
4
2018
Improved exact algorithms for counting 3- and 4-colorings. Zbl 1206.05041
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket
4
2007
Augmenting graphs to minimize the diameter. Zbl 1406.68078
Frati, Fabrizio; Gaspers, Serge; Gudmundsson, Joachim; Mathieson, Luke
3
2013
Myhill-Nerode methods for hypergraphs. Zbl 1335.68098
van Bevern, René; Downey, Rodney G.; Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.
3
2015
On the number of minimal separators in graphs. Zbl 1417.05105
Gaspers, Serge; Mackenzie, Simon
3
2016
Guarantees and limits of preprocessing in constraint satisfaction and reasoning. Zbl 1405.68139
Gaspers, Serge; Szeider, Stefan
3
2014
Complexity of splits reconstruction for low-degree trees. Zbl 1341.05108
Gaspers, Serge; Liedloff, Mathieu; Stein, Maya; Suchan, Karol
3
2011
Iterative compression and exact algorithms. Zbl 1173.68537
Fomin, Fedor V.; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket
3
2008
On the complexity of grammar-based compression over fixed alphabets. Zbl 1388.68036
Casel, Katrin; Fernau, Henning; Gaspers, Serge; Gras, Benjamin; Schmid, Markus L.
3
2016
Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs. Zbl 1483.05062
Gaspers, Serge; Huang, Shenwei
3
2017
Exact algorithms via monotone local search. Zbl 1427.68119
Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket
2
2019
An exponential time 2-approximation algorithm for bandwidth. Zbl 1407.68545
Fürer, Martin; Gaspers, Serge; Kasiviswanathan, Shiva Prasad
2
2013
Myhill-Nerode methods for hypergraphs. Zbl 1329.68129
van Bevern, René; Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.
2
2013
Multivariate complexity theory. Zbl 1281.68123
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances
2
2011
Backdoors to q-Horn. Zbl 1336.68126
Gaspers, Serge; Ordyniak, Sebastian; Ramanujan, M. S.; Saurabh, Saket; Szeider, Stefan
2
2016
\(k\)-gap interval graphs. Zbl 1353.68124
Fomin, Fedor V.; Gaspers, Serge; Golovach, Petr; Suchan, Karol; Szeider, Stefan; van Leeuwen, Erik Jan; Vatshelle, Martin; Villanger, Yngve
2
2012
Strong backdoors to nested satisfiability. Zbl 1273.68169
Gaspers, Serge; Szeider, Stefan
2
2012
Colouring square-free graphs without long induced paths. Zbl 1429.68081
Gaspers, Serge; Huang, Shenwei; Paulusma, Daniël
2
2019
Faster graph coloring in polynomial space. Zbl 1435.68233
Gaspers, Serge; Lee, Edward J.
2
2017
Stable matching with uncertain linear preferences. Zbl 1435.91123
Aziz, Haris; Biró, Péter; Gaspers, Serge; de Haan, Ronald; Mattei, Nicholas; Rastegari, Baharak
2
2020
Linearly \(\chi \)-bounding \((P_6, C_4)\)-free graphs. Zbl 1429.05067
Gaspers, Serge; Huang, Shenwei
1
2019
Faster algorithms to enumerate hypergraph transversals. Zbl 1475.68474
Cochefert, Manfred; Couturier, Jean-François; Gaspers, Serge; Kratsch, Dieter
1
2016
Theory and applications of satisfiability testing – SAT 2017. 20th international conference, Melbourne, VIC, Australia, August 28 – September 1, 2017. Proceedings. Zbl 1368.68008
1
2017
On finding optimal polytrees. Zbl 1330.68223
Gaspers, Serge; Koivisto, Mikko; Liedloff, Mathieu; Ordyniak, Sebastian; Szeider, Stefan
1
2015
Backdoors to q-Horn. Zbl 1354.68123
Gaspers, Serge; Ordyniak, Sebastian; Ramanujan, M. S.; Saurabh, Saket; Szeider, Stefan
1
2013
\((2P_2,K_4)\)-free graphs are 4-colorable. Zbl 1432.05041
Gaspers, Serge; Huang, Shenwei
1
2019
Cluster editing with vertex splitting. Zbl 1403.90556
Abu-Khzam, Faisal N.; Egan, Judith; Gaspers, Serge; Shaw, Alexis; Shaw, Peter
1
2018
Stable matching with uncertain linear preferences. Zbl 1435.91123
Aziz, Haris; Biró, Péter; Gaspers, Serge; de Haan, Ronald; Mattei, Nicholas; Rastegari, Baharak
2
2020
Exact algorithms via monotone local search. Zbl 1427.68119
Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket
2
2019
Colouring square-free graphs without long induced paths. Zbl 1429.68081
Gaspers, Serge; Huang, Shenwei; Paulusma, Daniël
2
2019
Linearly \(\chi \)-bounding \((P_6, C_4)\)-free graphs. Zbl 1429.05067
Gaspers, Serge; Huang, Shenwei
1
2019
\((2P_2,K_4)\)-free graphs are 4-colorable. Zbl 1432.05041
Gaspers, Serge; Huang, Shenwei
1
2019
A note on the eternal dominating set problem. Zbl 1416.91058
Finbow, Stephen; Gaspers, Serge; Messinger, Margaret-Ellen; Ottaway, Paul
5
2018
Fixing balanced knockout and double elimination tournaments. Zbl 1451.68129
Aziz, Haris; Gaspers, Serge; Mackenzie, Simon; Mattei, Nicholas; Stursberg, Paul; Walsh, Toby
4
2018
On the number of minimal separators in graphs. Zbl 1386.05093
Gaspers, Serge; Mackenzie, Simon
4
2018
Cluster editing with vertex splitting. Zbl 1403.90556
Abu-Khzam, Faisal N.; Egan, Judith; Gaspers, Serge; Shaw, Alexis; Shaw, Peter
1
2018
Backdoors into heterogeneous classes of SAT and CSP. Zbl 1356.68097
Gaspers, Serge; Misra, Neeldhara; Ordyniak, Sebastian; Szeider, Stefan; Živný, Stanislav
7
2017
Turbocharging treewidth heuristics. Zbl 1398.68490
Gaspers, Serge; Gudmundsson, Joachim; Jones, Mitchell; Mestre, Julián; Rümmele, Stefan
5
2017
On satisfiability problems with a linear structure. Zbl 1398.68235
Gaspers, Serge; Papadimitriou, Christos H.; Sæther, Sigve Hortemo; Telle, Jan Arne
4
2017
Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs. Zbl 1483.05062
Gaspers, Serge; Huang, Shenwei
3
2017
Faster graph coloring in polynomial space. Zbl 1435.68233
Gaspers, Serge; Lee, Edward J.
2
2017
Theory and applications of satisfiability testing – SAT 2017. 20th international conference, Melbourne, VIC, Australia, August 28 – September 1, 2017. Proceedings. Zbl 1368.68008
1
2017
Exact algorithms via monotone local search. Zbl 1375.68185
Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket
18
2016
Stable matching with uncertain linear preferences. Zbl 1403.91254
Aziz, Haris; Biró, Péter; Gaspers, Serge; de Haan, Ronald; Mattei, Nicholas; Rastegari, Baharak
6
2016
On the number of minimal separators in graphs. Zbl 1417.05105
Gaspers, Serge; Mackenzie, Simon
3
2016
On the complexity of grammar-based compression over fixed alphabets. Zbl 1388.68036
Casel, Katrin; Fernau, Henning; Gaspers, Serge; Gras, Benjamin; Schmid, Markus L.
3
2016
Backdoors to q-Horn. Zbl 1336.68126
Gaspers, Serge; Ordyniak, Sebastian; Ramanujan, M. S.; Saurabh, Saket; Szeider, Stefan
2
2016
Faster algorithms to enumerate hypergraph transversals. Zbl 1475.68474
Cochefert, Manfred; Couturier, Jean-François; Gaspers, Serge; Kratsch, Dieter
1
2016
Augmenting graphs to minimize the diameter. Zbl 1319.68156
Frati, Fabrizio; Gaspers, Serge; Gudmundsson, Joachim; Mathieson, Luke
12
2015
Fair assignment of indivisible objects under ordinal preferences. Zbl 1346.68106
Aziz, Haris; Gaspers, Serge; Mackenzie, Simon; Walsh, Toby
10
2015
Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets. Zbl 1436.68393
Gaspers, Serge; Sorkin, Gregory B.
5
2015
Myhill-Nerode methods for hypergraphs. Zbl 1335.68098
van Bevern, René; Downey, Rodney G.; Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.
3
2015
On finding optimal polytrees. Zbl 1330.68223
Gaspers, Serge; Koivisto, Mikko; Liedloff, Mathieu; Ordyniak, Sebastian; Szeider, Stefan
1
2015
Guarantees and limits of preprocessing in constraint satisfaction and reasoning. Zbl 1405.68139
Gaspers, Serge; Szeider, Stefan
3
2014
Exact and parameterized algorithms for Max Internal Spanning Tree. Zbl 1259.05159
Binkele-Raible, Daniel; Fernau, Henning; Gaspers, Serge; Liedloff, Mathieu
21
2013
A linear vertex kernel for maximum internal spanning tree. Zbl 1258.05117
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Thomassé, Stéphan
17
2013
Feedback vertex sets in tournaments. Zbl 1259.05070
Gaspers, Serge; Mnich, Matthias
11
2013
Augmenting graphs to minimize the diameter. Zbl 1406.68078
Frati, Fabrizio; Gaspers, Serge; Gudmundsson, Joachim; Mathieson, Luke
3
2013
An exponential time 2-approximation algorithm for bandwidth. Zbl 1407.68545
Fürer, Martin; Gaspers, Serge; Kasiviswanathan, Shiva Prasad
2
2013
Myhill-Nerode methods for hypergraphs. Zbl 1329.68129
van Bevern, René; Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.
2
2013
Backdoors to q-Horn. Zbl 1354.68123
Gaspers, Serge; Ordyniak, Sebastian; Ramanujan, M. S.; Saurabh, Saket; Szeider, Stefan
1
2013
A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between. Zbl 1238.68066
Gaspers, Serge; Sorkin, Gregory B.
18
2012
Backdoors to satisfaction. Zbl 1358.68133
Gaspers, Serge; Szeider, Stefan
16
2012
On independent sets and bicliques in graphs. Zbl 1239.05101
Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu
9
2012
Parameterizing by the number of numbers. Zbl 1253.68173
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.
8
2012
A branch-and-reduce algorithm for finding a minimum independent dominating set. Zbl 1283.05203
Gaspers, Serge; Liedloff, Mathieu
5
2012
Backdoors to acyclic SAT. Zbl 1272.68373
Gaspers, Serge; Szeider, Stefan
4
2012
\(k\)-gap interval graphs. Zbl 1353.68124
Fomin, Fedor V.; Gaspers, Serge; Golovach, Petr; Suchan, Karol; Szeider, Stefan; van Leeuwen, Erik Jan; Vatshelle, Martin; Villanger, Yngve
2
2012
Strong backdoors to nested satisfiability. Zbl 1273.68169
Gaspers, Serge; Szeider, Stefan
2
2012
Kernels for feedback arc set in tournaments. Zbl 1235.05134
Bessy, Stéphane; Fomin, Fedor V.; Gaspers, Serge; Paul, Christophe; Perez, Anthony; Saurabh, Saket; Thomassé, Stéphan
20
2011
Complexity of splits reconstruction for low-degree trees. Zbl 1341.05108
Gaspers, Serge; Liedloff, Mathieu; Stein, Maya; Suchan, Karol
3
2011
Multivariate complexity theory. Zbl 1281.68123
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances
2
2011
Parallel cleaning of a network with brushes. Zbl 1185.90024
Gaspers, Serge; Messinger, Margaret-Ellen; Nowakowski, Richard J.; Prałat, Paweł
10
2010
Iterative compression and exact algorithms. Zbl 1186.68187
Fomin, Fedor V.; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket
9
2010
Exact and parameterized algorithms for Max Internal Spanning Tree. Zbl 1273.68167
Fernau, Henning; Gaspers, Serge; Raible, Daniel
7
2010
Parameterized algorithm for eternal vertex cover. Zbl 1234.68150
Fomin, Fedor V.; Gaspers, Serge; Golovach, Petr A.; Kratsch, Dieter; Saurabh, Saket
6
2010
Exact exponential-time algorithms for finding bicliques. Zbl 1259.05160
Binkele-Raible, Daniel; Fernau, Henning; Gaspers, Serge; Liedloff, Mathieu
5
2010
Parameterizing by the number of numbers. Zbl 1309.68092
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.
5
2010
Feedback vertex sets in tournaments. Zbl 1287.05051
Gaspers, Serge; Mnich, Matthias
4
2010
On two techniques of combining branching and treewidth. Zbl 1185.68475
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Stepanov, Alexey A.
42
2009
Clean the graph before you draw it! Zbl 1209.68369
Gaspers, Serge; Messinger, Margaret-Ellen; Nowakowski, Richard J.; Prałat, Paweł
12
2009
An exponential time 2-approximation algorithm for bandwidth. Zbl 1273.68408
Fürer, Martin; Gaspers, Serge; Kasiviswanathan, Shiva Prasad
9
2009
Exponential time algorithms for the minimum dominating set problem on some graph classes. Zbl 1300.05300
Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Todinca, Ioan
7
2009
A linear vertex kernel for Maximum Internal Spanning Tree. Zbl 1272.05197
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Thomassé, Stéphan
5
2009
Kernels for feedback arc set in tournaments. Zbl 1248.68235
Bessy, Stéphane; Fomin, Fedor V.; Gaspers, Serge; Paul, Christophe; Perez, Anthony; Saurabh, Saket; Thomassé, Stéphan
4
2009
On the minimum feedback vertex set problem: Exact and enumeration algorithms. Zbl 1170.68029
Fomin, Fedor V.; Gaspers, Serge; Pyatkin, Artem V.; Razgon, Igor
37
2008
On independent sets and bicliques in graphs. Zbl 1202.05096
Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu
14
2008
A moderately exponential time algorithm for full degree spanning tree. Zbl 1139.68391
Gaspers, Serge; Saurabh, Saket; Stepanov, Alexey A.
4
2008
Iterative compression and exact algorithms. Zbl 1173.68537
Fomin, Fedor V.; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket
3
2008
Improved exact algorithms for counting 3- and 4-colorings. Zbl 1206.05041
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket
4
2007
Finding a minimum feedback vertex set in time \(\mathcal{O} (1.7548^n)\). Zbl 1154.05327
Fomin, Fedor V.; Gaspers, Serge; Pyatkin, Artem V.
10
2006
Branching and treewidth based exact algorithms. Zbl 1135.68513
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket
7
2006
A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs. Zbl 1167.05331
Gaspers, Serge; Liedloff, Mathieu
6
2006
Exponential time algorithms for the minimum dominating set problem on some graph classes. Zbl 1141.68529
Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu
5
2006
all top 5

Cited by 544 Authors

29 Gaspers, Serge
25 Saurabh, Saket
19 Kratsch, Dieter
14 Zehavi, Meirav
13 Fomin, Fedor V.
13 Liedloff, Mathieu
11 Fernau, Henning
11 Paschos, Vangelis Th.
9 Bodlaender, Hans L.
9 Golovach, Petr A.
9 Heggernes, Pinar
9 Prałat, Paweł
9 Szeider, Stefan
9 Xiao, Mingyu
8 Chen, Jian-er
8 Escoffier, Bruno
8 Niedermeier, Rolf
8 Ordyniak, Sebastian
8 Raman, Venkatesh
7 Lokshtanov, Daniel
7 Mnich, Matthias
6 Binkele-Raible, Daniel
6 Cao, Yixin
6 Couturier, Jean-Francois
6 Gudmundsson, Joachim
6 van Rooij, Johan M. M.
6 Villanger, Yngve
5 Aziz, Haris
5 de Haan, Ronald
5 Ganian, Robert
5 Koivisto, Mikko
5 Komusiewicz, Christian
5 Krithika, R.
5 Misra, Neeldhara
5 Nagamochi, Hiroshi
5 Nowakowski, Richard Joseph
5 Paul, Christophe
5 Ramanujan, M. S.
5 Rastegari, Baharak
5 van Bevern, René
4 Bang-Jensen, Jørgen
4 Biró, Peter
4 Björklund, Andreas
4 Cygan, Marek
4 Hanaka, Tesshu
4 Kratsch, Stefan
4 Liu, Tian
4 Mattei, Nicholas
4 Messinger, Margaret-Ellen
4 Nederlof, Jesper
4 Papadopoulos, Charis
4 Tale, Prafullkumar
4 Wang, Jianxin
4 Wang, Lusheng
4 Xu, Ke
3 Bonnet, Edouard
3 Bourgeois, Nicolas
3 Butenko, Sergiy I.
3 Casel, Katrin
3 Chen, Zhizhong
3 Della Croce, Federico
3 Dereniowski, Dariusz
3 Downey, Rodney Graham
3 Fellows, Michael Ralph
3 Fichte, Johannes Klaus
3 Fujito, Toshihiro
3 Grandoni, Fabrizio
3 Guo, Jiong
3 Havet, Frédéric
3 Hüffner, Falk
3 Kaski, Petteri
3 Kawarabayashi, Ken-ichi
3 Kim, Eun Jung
3 Kobayashi, Yusuke
3 Kowalik, Łukasz
3 Li, Xingfu
3 Meier, Arne
3 Misra, Pranabendu
3 Ono, Hirotaka
3 Otachi, Yota
3 Panolan, Fahad
3 Perez, Anthony
3 Pilipczuk, Marcin L.
3 Pilipczuk, Michał
3 Rai, Ashutosh
3 Rosamond, Frances A.
3 Sayadi, Mohamed Yosri
3 Shachnai, Hadas
3 Telle, Jan Arne
3 Thilikos, Dimitrios M.
3 Tourniaire, Emeric
3 Van Leeuwen, Erik Jan
3 Weller, Mathias
2 Agrawal, Akanksha
2 Aldi, Marco
2 Aronshtam, Lior
2 Bae, Sang Won
2 Bazgan, Cristina
2 Bessy, Stéphane
2 Bliznets, Ivan A.
...and 444 more Authors
all top 5

Cited in 55 Serials

55 Algorithmica
47 Theoretical Computer Science
23 Discrete Applied Mathematics
20 Journal of Computer and System Sciences
16 Theory of Computing Systems
14 Information Processing Letters
10 Artificial Intelligence
10 Journal of Combinatorial Optimization
6 Information and Computation
6 SIAM Journal on Discrete Mathematics
5 Discrete Mathematics
4 Graphs and Combinatorics
4 Computational Geometry
4 Journal of Discrete Algorithms
4 Discrete Optimization
3 Journal of Graph Theory
3 European Journal of Combinatorics
3 Annals of Mathematics and Artificial Intelligence
3 Optimization Letters
2 Journal of Economic Theory
2 SIAM Journal on Computing
2 Operations Research Letters
2 Social Choice and Welfare
2 Mathematical Programming. Series A. Series B
2 Constraints
2 RAIRO. Operations Research
2 Discrete Mathematics, Algorithms and Applications
2 Algorithms
1 Acta Informatica
1 Communications in Mathematical Physics
1 Applied Mathematics and Computation
1 Journal of Combinatorial Theory. Series B
1 Mathematics of Operations Research
1 Networks
1 Mathematical Social Sciences
1 Optimization
1 Journal of Automated Reasoning
1 Applied Mathematics Letters
1 International Journal of Computational Geometry & Applications
1 International Journal of Foundations of Computer Science
1 Journal of Global Optimization
1 European Journal of Operational Research
1 International Journal of Computer Mathematics
1 The Electronic Journal of Combinatorics
1 Mathematical Problems in Engineering
1 Journal of Scheduling
1 Annals of Combinatorics
1 Discrete Dynamics in Nature and Society
1 Journal of Mathematical Logic
1 Trudy Instituta Matematiki
1 ACM Transactions on Computational Logic
1 Journal of Satisfiability, Boolean Modeling and Computation
1 Acta Universitatis Sapientiae. Informatica
1 Computer Science Review
1 Journal of Logical and Algebraic Methods in Programming

Citations by Year