Parameterized complexity of machine scheduling: 15 open problems von Mnich, Matthias, van Bevern, René

Volltext

Interval scheduling and colorful independent sets von van Bevern, René, Mnich, Matthias, Niedermeier, Rolf, Weller, Mathias

Volltext

Inductive k-independent graphs and c-colorable subgraphs in scheduling: a review von Bentert, Matthias, van Bevern, René, Niedermeier, Rolf

Volltext

A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack von van Bevern, René, Niedermeier, Rolf, Suchý, Ondřej

Volltext

On data reduction for dynamic vector bin packing von van Bevern, René, Melnikov, Andrey, Smirnov, Pavel V., Tsidulko, Oxana Yu

Volltext

Special Issue on Computer Science Symposium in Russia (2019) von van Bevern, René, Kucherov, Gregory

Volltext

Constant-factor approximations for Capacitated Arc Routing without triangle inequality von van Bevern, René, Hartung, Sepp, Nichterlein, André, Sorge, Manuel

Volltext

Computer Science - Theory and Applications: 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings von van Bevern, René, Kucherov, Gregory

Volltext

On approximate data reduction for the Rural Postman Problem: Theory and experiments von Bevern, René, Fluschnik, Till, Tsidulko, Oxana Yu

Volltext

Parameterized algorithms and data reduction for the short secluded s‐t‐path problem von Bevern, René, Fluschnik, Till, Tsidulko, Oxana Yu

Volltext

Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments von Bentert, Matthias, van Bevern, René, Nichterlein, André, Niedermeier, Rolf, Smirnov, Pavel V.

Volltext

Parameterizing Edge Modification Problems Above Lower Bounds von van Bevern, René, Froese, Vincent, Komusiewicz, Christian

Volltext

Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints von van Bevern, René, Tsidulko, Oxana Yu, Zschoche, Philipp

Volltext

Computer Science – Theory and Applications: 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019, Proceedings

Volltext

A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem von van Bevern, René, Slugina, Viktoriia A.

Volltext

Completing Partial Schedules for Open Shop with Unit Processing Times and Routing von van Bevern, René, Pyatkin, Artem V.

Volltext

A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number von van Bevern, René, Skachkov, Daniel A.

Volltext

Network-Based Vertex Dissolution von van Bevern, René, Bredereck, Robert, Chen, Jiehua, Froese, Vincent, Niedermeier, Rolf, Woeginger, Gerhard J.

Volltext

Optimal-size problem kernels for d-Hitting Set in linear time and space von van Bevern, René, Smirnov, Pavel V.

Volltext

h -Index manipulation by undoing merges von van Bevern, René, Komusiewicz, Christian, Molter, Hendrik, Niedermeier, Rolf, Sorge, Manuel, Walsh, Toby

Volltext