Result 1 to 20 of 87 total
Hierarchical hub labelings for shortest paths. (English)
Epstein, Leah (ed.) et al., Algorithms ‒ ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10‒12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 24-35 (2012).
1
Modelling the psychographic behaviour of users using ontologies in web marketing services. (English)
Moreno-Díaz, Roberto (ed.) et al., Computer aided systems theory ‒ EUROCAST 2011. 13th international conference, Las Palmas de Gran Canaria, Spain, February 6‒11, 2011. Revised selected papers, Part I. Berlin: Springer (ISBN 978-3-642-27548-7/pbk). Lecture Notes in Computer Science 6927, 121-128 (2012).
2
Advances in metric embedding theory. (English)
Adv. Math. 228, No. 6, 3026-3126 (2011).
3
On approximate distance labels and routing schemes with affine stretch. (English)
Peleg, David (ed.), Distributed computing. 25th international symposium, DISC 2011, Rome, Italy, September 20‒22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24099-7/pbk). Lecture Notes in Computer Science 6950, 404-415 (2011).
4
VC-dimension and shortest path algorithms. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 690-699 (2011).
5
A hub-based labeling algorithm for shortest paths in road networks. (English)
Pardalos, Panos M. (ed.) et al., Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20661-0/pbk). Lecture Notes in Computer Science 6630, 230-241 (2011).
6
Distributed computing meets game theory: combining insights from two fields (English)
SIGACT News 42, No. 2, 69-76 (2011).
7
VC-dimension and shortest path algorithms (English)
ICALP (1), 690-699 (2011).
8
A hub-based labeling algorithm for shortest paths in road networks (English)
SEA, 230-241 (2011).
9
On approximate distance labels and routing schemes with affine stretch (English)
DISC, 404-415 (2011).
10
Strong-diameter decompositions of minor free graphs. (English)
Theory Comput. Syst. 47, No. 4, 837-855 (2010).
11
Fast asynchronous consensus with optimal resilience. (English)
Lynch, Nancy A. (ed.) et al., Distributed computing. 24th international symposium, DISC 2010, Cambridge, MA, USA, September 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15762-2/pbk). Lecture Notes in Computer Science 6343, 4-19 (2010).
12
Volume in general metric spaces. (English)
de Berg, Mark (ed.) et al., Algorithms ‒ ESA 2010. 18th annual European symposium, Liverpool, UK, September 6‒8, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-15780-6/pbk). Lecture Notes in Computer Science 6347, 87-99 (2010).
13
Alternative routes in road networks. (English)
Festa, Paola (ed.), Experimental algorithms. 9th international symposium, SEA 2010, Ischia Island, Naples, Italy, May 20‒22, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13192-9/pbk). Lecture Notes in Computer Science 6049, 23-34 (2010).
14
Volume in general metric spaces (English)
ESA (2), 87-99 (2010).
15
Highway dimension, shortest paths, and provably efficient algorithms (English)
SODA, 782-793 (2010).
16
Alternative routes in road networks (English)
SEA, 23-34 (2010).
17
Fast asynchronous consensus with optimal resilience (English)
DISC, 4-19 (2010).
18
Forbidden-set distance labels for graphs of bounded doubling dimension (English)
PODC, 192-200 (2010).
19
Compact multicast routing. (English)
Keidar, Idit (ed.), Distributed computing. 23rd international symposium, DISC 2009, Elche, Spain, September 23‒25, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04354-3/pbk). Lecture Notes in Computer Science 5805, 364-378 (2009).
20
Result 1 to 20 of 87 total
Start
Contact
Print
General Help
