Follow
Matthias Bentert
Title
Cited by
Cited by
Year
Listing All Maximal k-Plexes in Temporal Graphs
M Bentert, AS Himmel, H Molter, M Morik, R Niedermeier, R Saitenmacher
Journal of Experimental Algorithmics (JEA) 24, 1-27, 2019
282019
Efficient computation of optimal temporal walks under waiting-time constraints
M Bentert, AS Himmel, A Nichterlein, R Niedermeier
Applied Network Science 5 (1), 1-26, 2020
232020
Parameterized aspects of triangle enumeration
M Bentert, T Fluschnik, A Nichterlein, R Niedermeier
Journal of Computer and System Sciences 103, 61-77, 2019
212019
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
M Bentert, A Dittmann, L Kellerhals, A Nichterlein, R Niedermeier
arXiv preprint arXiv:1802.06701, 2018
182018
Efficient computation of optimal temporal walks under waiting-time constraints
AS Himmel, M Bentert, A Nichterlein, R Niedermeier
Complex Networks and Their Applications VIII: Volume 2 Proceedings of the …, 2019
172019
Good things come to those who swap objects on paths
M Bentert, J Chen, V Froese, GJ Woeginger
arXiv preprint arXiv:1905.04219, 2019
152019
Inductive -independent graphs and c-colorable subgraphs in scheduling: a review
M Bentert, R van Bevern, R Niedermeier
Journal of Scheduling 22 (1), 3-20, 2019
132019
Comparing election methods where each voter ranks only few candidates
M Bentert, P Skowron
Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 2218-2225, 2020
112020
Parameterized complexity of diameter
M Bentert, A Nichterlein
Algorithmica, 1-27, 2022
102022
Analysis of an ontological proof proposed by Leibniz
M Bentert, C Benzmüller, D Streit, BW Paleo
Death and Anti-Death 14, 2016
102016
Using a geometric lens to find k disjoint shortest paths
M Bentert, A Nichterlein, M Renken, P Zschoche
arXiv preprint arXiv:2007.12502, 2020
92020
Length-bounded cuts: Proper interval graphs and structural parameters
M Bentert, K Heeger, D Knop
Journal of Computer and System Sciences 126, 21-43, 2022
72022
Tree containment with soft polytomies
M Bentert, J Malík, M Weller
SWAT 2018 101, 9: 1-9: 14, 2018
72018
Parameterized algorithms for power-efficient connected symmetric wireless sensor networks
M Bentert, R van Bevern, A Nichterlein, R Niedermeier
Algorithms for Sensor Systems: 13th International Symposium on Algorithms …, 2017
72017
Polynomial-time data reduction for weighted problems beyond additive goal functions
M Bentert, R van Bevern, T Fluschnik, A Nichterlein, R Niedermeier
Discrete Applied Mathematics 328, 117-133, 2023
5*2023
The complexity of gerrymandering over graphs: paths and trees
M Bentert, T Koana, R Niedermeier
Discrete Applied Mathematics 324, 103-112, 2023
52023
On reachable assignments in cycles and cliques
L Müller, M Bentert
arXiv preprint arXiv:2005.02218, 2020
52020
Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity
M Bentert, R Haag, C Hofer, T Koana, A Nichterlein
Theory of Computing Systems 65 (7), 1141-1142, 2021
4*2021
Parameterized algorithms for power-efficiently connecting wireless sensor networks: Theory and experiments
M Bentert, R van Bevern, A Nichterlein, R Niedermeier, PV Smirnov
INFORMS Journal on Computing 34 (1), 55-75, 2022
32022
A multivariate complexity analysis of the material consumption scheduling problem
M Bentert, R Bredereck, P Györgyi, A Kaczmarczyk, R Niedermeier
Journal of Scheduling, 1-14, 2023
22023
The system can't perform the operation now. Try again later.
Articles 1–20