Marin Bougeret

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