Experimental Algorithms

Selecting Data for Experiments: Past, Present and Future.- The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models.- Integral Simplex Using Decomposition with Primal Cuts.- A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs.- Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth.- An Exact Algorithm for the Discrete Chromatic Art Gallery Problem.- Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem.- Relocation in Carsharing Systems Using Flows in Time-Expanded Networks.- Dynamic Windows Scheduling with Reallocation.- Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates.- Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest.- Retrieval and Perfect Hashing Using Fingerprinting.- Efficient Wavelet Tree Construction and Querying for Multicore Architectures.- Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket.- Loop Nesting Forests, Dominators, and Applications.- DenseZDD: A Compact and Fast Index for Families of Sets.- An Evaluation of Dynamic Labeling Schemes for Tree Networks.- Engineering Color Barcode Algorithms for Mobile Applications.- Computing Consensus Curves.- Evaluation of Labeling Strategies for Rotating Maps.- Experimental Comparison of Semantic Word Clouds.- Hub Labels: Theory and Practice.- Customizable Contraction Hierarchies.- Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches.- Exploiting GPS Data in Public Transport Journey Planners.- Order-Preserving Matching with Filtration.- Approximate Online Matching of Circular Strings.- From Theory to Practice: Plug and Play with Succinct Data Structures.- Improved ESP-index: A Practical Self-index for Highly Repetitive Texts.- Partitioning Complex Networks via Size-Constrained Clustering.- Tree-Based Coarsening and Partitioning of Complex Networks.- Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks.- Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study.- Efficient Representation for Online Suffix Tree Construction.- LCP Array Construction in External Memory.- Faster Compressed Suffix Trees for Repetitive Text Collections.- Improved and Extended Locating Functionality on Compressed Suffix Arrays.