41 - 50 out of 60Page size: 10
  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.). SIAM 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-Verlag GmbH and Co. KG, 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-Verlag GmbH and Co. KG, 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. Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications

    van Bevern, R., 2014, Universitätsverlag der TU Berlin. 229 p. (Foundations of Computing; vol. 1)

    Research output: Book/Report › Book › Research › peer-review

  9. 2013

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

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

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

  13. 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-Verlag GmbH and Co. KG, 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

Previous 1 2 3 4 5 6 Next

ID: 3456448