Matthias Bentert

Available identifiers

zbMath Open bentert.matthiasMaRDI QIDQ1679961

List of research outcomes

Publication	Date of Publication	Type
Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication	2025-01-06	Paper
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences	2024-01-11	Paper
https://portal.mardi4nfdi.de/entity/Q6087208	2023-11-14	Paper
A multivariate complexity analysis of the material consumption scheduling problem	2023-08-28	Paper
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths	2023-08-11	Paper
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences	2023-07-28	Paper
On reachable assignments in cycles	2023-03-31	Paper
Polynomial-time data reduction for weighted problems beyond additive goal functions	2023-02-22	Paper
Parameterized complexity of diameter	2023-02-16	Paper
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks	2022-12-09	Paper
The complexity of gerrymandering over graphs: paths and trees	2022-11-11	Paper
The structural complexity landscape of finding balance-fair shortest paths	2022-09-27	Paper
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality	2022-07-21	Paper
Tree containment with soft polytomies	2022-06-28	Paper
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments	2022-06-28	Paper
The complexity of gerrymandering over graphs: paths and trees	2022-06-08	Paper
Length-bounded cuts: proper interval graphs and structural parameters	2022-03-29	Paper
Parameterized complexity of min-power asymmetric connectivity	2021-06-11	Paper
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality	2020-11-05	Paper
https://portal.mardi4nfdi.de/entity/Q5116473	2020-08-25	Paper
Parameterized complexity of min-power asymmetric connectivity	2020-02-25	Paper
Parameterized complexity of diameter	2020-02-06	Paper
Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review	2019-10-08	Paper
Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions	2019-10-01	Paper
Parameterized aspects of triangle enumeration	2019-06-25	Paper
Parameterized aspects of triangle enumeration	2017-11-22	Paper

Research outcomes over time

This page was built for person: Matthias Bentert