Mathieu Mari

Orcid: 0000-0001-8074-0241

According to our database1, Mathieu Mari authored at least 19 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs.
Algorithmica, November, 2024

Dynamic pricing with Bayesian updates from online reviews.
CoRR, 2024

Online Multi-level Aggregation with Delays and Stochastic Arrivals.
CoRR, 2024

Modeling Online Paging in Multi-Core Systems.
CoRR, 2024

Shortest Disjoint Paths on a Grid.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

Multi-level Aggregation with Delays and Stochastic Arrivals.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Approximating Maximum Integral Multiflows on Bounded Genus Graphs.
Discret. Comput. Geom., December, 2023

Fixed-Parameter Algorithms for Unsplittable Flow Cover.
Theory Comput. Syst., February, 2023

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

On price-induced minmax matchings.
CoRR, 2023

Online Hitting Set of d-Dimensional Fat Objects.
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Online Matching with Delays and Stochastic Arrival Times.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths.
SIAM J. Discret. Math., 2021

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

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

2019
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint.
Proceedings of the Approximation, 2019


  Loading...