Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents


Institute:
Collection:
Print in Citation style Print version     Display:
Sort by: Display records with Fulltext only
Entries: 1-10  
 Basket 
On the Low-Dimensional Steiner Minimum Tree Problem in {Hamming} Metric
Authors: Althaus, Ernst; Kupilas, Joschka; Naujoks, Rouven
Place of Publication: Heidelberg
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2011
Title of Proceedings: Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011
Start Page: 308
End Page: 319
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 618671.0
Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours
Authors: Funke, Stefan; Laue, Soeren; Lotker, Zvi; Naujoks, Rouven
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: Ad Hoc Networks
Volume: 9
Issue / Number: 6
Start Page: 1028
End Page: 1035
Document Type: Article
ID: 618750.0
A New Combinatorial Approach to Parametric Path Analysis
Authors: Althaus, Ernst; Altmeyer, Sebastian; Naujoks, Rouven
Place of Publication: Saarbrücken
Publisher: AVACS
Date of Publication (YYYY-MM-DD): 2010
Title of (Report) Series: Technical Report / Sonderforschungsbereich/Transregio 14 AVACS (Automatic Verification and Analysis of Complex Systems)
Document Type: Report
ID: 536763.0
NP-hard Networking Problems - Exact and Approximate Algorithms
Authors: Naujoks, Rouven
Name of University: Universität des Saarlandes
Place of University: Saarbrücken, Saarland
Date of Approval (YYYY-MM-DD): 2008-12-22
Document Type: PhD-Thesis
ID: 428321.0
Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
Authors: Funke, Stefan; Laue, Sören; Naujoks, Rouven; Lotker, Zvi
Place of Publication: Berlin
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2008
Title of Proceedings: Distributed Computing in Sensor Systems : 4th IEEE International Conference, DCOSS 2008
Start Page: 282
End Page: 295
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 428084.0
Reconstructing Phylogenetic Networks with One Recombination
Authors: Althaus, Ernst; Naujoks, Rouven
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2008
Title of Proceedings: Experimental algorithms : 7th International Workshop, WEA 2008
Start Page: 275
End Page: 288
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 427970.0
Minimum Energy Broadcast with Few Senders
Authors: Funke, Stefan; Laue, Sören; Naujoks, Rouven
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2007
Title of Proceedings: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007
Start Page: 404
End Page: 416
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 356697.0
Computing Steiner Minimal Trees in Hamming Metric
Authors: Althaus, Ernst; Naujoks, Rouven
Place of Publication: New York, USA
Publisher: ACM / Siam
Date of Publication (YYYY-MM-DD): 2006
Title of Proceedings: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06
Start Page: 172
End Page: 181
Document Type: Conference-Paper
ID: 314651.0
A heuristic for solving interior point Methods exactly
Authors: Naujoks, Rouven
Name of University: Universität des Saarlandes
Place of University: Saarbrücken, Saarland
Document Type: Thesis
ID: 231233.0
A heuristic for solving interior point Methods exactly
Authors: Naujoks, Rouven
Date of Approval (YYYY-MM-DD): 2004
Name of University: Universität des Saarlandes
Place of University: Saarbrücken, Saarland
Document Type: Thesis
ID: 232056.0
Entries: 1-10  
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.