×

zbMATH — the first resource for mathematics

Escoffier, Bruno

Compute Distance To:
Author ID: escoffier.bruno Recent zbMATH articles by "Escoffier, Bruno"
Published as: Escoffier, B.; Escoffier, Bruno
Documents Indexed: 69 Publications since 2004

Publications by Year

Citations contained in zbMATH

52 Publications have been cited 320 times in 203 Documents Cited by Year
Weighted coloring: further complexity and approximability results. Zbl 1181.68173
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
23
2006
Reoptimization of minimum and maximum traveling salesman’s tours. Zbl 1141.90506
Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
21
2006
Fast algorithms for max independent set. Zbl 1241.68087
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis T.; van Rooij, Johan M. M.
20
2012
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Zbl 1237.05146
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
20
2011
Simple and fast reoptimizations for the Steiner tree problem. Zbl 1277.90138
Escoffier, Bruno; Milanič, Martin; Paschos, Vangelis Th.
20
2009
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. Zbl 1214.05162
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
16
2010
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Zbl 1173.05325
de Werra, D.; Demange, M.; Escoffier, B.; Monnot, J.; Paschos, V. Th.
16
2009
Fast algorithms for min independent dominating set. Zbl 1259.05161
Bourgeois, N.; Della Croce, F.; Escoffier, B.; Paschos, V. Th.
14
2013
Efficient approximation of Min Set Cover by moderately exponential algorithms. Zbl 1166.68043
Bourgeois, N.; Escoffier, B.; Paschos, V. Th.
13
2009
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. Zbl 1068.68063
Bazgan, Cristina; Escoffier, Bruno; Paschos, Vangelis Th.
13
2005
Complexity and approximation in reoptimization. Zbl 1262.90172
Ausiello, Giorgio; Bonifaci, Vincenzo; Escoffier, Bruno
10
2011
Approximation of min coloring by moderately exponential algorithms. Zbl 1197.05141
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
9
2009
Reoptimization of minimum and maximum traveling salesman’s tours. Zbl 1180.90259
Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis
8
2009
Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization. Zbl 1312.68095
Bonnet, Édouard; Escoffier, Bruno; Paschos, Vangelis; Tourniaire, Émeric
6
2015
Strategy-proof mechanisms for facility location games with many facilities. Zbl 1233.90211
Escoffier, Bruno; Gourvès, Laurent; Thang, Nguyen Kim; Pascual, Fanny; Spanjaard, Olivier
6
2011
Efficient approximation of combinatorial problems by moderately exponential algorithms. Zbl 1253.68357
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
6
2009
Weighted coloring on planar, bipartite and split graphs: Complexity and improved approximation. Zbl 1116.68565
de Werra, Dominique; Demange, Mare; Escoffier, Bruno; Monnot, Jerome; Paschos, Vangelis Th.
6
2004
Maximum Independent Set in graphs of average degree at most three in \({\mathcal O}(1.08537^n)\). Zbl 1284.68290
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.; van Rooij, Johan M. M.
5
2010
Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation. Zbl 1187.90208
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme; Spanjaard, Olivier
5
2010
Probabilistic graph-coloring in bipartite and split graphs. Zbl 1206.05039
Bourgeois, N.; Della Croce, F.; Escoffier, B.; Murat, C.; Paschos, V. Th.
5
2009
Differential approximation of MIN SAT, MAX SAT and related problems. Zbl 1131.90080
Escoffier, Bruno; Paschos, Vangelis Th.
5
2007
Completeness in approximation classes beyond APX. Zbl 1099.68135
Escoffier, Bruno; Paschos, Vangelis Th.
5
2006
On subexponential and FPT-time inapproximability. Zbl 1312.68232
Bonnet, Edouard; Escoffier, Bruno; Kim, Eun; Paschos, Vangelis
4
2015
Approximating MAX SAT by moderately exponential and parameterized algorithms. Zbl 1303.68155
Escoffier, Bruno; Paschos, Vangelis Th.; Tourniaire, Emeric
4
2014
On subexponential and FPT-time inapproximability. Zbl 1309.68229
Bonnet, Edouard; Escoffier, Bruno; Kim, Eun Jung; Paschos, Vangelis Th.
4
2013
A bottom-up method and fast algorithms for Max Independent Set. Zbl 1285.68060
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.; van Rooij, Johan M. M.
4
2010
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set. Zbl 1328.68090
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.; Xiao, Mingyu
3
2015
Exponential approximation schemata for some network design problems. Zbl 1334.68300
Boria, Nicolas; Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
3
2013
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set. Zbl 1329.68137
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.; Xiao, Mingyu
3
2012
Fast algorithms for min independent dominating set. Zbl 1284.05270
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
3
2010
An \(O ^{*}(1.0977^{n })\) exact algorithm for Max Independent Set in sparse graphs. Zbl 1142.68596
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
3
2008
Complexity and approximation results for the connected vertex cover problem. Zbl 1141.68525
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
3
2007
Parameterized power vertex cover. Zbl 1417.05157
Angel, Eric; Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael
2
2016
Saving colors and max coloring: some fixed-parameter tractability results. Zbl 1417.05064
Escoffier, Bruno
2
2016
Strategic coloring of a graph. Zbl 1257.91009
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
2
2012
Approximating MAX SAT by moderately exponential and parameterized algorithms. Zbl 1354.68298
Escoffier, Bruno; Paschos, Vangelis Th.; Tourniaire, Emeric
2
2012
A survey on the structure of approximation classes. Zbl 1300.68031
Escoffier, Bruno; Paschos, Vangelis Th.
2
2010
On the impact of local taxes in a set cover game. Zbl 1284.91089
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
2
2010
Strategic coloring of a graph. Zbl 1284.05168
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
2
2010
Some tractable instances of interval data minmax regret problems. Zbl 1155.90467
Escoffier, Bruno; Monnot, Jérôme; Spanjaard, Olivier
2
2008
A better differential approximation ratio for symmetric TSP. Zbl 1145.68051
Escoffier, Bruno; Monnot, Jérôme
2
2008
Some tractable instances of interval data minmax regret problems: Bounded distance from triviality. Zbl 1132.68505
Escoffier, Bruno; Monnot, Jérôme; Spanjaard, Olivier
2
2008
Approximation of the quadratic set covering problem. Zbl 1157.90484
Escoffier, Bruno; Hammer, Peter L.
2
2007
Improved worst-case complexity for the MIN 3-SET COVERING problem. Zbl 1123.68048
Della Croce, Federico; Escoffier, Bruno; Paschos, Vangelis Th.
2
2007
On-line models and algorithms for max independent set. Zbl 1110.68170
Escoffier, Bruno; Paschos, Vangelis Th.
2
2006
Proving completeness by logic. Zbl 1079.68042
Escoffier, Bruno; Paschos, Vangelis Th.
2
2005
Parameterized power vertex cover. Zbl 1401.05229
Angel, Eric; Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael
1
2018
A 0.821-ratio purely combinatorial algorithm for maximum \(k\)-vertex cover in bipartite graphs. Zbl 06576672
Bonnet, Édouard; Escoffier, Bruno; Paschos, Vangelis Th.; Stamoulis, Georgios
1
2016
Designing budget-balanced best-response mechanisms for network coordination games. Zbl 1319.91054
Escoffier, Bruno; Ferraioli, Diodato; Gourvès, Laurent; Moretti, Stefano
1
2013
Algorithms for dominating clique problems. Zbl 1252.05160
Bourgeois, N.; Della Croce, F.; Escoffier, B.; Paschos, V. Th.
1
2012
Weighted coloring: Further complexity and approximability results. Zbl 1171.68611
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
1
2005
Poly-APX- and PTAS-completeness in standard and differential approximation (Extended abstract). Zbl 1116.68678
Bazgan, Cristina; Escoffier, Bruno; Paschos, Vangelis Th.
1
2004
Parameterized power vertex cover. Zbl 1401.05229
Angel, Eric; Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael
1
2018
Parameterized power vertex cover. Zbl 1417.05157
Angel, Eric; Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael
2
2016
Saving colors and max coloring: some fixed-parameter tractability results. Zbl 1417.05064
Escoffier, Bruno
2
2016
A 0.821-ratio purely combinatorial algorithm for maximum \(k\)-vertex cover in bipartite graphs. Zbl 06576672
Bonnet, Édouard; Escoffier, Bruno; Paschos, Vangelis Th.; Stamoulis, Georgios
1
2016
Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization. Zbl 1312.68095
Bonnet, Édouard; Escoffier, Bruno; Paschos, Vangelis; Tourniaire, Émeric
6
2015
On subexponential and FPT-time inapproximability. Zbl 1312.68232
Bonnet, Edouard; Escoffier, Bruno; Kim, Eun; Paschos, Vangelis
4
2015
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set. Zbl 1328.68090
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.; Xiao, Mingyu
3
2015
Approximating MAX SAT by moderately exponential and parameterized algorithms. Zbl 1303.68155
Escoffier, Bruno; Paschos, Vangelis Th.; Tourniaire, Emeric
4
2014
Fast algorithms for min independent dominating set. Zbl 1259.05161
Bourgeois, N.; Della Croce, F.; Escoffier, B.; Paschos, V. Th.
14
2013
On subexponential and FPT-time inapproximability. Zbl 1309.68229
Bonnet, Edouard; Escoffier, Bruno; Kim, Eun Jung; Paschos, Vangelis Th.
4
2013
Exponential approximation schemata for some network design problems. Zbl 1334.68300
Boria, Nicolas; Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
3
2013
Designing budget-balanced best-response mechanisms for network coordination games. Zbl 1319.91054
Escoffier, Bruno; Ferraioli, Diodato; Gourvès, Laurent; Moretti, Stefano
1
2013
Fast algorithms for max independent set. Zbl 1241.68087
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis T.; van Rooij, Johan M. M.
20
2012
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set. Zbl 1329.68137
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.; Xiao, Mingyu
3
2012
Strategic coloring of a graph. Zbl 1257.91009
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
2
2012
Approximating MAX SAT by moderately exponential and parameterized algorithms. Zbl 1354.68298
Escoffier, Bruno; Paschos, Vangelis Th.; Tourniaire, Emeric
2
2012
Algorithms for dominating clique problems. Zbl 1252.05160
Bourgeois, N.; Della Croce, F.; Escoffier, B.; Paschos, V. Th.
1
2012
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Zbl 1237.05146
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
20
2011
Complexity and approximation in reoptimization. Zbl 1262.90172
Ausiello, Giorgio; Bonifaci, Vincenzo; Escoffier, Bruno
10
2011
Strategy-proof mechanisms for facility location games with many facilities. Zbl 1233.90211
Escoffier, Bruno; Gourvès, Laurent; Thang, Nguyen Kim; Pascual, Fanny; Spanjaard, Olivier
6
2011
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. Zbl 1214.05162
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
16
2010
Maximum Independent Set in graphs of average degree at most three in \({\mathcal O}(1.08537^n)\). Zbl 1284.68290
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.; van Rooij, Johan M. M.
5
2010
Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation. Zbl 1187.90208
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme; Spanjaard, Olivier
5
2010
A bottom-up method and fast algorithms for Max Independent Set. Zbl 1285.68060
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.; van Rooij, Johan M. M.
4
2010
Fast algorithms for min independent dominating set. Zbl 1284.05270
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
3
2010
A survey on the structure of approximation classes. Zbl 1300.68031
Escoffier, Bruno; Paschos, Vangelis Th.
2
2010
On the impact of local taxes in a set cover game. Zbl 1284.91089
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
2
2010
Strategic coloring of a graph. Zbl 1284.05168
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
2
2010
Simple and fast reoptimizations for the Steiner tree problem. Zbl 1277.90138
Escoffier, Bruno; Milanič, Martin; Paschos, Vangelis Th.
20
2009
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Zbl 1173.05325
de Werra, D.; Demange, M.; Escoffier, B.; Monnot, J.; Paschos, V. Th.
16
2009
Efficient approximation of Min Set Cover by moderately exponential algorithms. Zbl 1166.68043
Bourgeois, N.; Escoffier, B.; Paschos, V. Th.
13
2009
Approximation of min coloring by moderately exponential algorithms. Zbl 1197.05141
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
9
2009
Reoptimization of minimum and maximum traveling salesman’s tours. Zbl 1180.90259
Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis
8
2009
Efficient approximation of combinatorial problems by moderately exponential algorithms. Zbl 1253.68357
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
6
2009
Probabilistic graph-coloring in bipartite and split graphs. Zbl 1206.05039
Bourgeois, N.; Della Croce, F.; Escoffier, B.; Murat, C.; Paschos, V. Th.
5
2009
An \(O ^{*}(1.0977^{n })\) exact algorithm for Max Independent Set in sparse graphs. Zbl 1142.68596
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
3
2008
Some tractable instances of interval data minmax regret problems. Zbl 1155.90467
Escoffier, Bruno; Monnot, Jérôme; Spanjaard, Olivier
2
2008
A better differential approximation ratio for symmetric TSP. Zbl 1145.68051
Escoffier, Bruno; Monnot, Jérôme
2
2008
Some tractable instances of interval data minmax regret problems: Bounded distance from triviality. Zbl 1132.68505
Escoffier, Bruno; Monnot, Jérôme; Spanjaard, Olivier
2
2008
Differential approximation of MIN SAT, MAX SAT and related problems. Zbl 1131.90080
Escoffier, Bruno; Paschos, Vangelis Th.
5
2007
Complexity and approximation results for the connected vertex cover problem. Zbl 1141.68525
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme
3
2007
Approximation of the quadratic set covering problem. Zbl 1157.90484
Escoffier, Bruno; Hammer, Peter L.
2
2007
Improved worst-case complexity for the MIN 3-SET COVERING problem. Zbl 1123.68048
Della Croce, Federico; Escoffier, Bruno; Paschos, Vangelis Th.
2
2007
Weighted coloring: further complexity and approximability results. Zbl 1181.68173
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
23
2006
Reoptimization of minimum and maximum traveling salesman’s tours. Zbl 1141.90506
Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
21
2006
Completeness in approximation classes beyond APX. Zbl 1099.68135
Escoffier, Bruno; Paschos, Vangelis Th.
5
2006
On-line models and algorithms for max independent set. Zbl 1110.68170
Escoffier, Bruno; Paschos, Vangelis Th.
2
2006
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. Zbl 1068.68063
Bazgan, Cristina; Escoffier, Bruno; Paschos, Vangelis Th.
13
2005
Proving completeness by logic. Zbl 1079.68042
Escoffier, Bruno; Paschos, Vangelis Th.
2
2005
Weighted coloring: Further complexity and approximability results. Zbl 1171.68611
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
1
2005
Weighted coloring on planar, bipartite and split graphs: Complexity and improved approximation. Zbl 1116.68565
de Werra, Dominique; Demange, Mare; Escoffier, Bruno; Monnot, Jerome; Paschos, Vangelis Th.
6
2004
Poly-APX- and PTAS-completeness in standard and differential approximation (Extended abstract). Zbl 1116.68678
Bazgan, Cristina; Escoffier, Bruno; Paschos, Vangelis Th.
1
2004
all top 5

