Result 1 to 20 of 125 total
Topic 12: theory and algorithms for parallel computation. (English)
Kaklamanis, Christos (ed.) et al., Euro-Par 2012 parallel processing. 18th international conference, Euro-Par 2012, Rhodes Island, Greece, August 27‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32819-0/pbk). Lecture Notes in Computer Science 7484, 674-675 (2012).
1
Robust line planning in case of multiple pools and disruptions. (English)
Comput. Res. Repos. 2011, Article No. 1101.2770 (2011).
2
Robust line planning in case of multiple pools and disruptions. (English)
Marchetti-Spaccamela, Alberto (ed.) et al., Theory and practice of algorithms in (computer) systems. First international ICST conference, TAPAS 2011, Rome, Italy, April 18‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19753-6/pbk). Lecture Notes in Computer Science 6595, 33-44 (2011).
3
Robust line planning in case of multiple pools and disruptions (English)
TAPAS, 33-44 (2011).
4
ISB-tree: A new indexing scheme with efficient expected behaviour. (English)
J. Discrete Algorithms 8, No. 4, 373-387 (2010).
5
$D^{2}$-tree: A new overlay with deterministic bounds. (English)
Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju, Korea, December 15‒17, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17513-8/pbk). Lecture Notes in Computer Science 6507, 1-12 (2010).
6
On the efficient generation of prime-order elliptic curves. (English)
J. Cryptology 23, No. 3, 477-503 (2010).
7
$D^{2}$-tree: A new overlay with deterministic bounds (English)
ISAAC (2), 1-12 (2010).
8
Efficient route planning in flight networks. (English)
Clausen, Jens (ed.) et al., 9th workshop on algorithmic approaches for transportation modeling, optimization, and systems (ATMOS’09). Selected papers based on the presentations at the workshop, September 10, 2009, Copenhagen, Denmark. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-11-8). OASIcs ‒ OpenAccess Series in Informatics 12, 17 p., electronic only (2009).
9
On assessing robustness in transportation planning. (English)
Clausen, Jens (ed.) et al., 9th workshop on algorithmic approaches for transportation modeling, optimization, and systems (ATMOS’09). Selected papers based on the presentations at the workshop, September 10, 2009, Copenhagen, Denmark. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-11-8). OASIcs ‒ OpenAccess Series in Informatics 12, 16 p., electronic only (2009).
10
Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications. (English)
Theory Comput. Syst. 45, No. 1, 162-186 (2009).
11
Engineering planar separator algorithms (English)
ACM Journal of Experimental Algorithmics 14 (2009).
12
Incentive-compatible robust line planning (English)
Robust and Online Large-Scale Optimization, 85-118 (2009).
13
On assessing robustness in transportation planning (English)
ATMOS (2009).
14
Efficient route planning in flight networks (English)
ATMOS (2009).
15
Secure elliptic curve generation and key establishment on a 802.11 WLAN embedded device (English)
ISADS, 41-48 (2009).
16
Robust line planning under unknown incentives and elasticity of frequencies. (English)
Fiscetti, Matteo (ed.) et al., 8th workshop on algorithmic approaches for transportation modeling, optimization, and systems (ATMOS’08). Papers based on the presentations at the workshop, September 18, 2008, Karlsruhe, Germany. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-07-1). OASIcs ‒ OpenAccess Series in Informatics 9, 16 p., electronic only (2008).
17
A cutting plane approach to solve the railway traveling salesman problem. (English)
Stud. Univ. Babeş-Bolyai, Math. 53, No. 1, 63-74 (2008).
18
An experimental study of algorithms for fully dynamic transitive closure (English)
ACM Journal of Experimental Algorithmics 12 (2008).
19
Negative cycles in weighted digraphs (English)
Encyclopedia of Algorithms (2008).
20
Result 1 to 20 of 125 total
Start
Contact
Print
General Help
