Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint. - Chien-Chung Huang 001; Mathieu Mari; Claire Mathieu; Joseph S. B. Mitchell; Nabil H. Mustafa (APPROX-RANDOM, 2019)

Greedy approaches to approximation of some NP-hard combinatorial optimization problems. (Approches gloutonnes pour l'approximation de problèmes combinatoires NP-difficiles). - Mathieu Mari (2020)

A 4-Approximation Algorithm for Maximum Independent Set of Rectangles. - Waldo Gálvez; Arindam Khan 001; Mathieu Mari; Tobias Mömke; Madhusudhan Reddy Pittu; Andreas Wiese (CoRR, 2021)

An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. - Chien-Chung Huang 001; Mathieu Mari; Claire Mathieu; Kevin Schewior; Jens Vygen (SIAM J. Discret. Math., 2021)

A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. - Waldo Gálvez; Arindam Khan 001; Mathieu Mari; Tobias Mömke; Madhusudhan Reddy Pittu; Andreas Wiese (SODA, 2022)

A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items. - Mathieu Mari; Timothé Picavet; Michal Pilipczuk (IPEC, 2023)

Online Hitting Set of d-Dimensional Fat Objects. - Shanli Alefkhani; Nima Khodaveisi; Mathieu Mari (WAOA, 2023)

On price-induced minmax matchings. - Christoph Dürr; Mathieu Mari; Ulrike Schmidt-Kraepelin (CoRR, 2023)

A parameterized approximation scheme for the 2D-Knapsack problem with wide items. - Michal Pilipczuk; Mathieu Mari; Timothé Picavet (CoRR, 2023)

Fixed-Parameter Algorithms for Unsplittable Flow Cover. - Andrés Cristi; Mathieu Mari; Andreas Wiese (Theory Comput. Syst., 2023)

Approximating Maximum Integral Multiflows on Bounded Genus Graphs. - Chien-Chung Huang 001; Mathieu Mari; Claire Mathieu; Jens Vygen (Discret. Comput. Geom., 2023)

Multi-level Aggregation with Delays and Stochastic Arrivals. - Mathieu Mari; Michal Pawlowski; Runtian Ren; Piotr Sankowski (AAMAS, 2024)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions. - Fabrizio Grandoni 001; Edin Husic; Mathieu Mari; Antoine Tinguely (SoCG, 2024)

Online Multi-Level Aggregation with Delays and Stochastic Arrivals. - Mathieu Mari; Michal Pawlowski; Runtian Ren; Piotr Sankowski (ISAAC, 2024)

Shortest Disjoint Paths on a Grid. - Mathieu Mari; Anish Mukherjee 001; Michal Pilipczuk; Piotr Sankowski (SODA, 2024)

Modeling Online Paging in Multi-Core Systems. - Mathieu Mari; Anish Mukherjee 001; Runtian Ren; Piotr Sankowski (CoRR, 2024)

Dynamic pricing with Bayesian updates from online reviews. - José Correa 001; Mathieu Mari; Andrew Xia (CoRR, 2024)

Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs. - Piotr Krysta; Mathieu Mari; Nan Zhi (Algorithmica, 2024)

Online Matching with Delays and Stochastic Arrival Times. - Mathieu Mari; Michal Pawlowski; Runtian Ren; Piotr Sankowski (Theory Comput. Syst., 2025)

Parameterized complexity of isometric path partition: treewidth and diameter. - Dibyayan Chakraborty; Oscar Defrain; Florent Foucaud; Mathieu Mari; Prafullkumar Tale (CoRR, 2025)