Marin Bougeret

Orcid: 0000-0002-9910-4656

According to our database1, Marin Bougeret authored at least 42 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Single machine robust scheduling with budgeted uncertainty.
Oper. Res. Lett., March, 2023

Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets.
Algorithmica, February, 2023

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

Kernelization for Graph Packing Problems via Rainbow Matching.
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.
SIAM J. Discret. Math., December, 2022

Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty.
SIAM J. Discret. Math., 2022

Approximating optimization problems in graphs with locational uncertainty.
CoRR, 2022

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

2021
Approximation Results for Makespan Minimization with Budgeted Uncertainty.
Theory Comput. Syst., 2021

Optimization problems in graphs with locational uncertainty.
CoRR, 2021

Packing Arc-Disjoint Cycles in Tournaments.
Algorithmica, 2021

A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020
On independent set in B1-EPG graphs.
Discret. Appl. Math., 2020

Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Robust scheduling with budgeted uncertainty.
Discret. Appl. Math., 2019

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

Approximating Robust Bin Packing with Budgeted Uncertainty.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Width Parameterizations for Knot-Free Vertex Deletion on Digraphs.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018
Approximability and exact resolution of the multidimensional binary vector assignment problem.
J. Comb. Optim., 2018

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

2017
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations.
Discret. Math. Theor. Comput. Sci., 2017

The complexity of partitioning into disjoint cliques and a triangle-free graph.
Discret. Appl. Math., 2017

Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Approximating the Sparsest k-Subgraph in Chordal Graphs.
Theory Comput. Syst., 2016

On the complexity of Wafer-to-Wafer Integration.
Discret. Optim., 2016

2015
Improved approximation algorithms for scheduling parallel jobs on identical clusters.
Theor. Comput. Sci., 2015

On Independent Set on B1-EPG Graphs.
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

2014
On the sum-max graph partitioning problem.
Theor. Comput. Sci., 2014

Using group replication for resilience on exascale systems.
Int. J. High Perform. Comput. Appl., 2014

Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

2013
Moderately exponential approximation for makespan minimization on related machines.
Theor. Comput. Sci., 2013

2012
Approximation Algorithms for the Wafer to Wafer Integration Problem.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Tight Approximation for Scheduling Parallel Jobs on Identical Clusters.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

2011
Approximating the Discrete Resource Sharing Scheduling Problem.
Int. J. Found. Comput. Sci., 2011

Approximation Algorithms for Multiple Strip Packing and Scheduling Parallel Jobs in Platforms.
Discret. Math. Algorithms Appl., 2011

Checkpointing strategies for parallel jobs.
Proceedings of the Conference on High Performance Computing Networking, 2011

Scheduling Jobs on Heterogeneous Platforms.
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).
PhD thesis, 2010

Approximating the Non-contiguous Multiple Organization Packing Problem.
Proceedings of the Theoretical Computer Science, 2010

A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling.
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.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Combining multiple heuristics on discrete resources.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009


  Loading...