14881 - 14890 out of 27,316Page size: 10
  1. 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 journalArticlepeer-review

  2. 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. (OpenAccess Series in Informatics; vol. 65).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  3. Parameterized algorithms and data reduction for the short secluded s-t-path problem

    van Bevern, R., Fluschnik, T. & Tsidulko, O. Y., Jan 2020, In: Networks. 75, 1, p. 34-63 30 p.

    Research output: Contribution to journalArticlepeer-review

  4. Parameterized algorithms for power-efficient connected symmetric wireless sensor networks

    Bentert, M., van Bevern, R., Nichterlein, A. & Niedermeier, R., 2017, Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Revised Selected Papers. Springer, Vol. 10718 LNCS. p. 26-40 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10718 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  5. Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments

    Bentert, M., van Bevern, R., Nichterlein, A., Niedermeier, R. & Smirnov, P. V., Jan 2022, In: Informs journal on computing. 34, 1, p. 55-75 21 p.

    Research output: Contribution to journalArticlepeer-review

  6. 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 proceedingConference contributionResearchpeer-review

  7. Parameterized complexity of machine scheduling: 15 open problems

    Mnich, M. & van Bevern, R., 1 Dec 2018, In: Computers and Operations Research. 100, p. 254-261 8 p.

    Research output: Contribution to journalReview articlepeer-review

  8. Parameterizing edge modification problems above lower bounds

    Van Bevern, R., Froese, V. & Komusiewicz, C., 1 Jan 2016, Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, Proceedings. Woeginger, G. J. & Kulikov, A. S. (eds.). Springer, p. 57-72 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9691).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  9. Parameterizing Edge Modification Problems Above Lower Bounds

    van Bevern, R., Froese, V. & Komusiewicz, C., 1 Apr 2018, In: Theory of Computing Systems. 62, 3, p. 739-770 32 p.

    Research output: Contribution to journalArticlepeer-review

  10. Parameter Optimization for Restarted Mixed Precision Iterative Sparse Solver

    Пролубников, А. В., 6 Jul 2025, Lecture Notes in Computer Science. Springer, p. 374-388 15 p. (Lecture Notes in Computer Science; vol. 15681 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingChapterResearchpeer-review