|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 4 keywords
|
|
|
|
|
Results
Found 51 publication records. Showing 51 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Serge Gaspers, Mathieu Liedloff |
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set.  |
Discrete Mathematics & Theoretical Computer Science  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff |
On Independent Sets and Bicliques in Graphs. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
Strong Backdoors to Nested Satisfiability |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
Strong Backdoors to Bounded Treewidth SAT |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers |
From edge-disjoint paths to independent paths |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Serge Gaspers, Frances A. Rosamond |
Parameterizing by the Number of Numbers. |
Theory Comput. Syst. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Gregory B. Sorkin |
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
The Parameterized Complexity of Local Consistency. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
Backdoors to Satisfaction |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
Backdoors to Acyclic SAT |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
Kernels for Global Constraints |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan |
Complexity of Splits Reconstruction for Low-Degree Trees. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
Kernels for Global Constraints. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
The Parameterized Complexity of Local Consistency. |
CP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh |
Parameterized algorithm for eternal vertex cover. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff |
Exact exponential-time algorithms for finding bicliques. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh |
Iterative compression and exact algorithms. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Serge Gaspers, Frances A. Rosamond |
Parameterizing by the Number of Numbers |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan |
Complexity of Splits Reconstruction for Low-Degree Trees |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Mathieu Liedloff |
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat |
Parallel cleaning of a network with brushes. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers |
Exponential Time Algorithms - Structures, Measures, and Bounds. |
|
2010 |
RDF |
|
| 1 | Serge Gaspers, Matthias Mnich |
Feedback Vertex Sets in Tournaments. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Serge Gaspers, Frances A. Rosamond |
Parameterizing by the Number of Numbers. |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat |
Clean the graph before you draw it! |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov |
On Two Techniques of Combining Branching and Treewidth. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Exact exponential time algorithms, #3-Coloring, #Minimum dominating set, Minimum maximal matching, k-Weighted vertex cover, NP hard problems, Treewidth, Parameterized algorithms |
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé |
A Linear Vertex Kernel for Maximum Internal Spanning Tree |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Gregory B. Sorkin |
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan |
An Exponential Time 2-Approximation Algorithm for Bandwidth |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Matthias Mnich |
On Feedback Vertex Sets in Tournaments |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Henning Fernau, Serge Gaspers, Daniel Raible |
Exact and Parameterized Algorithms for Max Internal Spanning Tree. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Gregory B. Sorkin |
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan |
An Exponential Time 2-Approximation Algorithm for Bandwidth. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible |
Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. |
CTW |
2009 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé |
A Linear Vertex Kernel for Maximum Internal Spanning Tree. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon |
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Maximum induced forest, Exact exponential algorithm, Number of minimal feedback vertex sets, Minimum feedback vertex set |
| 1 | Henning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov |
Exact Exponential Time Algorithms for Max Internal Spanning Tree |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff |
On Independent Sets and Bicliques in Graphs. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Saket Saurabh, Alexey A. Stepanov |
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh |
Iterative Compression and Exact Algorithms. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Saket Saurabh |
Improved Exact Algorithms for Counting 3- and 4-Colorings. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Mathieu Liedloff |
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin |
Finding a Minimum Feedback Vertex Set in Time O (1.7548n). |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
maximum induced forest, exact exponential algorithm, minimum feedback vertex set |
| 1 | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff |
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Saket Saurabh |
Branching and Treewidth Based Exact Algorithms. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #51 of 51 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")