The following pages link to Cristina M. Pinotti (Q393045):
Displaying 23 items.
- Maximum matching in multi-interface networks (Q393046) (← links)
- Distributed colorings for collision-free routing in sink-centric sensor networks (Q450566) (← links)
- Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees (Q701181) (← links)
- Channel assignment for interference avoidance in honeycomb wireless networks (Q705558) (← links)
- Synchronous black hole search in directed graphs (Q719316) (← links)
- Efficient corona training protocols for sensor networks (Q936525) (← links)
- Approximation bounds for the minimum \(k\)-storage problem (Q1796432) (← links)
- The minimum \(k\)-storage problem on directed graphs (Q2355709) (← links)
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones (Q2405900) (← links)
- Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks (Q2407947) (← links)
- Localization and scheduling protocols for actor-centric sensor networks (Q2894248) (← links)
- Storage Placement in Path Networks (Q2982333) (← links)
- Collision-Free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates (Q3000503) (← links)
- Maximum Matching in Multi-Interface Networks (Q3167345) (← links)
- Approximate <i>L</i>(δ<sub>1</sub>,δ<sub>2</sub>,…,δ<sub><i>t</i></sub>)‐coloring of trees and interval graphs (Q3442863) (← links)
- Recoverable Robust Timetables on Trees (Q3637092) (← links)
- (Q4414591) (← links)
- (Q4536926) (← links)
- Recoverable Robust Timetables: An Algorithmic Approach on Trees (Q5280617) (← links)
- Dense, Concentric, and Non-uniform Multi-hop Sensor Networks (Q5391128) (← links)
- A dynamic hybrid scheduling algorithm for heterogeneous asymmetric environments (Q5712043) (← links)
- Theoretical Computer Science (Q5897357) (← links)
- Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs (Q6078291) (← links)
