Rouven Naujoks

12 papers A* 1B 4C 2Journal 3Unranked 1
YearRankTypeTitle / Venue / Authors
2013 J jnl
On the low-dimensional Steiner minimum tree problem in Hamming metric.
Theor. Comput. Sci.
Ernst Althaus, Joschka Kupilas, Rouven Naujoks
2011 B conf
A Column Generation Approach to Scheduling of Periodic Tasks.
SEA
Ernst Althaus, Rouven Naujoks, Eike Thaden
2011 — —
NP-hard networking problems: exact and approximate algorithms.
Rouven Naujoks
2011 C conf
On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric.
TAMC
Ernst Althaus, Joschka Kupilas, Rouven Naujoks
2011 J jnl
Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours.
Ad Hoc Networks
Stefan Funke, Sören Laue, Zvi Lotker, Rouven Naujoks
2011 B conf
Precise and efficient parametric path analysis.
LCTES
Ernst Althaus, Sebastian Altmeyer, Rouven Naujoks
2011 C conf
Symbolic Worst Case Execution Times.
ICTAC
Ernst Althaus, Sebastian Altmeyer, Rouven Naujoks
2008 B conf
Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours.
DCOSS
Stefan Funke, Sören Laue, Rouven Naujoks, Zvi Lotker
2008 — conf
Reconstructing Phylogenetic Networks with One Recombination.
WEA
Ernst Althaus, Rouven Naujoks
2007 B conf
Minimum-Energy Broadcast with Few Senders.
DCOSS
Stefan Funke, Sören Laue, Rouven Naujoks
2006 A* conf
Computing steiner minimum trees in Hamming metric.
SODA
Ernst Althaus, Rouven Naujoks
2006 J jnl
Power Assignment Problems in Wireless Communication
CoRR
Stefan Funke, Sören Laue, Zvi Lotker, Rouven Naujoks