| Abstracts of Invited Talks On Designing Truthful Mechanisms for Online Scheduling On Private Computation in Incomplete Networks Traffic Grooming on the Path Range Augmentation Problems in Static Ad-Hoc Wireless Networks On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs A Tight Bound for Online Coloring of Disk Graphs Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances Distributed Exploration of an Unknown Graph Two Absolute Bounds for Distributed Bit Complexity Finding Short Right-Hand-on-the-Wall Walks in Graphs Space Lower Bounds for Graph Exploration via Reduced Automata Communications in Unknown Networks: Preserving the Secret of Topology An Improved Algorithm for Adaptive Condition-Based Consensus Biangular Circle Formation by Asynchronous Mobile Robots Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs On Semi-perfect 1-Factorizations Free-Riders in Steiner Tree Cost-Sharing Games On the Feasibility of Gathering by Autonomous Mobile Robots Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults Minimizing the Number of ADMs in SONET Rings with Maximum Throughput Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets Geometric Routing Without Geometry Author Index |
内容加载中，请稍后...
商品评论（0条）