41 - 59 out of 59Page size: 20
  1. 2015

  2. Complexity of arc routing problems

    van Bevern, R., Niedermeier, R., Sorge, M. & Weller, M., 2015, Arc Routing: Problems, Methods, and Applications. Corberan, Á. & Laporte, G. (eds.). Society for Industrial and Applied Mathematics Publications, p. 19-52 34 p. (MOS-SIAM Series on Optimization; vol. 20).

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

  3. 2014

  4. Constant-factor approximations for Capacitated Arc Routing without triangle inequality

    Van Bevern, R., Hartung, S., Nichterlein, A. & Sorge, M., 1 Jan 2014, In: Operations Research Letters. 42, 4, p. 290-292 3 p.

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

  5. Network-based dissolution

    Van Bevern, R., Bredereck, R., Chen, J., Froese, V., Niedermeier, R. & Woeginger, G. J., 1 Jan 2014, Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings. PART 2 ed. Springer, p. 69-80 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8635 LNCS, no. PART 2).

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

  6. Star partitions of perfect graphs

    Van Bevern, R., Bredereck, R., Bulteau, L., Chen, J., Froese, V., Niedermeier, R. & Woeginger, G. J., 1 Jan 2014, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1 ed. Springer, p. 174-185 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8572 LNCS, no. PART 1).

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

  7. Towards optimal and expressive kernelization for d-hitting set

    Van Bevern, R., 1 Jan 2014, In: Algorithmica. 70, 1, p. 129-147 19 p.

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

  8. 2013

  9. Myhill-Nerode methods for hypergraphs

    Van Bevern, R., Fellows, M. R., Gaspers, S. & Rosamond, F. A., 1 Dec 2013, Algorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings. p. 372-382 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8283 LNCS).

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

  10. 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

  11. Parameterized complexity of DAG partitioning

    Van Bevern, R., Bredereck, R., Chopin, M., Hartung, S., Hüffner, F., Nichterlein, A. & Suchý, O., 9 Sept 2013, Algorithms and Complexity - 8th International Conference, CIAC 2013, Proceedings. p. 49-60 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7878 LNCS).

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

  12. On the parameterized complexity of computing graph bisections

    Van Bevern, R., Feldmann, A. E., Sorge, M. & Suchý, O., 1 Jan 2013, Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Revised Papers. Springer, p. 76-87 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8165 LNCS).

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

  13. 2012

  14. Interval scheduling and colorful independent sets

    Van Bevern, R., Mnich, M., Niedermeier, R. & Weller, M., 31 Dec 2012, Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings. p. 247-256 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7676 LNCS).

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

  15. 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

  16. Towards optimal and expressive kernelization for d-hitting set

    Van Bevern, R., 6 Sept 2012, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7434 LNCS, p. 121-132 12 p.

    Research output: Contribution to journal › Conference article › peer-review

  17. Linear-time computation of a linear problem kernel for dominating set on planar graphs

    Van Bevern, R., Hartung, S., Kammer, F., Niedermeier, R. & Weller, M., 22 Mar 2012, Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Revised Selected Papers. p. 194-206 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7112 LNCS).

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

  18. 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

  19. 2011

  20. From few components to an Eulerian graph by adding arcs

    Sorge, M., Van Bevern, R., Niedermeier, R. & Weller, M., 1 Dec 2011, Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Revised Papers. p. 307-318 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6986 LNCS).

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

  21. 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

  22. Parameterized algorithmics for finding connected motifs in biological networks

    Betzler, N., Van Bevern, R., Fellows, M. R., Komusiewicz, C. & Niedermeier, R., 3 Aug 2011, In: IEEE/ACM Transactions on Computational Biology and Bioinformatics. 8, 5, p. 1296-1308 13 p., 5708132.

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

  23. 2010

  24. Measuring indifference: Unit interval vertex deletion

    Van Bevern, R., Komusiewicz, C., Moser, H. & Niedermeier, R., 21 Dec 2010, Graph-Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Revised Papers. p. 232-243 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6410 LNCS).

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

  25. Kernelization through tidying: A case study based on s-plex cluster vertex deletion

    Van Bevern, R., Moser, H. & Niedermeier, R., 18 Jun 2010, LATIN 2010: Theoretical Informatics - 9th Latin American Symposium, Proceedings. p. 527-538 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6034 LNCS).

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

Previous 1 2 3 Next

ID: 3456448