- Dynamic Shortest Paths Containers Dorothea Wagnera,1
- Parallel Processing Letters, fc World Scienti c Publishing Company
- Timetable Information: Models and Algorithms Matthias Muller-Hannemann1
- Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs (FCT'95 ver.)
- The Societal Impact of Algorithms in Transport Optimization1
- -Tree: A New Overlay with Deterministic Gerth Stlting Brodal1
- Efficient Route Planning in Flight Networks Daniel Delling1
- An Experimental Study of Dynamic Algorithms for Directed Graphs ?
- DOI: 10.1007/s00224-003-1087-5 Theory Comput. Systems 36, 553574 (2003)
- Transmissions in a Network with Capacities Dimitrios Kagaris,1
- 442 L LEDA: a Library of Efficient Algorithms many existing algorithms. One of these recurring build-
- Improved Bounds for Finger Search on a RAM Alexis Kaporis
- An Experimental Study of Algorithms for Fully Dynamic Transitive Closure
- STUDIA UNIV. "BABESBOLYAI", MATHEMATICA, Volume LIII, Number 1, March 2008 A CUTTING PLANE APPROACH TO SOLVE THE RAILWAY
- 11. Implementations and Experimental Studies of Dynamic Graph Algorithms
- 0 10000 20000 30000 40000 50000 60000 70000 0 10000 20000 30000 40000 50000 60000 70000
- DOI: 10.1007/s004530010043 Algorithmica (2000) 28: 367389
- Z .JOURNAL OF ALGORITHMS 29, 82 110 1998 ARTICLE NO. AL980961
- Parallel Processing Letters, fc World Scienti c Publishing Company
- On Assessing Robustness in Transportation Planning
- Enabling Social Navigation on the Web Athanasios Papagelis
- Robust Line Planning under Unknown Incentives and Elasticity of Frequencies
- Distributed Simulation of Heterogeneous Systems of Small Programmable Objects and Traditional Processors
- Searchius: A Collaborative Search Engine Athanasios Papagelis
- Routing Protocols for Efficient Communication in Wireless Ad-hoc Networks
- Dynamic Interpolation Search Revisited Alexis Kaporis1,2
- Searching the Web Through User Information Spaces
- The Railway Traveling Salesman Problem Georgia Hadjicharalambous1
- On the Use of Weber Polynomials in Elliptic Curve Cryptography
- Improved Bounds for Finger Search on a RAM Alexis Kaporis, Christos Makris, Spyros Sioutas, Athanasios Tsakalidis,
- An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks
- All-Pairs Min-Cut in Sparse Networks? (FSTTCS'95) Srinivasa R. Arikati Shiva Chaudhuri Christos D. Zaroliagis
- Optimal Parallel Shortest Paths in Small Treewidth Digraphs (to appear in ESA'95)
- Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem (to appear in ISAAC'94)
- Engineering Planar Separator Algorithms MARTIN HOLZER, FRANK SCHULZ, and DOROTHEA WAGNER
- 272 E Engineering Algorithms for Large Network Applications Sorting by Transpositions and Reversals (Approx Ratio
- Synthesizing Routing Protocols for Ad-hoc Mobile Networks Ioannis Chatzigiannakis
- iClone: Towards Online Social Navigation Athanasios Papagelis
- DOI: 10.1007/s004530010016 Algorithmica (2000) 27: 212226
- Secure Elliptic Curve Generation and Key Establishment on a 802.11 WLAN Embedded Device
- A First Experimental Study of a Dynamic Transitive Closure Algorithm
- Computing Mimicking Networks Shiva Chaudhuri 1 , K.V. Subrahmanyam 1 ,
- Theory Comput Syst DOI 10.1007/s00224-007-9096-4
- Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest
- JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 49, 421 (1998) ARTICLE NO. PC981425
- Towards Realistic Modeling of Time-Table Information through the Time-Dependent
- Journal of Discrete Algorithms 8 (2010) 373387 Contents lists available at ScienceDirect
- On the Efficient Generation of Elliptic Curves over Prime Fields
- TRAILS, a Toolkit for Efficient, Realistic and Evolving Models of Mobility, Faults and Obstacles in Wireless Networks
- Incentive-Compatible Robust Line Planning Apostolos Bessas1,3
- Efficient Models for Timetable Information in Public Transportation Systems
- 576 N Negative Cycles in Weighted Digraphs Open Problems
- BIT 32 (1992),215-236. EFFICIENT PARALLEL ALGORITHMS FOR
- On-line and Dynamic Algorithms for Shortest Path Problems (to appear in STACS'95)
- ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour
- J. Cryptol. DOI: 10.1007/s00145-009-9037-2
- Using Multi-level Graphs for Timetable Information in Railway Systems
- Shortest Path Queries in Digraphs of Small Treewidth
- A Parallel Priority Data Structure with Applications Gerth St lting Brodaly
- Robust Line Planning in case of Multiple Pools and Disruptions
- A Simple Parallel Algorithm for the SingleSource Shortest Path Problem on Planar Digraphs ?
- Heapsort using Multiple Heaps D. Levendeas1
- DAP: A Generic Platform for the Simulation of Distributed Algorithms Ioannis Chatzigiannakis Athanasios Kinalis Athanasios Poulakidas
- On the Computation of Fast Data Transmissions in Networks with Capacities and Delays
- Geometric Containers for Efficient Shortest-Path Computation
- Attack Propagation in Networks Computer Technology Institute, P.O. Box 1122, 26110 Patras, Greece
- Int. J. Inf. Secur. (2007) 6:4763 DOI 10.1007/s10207-006-0009-3
- Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
- A Software Library for Elliptic Curve Cryptography
- DOI: 10.1007/s004539910003 Algorithmica (2000) 26: 3149
- Recent Advances in Multiobjective Optimization
- Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
- 10. Distributed Algorithm Engineering Paul G. Spirakis and Christos D. Zaroliagis
- On the Construction of Prime Order Elliptic Curves
- Proceedings of ''Algorithms and Experiments'' (ALEX98) Trento, Italy, Feb 9--11, 1998 R. Battiti and A. A. Bertossi (Eds.) pp. 129136
- Journal of Parallel and Distributed Computing 60, 1103 1124 (2000) A Simple Parallel Algorithm for the Single-Source
- A Collaborative Decentralized Approach to Web Search Athanasios Papagelis Christos Zaroliagis
