Остановите войну!
for scientists:
default search action
Bruno Escoffier
- > Home > Persons > Bruno Escoffier
Publications
- 2024
- [i20]Evripidis Bampis, Bruno Escoffier, Michalis Xefteris:
Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems. CoRR abs/2402.02062 (2024) - 2023
- [j45]Evripidis Bampis, Bruno Escoffier, Paul Youssef:
Online 2-stage stable matching. Discret. Appl. Math. 341: 394-405 (2023) - [j44]Evripidis Bampis, Carmine-Emanuele Cella, Bruno Escoffier, Mila Rocco, Alexandre Teiller:
Target-based computer-assisted orchestration: Complexity and approximation algorithms. Eur. J. Oper. Res. 304(3): 926-938 (2023) - [c46]Evripidis Bampis, Bruno Escoffier, Paul Youssef:
Online 2-stage Stable Matching. AAMAS 2023: 2475-2477 - [c44]Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, Michalis Xefteris:
Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else. ESA 2023: 12:1-12:17 - [c42]Evripidis Bampis, Bruno Escoffier, Niklas Hahn, Michalis Xefteris:
Online TSP with Known Locations. WADS 2023: 65-78 - [i19]Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, Michalis Xefteris:
Learning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else. CoRR abs/2305.02169 (2023) - 2022
- [j42]Evripidis Bampis, Bruno Escoffier, Alexandre Teiller:
Multistage knapsack. J. Comput. Syst. Sci. 126: 106-118 (2022) - [j41]Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Alexander V. Kononov, Kim Thang Nguyen:
A simple rounding scheme for multistage optimization. Theor. Comput. Sci. 907: 1-10 (2022) - [j39]Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Kim Thang Nguyen:
Online learning for min-max discrete problems. Theor. Comput. Sci. 930: 209-217 (2022) - [c41]Evripidis Bampis, Bruno Escoffier, Michalis Xefteris:
Canadian Traveller Problem with Predictions. WAOA 2022: 116-133 - [i18]Evripidis Bampis, Bruno Escoffier, Paul Youssef:
Online 2-stage Stable Matching. CoRR abs/2207.02057 (2022) - [i17]Evripidis Bampis, Bruno Escoffier, Michalis Xefteris:
Canadian Traveller Problem with Predictions. CoRR abs/2209.11100 (2022) - [i16]Evripidis Bampis, Bruno Escoffier, Niklas Hahn, Michalis Xefteris:
Online TSP with Known Locations. CoRR abs/2210.14722 (2022) - 2021
- [j38]Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller:
Online Multistage Subset Maximization Problems. Algorithmica 83(8): 2374-2399 (2021) - 2020
- [c36]Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov:
LP-Based Algorithms for Multistage Minimization Problems. WAOA 2020: 1-15 - 2019
- [c35]Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller:
Online Multistage Subset Maximization Problems. ESA 2019: 11:1-11:14 - [c34]Evripidis Bampis, Bruno Escoffier, Alexandre Teiller:
Multistage Knapsack. MFCS 2019: 22:1-22:14 - [i13]Evripidis Bampis, Bruno Escoffier, Alexandre Teiller:
Multistage Knapsack. CoRR abs/1901.11260 (2019) - [i11]Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller:
Online Multistage Subset Maximization Problems. CoRR abs/1905.04162 (2019) - [i10]Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Kim Thang Nguyen:
Online-Learning for min-max discrete problems. CoRR abs/1907.05944 (2019) - [i9]Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov:
LP-based algorithms for multistage minimization problems. CoRR abs/1909.10354 (2019) - 2018
- [j35]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [c32]Evripidis Bampis, Bruno Escoffier, Sasa Mladenovic:
Fair Resource Allocation Over Time. AAMAS 2018: 766-773 - [c31]Evripidis Bampis, Bruno Escoffier, Michael Lampis, Vangelis Th. Paschos:
Multistage Matchings. SWAT 2018: 7:1-7:13 - [i8]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. CoRR abs/1801.10476 (2018) - 2016
- [c28]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. WG 2016: 97-108
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