Alan A. Bertossi

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

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

[BibT_eX]

[DOI]

Giorgio Audrito

Alfredo Navarra

J. Discrete Algorithms, 2017

2015

Storage Placement in Path Networks.

[BibT_eX]

[DOI]

Daniele Diodati

Cristina M. Pinotti

IEEE Trans. Computers, 2015

2011

Efficient Location Training Protocols for Heterogeneous Sensor and Actor Networks.

[BibT_eX]

[DOI]

Vlady Ravelomanana

IEEE Trans. Mob. Comput., 2011

Maximum bandwidth broadcast in single and multi-interface networks.

[BibT_eX]

[DOI]

Alfredo Navarra

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

2010

Allocating data for broadcasting over wireless channels subject to transmission errors.

[BibT_eX]

[DOI]

Paolo Barsocchi

Francesco Potorti

Wirel. Networks, 2010

2009

Asynchronous Corona Training Protocols in Wireless Sensor and Actor Networks.

[BibT_eX]

[DOI]

Francesco Betti Sorbelli

Roberto Ciotti

IEEE Trans. Parallel Distributed Syst., 2009

Optimal receiver scheduling algorithms for a multicast problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Efficient heuristics for data broadcasting on multiple channels.

[BibT_eX]

[DOI]

Wirel. Networks, 2008

Efficient corona training protocols for sensor networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Efficient binary schemes for training heterogeneous sensor and actor networks.

[BibT_eX]

[DOI]

Alfredo Navarra

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

2007

Scheduling Data Broadcasts on Wireless Channels.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Approximate L(delta1, delta2, ..., deltat)-coloring of trees and interval graphs.

[BibT_eX]

[DOI]

Networks, 2007

Asynchronous training in SANET.

[BibT_eX]

[DOI]

Francesco Betti Sorbelli

Roberto Ciotti

Proceedings of the First ACM Workshop on Sensor and Actor Networks, 2007

Asynchronous Training in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Francesco Betti Sorbelli

Roberto Ciotti

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2007

2006

Guest Editorial.

[BibT_eX]

[DOI]

Azzedine Boukerche

Wirel. Networks, 2006

Special issue: Algorithms for wireless and ad-hoc networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2006

Skewed allocation of non-uniform data for broadcasting over multiple channels.

[BibT_eX]

[DOI]

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Scheduling Hard-Real-Time Tasks with Backup Phasing Delay.

[BibT_eX]

[DOI]

Alessandra Menapace

Proceedings of the 10th IEEE International Symposium on Distributed Simulation and Real-Time Applications (DS-RT 2006), 2006

Efficient Training of Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006

2005

Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel.

[BibT_eX]

[DOI]

Elia Ardizzoni

Shashank Ramaprasad

Madhusudana V. S. Shashanka

IEEE Trans. Computers, 2005

Guest Editorial.

[BibT_eX]

[DOI]

Amotz Bar-Noy

Cauligi S. Raghavendra

Mob. Networks Appl., 2005

2004

Classifying Matrices Separating Rows and Columns.

[BibT_eX]

[DOI]

Si-Qing Zheng

IEEE Trans. Parallel Distributed Syst., 2004

Channel assignment for interference avoidance in honeycomb wireless networks.

[BibT_eX]

[DOI]

Anil M. Shende

J. Parallel Distributed Comput., 2004

Allocating servers in infostations for bounded simultaneous requests.

[BibT_eX]

[DOI]

Phalguni Gupta

J. Parallel Distributed Comput., 2004

Time and work optimal simulation of basic reconfigurable meshes on hypercubes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2004

Optimal Multi-Channel Data Allocation with Flat Broadcast Per Channel.

[BibT_eX]

[DOI]

Shashank Ramaprasad

Madhusudana V. S. Shashanka

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003

Channel Assignment with Separation for Interference Avoidance in Wireless Networks.

[BibT_eX]

[DOI]

Richard B. Tan

IEEE Trans. Parallel Distributed Syst., 2003

Allocating Servers in Infostations for On-Demand Communications.

[BibT_eX]

[DOI]

Phalguni Gupta

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Channel Assignment on Strongly-Simplicial Graphs.

[BibT_eX]

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Channel Assignment in Honeycomb Networks.

[BibT_eX]

[DOI]

Anil M. Shende

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

2002

Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2002

Foreword.

[BibT_eX]

[DOI]

Algorithmica, 2002

Channel Assignment with Separation for Special Classes of Wireless Networks: Grids and Rings.

[BibT_eX]

[DOI]

Richard B. Tan

Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

