|
|
|
|
Approximating Energy Efficient Paths in Wireless Multi-hop Networks |
Editors: Di Battista, Giuseppe; Zwick, Uri | Authors: Funke, Stefan; Matijevic, Domagoj; Sanders, Peter | Place of Publication: Berlin, Germany | Publisher: Springer | Date of Publication (YYYY-MM-DD): 2003 | Title of Proceedings: Algorithms - ESA 2003: 11th Annual European Symposium | Start Page: 230 | End Page: 241 | Title of Series: Lecture Notes in Computer Science | Document Type: Conference-Paper | ID: 201834.0 |
|
|
|
|
|
A Practical Minimum Spanning Tree Algorithm Using the Cycle Property |
Editors: Di Battista, Giuseppe; Zwick, Uri | Authors: Katriel, Irit; Sanders, Peter; Träff, Jesper Larsson | Place of Publication: Berlin, Germany | Publisher: Springer | Date of Publication (YYYY-MM-DD): 2003 | Title of Proceedings: Algorithms - ESA 2003: 11th Annual European Symposium | Start Page: 679 | End Page: 690 | Title of Series: Lecture Notes in Computer Science | Document Type: Conference-Paper | ID: 201859.0 |
|
|
|
|
|
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation |
Editors: Di Battista, Giuseppe; Zwick, Uri | Authors: Granados, Miguel; Hachenberger, Peter; Hert, Susan; Kettner, Lutz; Mehlhorn, Kurt; Seel, Michael | Place of Publication: Berlin, Germany | Publisher: Springer | Date of Publication (YYYY-MM-DD): 2003 | Title of Proceedings: Algorithms - ESA 2003: 11th Annual European Symposium | Start Page: 654 | End Page: 666 | Title of Series: Lecture Notes in Computer Science | Document Type: Conference-Paper | ID: 201891.0 |
|
|
|
|
|
I/O-Efficient Undirected Shortest Paths |
Editors: Di Battista, Giuseppe; Zwick, Uri | Authors: Meyer, Ulrich; Zeh, Norbert | Place of Publication: Berlin, Germany | Publisher: Springer | Date of Publication (YYYY-MM-DD): 2003 | Title of Proceedings: Algorithms - ESA 2003: 11th Annual European Symposium | Start Page: 434 | End Page: 445 | Title of Series: Lecture Notes in Computer Science | Document Type: Conference-Paper | ID: 201966.0 |
|
|
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.
|
|