default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Bergé
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant:
1-Extendability of Independent Sets. Algorithmica 86(3): 757-781 (2024)- [j7]Pierre Bergé, Guillaume Ducoffe, Michel Habib:
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs. Theory Comput. Syst. 68(1): 144-193 (2024) - [c14]Pierre Bergé
, Mari Chaikovskaia, Jean-Philippe Gayon, Alain Quilliot:
Approximation Algorithm for Job Scheduling with Reconfigurable Resources. ISCO 2024: 263-276 - [c13]Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
The Canadian Traveller Problem on Outerplanar Graphs. MFCS 2024: 19:1-19:16 - [i11]Pierre Bergé, Mari Chaikovskaia, Jean-Philippe Gayon, Alain Quilliot:
Approximation algorithms for Job Scheduling with reconfigurable resources. CoRR abs/2401.00419 (2024) - [i10]Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
The Canadian Traveller Problem on outerplanar graphs. CoRR abs/2403.01872 (2024) - [i9]Pierre Bergé, Guillaume Ducoffe, Michel Habib:
Quasilinear-time eccentricities computation, and more, on median graphs. CoRR abs/2410.10235 (2024) - 2023
- [j6]Pierre Bergé, Wassim Bouaziz, Arpad Rimmel, Joanna Tomasik:
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts. SIAM J. Discret. Math. 37(2): 964-996 (2023) - [j5]Pierre Bergé, Lou Salaün:
The influence of maximum (s, t)-cuts on the competitiveness of deterministic strategies for the Canadian Traveller Problem. Theor. Comput. Sci. 941: 221-240 (2023) - [c12]Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant:
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. STACS 2023: 10:1-10:15 - 2022
- [c11]Pierre Bergé, Édouard Bonnet, Hugues Déprés:
Deciding Twin-Width at Most 4 Is NP-Complete. ICALP 2022: 18:1-18:20 - [c10]Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant:
1-Extendability of Independent Sets. IWOCA 2022: 172-185 - [c9]Pierre Bergé, Guillaume Ducoffe, Michel Habib:
Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs. STACS 2022: 9:1-9:21 - [i8]Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant:
1-Extendability of independent sets. CoRR abs/2204.05809 (2022) - [i7]Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant:
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. CoRR abs/2207.07708 (2022) - 2021
- [c8]Pierre Bergé, Michel Habib:
Diameter in linear time for constant-dimension median graphs. LAGOS 2021: 97-107 - [i6]Pierre Bergé, Michel Habib:
Diameter, radius and all eccentricities in linear time for constant-dimension median graphs. CoRR abs/2105.12150 (2021) - [i5]Pierre Bergé, Guillaume Ducoffe, Michel Habib:
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs. CoRR abs/2110.02709 (2021) - [i4]Pierre Bergé, Édouard Bonnet, Hugues Déprés:
Deciding twin-width at most 4 is NP-complete. CoRR abs/2112.08953 (2021) - 2020
- [j4]Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
The Authorization Policy Existence Problem. IEEE Trans. Dependable Secur. Comput. 17(6): 1333-1344 (2020)
2010 – 2019
- 2019
- [b1]Pierre Bergé:
A guide book for the traveller on graphs full of blockages. (Algorithmes pour voyager sur un graphe contenant des blocages). University of Paris-Saclay, France, 2019 - [j3]Pierre Bergé, Jean Desmarchelier, Wen Guo, Aurélie Lefebvre, Arpad Rimmel, Joanna Tomasik:
Multiple Canadians on the road: minimizing the distance competitive ratio. J. Comb. Optim. 38(4): 1086-1100 (2019) - [j2]Pierre Bergé, Arpad Rimmel, Joanna Tomasik:
On the parameterized complexity of separating certain sources from the target. Theor. Comput. Sci. 795: 183-193 (2019) - [c7]Pierre Bergé, Lou Salaün:
Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts. WAOA 2019: 29-42 - [c6]Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik:
Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts. WG 2019: 79-92 - [i3]Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik:
Fixed-parameter tractability of counting small minimum (S, T)-cuts. CoRR abs/1907.02353 (2019) - 2018
- [j1]Ghada Ben Hassine, Pierre Bergé, Arpad Rimmel, Joanna Tomasik:
A lower bound for weak Schur numbers with a deterministic algorithm. J. Discrete Algorithms 51: 12-25 (2018) - [c5]Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik:
On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem. COCOA 2018: 566-576 - [c4]Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik:
The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities. ISCIS 2018: 96-103 - 2017
- [c3]Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
The Authorization Policy Existence Problem. CODASPY 2017: 163-165 - 2016
- [c2]Pierre Bergé, Baptiste Cavarec, Arpad Rimmel, Joanna Tomasik:
Restricting the search space to boost Quantum Annealing performance. CEC 2016: 3238-3245 - [c1]Pierre Bergé, Kaourintin Le Guiban, Arpad Rimmel, Joanna Tomasik:
Search Space Exploration and an Optimization Criterion for Hard Design Problems. GECCO (Companion) 2016: 43-44 - [i2]Pierre Bergé, Kaourintin Le Guiban, Arpad Rimmel, Joanna Tomasik:
On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs. CoRR abs/1608.07225 (2016) - [i1]Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
The Authorization Policy Existence Problem. CoRR abs/1612.06191 (2016)
Coauthor Index
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-11-26 20:47 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:
