default search action
Mathieu Mari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Piotr Krysta, Mathieu Mari, Nan Zhi:
Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs. Algorithmica 86(11): 3518-3578 (2024) - [c11]Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski:
Multi-level Aggregation with Delays and Stochastic Arrivals. AAMAS 2024: 2378-2380 - [c10]Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely:
Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions. SoCG 2024: 61:1-61:16 - [c9]Mathieu Mari, Anish Mukherjee, Michal Pilipczuk, Piotr Sankowski:
Shortest Disjoint Paths on a Grid. SODA 2024: 346-365 - [i12]Mathieu Mari, Anish Mukherjee, Runtian Ren, Piotr Sankowski:
Modeling Online Paging in Multi-Core Systems. CoRR abs/2401.05834 (2024) - [i11]Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely:
Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions. CoRR abs/2402.07666 (2024) - [i10]Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski:
Online Multi-level Aggregation with Delays and Stochastic Arrivals. CoRR abs/2404.09711 (2024) - [i9]José Correa, Mathieu Mari, Andrew Xia:
Dynamic pricing with Bayesian updates from online reviews. CoRR abs/2404.14953 (2024) - 2023
- [j3]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen:
Approximating Maximum Integral Multiflows on Bounded Genus Graphs. Discret. Comput. Geom. 70(4): 1266-1291 (2023) - [j2]Andrés Cristi, Mathieu Mari, Andreas Wiese:
Fixed-Parameter Algorithms for Unsplittable Flow Cover. Theory Comput. Syst. 67(1): 89-124 (2023) - [c8]Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski:
Online Matching with Delays and Stochastic Arrival Times. AAMAS 2023: 976-984 - [c7]Mathieu Mari, Timothé Picavet, Michal Pilipczuk:
A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items. IPEC 2023: 33:1-33:20 - [c6]Shanli Alefkhani, Nima Khodaveisi, Mathieu Mari:
Online Hitting Set of d-Dimensional Fat Objects. WAOA 2023: 134-144 - [i8]Christoph Dürr, Mathieu Mari, Ulrike Schmidt-Kraepelin:
On price-induced minmax matchings. CoRR abs/2302.11902 (2023) - [i7]Michal Pilipczuk, Mathieu Mari, Timothé Picavet:
A parameterized approximation scheme for the 2D-Knapsack problem with wide items. CoRR abs/2307.10672 (2023) - [i6]Shanli Alefkhani, Nima Khodaveisi, Mathieu Mari:
Online hitting set of d-dimensional fat objects. CoRR abs/2309.02269 (2023) - 2022
- [c5]Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese:
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. SODA 2022: 894-905 - [i5]Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski:
Online matching with delays and stochastic arrival times. CoRR abs/2210.07018 (2022) - 2021
- [j1]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen:
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. SIAM J. Discret. Math. 35(2): 752-769 (2021) - [c4]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen:
Approximating Maximum Integral Multiflows on Bounded Genus Graphs. ICALP 2021: 80:1-80:18 - [i4]Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese:
A 4-Approximation Algorithm for Maximum Independent Set of Rectangles. CoRR abs/2106.00623 (2021) - 2020
- [b1]Mathieu Mari:
Greedy approaches to approximation of some NP-hard combinatorial optimization problems. (Approches gloutonnes pour l'approximation de problèmes combinatoires NP-difficiles). PSL Research University, Paris, France, 2020 - [c3]Piotr Krysta, Mathieu Mari, Nan Zhi:
Ultimate greedy approximation of independent sets in subcubic graphs. SODA 2020: 1436-1455 - [c2]Andrés Cristi, Mathieu Mari, Andreas Wiese:
Fixed-Parameter Algorithms for Unsplittable Flow Cover. STACS 2020: 42:1-42:17 - [i3]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen:
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. CoRR abs/2001.01715 (2020) - [i2]Piotr Krysta, Mathieu Mari, Nan Zhi:
Ultimate greedy approximation of independent sets in subcubic graphs. CoRR abs/2001.11997 (2020) - [i1]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen:
Approximating maximum integral multiflows on bounded genus graphs. CoRR abs/2005.00575 (2020)
2010 – 2019
- 2019
- [c1]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, Nabil H. Mustafa:
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint. APPROX-RANDOM 2019: 32:1-32:21
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint