- 23
- 17
- 13
- 4
- 4
- 4
- 3
- 2
- 1
MB
Marin Bougeret
71
Documents
Researcher identifiers
marin-bougeret
-
0000-0002-9910-4656
- IdRef : 197511686
Presentation
Publications
- 9
- 9
- 8
- 7
- 6
- 5
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 21
- 16
- 16
- 13
- 13
- 9
- 8
- 8
- 7
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 24
- 35
- 7
- 7
- 2
- 1
- 4
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 6
- 4
- 4
- 3
- 2
- 5
- 1
- 4
- 4
- 6
- 3
- 4
- 9
- 7
- 6
- 3
- 7
- 7
- 5
- 5
- 4
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
Feedback Vertex Set for Pseudo-disk Graphs in Subexponential FPT TimeWG 2024 - 50th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2024, Gozd Martuljek, Slovenia. pp.65-78, ⟨10.1007/978-3-031-75409-8_5⟩
Conference papers
lirmm-04938252v1
|
|
Kernelization Dichotomies for Hitting Subgraphs Under Structural ParameterizationsICALP 2024 - 51st International Colloquium on Automata, Languages, and Programming, Jul 2024, Tallinn, Estonia. pp.33:1-33:20, ⟨10.4230/LIPIcs.ICALP.2024.33⟩
Conference papers
lirmm-04700560v1
|
|
Kick the CliquesIPEC 2024 - 19th International Symposium on Parameterized and Exact Computation, Sep 2024, Londres, United Kingdom. pp.13:1-13:17, ⟨10.4230/LIPIcs.IPEC.2024.13⟩
Conference papers
lirmm-04938282v1
|
|
Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radiusSWAT 2024 - 19th Scandinavian Symposium and Workshops on Algorithm Theory, Jun 2024, Helsinki, Finland. pp.11:1-11:18, ⟨10.4230/LIPIcs.SWAT.2024.11⟩
Conference papers
hal-04149792v1
|
|
Kernelization for Graph Packing Problems via Rainbow MatchingSODA 2023 - 34th ACM/SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3654-3663, ⟨10.1137/1.9781611977554.ch139⟩
Conference papers
hal-04042995v1
|
|
Optimization problems in graphs with locational uncertaintyROADEF 2022 - 23e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne, France
Conference papers
hal-03595364v1
|
|
A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex CoverIPEC 2021 - 16th International Symposium on Parameterized and Exact Computation, Sep 2021, Virtual, Portugal. pp.4:1-4:19, ⟨10.4230/LIPIcs.IPEC.2021.4⟩
Conference papers
lirmm-03526704v1
|
|
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial KernelICALP 2020 - 47th International Colloquium on Automata, Languages, and Programming, Jul 2020, Saarbrücken, Germany. pp.16:1--16:19, ⟨10.4230/LIPIcs.ICALP.2020.16⟩
Conference papers
lirmm-02991230v1
|
|
Width Parameterizations for Knot-Free Vertex Deletion on DigraphsIPEC 2019 - 14th International Symposium on Parameterized and Exact Computation, Sep 2019, Munich, Germany. pp.2:1-2:16, ⟨10.4230/LIPIcs.IPEC.2019.2⟩
Conference papers
lirmm-03526774v1
|
|
|
Approximation results for makespan minimization with budgeted uncertaintyWAOA 2019 - 17th International Workshop on Approximation and Online Algorithms, Sep 2019, Munich, Germany. pp.60-71, ⟨10.1007/978-3-030-39479-0_5⟩
Conference papers
hal-02277357v1
|
|
Packing Arc-Disjoint Cycles in TournamentsMFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.27:1-27:14, ⟨10.4230/LIPIcs.MFCS.2019.27⟩
Conference papers
hal-02277436v1
|
|
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. pp.10:1--10:13, ⟨10.4230/LIPIcs.IPEC.2017.10⟩
Conference papers
lirmm-01730228v1
|
|
Triangle packing in (sparse) tournaments: approximation and kernelizationESA 2017 - 25th Annual European Symposium on Algorithms, Sep 2017, Vienne, Austria. pp.14:1--14:13, ⟨10.4230/LIPIcs.ESA.2017.14⟩
Conference papers
lirmm-01550313v1
|
Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment ProblemISCO: International Symposium on Combinatorial Optimization, May 2016, Vietri sul Mare, Italy. pp.148-159, ⟨10.1007/978-3-319-45587-7_13⟩
Conference papers
lirmm-01383110v1
|
|
On the Complexity of Wafer-to-Wafer IntegrationCIAC: International Conference on Algorithms and Complexity, May 2015, Paris, France. pp.208-220, ⟨10.1007/978-3-319-18173-8_15⟩
Conference papers
lirmm-01250989v1
|
|
|
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee ParameterizationsFCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.189-201, ⟨10.1007/978-3-319-22177-9_15⟩
Conference papers
lirmm-01250997v1
|
On Independent Set on B1-EPG GraphsWAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169, ⟨10.1007/978-3-319-28684-6_14⟩
Conference papers
lirmm-01264022v1
|
|
On the complexity of flexible interval schedulingMAPSP: Models and Algorithms for Planning and Scheduling Problems, Jun 2015, La Roche-en-Ardenne, Belgium
Conference papers
lirmm-01251104v1
|
|
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal GraphsSOFSEM: Theory and Practice of Computer Science, Jan 2014, Nový Smokovec, Slovakia. pp.150-161, ⟨10.1007/978-3-319-04298-5_14⟩
Conference papers
lirmm-01251025v1
|
|
Approximating the Sparsest $k$-Subgraph in Chordal GraphsWAOA: Workshop on Approximation and Online Algorithms, Sep 2013, Sophia Antipolis, France. pp.73-84, ⟨10.1007/978-3-319-08001-7_7⟩
Conference papers
lirmm-01283611v1
|
|
|
Approximation algorithms for the wafer to wafer integration problemWAOA 2012 - 10th Workshop on Approximation and Online Algorithms, Sep 2012, Ljubljana, Slovenia. pp.286-297, ⟨10.1007/978-3-642-38016-7_23⟩
Conference papers
lirmm-00805063v1
|
|
On the Approximability of the Sum-Max Graph Partitioning ProblemAPEX: Approximation, Parameterized and EXact algorithms, Feb 2012, Paris, France
Conference papers
lirmm-00675888v1
|
|
Sum-Max Graph Partitioning ProblemISCO: International Symposium on Combinatorial Optimization, Apr 2012, Athens, Greece. pp.297-308, ⟨10.1007/978-3-642-32147-4_27⟩
Conference papers
lirmm-00738554v1
|
|
Tight approximation for scheduling parallel jobs on identical clustersIPDPSW: International Parallel and Distributed Processing Symposim, May 2012, Shangai, China. pp.878-885, ⟨10.1109/IPDPSW.2012.108⟩
Conference papers
hal-00738499v1
|
|
Scheduling jobs on heterogeneous platformsCOCOON, 2011, Dallas, United States
Conference papers
hal-00738508v1
|
|
Using oracles for the design of efficient approximation algorithmsMAPSP: Models and Algorithms for Planning and Scheduling Problems, Jun 2011, Nymburk, Czech Republic
Conference papers
hal-00738513v1
|
|
Checkpointing strategies for parallel jobs.SuperComputing (SC) - International Conference for High Performance Computing, Networking, Storage and Analysis, 2011, 2011, United States. pp.1-11
Conference papers
hal-00738504v1
|
Approximating the Non-contiguous Multiple Organization Packing ProblemTCS: Theoretical Computer Science, 2010, Brisbane, Australia. pp.316-327, ⟨10.1007/978-3-642-15240-5₂3⟩
Conference papers
hal-00798444v1
|
|
|
Approximating the Non-contiguous Multiple Organization Packing Problem6th 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⟩
Conference papers
hal-01054450v1
|
|
A fast 5/2-approximation algorithm for hierarchical schedulingEUROPAR, 2010, Ischia, Italy
Conference papers
hal-00738518v1
|
A fast \frac52-approximation algorithm for hierarchical schedulingProceedings of the 16th International EuroPar Conference, 2010, Ischia, Italy. pp.157-167
Conference papers
hal-00953419v1
|
|
Approximation Algorithms for Multiple Strip PackingApproximation and Online Algorithms, 2010, Copenhagen, Denmark. pp.37-48, ⟨10.1007/978-3-642-12450-1_4⟩
Conference papers
hal-00953421v1
|
|
|
Approximation Algorithm for Multiple Strip PackingWAOA'2009: 7th Workshop on Approximation and Online Algorithms, Sep 2009, Copenhague, Denmark. pp.37-48, ⟨10.1007/978-3-642-12450-1_4⟩
Conference papers
hal-00738614v1
|
The guess approximation technique and its application to the Discrete Resource Sharing Scheduling ProblemMAPSP, (the 9th workshop on Models and Algorithms for Planning and Scheduling Problems), 2009, Netherlands
Conference papers
hal-00806237v1
|
|
Combining Multiple Heuristics on Discrete ResourcesIPDPS, May 2009, Rome, Italy. pp.1-8, ⟨10.1109/IPDPS.2009.5160879⟩
Conference papers
hal-00688739v1
|
Kick the cliques2024
Preprints, Working Papers, ...
hal-04636118v1
|
|
Systèmes interactifs pour la résolution de problèmes complexes.Autre [cs.OH]. Institut National Polytechnique de Grenoble - INPG, 2010. Français. ⟨NNT : ⟩
Theses
tel-00543195v1
|