Rouven Naujoks

According to our database, Rouven Naujoks authored at least 10 papers between 2006 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

On the low-dimensional Steiner minimum tree problem in Hamming metric.

Ernst Althaus, Joschka Kupilas, Rouven Naujoks

Theor. Comput. Sci., 2013

2011

NP-hard networking problems: exact and approximate algorithms.

Rouven Naujoks

PhD thesis, 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

A Column Generation Approach to Scheduling of Periodic Tasks.

Ernst Althaus, Rouven Naujoks, Eike Thaden

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Precise and efficient parametric path analysis.

Ernst Althaus, Sebastian Altmeyer, Rouven Naujoks

Proceedings of the ACM SIGPLAN/SIGBED 2011 conference on Languages, 2011

Symbolic Worst Case Execution Times.

Ernst Althaus, Sebastian Altmeyer, Rouven Naujoks

Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

2008

Reconstructing Phylogenetic Networks with One Recombination.

Ernst Althaus, Rouven Naujoks

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

2007

Minimum-Energy Broadcast with Few Senders.

Stefan Funke, Sören Laue, Rouven Naujoks

Proceedings of the Distributed Computing in Sensor Systems, 2007

2006

Power Assignment Problems in Wireless Communication

Stefan Funke, Sören Laue, Zvi Lotker, Rouven Naujoks

CoRR, 2006

Computing steiner minimum trees in Hamming metric.

Ernst Althaus, Rouven Naujoks

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006