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="Sau, Ignasi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The role of planarity in connectivity problems parameterized by treewidth
Julien Baste
,
Ignasi Sau
Theoretical Computer Science
570
, 2015, pp. 1-14
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
Explicit linear kernels via dynamic programming
Valentin Garnero
,
Christophe Paul
,
Ignasi Sau
,
Dimitrios M. Thilikos
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 312-324
Hitting and harvesting pumpkins
Gwenaël Joret
,
Christophe Paul
,
Ignasi Sau
,
Saket Saurabh
,
Stéphan Thomassé
SIAM Journal on Discrete Mathematics
28
(3), 2014, pp. 1363-1390
Linear kernels and single-exponential algorithms via protrusion decompositions
Eun Jung Kim
,
Alexander Langer
,
Christophe Paul
,
Felix Reidl
,
Peter Rossmanith
,
Ignasi Sau
,
Somnath Sikdar
Lecture Notes in Computer Science
7965
, 2013, pp. 613-624
Fast minor testing in planar graphs
Isolde Adler
,
Frederic Dorn
,
Fedor V. Fomin
,
Ignasi Sau
,
Dimitrios M. Thilikos
Algorithmica
64
(1), 2012, pp. 69-84
GMPLS label space minimization through hypergraph layouts
Jean-Claude Bermond
,
David Coudert
,
Joanna Moulierac
,
Stéphane Pérennes
,
Ignasi Sau
,
Fernando Solano Donado
Theoretical Computer Science
444
, 2012, pp. 3-16
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
Dynamic programming for
H
-minor-free graphs
Juanjo Rué
,
Ignasi Sau
,
Dimitrios M. Thilikos
Lecture Notes in Computer Science
7434
, 2012, pp. 86-97
Faster parameterized algorithms for minor containment
Isolde Adler
,
Frederic Dorn
,
Fedor V. Fomin
,
Ignasi Sau
,
Dimitrios M. Thilikos
Theoretical Computer Science
412
(50), 2011, pp. 7018-7028
Traffic grooming in bidirectional WDM ring networks
Jean-Claude Bermond
,
Xavier Muñoz
,
Ignasi Sau
Networks
58
(1), 2011, pp. 20-35
Hitting and harvesting pumpkins
Gwenaël Joret
,
Christophe Paul
,
Ignasi Sau
,
Saket Saurabh
,
Stéphan Thomassé
Lecture Notes in Computer Science
6942
, 2011, pp. 394-407
The recognition of tolerance and bounded tolerance graphs
George B. Mertzios
,
Ignasi Sau
,
Shmuel Zaks
SIAM Journal on Computing
40
(5), 2011, pp. 1234-1257
Edge-partitioning regular graphs for ring traffic grooming with a priori placement of the ADMs
Xavier Muñoz
,
Zhentao Li
,
Ignasi Sau
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1490-1505
Faster parameterized algorithms for minor containment
Isolde Adler
,
Frederic Dorn
,
Fedor V. Fomin
,
Ignasi Sau
,
Dimitrios M. Thilikos
Lecture Notes in Computer Science
6139
, 2010, pp. 322-333
Fast minor testing in planar graphs
Isolde Adler
,
Frederic Dorn
,
Fedor V. Fomin
,
Ignasi Sau
,
Dimitrios M. Thilikos
Lecture Notes in Computer Science
6346
, 2010, pp. 97-109
Drop cost and wavelength optimal two-period grooming with ratio 4
Jean-Claude Bermond
,
Charles J. Colbourn
,
Lucia Gionfriddo
,
Gaetano Quattrocchi
,
Ignasi Sau
SIAM Journal on Discrete Mathematics
24
(2), 2010, pp. 400-419
Graph partitioning and traffic grooming with bounded degree request graph
Zhentao Li
,
Ignasi Sau
Lecture Notes in Computer Science
5911
, 2010, pp. 250-261
Placing regenerators in optical networks to satisfy multiple sets of requests
George B. Mertzios
,
Ignasi Sau
,
Mordechai Shalom
,
Shmuel Zaks
Lecture Notes in Computer Science
6199
, 2010, pp. 333-344
A new intersection model and improved algorithms for tolerance graphs
George B. Mertzios
,
Ignasi Sau
,
Shmuel Zaks
Lecture Notes in Computer Science
5911
, 2010, pp. 285-295
The recognition of tolerance and bounded tolerance graphs
George B. Mertzios
,
Ignasi Sau
,
Shmuel Zaks
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 585-596
Dynamic programming for graphs on surfaces
Juanjo Rué
,
Ignasi Sau
,
Dimitrios M. Thilikos
Lecture Notes in Computer Science
6198
, 2010, pp. 372-383
Hardness and approximation of traffic grooming
Omid Amini
,
Stéphane Pérennes
,
Ignasi Sau
Theoretical Computer Science
410
(38-40), 2009, pp. 3751-3760
A new intersection model and improved algorithms for tolerance graphs
George B. Mertzios
,
Ignasi Sau
,
Shmuel Zaks
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1800-1813
Seiten 1
2
>