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="Bousquet, Nicolas"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Parameterized domination in circle graphs
Nicolas Bousquet
,
Daniel Gonçalves
,
George B. Mertzios
,
Christophe Paul
,
Ignasi Sau
,
Stéphane Thomassé
Theory of Computing Systems
54
(1), 2014, pp. 45-72
Graph coloring, communication complexity and the stubborn problem
Nicolas Bousquet
,
Aurélie Lagoutte
,
Stéphan Thomassé
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 3-4
Parameterized domination in circle graphs
Nicolas Bousquet
,
Daniel Gonçalves
,
George B. Mertzios
,
Christophe Paul
,
Ignasi Sau
,
Stéphan Thomassé
Lecture Notes in Computer Science
7551
, 2012, pp. 308-319
Parameterized domination in circle graphs
Nicolas Bousquet
,
Daniel Gonçalves
,
George B. Mertzios
,
Christophe Paul
,
Ignasi Sau
,
Stéphan Thomassé
Lecture Notes in Computer Science
7551
, 2012, pp. 308-319
Multicut is FPT
Nicolas Bousquet
,
Jean Daligault
,
Stéphan Thomassé
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 459-468
A polynomial kernel for multicut in trees
Nicolas Bousquet
,
Jean Daligault
,
Stéphan Thomassé
,
Anders Yeo
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 183-194