( en | de | ru )

 

Disambiguation of "Escoffier, Bruno"

Author of the publication

copydeleteadd this publication to your clipboard
Target-based computer-assisted orchestration: Complexity and approximation algorithms.

, , , , and . Eur. J. Oper. Res., 304 (3): 926-938 (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Clément Escoffier

Horst Bruno

Horst Bruno

Eugen Bruno

Armin Bruno

 

Other publications of authors with the same name

Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results.. WG, volume 9941 of Lecture Notes in Computer Science, page 50-61. (2016)Cost allocation protocols for network formation on connection situations., , , and . VALUETOOLS, page 228-234. ICST/IEEE, (2012)Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms., , and . SAGT, volume 12283 of Lecture Notes in Computer Science, page 291-306. Springer, (2020)The Price of Optimum: Complexity and Approximation for a Matching Game., , and . Algorithmica, 77 (3): 836-866 (2017)An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs., , and . IWPEC, volume 5018 of Lecture Notes in Computer Science, page 55-65. Springer, (2008)Social Ranking Manipulability for the CP-Majority, Banzhaf and Lexicographic Excellence Solutions., , , and . IJCAI, page 17-23. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..Improved worst-case complexity for the MIN 3-SET COVERING problem., , and . Oper. Res. Lett., 35 (2): 205-210 (2007)The Price of Optimum in a Matching Game., , and . SAGT, volume 6982 of Lecture Notes in Computer Science, page 81-92. Springer, (2011)Parameterized Power Vertex Cover., , , and . WG, volume 9941 of Lecture Notes in Computer Science, page 97-108. (2016)Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality., , and . SOFSEM, volume 4910 of Lecture Notes in Computer Science, page 280-291. Springer, (2008)