1 - 10 out of 60Page size: 10
Sort by: Title

  1. A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem

    van Bevern, R. & Slugina, V. A., Nov 2020, In: Historia Mathematica. 53, p. 118-127 10 p.

    Research output: Contribution to journal › Article › peer-review

  2. An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times

    van Bevern, R. A., Pyatkin, A. V. & Sevastyanov, S., 1 Jan 2019, In: Сибирские электронные математические известия. 16, p. 42-84 43 p.

    Research output: Contribution to journal › Article › peer-review

  3. A new view on rural postman based on Eulerian extension and matching

    Sorge, M., Van Bevern, R., Niedermeier, R. & Weller, M., 28 Nov 2011, Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Revised Selected Papers. p. 310-323 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7056 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  4. A new view on Rural Postman based on Eulerian Extension and Matching

    Sorge, M., Van Bevern, R., Niedermeier, R. & Weller, M., 1 Oct 2012, In: Journal of Discrete Algorithms. 16, p. 12-33 22 p.

    Research output: Contribution to journal › Article › peer-review

  5. A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments

    van Bevern, R., Komusiewicz, C. & Sorge, M., 1 Oct 2017, In: Networks. 70, 3, p. 262-278 17 p.

    Research output: Contribution to journal › Article › peer-review

  6. A parameterized complexity analysis of combinatorial feature selection problems

    Froese, V., Van Bevern, R., Niedermeier, R. & Sorge, M., 15 Oct 2013, Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings. p. 445-456 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8087 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  7. A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack

    van Bevern, R., Niedermeier, R. & Suchý, O., 1 Jun 2017, In: Journal of Scheduling. 20, 3, p. 255-265 11 p.

    Research output: Contribution to journal › Article › peer-review

  8. Approximability and parameterized complexity of multicover by c-intervals

    Van Bevern, R., Chen, J., Hüffner, F., Kratsch, S., Talmon, N. & Woeginger, G. J., 1 Oct 2015, In: Information Processing Letters. 115, 10, p. 744-749 6 p.

    Research output: Contribution to journal › Article › peer-review

  9. Approximation algorithms for mixed, windy, and capacitated arc routing problems

    Van Bevern, R., Komusiewicz, C. & Sorge, M., 1 Sept 2015, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2015. Schmidt, M. & Italiano, G. F. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 130-143 14 p. (OpenAccess Series in Informatics; vol. 48).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  10. Approximation and tidying—a problem kernel for s-Plex cluster vertex deletion

    van Bevern, R., Moser, H. & Niedermeier, R., 1 Jan 2012, In: Algorithmica. 62, 3-4, p. 930-950 21 p.

    Research output: Contribution to journal › Article › peer-review

Previous 1 2 3 4 5 6 Next

ID: 3456448