Alfredo Navarra

J. Comput. Syst. Sci., February, 2024

Mutual-Visibility in Fibonacci Cubes.

[BibT_eX]

[DOI]

Proceedings of the Advanced Information Networking and Applications, 2024

Interoperability Between EVM-Based Blockchains.

[BibT_eX]

[DOI]

Proceedings of the Advanced Information Networking and Applications, 2024

On Coverage in Multi-Interface Networks with Bounded Pathwidth.

[BibT_eX]

[DOI]

Proceedings of the Advanced Information Networking and Applications, 2024

2023

The geodesic mutual visibility problem: Oblivious robots on grids and trees.

[BibT_eX]

[DOI]

Pervasive Mob. Comput., October, 2023

Optimal vs rotation heuristics in the role of cluster-head for routing in IoT constrained devices.

[BibT_eX]

[DOI]

Renato De Leone

Internet Things, July, 2023

Arbitrary pattern formation on infinite regular tessellation graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Mutual visibility in hypercube-like graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Molecular Oblivious Robots: A New Model for Robots With Assembling Capabilities.

[BibT_eX]

[DOI]

IEEE Access, 2023

Brief Announcement: Line Formation in Silent Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Asynchronous Silent Programmable Matter: Line Formation.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Time-Optimal Geodesic Mutual Visibility of Robots on Grids Within Minimum Area.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Silent Programmable Matter: Coating.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

The Geodesic Mutual Visibility Problem for Oblivious Robots: the case of Trees.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Distributed Computing and Networking, 2023

Scattering with Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the Advanced Information Networking and Applications, 2023

Blockchain and IoT Integration for Air Pollution Control.

[BibT_eX]

[DOI]

Alessandro Bigiotti

Proceedings of the Advances on P2P, Parallel, Grid, Cloud and Internet Computing, 2023

2022

Speeding up Routing Schedules on Aisle Graphs With Single Access.

[BibT_eX]

[DOI]

IEEE Trans. Robotics, 2022

Designing Distributed Algorithms for Autonomous Robots.

[BibT_eX]

[DOI]

Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

Optimal and Heuristic Algorithms for Data Collection by Using an Energy- and Storage-Constrained Drone.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Wireless Networks, 2022

Molecular Robots with Chirality on Grids.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Wireless Networks, 2022

NARUN-PC: Caching Strategy for Noise Adaptive Routing in Utility Networks.

[BibT_eX]

[DOI]

Fabio Pagnotta

Proceedings of the Advanced Information Networking and Applications, 2022

Robot Based Computing System: An Educational Experience.

[BibT_eX]

[DOI]

Proceedings of the Advanced Information Networking and Applications, 2022

Blockchain and IoT Integration for Pollutant Emission Control.

[BibT_eX]

[DOI]

Proceedings of the Advanced Information Networking and Applications, 2022

2021

Gathering robots in graphs: The central role of synchronicity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Fast File Transfers from IoT Devices by Using Multiple Interfaces.

[BibT_eX]

[DOI]

Francesco Nobili

Sensors, 2021

A structured methodology for designing distributed algorithms for mobile entities.

[BibT_eX]

[DOI]

Inf. Sci., 2021

On the effectiveness of the genetic paradigm for polygonization.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

Solving the Pattern Formation by Mobile Robots With Chirality.

[BibT_eX]

[DOI]

IEEE Access, 2021

"Semi-Asynchronous": A New Scheduler in Distributed Computing.

[BibT_eX]

[DOI]

IEEE Access, 2021

Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

MOBLOT: Molecular Oblivious Robots.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

UAVs Route Planning in Sea Emergencies.

[BibT_eX]

[DOI]

Nicholas Formica

Proceedings of the Advanced Information Networking and Applications, 2021

2020

On the curve complexity of 3-colored point-set embeddings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Energy consumption balancing in multi-interface networks.

[BibT_eX]

[DOI]

J. Ambient Intell. Humaniz. Comput., 2020

Budgeted constrained coverage on bounded carving-width and series-parallel multi-interface networks.

[BibT_eX]

[DOI]

Internet Things, 2020

A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study.

[BibT_eX]

[DOI]

CoRR, 2020

Graph Planarity by Replacing Cliques with Paths.

[BibT_eX]

[DOI]

Algorithms, 2020

Constrained Connectivity in Bounded X-Width Multi-Interface Networks.

[BibT_eX]

[DOI]

Algorithms, 2020

Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction.

[BibT_eX]

[DOI]

IEEE Access, 2020

Optimal Routing Schedules for Robots Operating in Aisle-Structures.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020

