Algorithm Theory -- SWAT 2014

Online Makespan Minimization with Parallel Schedules.- Expected Linear Time Sorting for Word Size (log2 n log log n).- Amortized Analysis of Smooth Quadtrees in All Dimensions.- New Approximability Results for the Robust k-Median Problem.- Approximating the Revenue Maximization Problem with Sharp Demands.- Reconfiguring Independent Sets in Claw-Free Graphs.- Competitive Online Routing on Delaunay Triangulations.- Optimal Planar Orthogonal Skyline Counting Queries.- B-slack Trees: Space Efficient B-Trees.- Approximately Minwise Independence with Twisted Tabulation.- Colorful Bin Packing.- Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques.- Win-Win Kernelization for Degree Sequence Completion Problems.- On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem.- Covering Problems in Edge- and Node-Weighted Graphs.- Colored Range Searching in Linear Space.- Fast Dynamic Graph Algorithms for Parameterized Problems.- Extending Partial Representations of Proper and Unit Interval Graphs.- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams.- Approximate Counting of Matchings in (3,3)-Hypergraphs.

"All texts are of very great quality. ... an important work not only for the quality and quantity of the knowledge available, but also for the aid to the development of schemes and methodologies of disciplined and organized work, very important in the field of algorithm theory. ... imperative for professionals, academics and simple practitioners who wish to be aware of the current knowledge and state-of-the-art results in algorithm theory." (Prof. Dr. Manuel Alberto M. Ferreira, Acta Scientiae et Intellectus, Vol. 3, 2017)