scientific article; zbMATH DE number 7764095
From MaRDI portal
DOI10.4230/lipics.ipec.2020.4arXiv2007.09023MaRDI QIDQ6068238
Marieke van der Wegen, Hans L. Bodlaender
Publication date: 13 November 2023
Full work available at URL: https://arxiv.org/abs/2007.09023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Related Items
Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation}, A multivariate complexity analysis of the material consumption scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Scheduling and fixed-parameter tractability
- One-machine generalized precedence constrained scheduling problems
- Parameterized complexity of machine scheduling: 15 open problems
- On the parametric complexity of schedules to minimize tardy tasks.
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues]
- \(W[2\)-hardness of precedence constrained \(K\)-processor scheduling]
- Scheduling identical jobs with chain precedence constraints on two uniform machines
- A comment on scheduling on uniform machines under chain-type precedence constraints
- Parameterized complexity of a coupled-task scheduling problem
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Collaborating with Hans: Some Remaining Wonderments
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