Speeding-up Routing Schedules on Aisle-Graphs.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Distributed Computing in Sensor Systems, 2020

Leader Election and Compaction for Asynchronous Silent Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Budgeted Constrained Coverage on Series-Parallel Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the Advanced Information Networking and Applications, 2020

2019

Asynchronous Robots on Graphs: Gathering.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing by Mobile Entities, 2019

Embedded pattern formation by asynchronous robots without chirality.

[BibT_eX]

[DOI]

Distributed Comput., 2019

Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach.

[BibT_eX]

[DOI]

Distributed Comput., 2019

Bamboo Garden Trimming Problem: Priority Schedulings.

[BibT_eX]

[DOI]

Algorithms, 2019

CER-CH: Combining Election and Routing Amongst Cluster Heads in Heterogeneous WSNs.

[BibT_eX]

[DOI]

Matteo Micheletti

IEEE Access, 2019

On Gathering of Semi-synchronous Robots in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Priority Scheduling in the Bamboo Garden Trimming Problem.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Gathering Synchronous Robots in Graphs: From General Properties to Dense and Symmetric Topologies.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

Asynchronous Rendezvous with Different Maps.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

Distributing Energy Consumption in Multi-interface Series-Parallel Networks.

[BibT_eX]

[DOI]

Proceedings of the Web, Artificial Intelligence and Network Applications, 2019

2018

Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Gathering of robots on meeting-points: feasibility and optimal resolution algorithms.

[BibT_eX]

[DOI]

Distributed Comput., 2018

"Semi-Asynchronous": A New Scheduler for Robot Based Computing Systems.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

Turning Cliques into Paths to Achieve Planarity.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Energy Saving and Collision-Free Motion Planning for Oblivious Robots.

[BibT_eX]

[DOI]

Diletta Cacciagrano

Proceedings of the 32nd International Conference on Advanced Information Networking and Applications Workshops, 2018

Approximation and Exact Algorithms for Optimally Placing a Limited Number of Storage Nodes in a Wireless Sensor Network.

[BibT_eX]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Online knapsack of unknown capacity: How to optimize energy consumption in smartphones.

[BibT_eX]

[DOI]

Cristina M. Pinotti

Theor. Comput. Sci., 2017

Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks.

[BibT_eX]

[DOI]

Giorgio Audrito

Alan A. Bertossi

J. Discrete Algorithms, 2017

Gathering of oblivious robots on infinite grids with minimum traveled distance.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings.

[BibT_eX]

[DOI]

Distributed Comput., 2017

A unified approach for gathering and exclusive searching on rings under weak assumptions.

[BibT_eX]

[DOI]

Nicolas Nisse

Distributed Comput., 2017

Asynchronous Pattern Formation: the effects of a rigorous approach.

[BibT_eX]

[DOI]

CoRR, 2017

Colored Point-Set Embeddings of Acyclic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016

The Minimum k-Storage Problem: Complexity, Approximation, and Experimental Analysis.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2016

Gathering of robots on anonymous grids and trees without multiplicity detection.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Asynchronous Embedded Pattern Formation Without Orientation.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 30th International Symposium, 2016

Improved Protocols for Luminous Asynchronous Robots.

[BibT_eX]

[DOI]

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Characterizing the Computational Power of Anonymous Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

Algorithms for Services with Multiple Levels of Quality.

[BibT_eX]

[DOI]

Proceedings of the 30th International Conference on Advanced Information Networking and Applications Workshops, 2016

2015

Interference-free scheduling with minimum latency in cluster-based wireless sensor networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2015

Explore and repair graphs with black holes using mobile entities.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

The minimum k-storage problem on directed graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs.

[BibT_eX]

[DOI]

Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks.

[BibT_eX]

[DOI]

Algorithmica, 2015

Online Knapsack of Unknown Capacity: - Energy Optimization for Smartphone Communications.

[BibT_eX]

[DOI]

Daniele Diodati

Cristina M. Pinotti

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Balancing Energy Consumption for the Establishment of Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings.

[BibT_eX]

[DOI]

Pietro Montanari

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

MinMax-Distance Gathering on Given Meeting Points.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Gathering of Robots on Meeting-Points.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2015

2014

Flow Problems in Multi-Interface Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2014

Gathering six oblivious robots on anonymous symmetric rings.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

The Game of Scintillae: From Cellular Automata to Computing and Cryptography Systems.

[BibT_eX]

[DOI]

J. Cell. Autom., 2014

Gathering on rings under the Look-Compute-Move model.

[BibT_eX]

[DOI]

Distributed Comput., 2014

Optimal Gathering on Infinite Grids.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

