Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau:
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets.
Algorithmica (2023)
Single machine robust scheduling with budgeted uncertainty.
Marin Bougeret, Artur Alves Pessoa, Michael Poss.
Oper. Res. Lett. (2023)
Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau.
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds.
Algorithmica (2022)
Marin Bougeret, György Dósa, Noam Goldberg, Michael Poss.
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty.
SIAM J. Discret. Math. (2022)
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau.
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel.
SIAM J. Discret. Math. (2022)
Packing Arc-Disjoint Cycles in Tournaments
Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
Algorithmica, 2021, Volume 83 (Journal version of MFCS 2019) hal depot
Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder.
Approximation Results for Makespan Minimization with Budgeted Uncertainty.
Theory Comput. Syst. (2021)
On independent set in B1-EPG graphs.
Stéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe Paul
Discrete Applied Mathematics, 2020 (Journal version of WAOA 2015) hal depot
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
Marin Bougeret, Ignasi Sau
Algorithmica, 2018, Volume 81 (Journal version of IPEC 2016) arXiv depot
Approximability and exact resolution of the multidimensional binary vector assignment problem
Marin Bougeret, Guillerme Duvillié and Rodolphe Giroudeau
Journal of Combinatorial Optimization, 2018, Volume 36 (journal version of ISCO 2016) Hal depot
Robust scheduling with budgeted uncertainty
Marin Bougeret, Artur Alves Pesoa, Michael Poss
Discrete Applied Mathematics, 2018 Hal depot
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations
Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau and Rémi Watrigant
Discrete Mathematics & Theoretical Computer Science (DMTCS, 2016) (journal version of FCT 2015) arXiv depot
The complexity of partitioning into disjoint cliques and a triangle-free graphs
Marin Bougeret, Pascal Ochem
Discrete Applied Mathematics, 2016 arXiv depot
On the complexity of Wafer-to-Wafer Integration
M. Bougeret, V. Boudet, T. Dokka, G. Duvillié, R. Giroudeau
Discrete Optimization (journa version of CIAC 2015) paper
Approximating the sparsest k-subgraph in chordal graphs
Marin Bougeret, Remi Watrigant, Rodolphe Giroudeau
Theory of Computing Systems, 2016, volume 58 (journal version of WAOA 2013) Hal depot
Improved approximation algorithms for scheduling parallel jobs on identical clusters
Marin Bougeret, Pierre-Francois Dutot, Denis Trystram, Klaus Jansen, Christina Robenek
Theoretical Computer Science, 2015, volume 60 paper
Using group replication for resilience on exascale systems
Marin Bougeret, Henri Casanova, Yves Robert, Frederic Vivien
Int. Journal of High Performance Computing Applications, 2014, volume 28, p210-224 paper
On the Sum-Max Graph Partitioning Problem
Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König and Rémi Watrigant
Theoretical Computer Science, 540-541 pp. 143-155. (journal version of ISCO 12)
Hal depot
Moderately exponential approximation for makespan minimization on related machines
Marin Bougeret, Pierre François Dutot, and Denis Trystram
Theoretical Computer Science, 2013 paper
Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
Marin Bougeret, Pierre François Dutot, Klaus Jannsen, Christina Robenek, and Denis Trystram
Discrete Mathematics, Algorithms and Applications, DMAA, 3(4):553-586, 2011 paper
Approximating in Discrete Resource Sharing Scheduling Problem
Marin Bougeret, Pierre François Dutot, Alfredo Goldman, Yannick Ngoko and Denis Trystram
International Journal of Foundations of Computer Science IJFCSpaper
Conferences & Workshops
Kernelization for Graph Packing Problems via Rainbow Matching.
Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht.
SODA 2023
A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover.
Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau.
IPEC 2021
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel.
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
ICALP 2020 arXiv depot
Width Parameterizations for Knot-free Vertex Deletion on Digraphs
Stéphane Bessy, Marin Bougeret, Alan D. A. Carneiro, Fábio Protti, Uéverton S. Souza
IPEC 2019
Approximating robust bin packing with budgeted uncertainty
Aniket Basu Roy, Marin Bougeret, Noam Goldberg, Michael Poss
WADS 2019 paper
Approximation results for makespan minimization with budgeted uncertainty
Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
WAOA 2019 arXiv depot
Packing Arc-Disjoint Cycles in Tournaments
Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
MFCS 2019 paper
Triangle packing in (sparse) tournaments: approximation and kernelization
S. Bessy, M. Bougeet, J. Thiebault
ESA 2017 arXiv depot
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
M. Bougeet, I. Sau
IPEC 2017
(see journal version above)
Approximability and exact resolution of the
Multidimensional Binary Vector Assignment
problem
M. Bougeet, G. Duvillié, R. Giroudeau
ISCO 2016 paper
On independent set on B1-EPG Graphs
Marin Bougeret, Stephane Bessy, Daniel Gonçalves, Cristophe Paul
WAOA 2015 arXiv depot
On the complexity of Wafer-to-Wafer Integration
M. Bougeret, V. Boudet, T. Dokka, G. Duvillié, R. Giroudeau
CIAC 2015
(see journal version above)
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs
Nicolas Bousquet, Marin Bougeret and Rodolphe Giroudeau
SOFSEM 2014
Approximating the Sparsest k-Subgraph in Chordal Graphs
R. Watrigant, M. Bougeret, R. Giroudeau
WAOA 2013
(see journal version above)
Approximation Algorithms for Wafer to Wafer Integration Problem
T. Dokka, M. Bougeret, V. Boudet, F C.R. Spieksma WAOA 2012paper
Sum-Max Graph Partitioning Problem
M. Bougeret, R. Giroudeau, J.C. Konig, R. Watrigant ISCO 2012
On the approximability of the Sum-Max graph partitioning problem
M. Bougeret, R. Giroudeau, J.C. Konig, R. Watrigant APEX 2012
Tight approximation for scheduling parallel jobs on identical cluster
M. Bougeret, P.F. Dutot, K. Jansen, C. Otte and D. Trystram APDCM 2012 (workshop of IPDPS)
Checkpointing strategies for parallel jobs
M. Bougeret, H. Casanova, M. Rabie, Y. Robert and F. Vivien SC 2011 paper
Scheduling jobs on heterogeneous platforms
M. Bougeret, P.F. Dutot, K. Jansen, C. Otte and D. Trystram COCOON 2011 paper
Using oracles for the design of efficient approximation algorithms
M. Bougeret, P.F. Dutot, and D. Trystram MAPSP 2011 paper
A fast 5/2-approximation algorithm for hierarchical scheduling
M. Bougeret, P.F. Dutot, K. Jansen, C. Otte and D. Trystram EUROPAR 2010 paper
Approximating the non-contiguous Multiple Organization Packing Problem
M. Bougeret, P.F. Dutot, K. Jansen, C. Otte and D. Trystram, TCS 2010 paper
Combining Multiple Heuristics on Discrete Resources
M. Bougeret, P.F. Dutot, A. Goldman, Y. Ngoko and D. Trystram APDCM (workshop of IPDPS) 2009 paper
The guess approximation technique and its application to the Discrete Resource Sharing
Scheduling Problem
M. Bougeret, P.F. Dutot and D. Trystram MAPSP 2009 paper
Research Reports
Tight approximation for scheduling parallel job on identical clusters
M. Bougeret, P.F. Dutot, K. Jansen, C. Otte and D. Trystram paper
An extention of the 5/2-approximation algorithm using oracle
M. Bougeret, P.F. Dutot, and D. Trystram paper
Checkpointing strategies for parallel jobs
M. Bougeret, H. Casanova, M. Rabie, Y. Robert and F. Vivien paper
PhD thesis
Systèmes interactifs pour la résolution de problèmes complexes PhD thesis
Master thesis
Systèmes interactifs pour la résolution de problèmes complexes Master thesis
Some Talks
SODA 2023 slides
Kernelization for graph packing problems via rainbow matching
APDCM 2009 slides
Combining Multiple Heuristics on Discrete Resources
MAPSP 2009 slides
The guess approximation technique and its application to the Discrete Resource Sharing
Scheduling Problem
Groupe de travail GOThA/MAO 2009
Lien entre la conception de PTAS et les oracles (application au problème d’allocation de ressources dans un portfolio)