Bibliography
Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser. Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. APPROX-RANDOM, pp.3-14, 2006. [link]Christoph Ambuhl and Andrea E. F. Clementi and Paolo Penna and Gianluca Rossi and Riccardo Silvestri On the approximability of the range assignment problem on radio networks in presence of selfish agents Theor. Comput. Sci. 343(1-2): pages 27-41 2005. [link]
L. Barrière, P. Flocchini, P. Fraigniaud, and N. Santoro. Rendezvous and Election of Mobile Agents: Impact of Sense of Direction. Theory of Computing Systems, 40(2), 143-162, 2007. [link]
Vincent D. Blondel, Jean-Loup Guillaume, Julien M. Hendrickx, Cristobald de Kerchove and Renaud Lambiotte. Local Leaders in Random Networks. arXiv:0707.4064
Vincent D. Blondel, Jean-Loup Guillaume, Julien M. Hendrickx and Raphaël Jungers. Distance distribution in random graphs and application to complex networks exploration. arXiv:0706.3322
H. L. Bodlaender, F. V. Fomin, A. M. C. A. Koster, D. Kratsch, and D. M. Thilikos. On exact algorithms for treewidth. Proceedings of the 14th Annual European Symposium on Algorithms (ESA 2006), Springer-Verlag Lecture Notes in Computer Science, vol. 4168, 2006, pp. 672-683. [link]
Harry Buhrman, Matthias Christandl, Michal Koucky', Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin. High Entropy Random Selection Protocols. APPROX-RANDOM 2007: 366-379
I. Caragiannis, C. Kaklamanis, and P. Persiano. Approximation Algorithms for Path Coloring in Trees. Chapter in Efficient Approximation and Online Algorithms, LNCS 3484, Springer, pp. 74-96, 2006. [link]
I. Caragiannis, C. Galdi, and C. Kaklamanis. Network Load Games. In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 05), LNCS 3827, Springer, pp. 809-818, 2005. [link]
I. Caragiannis, C. Galdi, and C. Kaklamanis. Basic Computations in Wireless Networks. In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 05), LNCS 3827, Springer, pp. 533-542, 2005. http://www.informatik.uni-trier.de/~ley/db/conf/isaac/isaac2005.html#CaragiannisGK05
Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, and Paul Vitanyi. Lifespan of Peer to Peer Networks: models and insight. Accepted for publication in 10th International Conference On Principles Of Distributed Systems.
J. Cohen, F. V. Fomin, P. Heggernes, D. Kratsch, and G. Kucherov. Optimal Linear Arrangement of Interval Graphs. Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 2006), Springer-Verlag Lecture Notes in Computer Science, vol. 4162, 2006, pp. 267-279. [link]
R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman and D. Peleg. Labeling Schemes for Tree Representation. Accepted to Algorithmica. [link]
R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman and D. Peleg. Label-Guided Graph Exploration by a Finite Automation. Proc. 32nd Int. Colloq. on Automata, Languages and Prog. (ICALP), July 2005. [link]
R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman and D. Peleg. Labeling Schemes for Tree Representation. Proc. 7’th Int. Workshop on Dist. Computing. (IWDC: now called ICDCN), Dec. 2005. [link]
Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas. Performing work in broadcast networks. Distributed Computing 18(6): 435-451 (2006) [link]
Pilu Crescenzi and Miriam Di Ianni and Alessandro Lazzoni and Paolo Penna and Gianluca Rossi and Paola Vocca Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks in Proceedings of 4th International Conference on Ad-Hoc, Mobile, and Wireless Networks (ADHOC-NOW): pages 4-17 LNCS 3738, 2005. [link]
Pilu Crescenzi and Giorgio Gambosi and Gaia Nicosia and Paolo Penna and Walter Unger: On-line load balancing made simple: Greedy strikes back J. Discrete Algorithms 5(1): pages 162-175 2007. [link]
A. Czumaj, M. Kowaluk and A. Lingas. Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theoretical Computer Science, 380 (1-2), pp. 37-46, 2007. [link]
Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc. Complexity of Searching for a Black Hole. Fundam. Inform. 71(2-3): 229-242 (2006). [link]
Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc. Gathering Few Fat Mobile Robots in the Plane. OPODIS 2006: 350-364. [link]
J. Czyzowicz, D. Kowalski, E. Markou, A. Pelc, Searching for a black hole in synchronous tree networks, Combinatorics, Probability & Computing 16 (2007), 595-619.
J. Czyzowicz, E. Kranakis, D. Krizanc, A. Pelc, M. Vargas Martin, Assigning bookmarks in perfect binary trees, Ars Combinatoria 82 (2007), 165-179.
Shantanu Das, Paola Flocchini, Shay Kutten, Amiya Nayak, and Nicola Santoro. Distributed Exploration of Unlabelled Graphs by Multiple Agents. to appear in Theoretical Computer Science. [link]
S. Das, P. Flocchini, S. Kutten, A. Nayak, and N. Santoro. Map Construction of Unknown Graphs by Multiple Agents. Theoretical Computer Science, to appear.
S. Das, P. Flocchini,N. Santoro, and M. Yamashita. Fault-tolerant simulation of message-passing algorithms by mobile agents. Proc. of 14th International Colloquium on Structural Information and Communication Complexity, (SIROCCO), 2007.
S. Das, P. Flocchini, A. Nayak, and N . Santoro. Effective elections for anonymous mobile agents. In Proc. 17th International Symposium on Algorithms and Computation (ISAAC), 732-743, 2006.
S. Das, P. Flocchini, A. Nayak, and N. Santoro. Exploration and labelling of an unknown graph by multiple agents. Proc. of 12th International Colloquium on Structural Information and Communication Complexity, (SIROCCO), 99-114, 2005.
Annalisa De Bonis, Leszek Gasieniec, Ugo Vaccaro. Optimal Two-Stage Algorithms for Group Testing Problems. SIAM J. Comput. 34(5): 1253-1270 (2005). [link]
E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos. Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. Journal of the ACM 52 (6), (2005), pp. 866--893. [link]
E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos. Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs. ACM Transactions on Algorithms 1 (1), (2005), pp. 33--47. [link]
G. De Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc, U. Vaccaro, Asynchronous deterministic rendezvous in graphs, Theoretical Computer Science 355 (2006), 315-326.
G. De Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc, U. Vaccaro, Asynchronous deterministic rendezvous in graphs, Proc. 30th International Symposium on Mathematical Foundations of Computer Science, (MFCS 2005), LNCS 3618, 271-282.
Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc. Deterministic Rendezvous in Graphs. Algorithmica 46(1): 69-96 (2006) [link]
J. Diaz, J. Petit, D. Thilikos. Kernels for the Vertex Cover Problem on the Preferred Attachment Model. LCNC 4007, pages 231-240, 2006.
J. Diaz, V. Samwalani, M.J. Serna, P. Spirakis. The chromatic and clique number of random scaled sector graphs. Theoretical Computer Science 349(1):40-51, 2005.
J. Diaz, A. Kaporis, L. Kirousis, X. Perez, D. Sotiropoulus. 5-regular graphs are 3-colorable with positive probability. LNCS 3669, pages 215-225, 2005.
Josep Díaz, Zvi Lotker, Maria Serna. The distant-2 chromatic number of random proximity and random geometric graphs. Information Processing Letters 106(4):144-148, 2008. [link]
S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Mobile search for a black hole in an anonymous ring. Algorithmica, to appear.
S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Searching for a black hole in arbitrary networks: optimal mobile agents protocols. Distributed Computing, 19(1), 1-19, 2006.
S. Dobrev,P. Flocchini, R. Kralovic, G. Prencipe, P. Ruzicka, and N. Santoro. Optimal search for a black hole in common interconnection networks. Networks, 47 (2), p. 61-71, 2006.
S. Dobrev, P. Flocchini, and N. Santoro. Cycling through a dangerous network: a simple efficient strategy for black hole search. Proc. of 26th International Conference on. Distributed Computing Systems (ICDCS), 57-69, 2006.
S. Dobrev, P. Flocchini, R. Kralovic, and N. Santoro. Exploring a dangerous unknown graph using tokens. In Proc. of 5th IFIP International Conference on Theoretical Computer Science (TCS), 131-150, 2006.
F. Dorn, F. V. Fomin, and D. M. Thilikos, Subexponential parameterized algorithms. Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), Springer-Verlag Lecture Notes in Computer Science, vol. 4596, 2007, pp. 15--27. [link]
W. Dosch, M. Meriste, L. Motus (2007). Enriching Interactive Components With Again Commands. Proceedings of the 2007 IEEE International Conference on Electro/Information Technology (EIT 2007). Chicago, Illinois, May 17-20, 2007.
W. Dosch, M. Meriste, L. Motus (2005). Time-awareness and Proactivity in Models of Interactive Computation. Electronic Notes in Theoretical Computer Science 141, 69-95
Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar and Nicolas Schabanel Could any graph be turned into a small world? Theoretical Computer Science special issue on Complex Networks 355(1), pp 96 - 103 (2006). [link]
Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar and Nicolas Schabanel Towards small world emergence Proceedings of SPAA'06, 18th ACM Symposium on Parallelism in Algorithms and Architectures, pp 225-232 (2006). [link]
C. Efthymiou, S. Nikoletseas and J. Rolim. Energy Balanced Data Propagation in Wireless Sensor Networks. Wireless Networks (WINET) Journal, Special Issue on "Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, Article ID*05-NO00006529, Springer Verlag, 2006.
Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su. Broadcasting in UDG Radio Networks with Unknown Topology. 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), 2007.
Paola Flocchini, Leszek Gasieniec. 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings Springer 2006. [link]
P. Flocchini, A. Pelc, N. Santoro, Fault-tolerant sequential scan, Theory of Computing Systems, to appear.
P. Flocchini, G. Prencipe, and N. Santoro. Self-Deployment of Mobile Sensors on a Ring. Theoretical Computer Science, to appear.
P. Flocchini, L. Pagli, G. Prencipe, and N. Santoro. Distributed computation of all node replacements of a minimum spanning tree. Proc. Euro-Par 2007.
P. Flocchini, A. Mesa, L. Pagli, G. Prencipe, and N. Santoro. Point-of-failure shortest path rerouting: computing the optimal swaps distributively. IEICE Transactions on Information and Systems, vol. E89-D, n. 2, 700-708, 2006.
P. Flocchini, and N. Santoro. Distributed Security Algorithms by Mobile Agents. Proc. 9th Int. Conference on Distributed Computing and Networking, (ICDCN) 1-14, 2006.
P. Flocchini, G. Prencipe, and N. Santoro. Self-deployment algorithms for mobile sensors on a ring. Proc. 2nd International Workshop on Algorithmic Aspects of Wireless Sensor Networks, LNCS 4240, 59-70, 2006.
P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Gathering of asynchronous mobile robots with limited visibility. Theoretical Computer Science, vol. 337 :1-3, 147-168, 2005.
Fedor V. Fomin and Dimitrios M. Thilikos, On self duality of pathwidth in polyhedral graph embeddings, Journal of Graph Theory, 55 (1), (2007), pp. 42--54. [link]
F. Fomin, P. Fraigniaud and N. Nisse. Nondeterministic Graph Searching: From Pathwidth to Treewidth. In 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2005. [link]
F. V. Fomin and D. M. Thilikos, A $3$-approximation for the pathwidth of Halin graphs, Journal of Discrete Algorithms 4 (4), (2006), pp. 499--510. [link]
F. V. Fomin and D. M. Thilikos, \emph{Dominating sets in planar graphs: branch-width and exponential speed-up, SIAM Journal on Computing 36 (2), (2006), pp. 281-–309. [link]
F. V. Fomin and D. M. Thilikos, New upper bounds on the decomposability of planar graphs, Journal of Graph Theory 51 (1), (2006), pp. 53--81. [link]
Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc. Collective tree exploration. Networks 48(3): 166-177 (2006). [link]
P. Fraigniaud, C. Gavoille, D. Ilcinkas, A. Pelc, Distributed computing with advice: information sensitivity of graph coloring, Proc. 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), LNCS 4596, 231-242. [link]
P. Fraigniaud, D. Ilcinkas, A. Pelc, Tree exploration with an oracle, Proc. 31st International Symposium on Mathematical Foundations of Computer Science, (MFCS 2006), LNCS 4162, 24-37. [link]
Pierre Fraigniaud, David Ilcinkas and Andrzej Pelc. Oracle Size: a New Measure of Difficulty for Communication Tasks. Proc. of 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 179-187, 2006. [link]
P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, D. Peleg, Graph exploration by a finite automaton, Theoretical Computer Science 345 (2005), 331-344. [link]
Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski , Emmanuelle Lebhar and Zvi Lotker. Universal Augmentation Schemes for Network Navigability: Overcoming the sqrt(n)-Barrier Proceedings of SPAA'07, 19th ACM Symposium on Parallelism in Algorithms and Architectures, pp 1-7 (2007). [link]
Pierre Fraigniaud, Amos Korman and Emmanuelle Lebhar. Local MST Computation with Short Advice Proceedings of SPAA'07, 19th ACM Symposium on Parallelism in Algorithms and Architectures, pp 154-160 (2007) [link]
Pierre Fraigniaud, Emmanuelle Lebhar and Zvi Lotker. A doubling dimension threshold Theta(loglog n) for augmented graphs navigability Proceedings of ESA'06, 14th Annual European Symposium on Algorithm, pp 376-386 (2006). [link]
Clemente Galdi and Christos Kaklamanis and Manuela Montangero and Giuseppe Persiano Station Placement in Networks Parallel Processing Letters 15(1-2): pages 117-130 2005. [link]
Leszek Gasieniec, Erez Kantor, Dariusz R. Kowalski, David Peleg, Chang Su, Energy and Time Efficient Broadcasting in Known Topology Radio Networks, 21st International Symposium on Distributed Computing (DISC), 2007.
Leszek Gasieniec, Ralf Klasing, Russell Martin, Alfredo Navarra, Xiaohui Zhang. Fast periodic graph exploration with constant memory. 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp 26-40, 2007. [link]
Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, X. Zhang. Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring. SOFSEM 2006, pp 282-292. [link]
Leszek Gasieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin. Deterministic M2M multicast in radio networks. Theor. Comput. Sci. 362(1-3): 196-206 (2006). [link]
Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang. Tree exploration with logarithmic memory. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp 585-594, 2007.
Leszek Gasieniec, David Peleg, Qin Xin. Faster communication in known topology radio networks. Distributed Computing vol 19 issue 4 pp 289-300, 2007. [link]
Leszek Gasieniec, David Peleg, Qin Xin. Faster communication in known topology radio networks. 24th Annual ACM Symposium on Principles of Distributed Computing, PODC 2005: 129-137. [link]
Leszek Gasieniec, Chang Su, Prudence W. H. Wong, Qin Xin. Routing of single-source and multiple-source queries in static sensor networks. J. Discrete Algorithms 5(1): 1-11 (2007). [link]
Keijo Haataja. Evaluation of the Current State of Bluetooth Security. Licentiate Thesis, University of Kuopio, Department of Computer Science, Finland, January 2007. [link]
Jaap-Henk Hoepman, Shay Kutten, Zvi Lotker. Randomised Distributed Weighted Matchings on Trees. Sirocco 2006, page 115-129.
Risto Honkanen, Ville Leppänen, Martti Penttonen. Address-free all-to-all routing in sparse torus. in V. Malyshkin (Ed.): Proc. PaCT 2007, LNCS 4671, pp. 200-205
Christos Kaklamanis and Danny Krizanc and Manuela Montangero and Giuseppe Persiano Efficient automatic simulation of parallel computation on networks of workstations Discrete Applied Mathematics 154(10): pages 1500-1509 2006. [link]
R. Klasing, E. Markou, A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, Proc. 17th International Symposium on Algorithms and Computation (ISAAC 2006), LNCS 4288, 744-753.
Ralf Klasing, Zvi Lotker, Alfredo Navarra, St\'ephane P\'erennes. From Balls and Bins to Points and Vertices. In Algorithms and Computation, 16th International Symposium, (ISAAC 2005), Lecture Notes in Computer Science 3827, Springer, pp.757-766, 2005.
A. Korman S. Kutten and D. Peleg. Proof Labeling Schemes. Proc. 24th Annual Symposium on Principles of Distributed Computing (PODC), July 2005.
A. Korman and D. Peleg. Dynamic Routing Schemes for General Graphs. Proc. 33rd Int. Colloq. on Automata, Languages and Prog. (ICALP), July 2006.
A. Korman and S. Kutten. Distributed Verification of Minimum Spanning Trees. Proc. 25th Annual Symposium on Principles of Distributed Computing (PODC), July 2006.
A. Korman, D. Peleg and Y. Rodeh. “Constructing Labeling Schemes through Universal Matrices.”. Proc. 17th Int. Symp. on Algorithms and Computation (ISAAC), Dec. 2006.
A. Korman and S. Kutten. Labeling Schemes with Queries. Proc. 14th Int. Colloq. on Structural Information and Communication Complexity (SIROCCO), June 2007.
A. Korman and S. Kutten. Controller and Estimator for Dynamic Networks. Proc. 26th Ann. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), August 2007.
A.Korman and D. Peleg. Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes. Proc. 21st Int. Symp. on Distributed Computing (DISC), Sep., 2007.
A. Korman and D. Peleg. Dynamic Routing Schemes for Graphs with Low Local Density. To appear in ACM Transactions on Algorithms.
A. Korman and D. Peleg. “Labeling Schemes for Weighted Dynamic Trees”. To appear in Information and Computation.
A. Korman and S. Kutten. “Distributed Verification of Minimum Spanning Trees. To appear in Distributed Computing (Special Issue of PODC 06).
Dariusz R. Kowalski, Adam Malinowski. How to Meet in Anonymous Network. 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp44-58, 2006. [link]
Dariusz R. Kowalski, Andrzej Pelc. Optimal Deterministic Broadcasting in Known Topology Radio Networks, Distributed Computing 19(3): 185-195 (2007). [link]
Dariusz R. Kowalski, Andrzej Pelc. Broadcasting in undirected ad hoc radio networks. Distributed Computing 18(1): 43-57 (2005) [link]
Dariusz R. Kowalski, Andrzej Pelc. Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theor. Comput. Sci. 333(3): 355-371 (2005) [link]
Dariusz R. Kowalski, Michal Strojnowski On the communication surplus incurred by faulty processors 21st International Symposium on Distributed Computing (DISC), 2007.
M. Kowaluk and A. Lingas. Unique Lowest Common Ancestors in Dags are Almost as Easy as Matrix Multiplication. Proc. 15th Annual European Symposium on Algorithms (ESA), 2007.
M. Kowaluk and A. Lingas. LCA queries in directed acyclic graphs. Proc. ICALP 2005, July 2005, LNCS 3580, pp. 241-248.
E. Kranakis, M. Paquette, A. Pelc, Communication in networks with random dependent faults, Proc. 32nd International Symposium on Mathematical Foundations of Computer Science, (MFCS 2007).
Pierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim. An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Sensors Networks. DCOSS 2005: 35-48
Andrey Lukyanenko. On the optimality and the stability of backoff protocols. in Y. Koucheryavy, J. Harju, A. Sayenko (Eds.): Proc. NEW2AN 2007, LNCS 4712, pp. 393-408.
Fredrik Manne, Morten Mjelde, Laurence Pilard and Sebastien Tixeuil. A New Self-Stabilizing Maximal Matching Algorithm. Proc. of 14th Colloquium on Structural Information and Communication Complexity (Sirocco 2007). [link]
Marios Mavronicolas, Vicky G. Papadopoulou, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis The Price of Defense and Fractional Matchings Proc. of the 8th International Conference on Distributed Computing and Networking (ICDCN), pages 115-126 2006. [link]
M. Meriste, L. Motus, T. Kelder, J. Helekivi, A. Marandi, J. Preden. Location awareness of information agents. Advances in Databases and Information Systems, Springer, LNCS, vol.3631, 199-208
M. Meriste, L. Motus, T. Kelder, J. Helekivi, A. Marandi. On Geospatial Agents. Proc.1st International Conference on Web Information Systems and Technologies, WEBIST2005, ISBN: 972-8865-20-1, Miami 2005, 210-213
M. Meriste, L. Motus, T. Kelder, J. Helekivi. C# Templates for Time-aware Agents. Proc. 7th International Conference on Enterprise Information Systems ICEIS2005, ISBN 972-8865-19-8, Miami 2005, vol.4., 247-250
L. Motus, R. A. Vingerhoeds, M. Meriste (2005). Challenges for Real-Time Systems Engineering, part 1: State-of-the-art. Proc. of the Estonian Academy of Sciences. Engineering, vol.11, no.1, 3-17
L. Motus, R. A. Vingerhoeds, M. Meriste (2005) Challenges for Real-Time Systems Engineering, part 2: Towards Time-aware Technology. Proc. of the Estonian Academy of Sciences. Engineering, vol. 11, no.1, 18-30
L. Motus, Meriste, M., Preden, J-S. (2006). Network Enabled Capabilities -- Grassroots Perspectives. NATO RTO/IST Symposium on "Dynamic Communication Management" North Atlantic Treaty Organization, pp. 16-1 - 16-13.
A. Pelc, D. Peleg, Broadcasting with locally bounded Byzantine faults, Information Processing Letters 93 (2005), 109-115.
A. Pelc, D. Peleg, Feasibility and complexity of broadcasting with random transmission failures, Proc. 24th Ann. ACM Symposium on Principles of Distributed Computing (PODC'2005), 334-341.
Paolo Penna and Guido Proietti and Peter Widmayer Strongly Polynomial-Time Truthful Mechanisms in One Shot Proceedings of Second International Workshop on Internet and Network Economics (WINE): pages 377-388 2006. [link]
Paolo Penna, Guido Proietti, Peter Widmayer. Strongly Polynomial-Time Truthful Mechanisms in One Shot. Proc. of the 2nd Workshop on Internet and Network Economics, WINE 2006, LNCS 4286, pp. 377-388 [link]
Olivier Powell, Sotiris E. Nikoletseas. Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks. WEA 2007: 161-174
Beat Gfeller, Nicola Santoro, Peter Widmayer: A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree. 21st International Symposium on Distributed Computing (DISC), pp. 268-282, 2007. [link]
Lima, L. and Barros, J., Random walks on sensor networks, Proc. 5th International Syposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt 2007)
T. Erlebach, K. Jansen, C. Kaklamanis, G. Persiano. Directed Tree Networks. Chapter in Encyclopedia of Optimization, 2008, to appear. [link]
S. Dolev, E. M. Schiller, P. G. Spirakis, and P. Tsigas. Brief announcement: Game authority for robust and scalable distributed selfish-computer systems. In Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (PODCS 2007), p. 356--357, ACM Press 2007. [link]
Marcin Bienkowski, Jaroslaw Kutylowski, The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces, WADS 2007, 337-348, [link]
Miroslaw Dynia, Jakub Lopuszanski, Christian Schindelhauer, Why Robots Need Maps, SIROCCO 2007, 41-50, [link].
J. Diaz, M. Serna, D. Thilikos (2007). Complexity issues on bounded restrictive H-coloring. Discrete Mathematics 307(16):2082-2093
J. Diaz, M. Serna, D. Thilikos (2008). Efficient algorithms for counting parameterized list H-colorings Journal of Computer and System Sciences, in press.