Algorithm Theory - SWAT 2014  14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings /  [electronic resource] : 
edited by R. Ravi, Inge Li Gørtz. 
 - Cham :  Springer International Publishing,  2014. 
 - 1 online resource (XX, 394 p. 39 ill.) 
 - Lecture Notes in Computer Science,  8503  0302-9743 ; .
<br/><br/>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. 
<br/><br/><label>ISBN: </label>9783319084046 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer science.<br/>Data structures (Computer science).<br/>Algorithms.<br/>Computer science--Mathematics.