Skip to Main content

Keywords

European projects

Researcher identifiers

Social networks

    Export Publications

    Export the displayed publications:

    External widget

    Number of documents

    54

    Publications of Marin Bougeret


    Journal articles14 documents

    • Stéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe Paul. On independent set in B1-EPG graphs. Discrete Applied Mathematics, Elsevier, 2020, 278, pp.62-72. ⟨10.1016/j.dam.2019.10.019⟩. ⟨lirmm-03027587⟩
    • Marin Bougeret, Ignasi Sau Valls. How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?. Algorithmica, Springer Verlag, 2019, 81 (10), pp.4043-4068. ⟨10.1007/s00453-018-0468-8⟩. ⟨lirmm-02410618⟩
    • Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau. Approximability and exact resolution of the multidimensional binary vector assignment problem. Journal of Combinatorial Optimization, Springer Verlag, 2018, 36 (3), pp.1059-1073. ⟨10.1007/s10878-018-0276-8⟩. ⟨lirmm-01922494⟩
    • Marin Bougeret, Artur Alves Pessoa, Michael Poss. Robust scheduling with budgeted uncertainty. Discrete Applied Mathematics, Elsevier, 2018, 261 (31), pp.93-107. ⟨10.1016/j.dam.2018.07.001⟩. ⟨lirmm-02020566⟩
    • Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant. Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2017, FCT '15, 19 (4), ⟨10.23638/DMTCS-19-4-3⟩. ⟨lirmm-01889400⟩
    • Marin Bougeret, Pascal Ochem. The complexity of partitioning into disjoint cliques and a triangle-free graph. Discrete Applied Mathematics, Elsevier, 2017, 217, pp.438-445. ⟨10.1016/j.dam.2016.10.004⟩. ⟨lirmm-02078169⟩
    • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. Approximating the sparsest $k$-subgraph in chordal graph. Theory of Computing Systems, Springer Verlag, 2016, 58 (1), pp.111-132. ⟨10.1007/s00224-014-9568-2⟩. ⟨lirmm-01383119⟩
    • Marin Bougeret, Vincent Boudet, Trivikram Dokka, Guillerme Duvillié, Rodolphe Giroudeau. On the complexity of Wafer-to-Wafer Integration. Discrete Optimization, Elsevier, 2016, 22 (part B), pp.255-269. ⟨10.1016/j.disopt.2016.07.001⟩. ⟨lirmm-01378579⟩
    • Marin Bougeret, Pierre-Francois Dutot, Denis Trystram, Klaus Jansen, Christina Robenek. Improved approximation algorithms for scheduling parallel jobs on identical clusters. Theoretical Computer Science, Elsevier, 2015, 600, pp.70-85. ⟨10.1016/j.tcs.2015.07.003⟩. ⟨hal-01230293⟩
    • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König. On the sum-max graph partitioning problem. Theoretical Computer Science, Elsevier, 2014, Combinatorial Optimization: Theory of algorithms and Complexity, 540, pp.143-155. ⟨10.1016/j.tcs.2013.11.024⟩. ⟨lirmm-01251016⟩
    • Marin Bougeret, Henri Casanova, Yves Robert, Frédéric Vivien, Dounia Zaidouni. Using group replication for resilience on exascale systems. International Journal of High Performance Computing Applications, SAGE Publications, 2014, 28 (2), pp.210-224. ⟨10.1177/1094342013505348⟩. ⟨hal-00881463⟩
    • Marin Bougeret, Pierre-Francois Dutot, Denis Trystram. Moderately exponential approximation for makespan minimization on related machines. Theoretical Computer Science, Elsevier, 2013, In press. ⟨10.1016/j.tcs.2013.03.020⟩. ⟨lirmm-00838717⟩
    • Marin Bougeret, Pierre-François Dutot, Alfredo Goldman, Yanik Ngoko, Denis Trystram. Approximating the discrete resource sharing scheduling problem. International Journal of Foundations of Computer Science, World Scientific Publishing, 2011, 22 (3), ⟨10.1142/s0129054111008271⟩. ⟨hal-00796858⟩
    • Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram. Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms. Discrete Mathematics, Algorithms and Applications, World Scientific Publishing, 2011, 3 (4), pp.553-586. ⟨10.1142/S1793830911001413⟩. ⟨hal-00796859⟩

    Conference papers27 documents

    • Marin Bougeret, Bart Jansen, Ignasi Sau Valls. Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. 47th International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2020, Saarbrücken, Germany. pp.16:1--16:19, ⟨10.4230/LIPIcs.ICALP.2020.16⟩. ⟨lirmm-02991230⟩
    • Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder. Approximation results for makespan minimization with budgeted uncertainty. WAOA 2019, Sep 2019, Munich, Germany. ⟨hal-02277357⟩
    • Stéphane Bessy, Marin Bougeret, Ramaswamy Krithika, Abhishek Sahu, Saket Saurabh, et al.. Packing Arc-Disjoint Cycles in Tournaments. MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.1 - 23, ⟨10.4230/LIPIcs.CVIT.2016.23⟩. ⟨hal-02277436⟩
    • Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut. Triangle packing in (sparse) tournaments: approximation and kernelization. ESA: European Symposium on Algorithms, Sep 2017, Vienne, Austria. pp.14:1--14:13, ⟨10.4230/LIPIcs.ESA.2017.14⟩. ⟨lirmm-01550313⟩
    • Marin Bougeret, Ignasi Sau Valls. How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?. IPEC: International symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. pp.10:1--10:13, ⟨10.4230/LIPIcs.IPEC.2017.10⟩. ⟨lirmm-01730228⟩
    • Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau. Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem. ISCO: International Symposium on Combinatorial Optimization, May 2016, Vietri sul Mare, Italy. pp.148-159, ⟨10.1007/978-3-319-45587-7_13⟩. ⟨lirmm-01383110⟩
    • Guillerme Duvillié, Marin Bougeret, Vincent Boudet, Trivikram Dokka, Rodolphe Giroudeau. On the Complexity of Wafer-to-Wafer Integration. CIAC: International Conference on Algorithms and Complexity, May 2015, Paris, France. pp.208-220, ⟨10.1007/978-3-319-18173-8_15⟩. ⟨lirmm-01250989⟩
    • Marin Bougeret, Rodolphe Giroudeau, Guillerme Duvillié. On the complexity of flexible interval scheduling. MAPSP: Models and Algorithms for Planning and Scheduling Problems, Jun 2015, La Roche-en-Ardenne, Belgium. ⟨lirmm-01251104⟩
    • Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul. On Independent Set on B1-EPG Graphs. WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169, ⟨10.1007/978-3-319-28684-6_14⟩. ⟨lirmm-01264022⟩
    • Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant. Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations. FCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.189-201, ⟨10.1007/978-3-319-22177-9_15⟩. ⟨lirmm-01250997⟩
    • Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant. Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. SOFSEM: Theory and Practice of Computer Science, Jan 2014, Nový Smokovec, Slovakia. pp.150-161, ⟨10.1007/978-3-319-04298-5_14⟩. ⟨lirmm-01251025⟩
    • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. Approximating the Sparsest $k$-Subgraph in Chordal Graphs. WAOA: Workshop on Approximation and Online Algorithms, Sep 2013, Sophia Antipolis, France. pp.73-84, ⟨10.1007/978-3-319-08001-7_7⟩. ⟨lirmm-01283611⟩
    • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König. On the Approximability of the Sum-Max Graph Partitioning Problem. APEX: Approximation, Parameterized and EXact algorithms, Feb 2012, Paris, France. ⟨lirmm-00675888⟩
    • Rodolphe Giroudeau, Vincent Boudet, Marin Bougeret, Trivikram Dokka, Frits Spieksma. Approximation algorithms for the wafer to wafer integration problem. WAOA: Workshop on Approximation and Online Algorithms, Sep 2012, Ljubljana, Slovenia. pp.286-297. ⟨lirmm-00805063⟩
    • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König. Sum-Max Graph Partitioning Problem. ISCO: International Symposium on Combinatorial Optimization, Apr 2012, Athens, Greece. pp.297-308, ⟨10.1007/978-3-642-32147-4_27⟩. ⟨lirmm-00738554⟩
    • Marin Bougeret, Pierre-Francois Dutot, Klaus Jansen, Christina Robenek, Denis Trystram. Tight approximation for scheduling parallel jobs on identical clusters. IPDPSW: International Parallel and Distributed Processing Symposim, May 2012, Shangai, China. pp.878-885, ⟨10.1109/IPDPSW.2012.108⟩. ⟨hal-00738499⟩
    • Marin Bougeret, Pierre-Francois Dutot, Denis Trystram. Using oracles for the design of efficient approximation algorithms. MAPSP: Models and Algorithms for Planning and Scheduling Problems, Jun 2011, Nymburk, Czech Republic. ⟨hal-00738513⟩
    • Marin Bougeret, Pierre-Francois Dutot, Klaus Jansen, Christina Robenek, Denis Trystram. Scheduling jobs on heterogeneous platforms. COCOON, 2011, Dallas, United States. ⟨hal-00738508⟩
    • Marin Bougeret, Henri Casanova, Mikael Rabie, Yves Robert, Frédéric Vivien. Checkpointing strategies for parallel jobs.. SuperComputing (SC) - International Conference for High Performance Computing, Networking, Storage and Analysis, 2011, 2011, United States. pp.1-11. ⟨hal-00738504⟩
    • Marin Bougeret, Pierre François Dutot, Klaus Jansen, Christina Otte, Denis Trystram. Approximating the Non-contiguous Multiple Organization Packing Problem. 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. pp.316-327, ⟨10.1007/978-3-642-15240-5_23⟩. ⟨hal-01054450⟩
    • Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram. A fast \frac52-approximation algorithm for hierarchical scheduling. Proceedings of the 16th International EuroPar Conference, 2010, Ischia, Italy. pp.157-167. ⟨hal-00953419⟩
    • Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram. Approximation Algorithms for Multiple Strip Packing. Approximation and Online Algorithms, 2010, Copenhagen, Denmark. pp.37-48, ⟨10.1007/978-3-642-12450-1_4⟩. ⟨hal-00953421⟩
    • Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram. Approximating the Non-contiguous Multiple Organization Packing Problem. TCS: Theoretical Computer Science, 2010, Brisbane, Australia. pp.316-327, ⟨10.1007/978-3-642-15240-5₂3⟩. ⟨hal-00798444⟩
    • Marin Bougeret, Pierre-Francois Dutot, Klaus Jansen, Christina Robenek, Denis Trystram. A fast 5/2-approximation algorithm for hierarchical scheduling. EUROPAR, 2010, Ischia, Italy. ⟨hal-00738518⟩
    • Marin Bougeret, Pierre-Francois Dutot, Klaus Jansen, Christina Otte, Denis Trystram. Approximation Algorithm for Multiple Strip Packing. WAOA'2009: 7th Workshop on Approximation and Online Algorithms, Sep 2009, Copenhague, Denmark. pp.37-48, ⟨10.1007/978-3-642-12450-1_4⟩. ⟨hal-00738614⟩
    • Marin Bougeret, Pierre-Francois Dutot, A. Goldman, Yanik Ngoko, Denis Trystram. Combining Multiple Heuristics on Discrete Resources. IPDPS, May 2009, Rome, Italy. pp.1-8, ⟨10.1109/IPDPS.2009.5160879⟩. ⟨hal-00688739⟩
    • Marin Bougeret, Pierre-Francois Dutot, Denis Trystram. The guess approximation technique and its application to the Discrete Resource Sharing Scheduling Problem. MAPSP, (the 9th workshop on Models and Algorithms for Planning and Scheduling Problems), 2009, Netherlands. ⟨hal-00806237⟩

    Preprints, Working Papers, ...1 document

    • Marin Bougeret, György Dósa, Noam Goldberg, Michael Poss. Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty. 2020. ⟨hal-02119351v3⟩

    Reports11 documents

    • Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau. Approximability and exact resolution of the Multidimensional Binary Vector Assignment problem. [Research Report] Lirmm; Montpellier II. 2016. ⟨lirmm-01310648⟩
    • Guillerme Duvillié, Marin Bougeret, Vincent Boudet, Trivikram Dokka, Rodolphe Giroudeau. On the complexity of Wafer-to-Wafer Integration. [Research Report] LIRMM. 2015. ⟨lirmm-01110027⟩
    • Rémi Watrigant, Nicolas Bousquet, Marin Bougeret, Rodolphe Giroudeau. Parameterized Complexity of the Sparsest k-Subgraph in Chordal Graphs. [Research Report] RR-13033, LIRMM. 2013. ⟨lirmm-00875132⟩
    • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. Approximating the Sparsest k-Subgraph in Chordal Graphs. 2013. ⟨hal-00868188⟩
    • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. NP-hardness of the Sparsest k-Subgraph Problem in Chordal Graphs. RR-12026, 2012. ⟨lirmm-00744655v3⟩
    • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König. Sum-Max Graph Partitioning Problem. RR-12015, 2012. ⟨lirmm-00694569v2⟩
    • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. The k-Sparsest Subgraph Problem. RR-12019, 2012. ⟨lirmm-00735713v2⟩
    • Marin Bougeret, Pierre-Francois Dutot, Denis Trystram, Klaus Jansen, Christina Robenek. Tight Approximation for Scheduling Parallel Job on Identical Clusters. RR-12001, 2012. ⟨lirmm-00656780⟩
    • Marin Bougeret, Henri Casanova, Yves Robert, Frédéric Vivien, Dounia Zaidouni. Using group replication for resilience on exascale systems. [Research Report] RR-7876, INRIA. 2012. ⟨hal-00668016v2⟩
    • Marin Bougeret, Henri Casanova, Yves Robert, Frédéric Vivien, Dounia Zaidouni. Using replication for resilience on exascale systems. [Research Report] RR-7830, INRIA. 2011. ⟨hal-00650325v2⟩
    • Marin Bougeret, Henri Casanova, Mikael Rabie, Yves Robert, Frédéric Vivien. Checkpointing strategies for parallel jobs. [Research Report] RR-7520, INRIA. 2011, pp.45. ⟨inria-00560582v3⟩

    Theses1 document

    • Marin Bougeret. Systèmes interactifs pour la résolution de problèmes complexes.. Autre [cs.OH]. Institut National Polytechnique de Grenoble - INPG, 2010. Français. ⟨tel-00543195⟩