31 - 40 out of 59Page size: 10
Sort by: Title

  1. Myhill–Nerode Methods for Hypergraphs

    van Bevern, R., Downey, R. G., Fellows, M. R., Gaspers, S. & Rosamond, F. A., 1 Dec 2015, In: Algorithmica. 73, 4, p. 696-729 34 p.

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

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

  3. Network-based vertex dissolution

    Van Bevern, R., Bredereck, R., Chen, J., Froese, V., Niedermeier, R. & Woeginger, G. J., 1 Jan 2015, In: SIAM Journal on Discrete Mathematics. 29, 2, p. 888-914 27 p.

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

  4. On (1+ε) -approximate data reduction for the rural postman problem

    van Bevern, R., Fluschnik, T. & Tsidulko, O. Y., 1 Jan 2019, Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings. Khachay, M., Pardalos, P. & Kochetov, Y. (eds.). Springer, p. 279-294 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11548 LNCS).

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

  5. On approximate data reduction for the Rural Postman Problem: Theory and experiments

    van Bevern, R., Fluschnik, T. & Tsidulko, O. Y., 1 Dec 2020, In: Networks. 76, 4, p. 485-508 24 p., e21985.

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

  6. On the Parameterized Complexity of Computing Balanced Partitions in Graphs

    van Bevern, R., Feldmann, A. E., Sorge, M. & Suchý, O., 8 Jul 2015, In: Theory of Computing Systems. 57, 1

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

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

  8. Optimal-size problem kernels for d-Hitting Set in linear time and space

    van Bevern, R. & Smirnov, P. V., 1 Nov 2020, In: Information Processing Letters. 163, 9 p., 105998.

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

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

  10. Parameterized algorithms and data reduction for safe convoy routing

    Van Bevern, R., Fluschnik, T. & Tsidulko, O. Y., 1 Aug 2018, 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2018. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 65. 10

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

Previous 1 2 3 4 5 6 Next

ID: 3456448