- 7
- 4
- 2
MB
Marin Bougeret
13
Documents
Identifiants chercheurs
- marin-bougeret
- 0000-0002-9910-4656
- IdRef : 197511686
Présentation
Publications
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 13
- 13
- 4
- 2
- 2
- 10
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 3
- 5
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizationsDiscrete Mathematics and Theoretical Computer Science, 2017, FCT '15, 19 (4), ⟨10.23638/DMTCS-19-4-3⟩
Article dans une revue
lirmm-01889400v1
|
|
Approximating the sparsest $k$-subgraph in chordal graphTheory of Computing Systems, 2016, 58 (1), pp.111-132. ⟨10.1007/s00224-014-9568-2⟩
Article dans une revue
lirmm-01383119v1
|
|
On the sum-max graph partitioning problemTheoretical Computer Science, 2014, Combinatorial Optimization: Theory of algorithms and Complexity, 540, pp.143-155. ⟨10.1016/j.tcs.2013.11.024⟩
Article dans une revue
lirmm-01251016v1
|
|
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⟩
Communication dans un congrès
lirmm-01250997v1
|
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⟩
Communication dans un congrès
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⟩
Communication dans un congrès
lirmm-01283611v1
|
|
|
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⟩
Communication dans un congrès
lirmm-00738554v1
|
|
On the Approximability of the Sum-Max Graph Partitioning ProblemAPEX: Approximation, Parameterized and EXact algorithms, Feb 2012, Paris, France
Communication dans un congrès
lirmm-00675888v1
|
|
Parameterized Complexity of the Sparsest k-Subgraph in Chordal Graphs[Research Report] RR-13033, LIRMM. 2013
Rapport
lirmm-00875132v1
|
|
Approximating the Sparsest k-Subgraph in Chordal Graphs2013
Rapport
hal-00868188v1
|
|
Sum-Max Graph Partitioning ProblemRR-12015, 2012
Rapport
lirmm-00694569v2
|
|
The k-Sparsest Subgraph ProblemRR-12019, 2012
Rapport
lirmm-00735713v2
|
|
NP-hardness of the Sparsest k-Subgraph Problem in Chordal GraphsRR-12026, 2012
Rapport
lirmm-00744655v3
|