Optimal placement of storage nodes in a wireless sensor network.

[BibT_eX]

[DOI]

Daniele Diodati

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

Gathering and Exclusive Searching on Rings under Minimal Assumptions.

[BibT_eX]

[DOI]

Nicolas Nisse

Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2014

2013

Maximum matching in multi-interface networks.

[BibT_eX]

[DOI]

Dominik Pajak

Theor. Comput. Sci., 2013

Optimal Gathering of Oblivious Robots in Anonymous Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2013

A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

Approximation Bounds for the Minimum k-Storage Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

Exploring and Making Safe Dangerous Networks Using Mobile Entities.

[BibT_eX]

[DOI]

Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

2012

Localization and scheduling protocols for actor-centric sensor networks.

[BibT_eX]

[DOI]

Sajal K. Das

Giacomo Ghidini

Networks, 2012

VIBE: An energy efficient routing protocol for dense and mobile sensor networks.

[BibT_eX]

[DOI]

Aris A. Papadopoulos

Julie A. McCann

J. Netw. Comput. Appl., 2012

Distributed colorings for collision-free routing in sink-centric sensor networks.

[BibT_eX]

[DOI]

Andrea Formisano

J. Discrete Algorithms, 2012

Graph Decomposition for Memoryless Periodic Exploration.

[BibT_eX]

[DOI]

Algorithmica, 2012

Minimize the Maximum Duty in Multi-interface Networks.

[BibT_eX]

[DOI]

Algorithmica, 2012

How to Gather Asynchronous Oblivious Robots on Anonymous Rings.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Effects of IDSs on the WSNs Lifetime: Evidence of the Need of New Approaches.

[BibT_eX]

[DOI]

Proceedings of the 11th IEEE International Conference on Trust, 2012

Gathering of Robots on Anonymous Grids without Multiplicity Detection.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2012

UHEED - An Unequal Clustering Algorithm for Wireless Sensor Networks.

[BibT_eX]

Proceedings of the SENSORNETS 2012, 2012

Broadcast analysis in dense duty-cycle sensor networks.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication, 2012

Scintillae: How to Approach Computing Systems by Means of Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata, 2012

2011

Dense, Concentric, and Non-uniform Multi-hop Sensor Networks.

[BibT_eX]

[DOI]

Sajal K. Das

Cristina M. Pinotti

Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

Efficient Location Training Protocols for Heterogeneous Sensor and Actor Networks.

[BibT_eX]

[DOI]

Vlady Ravelomanana

IEEE Trans. Mob. Comput., 2011

Synchronous black hole search in directed graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Recoverable Robust Timetables: An Algorithmic Approach on Trees.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2011

Bandwidth Constrained Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Min-Max Coverage in Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Gathering of Six Robots on Anonymous Symmetric Rings.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

Maximum flow and minimum-cost flow in multi-interface networks.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, 2011

Maximum bandwidth broadcast in single and multi-interface networks.

[BibT_eX]

[DOI]

Alan A. Bertossi

Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, 2011

2010

Exploiting multi-interface networks: Connectivity and Cheapest Paths.

[BibT_eX]

[DOI]

Wirel. Networks, 2010

Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Cooperative training for high density sensor and actor networks.

[BibT_eX]

[DOI]

Vlady Ravelomanana

Roberto Ciotti

IEEE J. Sel. Areas Commun., 2010

Collision-Free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2010

Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

Topology Control and Routing in Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009

Recoverable Robustness in Shunting and Timetabling.

[BibT_eX]

[DOI]

Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Cost minimization in wireless networks with a bounded and unbounded number of interfaces.

[BibT_eX]

[DOI]

Networks, 2009

On the complexity of distributed graph coloring with local minimality constraints.

[BibT_eX]

[DOI]

Networks, 2009

Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases.

[BibT_eX]

[DOI]

J. Comb. Optim., 2009

Layouts for mobility management in wireless ATM networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

From Balls and Bins to Points and Vertices.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2009

Recoverable Robustness for Train Shunting Problems.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2009

Cooperative Training in Wireless Sensor and Actor Networks.

[BibT_eX]

[DOI]

Roberto Ciotti

Vlady Ravelomanana

Proceedings of the Quality of Service in Heterogeneous Networks, 2009

Synchronization Helps Robots to Detect Black Holes in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Graph Decomposition for Improving Memoryless Periodic Exploration.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Evaluation of Recoverable-Robust Timetables on Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

CoP3D: Context-aware Overlay Tree for Content-based Control Systems.

[BibT_eX]

Mauro Caporuscio

Proceedings of the ICINCO 2009, 2009

