Folgen
Matthias Bentert
Matthias Bentert
Bestätigte E-Mail-Adresse bei uib.no
Titel
Zitiert von
Zitiert von
Jahr
Efficient computation of optimal temporal walks under waiting-time constraints
M Bentert, AS Himmel, A Nichterlein, R Niedermeier
Applied Network Science 5, 1-26, 2020
402020
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
352019
Parameterized aspects of triangle enumeration
M Bentert, T Fluschnik, A Nichterlein, R Niedermeier
Journal of Computer and System Sciences 103, 61-77, 2019
262019
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
212018
Efficient computation of optimal temporal walks under waiting-time constraints
AS Himmel, M Bentert, A Nichterlein, R Niedermeier
International Conference on Complex Networks and Their Applications, 494-506, 2019
202019
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
192020
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
172019
Using a Geometric Lens to Find -Disjoint Shortest Paths
M Bentert, A Nichterlein, M Renken, P Zschoche
SIAM Journal on Discrete Mathematics 37 (3), 1674-1703, 2023
162023
Good things come to those who swap objects on paths
M Bentert, J Chen, V Froese, GJ Woeginger
arXiv preprint arXiv:1905.04219, 2019
162019
Parameterized complexity of diameter
M Bentert, A Nichterlein
Algorithmica 85 (2), 325-351, 2023
122023
Analysis of an ontological proof proposed by Leibniz
M Bentert, C Benzmüller, D Streit, BW Paleo
Death and Anti-Death 14, 2016
112016
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
102022
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
92017
The complexity of gerrymandering over graphs: paths and trees
M Bentert, T Koana, R Niedermeier
Discrete Applied Mathematics 324, 103-112, 2023
82023
Tree containment with soft polytomies
M Bentert, M Weller
Journal of Graph Algorithms and Applications 25 (1), 417-436, 2021
72021
On reachable assignments in cycles and cliques
L Müller, M Bentert
arXiv preprint arXiv:2005.02218, 2020
62020
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
Cluster editing with overlapping communities
E Arrighi, M Bentert, PG Drange, BD Sullivan, P Wolf
18th International Symposium on Parameterized and Exact Computation (IPEC 2023), 2023
52023
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
5*2021
A multivariate complexity analysis of the material consumption scheduling problem
M Bentert, R Bredereck, P Györgyi, A Kaczmarczyk, R Niedermeier
Journal of Scheduling 26 (4), 369-382, 2023
42023
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20