default search action
Marin Bougeret
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c27]Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. ICALP 2024: 33:1-33:20 - [c26]Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond:
Kick the Cliques. IPEC 2024: 13:1-13:17 - [c25]Gaétan Berthe
, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond:
Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius. SWAT 2024: 11:1-11:18 - [i18]Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations. CoRR abs/2404.16695 (2024) - [i17]Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond:
Kick the cliques. CoRR abs/2407.01465 (2024) - [i16]Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond:
Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time. CoRR abs/2410.23878 (2024) - 2023
- [j22]Júlio Araújo
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets. Algorithmica 85(2): 444-491 (2023) - [j21]Marin Bougeret, Jérémy Omer
Optimization Problems in Graphs with Locational Uncertainty. INFORMS J. Comput. 35(3): 578-592 (2023) - [j20]Marin Bougeret, Artur Alves Pessoa, Michael Poss
Single machine robust scheduling with budgeted uncertainty. Oper. Res. Lett. 51(2): 137-141 (2023) - [c24]Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht
Kernelization for Graph Packing Problems via Rainbow Matching. SODA 2023: 3654-3663 - [i15]Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond:
Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments. CoRR abs/2306.17710 (2023) - 2022
- [j19]Júlio Araújo
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds. Algorithmica 84(11): 3365-3406 (2022) - [j18]Marin Bougeret, György Dósa, Noam Goldberg, Michael Poss
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty. SIAM J. Discret. Math. 36(4): 2534-2552 (2022) - [j17]Marin Bougeret
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. SIAM J. Discret. Math. 36(4): 2737-2773 (2022) - [i14]Marin Bougeret, Jérémy Omer, Michael Poss:
Approximating optimization problems in graphs with locational uncertainty. CoRR abs/2206.08187 (2022) - [i13]Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Kernelization for Graph Packing Problems via Rainbow Matching. CoRR abs/2207.06874 (2022) - 2021
- [j16]Stéphane Bessy, Marin Bougeret
Packing Arc-Disjoint Cycles in Tournaments. Algorithmica 83(5): 1393-1420 (2021) - [j15]Marin Bougeret
Approximation Results for Makespan Minimization with Budgeted Uncertainty. Theory Comput. Syst. 65(6): 903-915 (2021) - [c23]Júlio Araújo
A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover. IPEC 2021: 4:1-4:19 - [i12]Júlio Araújo, Marin Bougeret
Introducing lop-kernels: a framework for kernelization lower bounds. CoRR abs/2102.02484 (2021) - [i11]Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
Parameterized complexity of computing maximum minimal blocking and hitting sets. CoRR abs/2102.03404 (2021) - [i10]Marin Bougeret, Jérémy Omer, Michael Poss:
Optimization problems in graphs with locational uncertainty. CoRR abs/2109.00389 (2021) - 2020
- [j14]Stéphane Bessy, Marin Bougeret
On independent set in B1-EPG graphs. Discret. Appl. Math. 278: 62-72 (2020) - [c22]Marin Bougeret
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. ICALP 2020: 16:1-16:19 - [i9]Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. CoRR abs/2004.12865 (2020)
2010 – 2019
- 2019
- [j13]Marin Bougeret
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? Algorithmica 81(10): 4043-4068 (2019) - [j12]Marin Bougeret
Robust scheduling with budgeted uncertainty. Discret. Appl. Math. 261: 93-107 (2019) - [c21]Stéphane Bessy, Marin Bougeret
Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. IPEC 2019: 2:1-2:16 - [c20]Stéphane Bessy, Marin Bougeret
Packing Arc-Disjoint Cycles in Tournaments. MFCS 2019: 27:1-27:14 - [c19]Aniket Basu Roy
Approximating Robust Bin Packing with Budgeted Uncertainty. WADS 2019: 71-84 - [c18]Marin Bougeret
Approximation Results for Makespan Minimization with Budgeted Uncertainty. WAOA 2019: 60-71 - [i8]Marin Bougeret
Approximation results for makespan minimization with budgeted uncertainty. CoRR abs/1905.08592 (2019) - [i7]Stéphane Bessy, Marin Bougeret
Width Parameterizations for Knot-free Vertex Deletion on Digraphs. CoRR abs/1910.01783 (2019) - 2018
- [j11]Marin Bougeret
Approximability and exact resolution of the multidimensional binary vector assignment problem. J. Comb. Optim. 36(3): 1059-1073 (2018) - [i6]Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut:
(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity. CoRR abs/1802.06669 (2018) - 2017
- [j10]Marin Bougeret
The complexity of partitioning into disjoint cliques and a triangle-free graph. Discret. Appl. Math. 217: 438-445 (2017) - [j9]Marin Bougeret
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. Discret. Math. Theor. Comput. Sci. 19(4) (2017) - [c17]Stéphane Bessy, Marin Bougeret
Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization. ESA 2017: 14:1-14:13 - [c16]Marin Bougeret
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?. IPEC 2017: 10:1-10:13 - [i5]Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut:
Triangle packing in (sparse) tournaments: approximation and kernelization. CoRR abs/1707.04220 (2017) - 2016
- [j8]Marin Bougeret
On the complexity of Wafer-to-Wafer Integration. Discret. Optim. 22: 255-269 (2016) - [j7]Rémi Watrigant, Marin Bougeret
Approximating the Sparsest k-Subgraph in Chordal Graphs. Theory Comput. Syst. 58(1): 111-132 (2016) - [c15]Marin Bougeret
Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem. ISCO 2016: 148-159 - [i4]Marin Bougeret
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? CoRR abs/1609.08095 (2016) - 2015
- [j6]Marin Bougeret
Improved approximation algorithms for scheduling parallel jobs on identical clusters. Theor. Comput. Sci. 600: 70-85 (2015) - [c14]Guillerme Duvillié
On the Complexity of Wafer-to-Wafer Integration. CIAC 2015: 208-220 - [c13]Marin Bougeret
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations. FCT 2015: 189-201 - [c12]Marin Bougeret
On Independent Set on B1-EPG Graphs. WAOA 2015: 158-169 - [i3]Marin Bougeret
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. CoRR abs/1506.03282 (2015) - [i2]Marin Bougeret
On independent set on B1-EPG graphs. CoRR abs/1510.00598 (2015) - [i1]Marin Bougeret
The complexity of partitioning into disjoint cliques and a triangle-free graph. CoRR abs/1512.02207 (2015) - 2014
- [j5]Marin Bougeret
Using group replication for resilience on exascale systems. Int. J. High Perform. Comput. Appl. 28(2): 210-224 (2014) - [j4]Rémi Watrigant, Marin Bougeret
On the sum-max graph partitioning problem. Theor. Comput. Sci. 540: 143-155 (2014) - [c11]Marin Bougeret
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. SOFSEM 2014: 150-161 - 2013
- [j3]Marin Bougeret
Moderately exponential approximation for makespan minimization on related machines. Theor. Comput. Sci. 511: 32-41 (2013) - [c10]Rémi Watrigant, Marin Bougeret
Approximating the Sparsest k-Subgraph in Chordal Graphs. WAOA 2013: 73-84 - 2012
- [c9]Marin Bougeret
Tight Approximation for Scheduling Parallel Jobs on Identical Clusters. IPDPS Workshops 2012: 878-885 - [c8]Rémi Watrigant, Marin Bougeret
Sum-Max Graph Partitioning Problem. ISCO 2012: 297-308 - [c7]Trivikram Dokka
Approximation Algorithms for the Wafer to Wafer Integration Problem. WAOA 2012: 286-297 - 2011
- [j2]Marin Bougeret
Approximation Algorithms for Multiple Strip Packing and Scheduling Parallel Jobs in Platforms. Discret. Math. Algorithms Appl. 3(4): 553-586 (2011) - [j1]Marin Bougeret, Pierre-François Dutot, Alfredo Goldman
Approximating the Discrete Resource Sharing Scheduling Problem. Int. J. Found. Comput. Sci. 22(3): 639-656 (2011) - [c6]Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram:
Scheduling Jobs on Heterogeneous Platforms. COCOON 2011: 271-283 - [c5]Marin Bougeret, Henri Casanova, Mikaël Rabie, Yves Robert
Checkpointing strategies for parallel jobs. SC 2011: 33:1-33:11 - 2010
- [b1]Marin Bougeret:
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). Grenoble Institute of Technology, France, 2010 - [c4]Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram:
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling. Euro-Par (1) 2010: 157-167 - [c3]Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram:
Approximating the Non-contiguous Multiple Organization Packing Problem. IFIP TCS 2010: 316-327
2000 – 2009
- 2009
- [c2]Marin Bougeret, Pierre-François Dutot, Alfredo Goldman
Combining multiple heuristics on discrete resources. IPDPS 2009: 1-8 - [c1]Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram:
Approximation Algorithms for Multiple Strip Packing. WAOA 2009: 37-48
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 01:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: