( en | de | ru )

 

Disambiguation of "Bentert, Matthias"

Author of the publication

copydeleteadd this publication to your clipboard
A multivariate complexity analysis of the material consumption scheduling problem.

, , , , and . J. Sched., 26 (4): 369-382 (August 2023)

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

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)On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model., , and . IPEC, volume 285 of LIPIcs, page 4:1-4:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Fair Short Paths in Vertex-Colored Graphs., , and . AAAI, page 12346-12354. AAAI Press, (2023)Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints., , , and . COMPLEX NETWORKS (2), volume 882 of Studies in Computational Intelligence, page 494-506. Springer, (2019)An Adaptive Version of Brandes' Algorithm for Betweenness Centrality., , , , and . ISAAC, volume 123 of LIPIcs, page 36:1-36:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Listing All Maximal k-Plexes in Temporal Graphs., , , , , and . ACM Journal of Experimental Algorithmics, 24 (1): 1.13:1-1.13:27 (2019)Efficient computation of optimal temporal walks under waiting-time constraints., , , and . Appl. Netw. Sci., 5 (1): 73 (2020)A multivariate complexity analysis of the material consumption scheduling problem., , , , and . J. Sched., 26 (4): 369-382 (August 2023)Comparing Election Methods Where Each Voter Ranks Only Few Candidates., and . AAAI, page 2218-2225. AAAI Press, (2020)