Mathieu Mari

According to our database, Mathieu Mari authored at least 20 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Parameterized complexity of isometric path partition: treewidth and diameter.

Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari, Prafullkumar Tale

CoRR, August, 2025

2024

Dynamic pricing with Bayesian updates from online reviews.

José Correa, Mathieu Mari, Andrew Xia

CoRR, 2024

Modeling Online Paging in Multi-Core Systems.

Mathieu Mari, Anish Mukherjee, Runtian Ren, Piotr Sankowski

CoRR, 2024

Shortest Disjoint Paths on a Grid.

Mathieu Mari, Anish Mukherjee, Michal Pilipczuk, Piotr Sankowski

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Online Multi-Level Aggregation with Delays and Stochastic Arrivals.

Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions.

Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Multi-level Aggregation with Delays and Stochastic Arrivals.

Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

A parameterized approximation scheme for the 2D-Knapsack problem with wide items.

Michal Pilipczuk, Mathieu Mari, Timothé Picavet

CoRR, 2023

On price-induced minmax matchings.

Christoph Dürr, Mathieu Mari, Ulrike Schmidt-Kraepelin

CoRR, 2023

Online Hitting Set of d-Dimensional Fat Objects.

Shanli Alefkhani, Nima Khodaveisi, Mathieu Mari

Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items.

Mathieu Mari, Timothé Picavet, Michal Pilipczuk

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Online Matching with Delays and Stochastic Arrival Times.

Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

A 3-Approximation Algorithm for Maximum Independent Set of Rectangles.

Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

An Approximation Algorithm for Fully Planar Edge-Disjoint Paths.

Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen

SIAM J. Discret. Math., 2021

A 4-Approximation Algorithm for Maximum Independent Set of Rectangles.

Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese

CoRR, 2021

Approximating Maximum Integral Multiflows on Bounded Genus Graphs.

Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

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

Mathieu Mari

PhD thesis, 2020

Fixed-Parameter Algorithms for Unsplittable Flow Cover.

Andrés Cristi, Mathieu Mari, Andreas Wiese

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Ultimate greedy approximation of independent sets in subcubic graphs.

Piotr Krysta, Mathieu Mari, Nan Zhi

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint.

Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, Nabil H. Mustafa

Proceedings of the Approximation, 2019