Marin Bougeret

From MaRDI portal
Person:260265

Available identifiers

zbMath Open bougeret.marinMaRDI QIDQ260265

List of research outcomes

PublicationDate of PublicationType
Optimization Problems in Graphs with Locational Uncertainty2024-02-28Paper
https://portal.mardi4nfdi.de/entity/Q61521602024-02-12Paper
Single machine robust scheduling with budgeted uncertainty2023-06-28Paper
Parameterized complexity of computing maximum minimal blocking and hitting sets2023-02-16Paper
https://portal.mardi4nfdi.de/entity/Q58755342023-02-03Paper
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel2022-11-15Paper
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty2022-11-09Paper
Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds2022-10-27Paper
https://portal.mardi4nfdi.de/entity/Q50923862022-07-21Paper
Approximation results for makespan minimization with budgeted uncertainty2021-09-28Paper
Packing arc-disjoint cycles in tournaments2021-04-19Paper
Approximation results for makespan minimization with budgeted uncertainty2020-08-24Paper
https://portal.mardi4nfdi.de/entity/Q51116992020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51118692020-05-27Paper
On independent set in \(B_1\)-EPG graphs2020-04-21Paper
Approximating robust bin packing with budgeted uncertainty2020-01-16Paper
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?2019-09-10Paper
Robust scheduling with budgeted uncertainty2019-05-17Paper
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations2018-12-10Paper
Approximability and exact resolution of the multidimensional binary vector assignment problem2018-12-06Paper
On the complexity of wafer-to-wafer integration2018-05-24Paper
The complexity of partitioning into disjoint cliques and a triangle-free graph2017-03-15Paper
Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem2016-11-30Paper
Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs2016-03-21Paper
On Independent Set on B1-EPG Graphs2016-02-26Paper
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations2015-09-29Paper
On the Complexity of Wafer-to-Wafer Integration2015-09-21Paper
Improved approximation algorithms for scheduling parallel jobs on identical clusters2015-09-16Paper
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs2015-01-13Paper
Approximating the Sparsest k-Subgraph in Chordal Graphs2014-09-02Paper
On the sum-max graph partitioning problem2014-06-06Paper
Moderately exponential approximation for makespan minimization on related machines2014-01-13Paper
Approximation Algorithms for the Wafer to Wafer Integration Problem2013-09-13Paper
Sum-Max Graph Partitioning Problem2012-11-02Paper
APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS2012-08-27Paper
Scheduling Jobs on Heterogeneous Platforms2011-08-17Paper
APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM2011-05-10Paper
Approximating the Non-contiguous Multiple Organization Packing Problem2010-10-27Paper
Approximation Algorithms for Multiple Strip Packing2010-05-11Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Marin Bougeret