18 citations · 23 across the 12 of their papers we have counts for
3 papers · 1 filter
Inductive -independent graphs and -colorable subgraphs in scheduling: A review
Matthias Bentert, René van Bevern, Rolf Niedermeier
Inductive -independent graphs generalize chordal graphs and have recently been advocated in the context of interference-avoiding wireless communication scheduling. The NP-hard p…
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
Matthias Bentert, René van Bevern, André Nichterlein +2
We study an NP-hard problem motivated by energy-efficiently maintaining the connectivity of a symmetric wireless communication network: Given an edge-weighted -vertex graph, fin…
Parameterized Aspects of Triangle Enumeration
Matthias Bentert, Till Fluschnik, André Nichterlein +1
The task of listing all triangles in an undirected graph is a fundamental graph primitive with numerous applications. It is trivially solvable in time cubic in the number of vertic…