Marin Bougeret

ORCID

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 44

Top Venues

Grenoble Institute of Technology, France (PHD)

Education History

Grenoble Institute of Technology, France

PHD

Publications

Marin Bougeret, Artur Alves Pessoa, Michael Poss
Single machine robust scheduling with budgeted uncertainty. Oper. Res. Lett. 51 (2) (2023)
Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets. Algorithmica 85 (2) (2023)
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments. CoRR (2023)
Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht
Kernelization for Graph Packing Problems via Rainbow Matching. SODA (2023)
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. 36 (4) (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. 36 (4) (2022)
Marin Bougeret, Jérémy Omer, Michael Poss
Approximating optimization problems in graphs with locational uncertainty. CoRR (2022)
Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht
Kernelization for Graph Packing Problems via Rainbow Matching. CoRR (2022)
Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds. Algorithmica 84 (11) (2022)
Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover. IPEC (2021)
Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
Introducing lop-kernels: a framework for kernelization lower bounds. CoRR (2021)
Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
Packing Arc-Disjoint Cycles in Tournaments. Algorithmica 83 (5) (2021)
Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
Approximation Results for Makespan Minimization with Budgeted Uncertainty. Theory Comput. Syst. 65 (6) (2021)
Marin Bougeret, Jérémy Omer, Michael Poss
Optimization problems in graphs with locational uncertainty. CoRR (2021)
Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
Parameterized complexity of computing maximum minimal blocking and hitting sets. CoRR (2021)
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. ICALP (2020)
Stéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe Paul
On independent set in B1-EPG graphs. Discret. Appl. Math. 278 (2020)
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. CoRR (2020)
Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza
Width Parameterizations for Knot-free Vertex Deletion on Digraphs. CoRR (2019)
Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza
Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. IPEC (2019)
Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
Packing Arc-Disjoint Cycles in Tournaments. MFCS (2019)
Aniket Basu Roy, Marin Bougeret, Noam Goldberg, Michael Poss
Approximating Robust Bin Packing with Budgeted Uncertainty. WADS (2019)
Marin Bougeret, Ignasi Sau
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? Algorithmica 81 (10) (2019)
Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
Approximation results for makespan minimization with budgeted uncertainty. CoRR (2019)
Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
Approximation Results for Makespan Minimization with Budgeted Uncertainty. WAOA (2019)
Marin Bougeret, Artur Alves Pessoa, Michael Poss
Robust scheduling with budgeted uncertainty. Discret. Appl. Math. 261 (2019)
Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut
(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity. CoRR (2018)
Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau
Approximability and exact resolution of the multidimensional binary vector assignment problem. J. Comb. Optim. 36 (3) (2018)
Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut
Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization. ESA (2017)
Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. Discret. Math. Theor. Comput. Sci. 19 (4) (2017)
Marin Bougeret, Ignasi Sau
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?. IPEC (2017)
Marin Bougeret, Pascal Ochem
The complexity of partitioning into disjoint cliques and a triangle-free graph. Discret. Appl. Math. 217 (2017)
Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut
Triangle packing in (sparse) tournaments: approximation and kernelization. CoRR (2017)
Marin Bougeret, Ignasi Sau
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? CoRR (2016)
Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau
Approximating the Sparsest k-Subgraph in Chordal Graphs. Theory Comput. Syst. 58 (1) (2016)
Marin Bougeret, Vincent Boudet, Trivikram Dokka, Guillerme Duvillié, Rodolphe Giroudeau
On the complexity of Wafer-to-Wafer Integration. Discret. Optim. 22 (2016)
Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau
Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem. ISCO (2016)
Guillerme Duvillié, Marin Bougeret, Vincent Boudet, Trivikram Dokka, Rodolphe Giroudeau
On the Complexity of Wafer-to-Wafer Integration. CIAC (2015)
Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations. FCT (2015)
Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. CoRR (2015)
Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul
On independent set on B1-EPG graphs. CoRR (2015)
Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul
On Independent Set on B1-EPG Graphs. WAOA (2015)
Marin Bougeret, Pascal Ochem
The complexity of partitioning into disjoint cliques and a triangle-free graph. CoRR (2015)
Marin Bougeret, Pierre-François Dutot, Denis Trystram, Klaus Jansen, Christina Robenek
Improved approximation algorithms for scheduling parallel jobs on identical clusters. Theor. Comput. Sci. 600 (2015)
Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. SOFSEM (2014)
Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König
On the sum-max graph partitioning problem. Theor. Comput. Sci. 540 (2014)
Marin Bougeret, Henri Casanova, Yves Robert, Frédéric Vivien, Dounia Zaidouni
Using group replication for resilience on exascale systems. Int. J. High Perform. Comput. Appl. 28 (2) (2014)
Marin Bougeret, Pierre-François Dutot, Denis Trystram
Moderately exponential approximation for makespan minimization on related machines. Theor. Comput. Sci. 511 (2013)
Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau
Approximating the Sparsest k-Subgraph in Chordal Graphs. WAOA (2013)
Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König
Sum-Max Graph Partitioning Problem. ISCO (2012)
Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram
Tight Approximation for Scheduling Parallel Jobs on Identical Clusters. IPDPS Workshops (2012)
Trivikram Dokka, Marin Bougeret, Vincent Boudet, Rodolphe Giroudeau, Frits C. R. Spieksma
Approximation Algorithms for the Wafer to Wafer Integration Problem. WAOA (2012)
Marin Bougeret, Pierre-François Dutot, Alfredo Goldman, Yanik Ngoko, Denis Trystram
Approximating the Discrete Resource Sharing Scheduling Problem. Int. J. Found. Comput. Sci. 22 (3) (2011)
Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram
Approximation Algorithms for Multiple Strip Packing and Scheduling Parallel Jobs in Platforms. Discret. Math. Algorithms Appl. 3 (4) (2011)
Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram
Scheduling Jobs on Heterogeneous Platforms. COCOON (2011)
Marin Bougeret, Henri Casanova, Mikaël Rabie, Yves Robert, Frédéric Vivien
Checkpointing strategies for parallel jobs. SC (2011)
Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram
Approximating the Non-contiguous Multiple Organization Packing Problem. IFIP TCS (2010)
Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling. Euro-Par (1) (2010)
Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram
Approximation Algorithms for Multiple Strip Packing. WAOA (2009)
Marin Bougeret, Pierre-François Dutot, Alfredo Goldman, Yanik Ngoko, Denis Trystram
Combining multiple heuristics on discrete resources. IPDPS (2009)

Marin Bougeret.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Marin Bougeret