| A 3-approximation algorithm for maximum independent set of rectangles W Gálvez, A Khan, M Mari, T Mömke, MR Pittu, A Wiese Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 24 | 2022 |
| A (2+\epsilon)-Approximation Algorithm for Maximum Independent Set of Rectangles W Gálvez, A Khan, M Mari, T Mömke, M Reddy, A Wiese arXiv preprint arXiv:2106.00623, 2021 | 17 | 2021 |
| An approximation algorithm for fully planar edge-disjoint paths CC Huang, M Mari, C Mathieu, K Schewior, J Vygen SIAM Journal on Discrete Mathematics 35 (2), 752-769, 2021 | 9 | 2021 |
| Maximizing covered area in the euclidean plane with connectivity constraint CC Huang, M Mari, C Mathieu, JSB Mitchell, NH Mustafa Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2019 | 8 | 2019 |
| Dynamic pricing with Bayesian updates from online reviews J Correa, M Mari, A Xia arXiv preprint arXiv:2404.14953, 2024 | 4 | 2024 |
| Approximating maximum integral multiflows on bounded genus graphs CC Huang, M Mari, C Mathieu, J Vygen Discrete & Computational Geometry 70 (4), 1266-1291, 2023 | 4 | 2023 |
| Online matching with delays and stochastic arrival times M Mari, M Pawłowski, R Ren, P Sankowski arXiv preprint arXiv:2210.07018, 2022 | 4 | 2022 |
| Ultimate greedy approximation of independent sets in subcubic graphs P Krysta, M Mari, N Zhi Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 3 | 2020 |
| Fixed-parameter algorithms for unsplittable flow cover A Cristi, M Mari, A Wiese Theory of Computing Systems 67 (1), 89-124, 2023 | 1 | 2023 |
| Greedy approaches to approximation of some NP-hard combinatorial optimization problems M Mari Université Paris sciences et lettres, 2020 | 1 | 2020 |
| Online Multi-level Aggregation with Delays and Stochastic Arrivals M Mari, M Pawłowski, R Ren, P Sankowski arXiv preprint arXiv:2404.09711, 2024 | | 2024 |
| Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions F Grandoni, E Husić, M Mari, A Tinguely arXiv preprint arXiv:2402.07666, 2024 | | 2024 |
| Modeling Online Paging in Multi-Core Systems M Mari, A Mukherjee, R Ren, P Sankowski arXiv preprint arXiv:2401.05834, 2024 | | 2024 |
| Shortest Disjoint Paths on a Grid M Mari, A Mukherjee, M Pilipczuk, P Sankowski Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | | 2024 |
| Online Hitting Set of d-Dimensional Fat Objects S Alefkhani, N Khodaveisi, M Mari International Workshop on Approximation and Online Algorithms, 134-144, 2023 | | 2023 |
| A parameterized approximation scheme for the 2D-Knapsack problem with wide items M Pilipczuk, M Mari, T Picavet arXiv preprint arXiv:2307.10672, 2023 | | 2023 |
| A parameterized approximation scheme for the 2D-Knapsack problem with wide items M Mari, T Picavet, M Pilipczuk | | 2023 |
| Online Matching with Delays and Stochastic Arrival Times P Sankowski, R Ren, M Pawłowski, M Mari | | 2023 |
| A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items M Mari, T Picavet, M Pilipczuk 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), 2023 | | 2023 |
| Approches Gloutonnes pour l'Approximation de Problèmes Combinatoires NP-difficiles M Mari | | 2020 |
