Matthias Bentert

From MaRDI portal
Person:1679961

Available identifiers

zbMath Open bentert.matthiasMaRDI QIDQ1679961

List of research outcomes





PublicationDate of PublicationType
Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication2025-01-06Paper
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences2024-01-11Paper
https://portal.mardi4nfdi.de/entity/Q60872082023-11-14Paper
A multivariate complexity analysis of the material consumption scheduling problem2023-08-28Paper
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths2023-08-11Paper
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences2023-07-28Paper
On reachable assignments in cycles2023-03-31Paper
Polynomial-time data reduction for weighted problems beyond additive goal functions2023-02-22Paper
Parameterized complexity of diameter2023-02-16Paper
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks2022-12-09Paper
The complexity of gerrymandering over graphs: paths and trees2022-11-11Paper
The structural complexity landscape of finding balance-fair shortest paths2022-09-27Paper
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality2022-07-21Paper
Tree containment with soft polytomies2022-06-28Paper
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments2022-06-28Paper
The complexity of gerrymandering over graphs: paths and trees2022-06-08Paper
Length-bounded cuts: proper interval graphs and structural parameters2022-03-29Paper
Parameterized complexity of min-power asymmetric connectivity2021-06-11Paper
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality2020-11-05Paper
https://portal.mardi4nfdi.de/entity/Q51164732020-08-25Paper
Parameterized complexity of min-power asymmetric connectivity2020-02-25Paper
Parameterized complexity of diameter2020-02-06Paper
Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review2019-10-08Paper
Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions2019-10-01Paper
Parameterized aspects of triangle enumeration2019-06-25Paper
Parameterized aspects of triangle enumeration2017-11-22Paper

Research outcomes over time

This page was built for person: Matthias Bentert