The following pages link to René van Bevern (Q247179):
Displaying 21 items.
- \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Constant-factor approximations for capacitated arc routing without triangle inequality (Q1785236) (← links)
- A new view on rural postman based on Eulerian extension and matching (Q1932348) (← links)
- (Q4634388) (← links)
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- On data reduction for dynamic vector bin packing (Q6047700) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments (Q6262800) (← links)
- A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number (Q6405337) (← links)
