Result 1 to 20 of 90 total
Super-fast distributed algorithms for metric facility location. (English)
Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9‒13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 428-439 (2012).
1
Building self-stabilizing overlay networks with the transitive closure framework. (English)
Défago, Xavier (ed.) et al., Stabilization, safety, and security of distributed systems. 13th international symposium, SSS 2011, Grenoble, France, October 10‒12, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24549-7/pbk). Lecture Notes in Computer Science 6976, 62-76 (2011).
2
Good quality virtual realization of unit disk graphs (English)
JoCG 2, No. 1, 69-91 (2011).
3
Max-coloring and online coloring with bandwidths on interval graphs (English)
ACM Transactions on Algorithms 7, No. 3, 35 (2011).
4
Distributed graph coloring in a few rounds (English)
PODC, 31-40 (2011).
5
Building self-stabilizing overlay networks with the transitive closure framework (English)
SSS, 62-76 (2011).
6
Sub-coloring and hypo-coloring interval graphs. (English)
Discrete Math. Algorithms Appl. 2, No. 3, 331-345 (2010).
7
Distributed computing and networking. 11th international conference, ICDCN 2010, Kolkata, India, January 3‒6, 2010. Proceedings. (English)
Lecture Notes in Computer Science 5935. Berlin: Springer (ISBN 978-3-642-11321-5/pbk). xix, 522~p. EUR~74.90 (2010).
8
Sub-coloring and hypo-coloring interval graphs. (English)
Paul, Christophe (ed.) et al., Graph-theoretic concepts in computer science. 35th international workshop, WG 2009, Montpellier, France, June 24‒26, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11408-3/pbk). Lecture Notes in Computer Science 5911, 122-132 (2010).
9
Localized spanners for ad hoc wireless networks (English)
Ad Hoc & Sensor Wireless Networks 9, No. 3-4, 305-328 (2010).
10
Budgeted maximum coverage with overlapping costs: monitoring the emerging infections network (English)
ALENEX, 112-123 (2010).
11
Brief announcement: a framework for building self-stabilizing overlay networks (English)
PODC, 398-399 (2010).
12
Rapid randomized pruning for fast greedy distributed algorithms (English)
PODC, 325-334 (2010).
13
Modeling and estimating the spatial distribution of healthcare workers (English)
IHI, 287-296 (2010).
14
Computational discrete mathematics. Combinatorics and graph theory with Mathematica. Reprint of the 2003 hardback ed. (English)
Cambridge: Cambridge University Press (ISBN 978-0-521-12146-0/pbk). xiv, 480~p. \sterling~25.99 (2009).
15
Approximation algorithms for domatic partitions of unit disk graphs. (English)
Dinur, Irit (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August 21‒23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03684-2/pbk). Lecture Notes in Computer Science 5687, 312-325 (2009).
16
Finding facilities fast. (English)
Garg, Vijay (ed.) et al., Distributed computing and networking. 10th international conference, ICDCN 2009, Hyderabad, India, January 3‒6, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-92294-0/pbk). Lecture Notes in Computer Science 5408, 11-24 (2009).
17
Finding facilities fast (English)
ICDCN, 11-24 (2009).
18
Sub-coloring and hypo-coloring interval graphs (English)
WG, 122-132 (2009).
19
Greedy routing with bounded stretch (English)
INFOCOM, 1737-1745 (2009).
20
Result 1 to 20 of 90 total
Start
Contact
Print
General Help
