Marin Bougeret

According to our database, Marin Bougeret authored at least 45 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Kick the cliques.

Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond

CoRR, 2024

Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius.

Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations.

Marin Bougeret, Bart M. P. Jansen, Ignasi Sau

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Single machine robust scheduling with budgeted uncertainty.

Marin Bougeret, Artur Alves Pessoa, Michael Poss

Oper. Res. Lett., March, 2023

Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets.

Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau

Algorithmica, February, 2023

Optimization Problems in Graphs with Locational Uncertainty.

Marin Bougeret, Jérémy Omer, Michael Poss

INFORMS J. Comput., 2023

Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments.

Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond

CoRR, 2023

Kernelization for Graph Packing Problems via Rainbow Matching.

Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel.

Marin Bougeret, Bart M. P. Jansen, Ignasi Sau

SIAM J. Discret. Math., December, 2022

Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty.

Marin Bougeret, György Dósa, Noam Goldberg, Michael Poss

SIAM J. Discret. Math., 2022

Approximating optimization problems in graphs with locational uncertainty.

Marin Bougeret, Jérémy Omer, Michael Poss

CoRR, 2022

Introducing lop-Kernels: A Framework for Kernelization Lower Bounds.

Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau

Algorithmica, 2022

2021

Approximation Results for Makespan Minimization with Budgeted Uncertainty.

Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder

Theory Comput. Syst., 2021

Packing Arc-Disjoint Cycles in Tournaments.

Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi

Algorithmica, 2021

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

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

On independent set in B1-EPG graphs.

Stéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe Paul

Discret. Appl. Math., 2020

Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel.

Marin Bougeret, Bart M. P. Jansen, Ignasi Sau

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Robust scheduling with budgeted uncertainty.

Marin Bougeret, Artur Alves Pessoa, Michael Poss

Discret. Appl. Math., 2019

How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?

Marin Bougeret, Ignasi Sau

Algorithmica, 2019

Approximating Robust Bin Packing with Budgeted Uncertainty.

Aniket Basu Roy, Marin Bougeret, Noam Goldberg, Michael Poss

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Width Parameterizations for Knot-Free Vertex Deletion on Digraphs.

Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

Approximability and exact resolution of the multidimensional binary vector assignment problem.

Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau

J. Comb. Optim., 2018

(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity.

Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut

CoRR, 2018

2017

Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations.

Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant

Discret. Math. Theor. Comput. Sci., 2017

The complexity of partitioning into disjoint cliques and a triangle-free graph.

Marin Bougeret, Pascal Ochem

Discret. Appl. Math., 2017

Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization.

Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Approximating the Sparsest k-Subgraph in Chordal Graphs.

Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau

Theory Comput. Syst., 2016

On the complexity of Wafer-to-Wafer Integration.

Marin Bougeret, Vincent Boudet, Trivikram Dokka, Guillerme Duvillié, Rodolphe Giroudeau

Discret. Optim., 2016

2015

Improved approximation algorithms for scheduling parallel jobs on identical clusters.

Marin Bougeret, Pierre-François Dutot, Denis Trystram, Klaus Jansen, Christina Robenek

Theor. Comput. Sci., 2015

On Independent Set on B1-EPG Graphs.

Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul

Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

2014

On the sum-max graph partitioning problem.

Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König

Theor. Comput. Sci., 2014

Using group replication for resilience on exascale systems.

Marin Bougeret, Henri Casanova, Yves Robert, Frédéric Vivien, Dounia Zaidouni

Int. J. High Perform. Comput. Appl., 2014

Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs.

Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

2013

Moderately exponential approximation for makespan minimization on related machines.

Marin Bougeret, Pierre-François Dutot, Denis Trystram

Theor. Comput. Sci., 2013

2012

Approximation Algorithms for the Wafer to Wafer Integration Problem.

Trivikram Dokka, Marin Bougeret, Vincent Boudet, Rodolphe Giroudeau, Frits C. R. Spieksma

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Tight Approximation for Scheduling Parallel Jobs on Identical Clusters.

Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

2011

Approximating the Discrete Resource Sharing Scheduling Problem.

Marin Bougeret, Pierre-François Dutot, Alfredo Goldman, Yanik Ngoko, Denis Trystram

Int. J. Found. Comput. Sci., 2011

Approximation Algorithms for Multiple Strip Packing and Scheduling Parallel Jobs in Platforms.

Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram

Discret. Math. Algorithms Appl., 2011

Checkpointing strategies for parallel jobs.

Marin Bougeret, Henri Casanova, Mikaël Rabie, Yves Robert, Frédéric Vivien

Proceedings of the Conference on High Performance Computing Networking, 2011

Scheduling Jobs on Heterogeneous Platforms.

Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

Systèmes interactifs pour la résolution de problèmes complexes. (Interactive systems for the resolution of complex problems. Application in combinatorial optimization, planification and scheduling).

Marin Bougeret

PhD thesis, 2010

Approximating the Non-contiguous Multiple Organization Packing Problem.

Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram

Proceedings of the Theoretical Computer Science, 2010

A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling.

Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram

Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

2009

Approximation Algorithms for Multiple Strip Packing.

Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Combining multiple heuristics on discrete resources.

Marin Bougeret, Pierre-François Dutot, Alfredo Goldman, Yanik Ngoko, Denis Trystram

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009