Cheapest Paths in Multi-interface Networks.

[BibT_eX]

[DOI]

Ferruccio Barsi

Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

Recoverable Robust Timetables on Trees.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2009

2008

Tightening the upper bound for the minimum energy broadcasting.

[BibT_eX]

[DOI]

Wirel. Networks, 2008

Asymptotically Optimal Solutions for Small World Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

Synthesis of decentralized and concurrent adaptors for correctly assembling distributed component-based systems.

[BibT_eX]

[DOI]

J. Syst. Softw., 2008

Fast periodic graph exploration with constant memory.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2008

Distributed Intrusion Detection Systems for Enhancing Security in Mobile Wireless Sensor Networks.

[BibT_eX]

[DOI]

Int. J. Distributed Sens. Networks, 2008

3-Dimensional minimum energy broadcasting problem.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2008

Grid emulation for managing random sensor networks.

[BibT_eX]

[DOI]

Zvi Lotker

Ad Hoc Networks, 2008

Connectivity in Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the Trustworthy Global Computing, 4th International Symposium, 2008

Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Efficient binary schemes for training heterogeneous sensor and actor networks.

[BibT_eX]

[DOI]

Ferruccio Barsi

Proceedings of the 1st ACM International Workshop on Heterogeneous Sensor and Actor Networks, 2008

Delay Management Problem: Complexity Results and Robust Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Improved Approximation Results for the Minimum Energy Broadcasting Problem.

[BibT_eX]

[DOI]

Algorithmica, 2007

Energetic performance of service-oriented multi-radio networks: issues and perspectives.

[BibT_eX]

[DOI]

Proceedings of the 6th International Workshop on Software and Performance, 2007

On the Complexity of Distributed Greedy Coloring.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 21st International Symposium, 2007

Cost Minimisation in Unbounded Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2007

Cost Minimisation in Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the Network Control and Optimization, 2007

Distributed Localization Strategies for Sensor Networks.

[BibT_eX]

[DOI]

Alberto Tofani

Proceedings of the IEEE 4th International Conference on Mobile Adhoc and Sensor Systems, 2007

SYNTHESIS: A Tool for Automatically Assembling Correct and Distributed Component-Based Systems.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Software Engineering (ICSE 2007), 2007

Robust Algorithms and Price of Robustness in Shunting Problems.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2007, 2007

2006

Sharing the cost of multicast transmissions in wireless networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

The "real" approximation factor of the MST heuristic for the minimum energy broadcasting.

[BibT_eX]

[DOI]

Stephane Perennes

ACM J. Exp. Algorithmics, 2006

Efficient offline algorithms for the bicriteria <i>k</i>-server problem and online applications.

[BibT_eX]

[DOI]

Gaia Nicosia

J. Discrete Algorithms, 2006

3-D Minimum Energy Broadcasting.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2006

Unbalanced Points and Vertices Problem.

[BibT_eX]

[DOI]

Zvi Lotker

Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

About the Lifespan of Peer to Peer Networks, .

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Managing Random Sensor Networks by means of Grid Emulation.

[BibT_eX]

[DOI]

Zvi Lotker

Proceedings of the NETWORKING 2006, 2006

Synthesis of Concurrent and Distributed Adaptors for Component-Based Systems.

[BibT_eX]

[DOI]

Proceedings of the Software Architecture, Third European Workshop, 2006

Distributed IDSs for enhancing Security in Mobile Wireless Sensor Networks.

[BibT_eX]

[DOI]

Paola Inverardi

Proceedings of the 20th International Conference on Advanced Information Networking and Applications (AINA 2006), 2006

2005

On routing of wavebands for all-to-all communications in all-optical paths and cycles.

[BibT_eX]

[DOI]

Andrzej Proskurowski

Theor. Comput. Sci., 2005

Wireless ATM Layouts for Chain Networks.

[BibT_eX]

[DOI]

Giorgio Gambosi

Mob. Networks Appl., 2005

Tighter Bounds for the Minimum Energy Broadcasting Problem.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Symposium on Modeling and Optimization in Mobile, 2005

Connectionless probabilistic (CoP) routing: an efficient protocol for mobile wireless ad-hoc sensor networks.

[BibT_eX]

[DOI]

Aris A. Papadopoulos

Julie A. McCann

Proceedings of the 24th IEEE International Performance Computing and Communications Conference, 2005

2004

Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem.

[BibT_eX]

[DOI]

Proceedings of the NETWORKING 2004, 2004

2003

Optimization issues in ATM, optical and wireless communication networks.

[BibT_eX]

[DOI]

PhD thesis, 2003

On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles.

[BibT_eX]