66 citations · 457 across the 33 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 complexity of machine scheduling: 15 open problems
Matthias Mnich, René van Bevern
Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms. To sti…
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…