( en | de | ru )

 

Disambiguation of "Bentert, Matthias"

Author of the publication

copydeleteadd this publication to your clipboard
Listing All Maximal k-Plexes in Temporal Graphs.

, , , , , and . ACM Journal of Experimental Algorithmics, 24 (1): 1.13:1-1.13:27 (2019)

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

Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions., , , , and . CoRR, (2019)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)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)Fair Short Paths in Vertex-Colored Graphs., , and . AAAI, page 12346-12354. AAAI Press, (2023)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)Good Things Come to Those Who Swap Objects on Paths., , , and . CoRR, (2019)Using a geometric lens to find k disjoint shortest paths., , , and . CoRR, (2020)Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments., , , , and . INFORMS J. Comput., 34 (1): 55-75 (2022)Polynomial-time data reduction for weighted problems beyond additive goal functions., , , , and . Discret. Appl. Math., (March 2023)