Cited by 328 Authors

41 Paschos, Vangelis Th.
22 Escoffier, Bruno
11 Monnot, Jérôme
9 Bourgeois, Nicolas
8 Boria, Nicolas
8 Xiao, Mingyu
7 Böckenhauer, Hans-Joachim
7 Fernau, Henning
6 Cygan, Marek
6 Della Croce, Federico
6 Lampis, Michael
6 Lucarelli, Giorgio
6 Mikhailyuk, Victor A.
6 Milis, Ioannis
6 Mömke, Tobias
6 Nagamochi, Hiroshi
5 Bonnet, Edouard
5 Branković, Ljiljana
5 Saurabh, Saket
5 Zehavi, Meirav
4 Bazgan, Cristina
4 Bilò, Davide
4 Casel, Katrin
4 Královič, Richard
4 Pilipczuk, Marcin
4 van Rooij, Johan M. M.
4 Zych, Anna
3 Bodlaender, Hans L.
3 Fujito, Toshihiro
3 Hromkovič, Juraj
3 Johnson, Matthew
3 Komm, Dennis
3 Li, Minming
3 Liedloff, Mathieu
3 Lokshtanov, Daniel
3 Malaguti, Enrico
3 Mei, Lili
3 Paulusma, Daniël
3 Shachnai, Hadas
3 Tourniaire, Emeric
3 Wojtaszczyk, Jakub Onufry
3 Ye, Deshi
3 Zhang, Guochuan
2 Araújo, Júlio César Silva
2 Ausiello, Giorgio
2 Chalermsook, Parinya
2 Chang, Maw-Shang
2 Chen, Li-Hsuan
2 Coelho, Rafael S.
2 Demange, Marc
2 Dvořák, Zdeněk
2 Fomin, Fedor V.
2 Furini, Fabio
2 Hung, Ling-Ju
2 Jansen, Klaus
2 Kasperski, Adam
2 Katsikarelis, Ioannis
2 Klein, Kim-Manuel
2 Knust, Sigrid
2 Laekhanukit, Bundit
2 Lima, Carlos Vinícius G. C.
2 Majumdar, Diptapriyo
2 Marx, Dániel
2 Montealegre, Pedro
2 Moura, Phablo F. S.
2 Murat, Cécile
2 Nanongkai, Danupon
2 Nederlof, Jesper
2 Nonner, Tim
2 Paesani, Giacomo
2 Pandey, Pooja
2 Pilipczuk, Michał
2 Plyasunov, Aleksandr V.
2 Punnen, Abraham P.
2 Raman, Venkatesh
2 Rossmanith, Peter
2 Rzążewski, Paweł
2 Sau, Ignasi
2 Seibert, Sebastian
2 Shakhlevich, Natalia V.
2 Sharma, Roohani
2 Shimoda, Tomoaki
2 Sikora, Florian
2 Sprock, Andreas
2 Strash, Darren
2 Tamir, Tami
2 Todinca, Ioan
2 Toth, Paolo
2 Wakabayashi, Yoshiko
2 Waldherr, Stefan
2 Weiss, Christoph
2 Wu, Weili
2 Zieliński, Paweł
1 Abreu Júnior, João Carlos
1 Akiba, Takuya
1 Alhadi, Gais
1 Apt, Krzysztof Rafal
1 Archetti, Claudia
1 Astudillo, César A.
1 Bampis, Evripidis
...and 228 more Authors
all top 5

