Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruno Escoffier
- > Home > Persons > Bruno Escoffier
Publications
- 2017
[j34]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
The Price of Optimum: Complexity and Approximation for a Matching Game. Algorithmica 77(3): 836-866 (2017)- 2015
- [j30]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao:
New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. Theory Comput. Syst. 56(2): 330-346 (2015) - 2013
- [j28]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Fair solutions for some multiagent optimization problems. Auton. Agents Multi Agent Syst. 26(2): 184-201 (2013) - [c27]Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard:
Truthful Many-to-Many Assignment with Private Weights. CIAC 2013: 209-220 - 2012
- [j24]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Strategic Coloring of a Graph. Internet Math. 8(4): 424-455 (2012) - [c23]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao:
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. IPEC 2012: 25-36 - [c21]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Stefano Moretti:
Cost allocation protocols for network formation on connection situations. VALUETOOLS 2012: 228-234 - 2011
- [c19]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
The Price of Optimum in a Matching Game. SAGT 2011: 81-92 - 2010
- [j20]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard:
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. Eur. J. Oper. Res. 205(1): 19-30 (2010) - [j19]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. J. Discrete Algorithms 8(1): 36-49 (2010) - [c18]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Strategic Coloring of a Graph. CIAC 2010: 155-166 - [c17]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
On the Impact of Local Taxes in a Set Cover Game. SIROCCO 2010: 2-13 - [i3]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Minimum regulation of uncoordinated matchings. CoRR abs/1012.3889 (2010) - 2009
- [j16]Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discret. Appl. Math. 157(4): 819-832 (2009) - [j13]Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of minimum and maximum traveling salesman's tours. J. Discrete Algorithms 7(4): 453-463 (2009) - 2008
- [j11]Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard:
Some tractable instances of interval data minmax regret problems. Oper. Res. Lett. 36(4): 424-429 (2008) - [j10]Bruno Escoffier, Jérôme Monnot:
A better differential approximation ratio for symmetric TSP. Theor. Comput. Sci. 396(1-3): 63-70 (2008) - [c9]Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard:
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. SOFSEM 2008: 280-291 - 2007
- [c7]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Complexity and Approximation Results for the Connected Vertex Cover Problem. WG 2007: 202-213 - 2006
- [j5]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted Coloring: further complexity and approximability results. Inf. Process. Lett. 97(3): 98-103 (2006) - [c6]Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of Minimum and Maximum Traveling Salesman's Tours. SWAT 2006: 196-207 - 2005
- [c3]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted Coloring: Further Complexity and Approximability Results. ICTCS 2005: 205-214 - 2004
- [c1]Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier:
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. ISAAC 2004: 896-907
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-10 23:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
