Please note that eDoc will be permanently shut down in the first quarter of 2021!      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 
Efficient models for timetable information in public transportation systems
Authors: Pyrga, Evangelia; Schulz, Frank; Wagner, Dorothea; Zaroliagis, Christos
Date of Publication (YYYY-MM-DD): 2007
Title of Journal: ACM Journal of Experimental Algorithmics
Volume: 12
Start Page: 2.4.1
End Page: 2.4.39
Document Type: Article
ID: 356705.0
A simple parallel algorithm for the single-source shortest path problem on planar digraphs
Authors: Träff, Jesper Larsson; Zaroliagis, Christos
Date of Publication (YYYY-MM-DD): 2000
Title of Journal: Journal of Parallel and Distributed Computing
Volume: 60
Issue / Number: 9
Start Page: 1103
End Page: 1124
Document Type: Article
ID: 518168.0
Computing mimicking networks
Authors: Chaudhuri, Shiva; Subrahmanyam, K. V.; Wagner, Frank; Zaroliagis, Christos
Date of Publication (YYYY-MM-DD): 2000
Title of Journal: Algorithmica
Volume: 26
Issue / Number: 1
Start Page: 31
End Page: 49
Document Type: Article
ID: 518151.0
Improved algorithms for dynamic shortest paths
Authors: Djidjev, Hristo N.; Pantziou, G. E.; Zaroliagis, Christos
Date of Publication (YYYY-MM-DD): 2000
Title of Journal: Algorithmica
Volume: 28
Issue / Number: 4
Start Page: 367
End Page: 389
Document Type: Article
ID: 518158.0
Shortest paths in digraphs of small treewidth. Part I, {Sequential} algorithms
Authors: Chaudhuri, Shiva; Zaroliagis, Christos
Date of Publication (YYYY-MM-DD): 2000
Title of Journal: Algorithmica
Volume: 27
Issue / Number: 3/4
Start Page: 212
End Page: 226
Document Type: Article
ID: 518152.0
Transmissions in a network with capacities and delays
Authors: Kagaris, Dimitrios; Pantziou, Grammati E.; Tragoudas, Spyros; Zaroliagis, Christos
Date of Publication (YYYY-MM-DD): 1999
Title of Journal: Networks
Volume: 33
Issue / Number: 3
Start Page: 167
End Page: 174
Document Type: Article
ID: 517820.0
All-Pairs Min-Cut in Sparse Networks
Authors: Arikati, Srinivasa Rao; Chaudhuri, Shiva; Zaroliagis, Christos
Date of Publication (YYYY-MM-DD): 1998
Title of Journal: Journal of Algorithms
Volume: 29
Start Page: 82
End Page: 110
Document Type: Article
ID: 517993.0
An experimental study of dynamic algorithms for directed graphs
Authors: Frigioni, Daniele; Miller, Tobias; Nanni, Umberto; Pasqualone, Giulio; Schäfer, Guido; Zaroliagis, Christos
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 1998
Title of Proceedings: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98)
Start Page: 368
End Page: 380
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 517995.0
A Parallel Priority Queue with Constant Time Operations
Authors: Brodal, Gerth Stølting; Träff, Jesper Larsson; Zaroliagis, Christos
Date of Publication (YYYY-MM-DD): 1998
Title of Journal: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures
Volume: 49
Issue / Number: 1
Start Page: 4
End Page: 21
Document Type: Article
ID: 517960.0
A Software Library of Dynamic Graph Algorithms
Authors: Alberts, David; Cattaneo, G; Italiano, Giuseppe; Nanni, Umberto; Zaroliagis, Christos
Place of Publication: Trento, Italy
Publisher: University of Trento
Date of Publication (YYYY-MM-DD): 1998
Title of Proceedings: Proceedings of Workshop on Algorithms and Experiments (ALEX-98)
Start Page: 129
End Page: 136
Document Type: Conference-Paper
ID: 517994.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.