Cited in 47 Serials

30 Theoretical Computer Science
21 Discrete Applied Mathematics
16 Algorithmica
9 Information Processing Letters
9 Journal of Combinatorial Optimization
8 Theory of Computing Systems
8 Journal of Discrete Algorithms
6 European Journal of Operational Research
6 Cybernetics and Systems Analysis
5 RAIRO. Operations Research
4 SIAM Journal on Computing
3 SIAM Journal on Discrete Mathematics
3 Annals of Operations Research
3 Optimization Letters
2 Information Sciences
2 Journal of Computer and System Sciences
2 European Journal of Combinatorics
2 International Transactions in Operational Research
2 Journal of Heuristics
2 Journal of Scheduling
2 4OR
2 Discrete Optimization
1 Acta Informatica
1 International Journal of Game Theory
1 Journal of Graph Theory
1 Journal of Optimization Theory and Applications
1 Mathematics of Operations Research
1 Operations Research Letters
1 Acta Mathematicae Applicatae Sinica. English Series
1 Optimization
1 Graphs and Combinatorics
1 Information and Computation
1 Computers & Operations Research
1 Journal of Global Optimization
1 Automation and Remote Control
1 The Electronic Journal of Combinatorics
1 Mathematical Problems in Engineering
1 Optimization Methods & Software
1 Taiwanese Journal of Mathematics
1 Journal of Graph Algorithms and Applications
1 JMMA. Journal of Mathematical Modelling and Algorithms
1 Operational Research. An International Journal
1 Algorithms
1 RAIRO. Theoretical Informatics and Applications
1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
1 Computer Science Review
1 Journal of Dynamics and Games

Citations by Year