Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Gaspers, Serge"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Exact and parameterized algorithms for
Max Internal Spanning Tree
Daniel Binkele-Raible
,
Henning Fernau
,
Serge Gaspers
,
Mathieu Liedloff
Algorithmica
65
(1), 2013, pp. 95-128
A linear vertex kernel for maximum internal spanning tree
Fedor V. Fomin
,
Serge Gaspers
,
Saket Saurabh
,
Stéphan Thomassé
Journal of Computer and System Sciences
79
(1), 2013, pp. 1-6
Augmenting graphs to minimize the diameter
Fabrizio Frati
,
Serge Gaspers
,
Joachim Gudmundsson
,
Luke Mathieson
Lecture Notes in Computer Science
8283
, 2013, pp. 383-393
An exponential time 2-approximation algorithm for bandwidth
Martin Fürer
,
Serge Gaspers
,
Shiva Prasad Kasiviswanathan
Theoretical Computer Science
511
, 2013, pp. 23-31
Feedback vertex sets in tournaments
Serge Gaspers
,
Matthias Mnich
Journal of Graph Theory
72
(1), 2013, pp. 72-89
Backdoors to
q
-Horn
Serge Gaspers
,
Sebastian Ordyniak
,
M.S. Ramanujan
,
Saket Saurabh
,
Stefan Szeider
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 67-79
Myhill-Nerode methods for hypergraphs
René van Bevern
,
Michael R. Fellows
,
Serge Gaspers
,
Frances A. Rosamond
Lecture Notes in Computer Science
8283
, 2013, pp. 372-382
Parameterizing by the number of numbers
Michael R. Fellows
,
Serge Gaspers
,
Frances A. Rosamond
Theory of Computing Systems
50
(4), 2012, pp. 675-693
On independent sets and bicliques in graphs
Serge Gaspers
,
Dieter Kratsch
,
Mathieu Liedloff
Algorithmica
62
(3-4), 2012, pp. 637-658
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
Serge Gaspers
,
Gregory B. Sorkin
Journal of Computer and System Sciences
78
(1), 2012, pp. 305-335
Backdoors to acyclic SAT
Serge Gaspers
,
Stefan Szeider
Lecture Notes in Computer Science
7391
, 2012, pp. 363-374
Kernels for feedback arc set in tournaments
Stéphane Bessy
,
Fedor V. Fomin
,
Serge Gaspers
,
Christophe Paul
,
Anthony Perez
,
Saket Saurabh
,
Stéphan Thomassé
Journal of Computer and System Sciences
77
(6), 2011, pp. 1071-1078
Complexity of splits reconstruction for low-degree trees
Serge Gaspers
,
Mathieu Liedloff
,
Maya Stein
,
Karol Suchan
Lecture Notes in Computer Science
6986
, 2011, pp. 167-178
Exact exponential-time algorithms for finding bicliques
Daniel Binkele-Raible
,
Henning Fernau
,
Serge Gaspers
,
Mathieu Liedloff
Information Processing Letters
111
(2), 2010, pp. 64-67
Exact and parameterized algorithms for
Max
Internal
Spanning
Tree
Henning Fernau
,
Serge Gaspers
,
Daniel Raible
Lecture Notes in Computer Science
5911
, 2010, pp. 100-111
Parameterized algorithm for eternal vertex cover
Fedor V. Fomin
,
Serge Gaspers
,
Petr A. Golovach
,
Dieter Kratsch
,
Saket Saurabh
Information Processing Letters
110
(16), 2010, pp. 702-706
Iterative compression and exact algorithms
Fedor V. Fomin
,
Serge Gaspers
,
Dieter Kratsch
,
Mathieu Liedloff
,
Saket Saurabh
Theoretical Computer Science
411
(7-9), 2010, pp. 1045-1053
Feedback vertex sets in tournaments
Serge Gaspers
,
Matthias Mnich
Lecture Notes in Computer Science
6346
, 2010, pp. 267-277
Kernels for feedback arc set in tournaments
Stéphane Bessy
,
Fedor V. Fomin
,
Serge Gaspers
,
Christophe Paul
,
Anthony Perez
,
Saket Saurabh
,
Stéphan Thomassé
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 37-47
On two techniques of combining branching and treewidth
Fedor V. Fomin
,
Serge Gaspers
,
Saket Saurabh
,
Alexey A. Stepanov
Algorithmica
54
(2), 2009, pp. 181-207
A linear vertex kernel for
Maximum Internal Spanning Tree
Fedor V. Fomin
,
Serge Gaspers
,
Saket Saurabh
,
Stéphan Thomassé
Lecture Notes in Computer Science
5878
, 2009, pp. 275-282
Clean the graph before you draw it!
Serge Gaspers
,
Margaret-Ellen Messinger
,
Richard J. Nowakowski
,
Paweƚ Praƚat
Information Processing Letters
109
(10), 2009, pp. 463-467
Iterative compression and exact algorithms
Fedor V. Fomin
,
Serge Gaspers
,
Dieter Kratsch
,
Mathieu Liedloff
,
Saket Saurabh
Lecture Notes in Computer Science
5162
, 2008, pp. 335-346
On the minimum feedback vertex set problem: Exact and enumeration algorithms
Fedor V. Fomin
,
Serge Gaspers
,
Artem V. Pyatkin
,
Igor Razgon
Algorithmica
52
(2), 2008, pp. 293-307
On independent sets and bicliques in graphs
Serge Gaspers
,
Dieter Kratsch
,
Mathieu Liedloff
Lecture Notes in Computer Science
5344
, 2008, pp. 171-182
Seiten 1
2
>