( en | de | ru )

 

Disambiguation of "Bentert, Matthias"

Author of the publication

copydeleteadd this publication to your clipboard
Two-Sets Cut-Uncut on Planar Graphs.

, , , , and . ICALP, volume 297 of LIPIcs, page 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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

Parameterized Complexity of Diameter., and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 50-61. Springer, (2019)Good Things Come to Those Who Swap Objects on Paths., , , and . CoRR, (2019)The Parameterized Complexity Landscape of Two-Sets Cut-Uncut., , , and . CoRR, (2024)Parameterized Complexity of Min-Power Asymmetric Connectivity., , , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 85-96. Springer, (2019)Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences., , , and . SAGT, volume 13584 of Lecture Notes in Computer Science, page 436-453. Springer, (2022)The Complexity of Gerrymandering over Graphs: Paths and Trees., , and . WG, volume 12911 of Lecture Notes in Computer Science, page 195-206. Springer, (2021)Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication., , and . ESA, volume 274 of LIPIcs, page 16:1-16:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Cluster Editing with Overlapping Communities., , , , and . IPEC, volume 285 of LIPIcs, page 2:1-2:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Using a Geometric Lens to Find k Disjoint Shortest Paths., , , and . ICALP, volume 198 of LIPIcs, page 26:1-26:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)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)