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
Hilfe
Suche: Author="Escoffier, Bruno"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximating MAX SAT by moderately exponential and parameterized algorithms
Bruno Escoffier
,
Vangelis Th. Paschos
,
Emeric Tourniaire
Theoretical Computer Science
560, Part 2
, 2014, pp. 147-157
Truthful many-to-many assignment with private weights
Bruno Escoffier
,
Jérôme Monnot
,
Fanny Pascual
,
Olivier Spanjaard
Lecture Notes in Computer Science
7878
, 2013, pp. 209-220
Fast algorithms for
max independent set
Nicolas Bourgeois
,
Bruno Escoffier
,
Vangelis T. Paschos
,
Johan M.M. van Rooij
Algorithmica
62
(1-2), 2012, pp. 382-415
A bottom-up method and fast algorithms for
max independent set
Nicolas Bourgeois
,
Bruno Escoffier
,
Vangelis Th. Paschos
,
Johan M.M. van Rooij
Lecture Notes in Computer Science
6139
, 2010, pp. 62-73
Adapting parallel algorithms to the W-Stream model, with applications to graph problems
Camil Demetrescu
,
Bruno Escoffier
,
Gabriel Moruz
,
Andrea Ribichini
Theoretical Computer Science
411
(44-46), 2010, pp. 3994-4004
Strategic coloring of a graph
Bruno Escoffier
,
Laurent Gourv`es
,
Jérôme Monnot
Lecture Notes in Computer Science
6078
, 2010, pp. 155-166
Approximation of MIN COLORING by moderately exponential algorithms
Nicolas Bourgeois
,
Bruno Escoffier
,
Vangelis Th. Paschos
Information Processing Letters
109
(16), 2009, pp. 950-954
Efficient approximation of combinatorial problems by moderately exponential algorithms
Nicolas Bourgeois
,
Bruno Escoffier
,
Vangelis Th. Paschos
Lecture Notes in Computer Science
5664
, 2009, pp. 507-518
A better differential approximation ratio for symmetric TSP
Bruno Escoffier
,
Jérôme Monnot
Theoretical Computer Science
396
(1-3), 2008, pp. 63-70
Adapting parallel algorithms to the W-stream model, with applications to graph problems
Camil Demetrescu
,
Bruno Escoffier
,
Gabriel Moruz
,
Andrea Ribichini
Lecture Notes in Computer Science
4708
, 2007, pp. 194-205
Complexity and approximation results for the connected vertex cover problem
Bruno Escoffier
,
Laurent Gourvès
,
Jérôme Monnot
Lecture Notes in Computer Science
4769
, 2007, pp. 202-213
Reoptimization of minimum and maximum Traveling Salesman's tours
Giorgio Ausiello
,
Bruno Escoffier
,
Jérôme Monnot
,
Vangelis Th. Paschos
Lecture Notes in Computer Science
4059
, 2006, pp. 196-207
Weighted coloring: Further complexity and approximability results
Bruno Escoffier
,
Jérôme Monnot
,
Vangelis Th. Paschos
Information Processing Letters
97
(3), 2006, pp. 98-103
Completeness in approximation classes beyond APX
Bruno Escoffier
,
Vangelis Th. Paschos
Theoretical Computer Science
359
(1-3), 2006, pp. 369-377
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
Cristina Bazgan
,
Bruno Escoffier
,
Vangelis Th. Paschos
Theoretical Computer Science
339
(2-3), 2005, pp. 272-292
Poly-APX- and PTAS-completeness in standard and differential approximation
Cristina Bazgan
,
Bruno Escoffier
,
Vangelis Th. Paschos
Lecture Notes in Computer Science
3341
, 2004, pp. 124-136
Weighted coloring on planar, bipartite and split graphs: Complexity and improved approximation
Dominique de Werra
,
Mare Demange
,
Bruno Escoffier
,
Jerome Monnot
,
Vangelis Th. Paschos
Lecture Notes in Computer Science
3341
, 2004, pp. 896-907