Mathieu Mari

31 papers A* 5A 3B 3Journal 18Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Online Matching with Delays and Stochastic Arrival Times.
Theory Comput. Syst.
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
2025 J jnl
Parameterized complexity of isometric path partition: treewidth and diameter.
CoRR
Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari, Prafullkumar Tale
2024 A* conf
Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions.
SoCG
Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely
2024 J jnl
Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions.
CoRR
Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely
2024 J jnl
Dynamic pricing with Bayesian updates from online reviews.
CoRR
José Correa, Mathieu Mari, Andrew Xia
2024 J jnl
Modeling Online Paging in Multi-Core Systems.
CoRR
Mathieu Mari, Anish Mukherjee, Runtian Ren, Piotr Sankowski
2024 A conf
Multi-level Aggregation with Delays and Stochastic Arrivals.
AAMAS
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
2024 B conf
Online Multi-Level Aggregation with Delays and Stochastic Arrivals.
ISAAC
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
2024 J jnl
Online Multi-level Aggregation with Delays and Stochastic Arrivals.
CoRR
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
2024 A* conf
Shortest Disjoint Paths on a Grid.
SODA
Mathieu Mari, Anish Mukherjee, Michal Pilipczuk, Piotr Sankowski
2024 J jnl
Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs.
Algorithmica
Piotr Krysta, Mathieu Mari, Nan Zhi
2023 B conf
A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items.
IPEC
Mathieu Mari, Timothé Picavet, Michal Pilipczuk
2023 J jnl
A parameterized approximation scheme for the 2D-Knapsack problem with wide items.
CoRR
Michal Pilipczuk, Mathieu Mari, Timothé Picavet
2023 J jnl
Approximating Maximum Integral Multiflows on Bounded Genus Graphs.
Discret. Comput. Geom.
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen
2023 J jnl
Fixed-Parameter Algorithms for Unsplittable Flow Cover.
Theory Comput. Syst.
Andrés Cristi, Mathieu Mari, Andreas Wiese
2023 J jnl
On price-induced minmax matchings.
CoRR
Christoph Dürr, Mathieu Mari, Ulrike Schmidt-Kraepelin
2023 B conf
Online Hitting Set of d-Dimensional Fat Objects.
WAOA
Shanli Alefkhani, Nima Khodaveisi, Mathieu Mari
2023 A conf
Online Matching with Delays and Stochastic Arrival Times.
AAMAS
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
2023 J jnl
Online hitting set of d-dimensional fat objects.
CoRR
Shanli Alefkhani, Nima Khodaveisi, Mathieu Mari
2022 A* conf
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles.
SODA
Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese
2022 J jnl
Online matching with delays and stochastic arrival times.
CoRR
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
2021 J jnl
A 4-Approximation Algorithm for Maximum Independent Set of Rectangles.
CoRR
Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese
2021 J jnl
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths.
SIAM J. Discret. Math.
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen
2021 A* conf
Approximating Maximum Integral Multiflows on Bounded Genus Graphs.
ICALP
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen
2020 J jnl
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths.
CoRR
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen
2020 J jnl
Approximating maximum integral multiflows on bounded genus graphs.
CoRR
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen
2020 A conf
Fixed-Parameter Algorithms for Unsplittable Flow Cover.
STACS
Andrés Cristi, Mathieu Mari, Andreas Wiese
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
2020 A* conf
Ultimate greedy approximation of independent sets in subcubic graphs.
SODA
Piotr Krysta, Mathieu Mari, Nan Zhi
2020 J jnl
Ultimate greedy approximation of independent sets in subcubic graphs.
CoRR
Piotr Krysta, Mathieu Mari, Nan Zhi
2019 — conf
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint.
APPROX-RANDOM
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, Nabil H. Mustafa