2001

A randomized saturation degree heuristic for channel assignment in cellular radio networks.

[BibT_eX]

[DOI]

Daniela Cavallaro

IEEE Trans. Veh. Technol., 2001

Cellular Channel Assignment: A New Localized and Distributed Strategy.

[BibT_eX]

[DOI]

Mauro Brunato

Mob. Networks Appl., 2001

Editorial.

[BibT_eX]

[DOI]

Silvano Martello

Discret. Appl. Math., 2001

2000

A Residue Number System on Reconfigurable Mesh with Applications to Prefix Sums and Approximate String Matching.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2000

Constant Time Dynamic Programming on Directed Reconfigurable Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2000

Optimal Segmented Scan and Simulation of Reconfigurable Architectures on Fixed Connection Networks.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing, 2000

Efficient use of radio spectrum in wireless networks with channel separation between close stations.

[BibT_eX]

[DOI]

Richard B. Tan

Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2000), 2000

Mappings for Conflict-Free Access of Paths in Elementary Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

Assigning codes in wireless networks: bounds and scaling properties.

[BibT_eX]

[DOI]

Wirel. Networks, 1999

Fault-Tolerant Rate-Monotonic First-Fit Scheduling in Hard-Real-Time Systems.

[BibT_eX]

[DOI]

Federico Rossini

IEEE Trans. Parallel Distributed Syst., 1999

Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1999

1998

New number representation and conversion techniques on reconfigurable mesh.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference On High Performance Computing, 1998

1997

P-Bandwidth Priority Queues on Reconfigurable Tree of Meshes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1997

Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks.

[BibT_eX]

[DOI]

Andrea Fusiello

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Randomized greedy algorithms for the hypergraph partitioning problem.

[BibT_eX]

[DOI]

Proceedings of the Randomization Methods in Algorithm Design, 1997

Differential greedy for the 0-1 equicut problem.

[BibT_eX]

[DOI]

Proceedings of the Network Design: Connectivity and Facilities Location, 1997

1995

Code assignment for hidden terminal interference avoidance in multihop packet radio networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 1995

Increasing Processor Utilization in Hard-Real-Time Systems with Checkpoints.

[BibT_eX]

[DOI]

Massimo Bonometto

Real Time Syst., 1995

1994

Scheduling Algorithms for Fault-Tolerance in Hard-Real-Time Systems.

[BibT_eX]

[DOI]

Real Time Syst., 1994

Parallel String Matching with Variable Length Don't Cares.

[BibT_eX]

[DOI]

Elena Lodi

J. Parallel Distributed Comput., 1994

Reconfigurable Tree Architectures for Gracefully Degradable VLSI Systems.

[BibT_eX]

[DOI]

Marco Roccetti

J. Parallel Distributed Comput., 1994

1992

Fault-tolerant LPT task scheduling in multiprocessor systems.

[BibT_eX]

[DOI]

Microprocess. Microsystems, 1992

1990

String Matching with Weighted Errors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Parallel Algorithms on Circular-Arc Graphs.

[BibT_eX]

[DOI]

Sabrina Moretti

Inf. Process. Lett., 1990

A VLSI system for string matching.

[BibT_eX]

[DOI]

Integr., 1990

1989

A Gracefully Degradable VLSI System for Linear Programming.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1989

1988

Total Domination and Irredundance in Weighted Interval Graphs.

[BibT_eX]

[DOI]

Allessandro Gori

SIAM J. Discret. Math., 1988

On the Domatic Number of Interval Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

Parallel Circle-Cover Algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

1987

Time Slot Assignment in SS/TDMA Systems with Intersatellite Links.

[BibT_eX]

[DOI]

Giancarlo Bongiovanni

IEEE Trans. Commun., 1987

A VLSI Implementation of the Simplex Algorithm.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1987

On some matching problems arising in vehicle scheduling models.

[BibT_eX]

[DOI]

Paolo Carraresi

Giorgio Gallo

Networks, 1987

Some parallel algorithms on interval graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1987

1986

Hamiltonian Circuits in Interval Graph Generalizations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

Total Domination in Interval Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

1985

A polynomial feasibility test for preemptive periodic scheduling of unrelated processors.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1985

1984

Dominating Sets for Split and Bipartite Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

1983

Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

Finding Hamiltonian Circuits in Proper Interval Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

1981

The Edge Hamiltonian Path Problem is NP-Complete.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

1980

On the Complexity of Scheduling Jobs on Dedicated Resources to Minimize Set-Up Costs.

[BibT_eX]

[DOI]