Pierre Bergé

Available identifiers

zbMath Open berge.pierreMaRDI QIDQ1757461

List of research outcomes

Publication	Date of Publication	Type
Approximating highly inapproximable problems on graphs of bounded twin-width	2024-10-08	Paper
Deciding twin-width at most 4 is NP-complete	2024-06-24	Paper
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs	2024-04-23	Paper
1-extendability of independent sets	2024-03-25	Paper
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs	2024-02-09	Paper
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts	2023-06-22	Paper
The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem	2023-01-04	Paper
1-extendability of independent sets	2022-08-30	Paper
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width	2022-07-15	Paper
Deciding twin-width at most 4 is NP-complete	2021-12-16	Paper
Diameter, radius and all eccentricities in linear time for constant-dimension median graphs	2021-05-25	Paper
Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts	2020-08-24	Paper
Fixed-parameter tractability of counting small minimum \((S,T)\)-cuts	2020-02-24	Paper
Multiple canadians on the road: minimizing the distance competitive ratio	2019-12-13	Paper
On the parameterized complexity of separating certain sources from the target	2019-10-18	Paper
On the competitiveness of memoryless strategies for the \(k\)-Canadian traveller problem	2019-10-11	Paper
A lower bound for weak Schur numbers with a deterministic algorithm	2019-01-04	Paper
https://portal.mardi4nfdi.de/entity/Q3843123	1998-08-25	Paper
https://portal.mardi4nfdi.de/entity/Q3843130	1998-08-25	Paper
https://portal.mardi4nfdi.de/entity/Q3822883	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3822882	1984-01-01	Paper

Research outcomes over time

This page was built for person: Pierre Bergé