( en | de | ru )

 

Disambiguation of "Escoffier, Bruno"

Author of the publication

copydeleteadd this publication to your clipboard
Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems.

, , , and . MFCS, volume 4708 of Lecture Notes in Computer Science, page 194-205. Springer, (2007)

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

Online Multistage Subset Maximization Problems., , , and . Algorithmica, 83 (8): 2374-2399 (2021)A simple rounding scheme for multistage optimization., , , , and . Theor. Comput. Sci., (2022)New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set., , , and . Theory Comput. Syst., 56 (2): 330-346 (2015)Improved worst-case complexity for the MIN 3-SET COVERING problem., , and . Oper. Res. Lett., 35 (2): 205-210 (2007)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)Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs., , and . J. Discrete Algorithms, 8 (1): 36-49 (2010)LP-based algorithms for multistage minimization problems., , and . CoRR, (2019)The Price of Optimum in a Matching Game., , and . SAGT, volume 6982 of Lecture Notes in Computer Science, page 81-92. Springer, (2011)Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation., , , and . Eur. J. Oper. Res., 205 (1): 19-30 (2010)