( en | de | ru )

 

Disambiguation of "Bentert, Matthias"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient computation of optimal temporal walks under waiting-time constraints.

, , , and . Appl. Netw. Sci., 5 (1): 73 (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Holger Bentert

Matthias Meyer

Musterbasiertes Re-Engineering von Softwaresystemen. Uni Paderborn, (2009)

Matthias Hägele

Immunrekonstitution nach haploidenter hämatopoetischer Stammzelltransplantation: Einfluss eines CD3-CD19-depletierten gegenüber einem CD34-selektionierten Transplantat. Uni Tübingen, (2008)

Matthias Schmidt

Topographische Verteilung und Morphometrie von retinalen Mikrogliazellen. Uni Münster, (2009)

Matthias Möller

Antikaons in infinite nuclear matter and nuclei. TU Darmstadt, (2007)
 

Other publications of authors with the same name

Using a geometric lens to find k disjoint shortest paths., , , and . CoRR, (2020)Good Things Come to Those Who Swap Objects on Paths., , , and . CoRR, (2019)Parameterized Complexity of Diameter., and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 50-61. Springer, (2019)Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity., , , , and . Theory Comput. Syst., 65 (7): 1141-1142 (2021)Polynomial-time data reduction for weighted problems beyond additive goal functions., , , , and . Discret. Appl. Math., (March 2023)Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments., , , , and . INFORMS J. Comput., 34 (1): 55-75 (2022)Using a Geometric Lens to Find \(k\)-Disjoint Shortest Paths., , , and . SIAM J. Discret. Math., 37 (3): 1674-1703 (September 2023)Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review., , and . J. Sched., 22 (1): 3-20 (2019)Parameterized Complexity of Min-Power Asymmetric Connectivity., , , , and . Theory Comput. Syst., 64 (7): 1158-1182 (2020)Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions., , , , and . CoRR, (2019)