Computing steiner minimum trees in Hamming metric. - Ernst Althaus; Rouven Naujoks (SODA, 2006)

Power Assignment Problems in Wireless Communication - Stefan Funke; Sören Laue; Zvi Lotker; Rouven Naujoks (CoRR, 2006)

Minimum-Energy Broadcast with Few Senders. - Stefan Funke; Sören Laue; Rouven Naujoks (DCOSS, 2007)

Reconstructing Phylogenetic Networks with One Recombination. - Ernst Althaus; Rouven Naujoks (WEA, 2008)

Symbolic Worst Case Execution Times. - Ernst Althaus; Sebastian Altmeyer; Rouven Naujoks (ICTAC, 2011)

Precise and efficient parametric path analysis. - Ernst Althaus; Sebastian Altmeyer; Rouven Naujoks (LCTES, 2011)

A Column Generation Approach to Scheduling of Periodic Tasks. - Ernst Althaus; Rouven Naujoks; Eike Thaden (SEA, 2011)

Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours. - Stefan Funke; Sören Laue; Zvi Lotker; Rouven Naujoks (Ad Hoc Networks, 2011)

NP-hard networking problems: exact and approximate algorithms. - Rouven Naujoks (2011)

On the low-dimensional Steiner minimum tree problem in Hamming metric. - Ernst Althaus; Joschka Kupilas; Rouven Naujoks (Theor. Comput. Sci., 2013)