The following pages link to Marin Bougeret (Q260265):
Displayed 40 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- Moderately exponential approximation for makespan minimization on related machines (Q392019) (← links)
- Improved approximation algorithms for scheduling parallel jobs on identical clusters (Q496005) (← links)
- The complexity of partitioning into disjoint cliques and a triangle-free graph (Q516874) (← links)
- Approximability and exact resolution of the multidimensional binary vector assignment problem (Q1631661) (← links)
- (Q1751189) (redirect page) (← links)
- On the complexity of wafer-to-wafer integration (Q1751193) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- On independent set in \(B_1\)-EPG graphs (Q2174555) (← links)
- Approximating robust bin packing with budgeted uncertainty (Q2285083) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Robust scheduling with budgeted uncertainty (Q2414457) (← links)
- On the sum-max graph partitioning problem (Q2453173) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
- On Independent Set on B1-EPG Graphs (Q2788999) (← links)
- Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem (Q2835671) (← links)
- Approximation Algorithms for the Wafer to Wafer Integration Problem (Q2848932) (← links)
- APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS (Q2905284) (← links)
- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (Q2938098) (← links)
- On the Complexity of Wafer-to-Wafer Integration (Q2947021) (← links)
- Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations (Q2947879) (← links)
- APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM (Q2997925) (← links)
- Scheduling Jobs on Heterogeneous Platforms (Q3087956) (← links)
- Approximating the Non-contiguous Multiple Organization Packing Problem (Q3163893) (← links)
- Sum-Max Graph Partitioning Problem (Q3167634) (← links)
- Approximating the Sparsest k-Subgraph in Chordal Graphs (Q3188867) (← links)
- Approximation Algorithms for Multiple Strip Packing (Q3558911) (← links)
- Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty (Q5046625) (← links)
- Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
- Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
- Triangle packing in (sparse) tournaments: approximation and kernelization (Q5111699) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
- Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. (Q5875534) (← links)
- Approximation results for makespan minimization with budgeted uncertainty (Q5918896) (← links)
- Approximation results for makespan minimization with budgeted uncertainty (Q5919095) (← links)
- (Q6152160) (← links)
- Single machine robust scheduling with budgeted uncertainty (Q6161900) (← links)
- Optimization Problems in Graphs with Locational Uncertainty (Q6203503) (← links)
- (Arc-disjoint) cycle packing in tournament: classical and parameterized complexity (Q6297948) (← links)