Design and Analysis of Algorithms

Detecting Approximate Periodic Patterns.- Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication.- Multicast Routing for Energy Minimization Using Speed Scaling.- Reoptimization of the Minimum Total Flow-Time Scheduling Problem.- Energy Efficient Caching for Phase-Change Memory.- Shortest-Elapsed-Time-First on a Multiprocessor Efficient Route Compression for Hybrid Route Planning.- Multipath Spanners via Fault-Tolerant Spanners.- Constant Thresholds Can Make Target Set Selection Tractable.- Faster Variance Computation for Patterns with Gaps.- Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks.- Experimental Analysis of Rumor Spreading in Social Networks.- A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs.- Simulation-Based Analysis of Topology Control Algorithms for Wireless Ad Hoc Networks.- An Efficient Generator for Clustered Dynamic Random Networks.- Slow Down and Sleep for Profit in Online Deadline Scheduling.- FIFO Queueing Policies for Packets with Heterogeneous Processing.- Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability.