Last update: Wed Dec 27 09:59:41 MST 2023
Volume 1, 1996Donald E. Knuth Irredundant intervals . . . . . . . . . 1:1--1:?? Arthur Gittleman Predicting string search speed . . . . . 2:1--2:?? David A. Bader and David R. Helman and Joseph JáJá Practical parallel algorithms for personalized communication and integer sorting . . . . . . . . . . . . . . . . 3:1--3:?? Anthony LaMarca and Richard Ladner The influence of caches on the performance of heaps . . . . . . . . . . 4:1--4:??
Adam L. Buchsbaum and Raffaele Giancarlo Algorithmic aspects in speech recognition: an introduction . . . . . . 1:1--1:?? Roberto Battiti and Marco Protasi Reactive search, a history-sensitive heuristic for MAX-SAT . . . . . . . . . 2:1--2:?? Bradley J. Smith and Gregory L. Heileman and Chaouki Abdallah The exponential hash function . . . . . 3:1--3:?? H. C. Purchase and R. F. Cohen and M. I. James An experimental study of the basis for graph drawing algorithms . . . . . . . . 4:1--4:?? David Alberts and Giuseppe Cattaneo and Giuseppe F. Italiano An empirical study of dynamic graph algorithms . . . . . . . . . . . . . . . 5:1--5:??
Lane A. Hemaspaandra and Kulathur S. Rajasethupathy and Prasanna Sethupathy and Marius Zimand Power balance and apportionment algorithms for the United States Congress . . . . . . . . . . . . . . . . 1:1--1:?? Seonghun Cho and Sartaj Sahni Weight-biased leftist trees and modified skip lists . . . . . . . . . . . . . . . 2:1--2:?? Yong Yan and Xiaodong Zhang Lock bypassing: an efficient algorithm for concurrently accessing priority heaps . . . . . . . . . . . . . . . . . 3:1--3:?? David R. Helman and Joseph JáJá and David A. Bader A new deterministic parallel sorting algorithm with an experimental evaluation . . . . . . . . . . . . . . . 4:1--4:?? Daniele Frigioni and Mario Ioffreda and Umberto Nanni and Giulio Pasqualone Experimental analysis of dynamic algorithms for the single . . . . . . . 5:1--5:?? Jakob Magun Greeding matching algorithms, an experimental study . . . . . . . . . . . 6:1--6:?? Arne Andersson and Stefan Nilsson Implementing radixsort . . . . . . . . . 7:1--7:?? Boris V. Cherkassky and Andrew V. Goldberg and Paul Martin and Joao C. Setubal and Jorge Stolfi Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms . . . . . . . . . . . . 8:1--8:?? Tomasz Radzik Implementation of dynamic trees with in-subtree operations . . . . . . . . . 9:1--9:??
E. K. Burke and A. J. Smith A memetic algorithm to schedule planned maintenance for the national grid . . . 1:1--1:?? Sun Kim A new string-pattern matching algorithm using partitioning and hashing efficiently . . . . . . . . . . . . . . 2:1--2:?? N. Eiron and M. Rodeh and I. Steinwarts Matrix multiplication: a case study of enhanced data cache utilization . . . . 3:1--3:?? T. Erlebach and K. Jansen Efficient implementation of an optimal greedy algorithm for wavelength assignment in directed tree networks . . 4:1--4:?? D. Huson and S. Nettles and K. Rice and T. Warnow and S. Yooseph Hybrid tree reconstruction methods . . . 5:1--5:?? R. Jacob and M. Marathe and K. Nagel A computational study of routing algorithms for realistic transportation networks . . . . . . . . . . . . . . . . 6:1--6:?? M. Müller-Hannemann and A. Schwartz Implementing weighted $b$-matching algorithms: towards a flexible software design . . . . . . . . . . . . . . . . . 7:1--7:?? J. Schwerdt and M. Smid and J. Majhi and R. Janardan Computing the width of a three-dimensional point set: an experimental study . . . . . . . . . . . 8:1--8:??
David Eppstein Fast hierarchical clustering and other applications of dynamic closest pairs 1:1--1:?? Kyn-Rak Chong and Sartaj Sahni Correspondence-based data structures for double-ended priority queues . . . . . . 2:1--2:?? Li Xiao and Xiaodong Zhang and Stefan A. Kubricht Improving memory performance of sorting algorithms . . . . . . . . . . . . . . . 3:1--3:?? Gonzalo Navarro and Mathieu Raffinot Fast and flexible string matching by combining bit-parallelism and suffix automata . . . . . . . . . . . . . . . . 4:1--4:?? Andrew E. Caldwell and Andrew B. Kahng and Igor L. Markov Design and implementation of move-based heuristics for VLSI hypergraph partitioning . . . . . . . . . . . . . . 5:1--5:?? Matthew S. Levine Finding the right cutting planes for the TSP . . . . . . . . . . . . . . . . . . 6:1--6:?? Peter Sanders Fast priority queues for cached memory 7:1--7:?? Matthias Müller-Hannemann and Alexander Schwartz Implementing weighted $b$-matching algorithms: insights from a computational study . . . . . . . . . . 8:1--8:?? Tetsuo Shibuya Computing the $n \times m$ shortest path efficiently . . . . . . . . . . . . . . 9:1--9:?? Dascal Vishkin and Uzi Vishkin Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism . . . . . . . . 10:1--10:?? Renato Werneck and João Setubal and Arlindo da Conceicão Finding minimum congestion spanning trees . . . . . . . . . . . . . . . . . 11:1--11:?? Frank Schulz and Dorothea Wagner and Karsten Weihe Dijkstra's algorithm on-line: an empirical case study from public railroad transport . . . . . . . . . . . 12:1--12:?? Eyal Flato and Dan Halperin and Iddo Hanniel and Oren Nechushtan and Eti Ezra The design and implementation of planar maps in CGAL . . . . . . . . . . . . . . 13:1--13:?? Naila Rahman and Rajeev Raman Analysing cache effects in distribution sorting . . . . . . . . . . . . . . . . 14:1--14:?? Jesper Bojesen and Jyrki Katajainen and Maz Spork Performance engineering case study: heap construction . . . . . . . . . . . . . . 15:1--15:?? N. P. Boghossian and O. Kohlbacher and H. P. Lenhof Rapid software prototyping in molecular modeling using the biochemical algorithms library (BALL) . . . . . . . 16:1--16:?? Klaus Brengel and Andreas Crauser and Paolo Ferragina and Ulrich Meyer An experimental study of priority queues in external memory . . . . . . . . . . . 17:1--17:??
Lars Arge and Laura Toma and Jeffrey Scott Vitter I/O-Efficient Algorithms for Problems on Grid-Based Terrains . . . . . . . . . . 1:1--1:?? Camil Demestrescu and Irene Finocchi Breaking cycles for minimizing crossings 2:1--2:?? Harold Gabow and Tadayoshi Kohno A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis . . . . . . . . . . . . . . . . 3:1--3:?? Raj Iyer and David Karger and Hariharan Rahul and Mikkel Thorup An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms . . . . . . . . 4:1--4:?? Vincenzo Liberatore Caching and Scheduling for Broadcast Disk Systems . . . . . . . . . . . . . . 5:1--5:?? Giri Narasimhan and Martin Zachariasen Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions . . . 6:1--6:?? Naila Rahman and Rajeev Raman Adapting Radix Sort to the Memory Hierarchy . . . . . . . . . . . . . . . 7:1--7:?? Matthias Stallmann and Franc Brglez and Debabrata Ghosh Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization . . . . . . . . . . . . . . 8:1--8:?? Daniele Frigioni and Tobias Miller and Christos Zaroliagis An Experimental Study of Dynamic Algorithms for Transitive Closure . . . 9:1--9:?? Yossi Matias and Nasir Rajpoot and Cenk Sahinalp The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression . . . . . . . . . . . . . . 10:1--10:??
Werner Backes and Susanne Wetzel Heuristics on lattice basis reduction in practice . . . . . . . . . . . . . . . . 1--1 Kazuo Iwama and Daisuke Kawai and Shuichi Miyazaki and Yasuo Okabe and Jun Umemoto Parallelizing local search for CNF satisfiability using vectorization and PVM . . . . . . . . . . . . . . . . . . 2--2 Susanne Albers and Bianca Schröder An experimental study of online scheduling algorithms . . . . . . . . . 3--3 Kurt Mehlhorn and Guido Schäfer Implementation of $O(nm \log n)$ weighted matchings in general graphs: the power of data structures . . . . . . 4--4 Stefan Edelkamp and Patrick Stiegeler Implementing \em HEAPSORT with $(n \log n - 0.9 n)$ and \em QUICKSORT with $(n \log n + 0.2 n)$ comparisons . . . . . . 5--5 Thomas Erlebach and Klaus Jansen Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees 6--6 Isabelle Guérin Lassous and Jens Gustedt Portable list ranking: an experimental study . . . . . . . . . . . . . . . . . 7--7 Jan Vahrenhold and Klaus H. Hinrichs Planar point location for large data sets: to seek or not to seek . . . . . . 8--8 Rajiv Wickremesinghe and Lars Arge and Jeffrey S. Chase and Jeffrey Scott Vitter Efficient sorting using registers and caches . . . . . . . . . . . . . . . . . 9--9 Francine Herrmann and Alain Hertz Finding the chromatic number by means of critical graphs . . . . . . . . . . . . 10--10 Sándor P. Fekete and Henk Meijer and André Rohe and Walter Tietze Solving a 'Hard' problem to approximate an 'Easy' one: heuristics for maximum matchings and maximum traveling salesman problems . . . . . . . . . . . . . . . . 11--11 Filippo Neri Relational concept learning by cooperative evolution . . . . . . . . . 12--12
Piyush Kumar and Joseph S. B. Mitchell and E. Alper Yildirim Approximate minimum enclosing balls in high dimensions using core-sets . . . . 1.1:1--1.1:?? Lars Arge and Andrew Danner and Sha-Mayn Teh I/O-efficient point location using persistent B-trees . . . . . . . . . . . 1.2:1--1.2:?? Adam L. Buchsbaum and Glenn S. Fowler and Balachannder Kirishnamurthy and Kiem-Phong Vo and Jia Wang Fast prefix matching of bounded strings 1.3:1--1.3:?? Eric A. Breimer and Mark K. Goldberg and Darren T. Lim A learning algorithm for the longest common subsequence problem . . . . . . . 2.1:1--2.1:?? Gayathri Venkataraman and Sartaj Sahni and Srabani Mukhopadhyaya A blocked all-pairs shortest-paths algorithm . . . . . . . . . . . . . . . 2.2:1--2.2:?? Jordi Petit Experiments on the minimum linear arrangement problem . . . . . . . . . . 2.3:1--2.3:??
Ulrik Brandes and Frank Schulz and Dorothea Wagner and Thomas Willhalm Generating node coordinates for shortest-path computations in transportation networks . . . . . . . . 1.1:1--1.1:?? Robert Niewiadomski and José Nelson Amaral and Robert C. Holte A performance study of data layout techniques for improving data locality in refinement-based pathfinding . . . . 1.2:1--1.2:?? Madhav V. Marathe and Alessandro Panconesi and Larry D. Risinger, Jr. An experimental study of a simple, distributed edge-coloring algorithm . . 1.3:1--1.3:?? Kimmo Fredriksson and Gonzalo Navarro Average-optimal single and multiple approximate string matching . . . . . . 1.4:1--1.4:?? Ranjan Sinha and Justin Zobel Cache-conscious sorting of large sets of strings with dynamic tries . . . . . . . 1.5:1--1.5:?? Rick Siow Mong Goh and Ian Li-Jin Thng Twol-amalgamated priority queues . . . . 1.6:1--1.6:??
Ioannis Ioannidis and Ananth Grama and Mikhail Atallah Adaptive data structures for IP lookups 1.1:1--1.1:?? N. Lesh and J. Marks and A. McMahon and M. Mitzenmacher New heuristic and interactive approaches to $2$D rectangular strip packing . . . 1.2:1--1.2:?? Dorothea Wagner and Thomas Willhalm and Christos Zaroliagis Geometric containers for efficient shortest-path computation . . . . . . . 1.3:1--1.3:?? Alejandro López-Ortiz and Mehdi Mirzazadeh and Mohammad Ali Safari and Hossein Sheikhattar Fast string sorting using order-preserving compression . . . . . . 1.4:1--1.4:?? Celso C. Ribeiro and Simone L. Martins Preface . . . . . . . . . . . . . . . . 2.1:1--2.1:?? Ranjan Sinha and Justin Zobel Using random sampling to build approximate tries for efficient string sorting . . . . . . . . . . . . . . . . 2.10:1--2.10:?? Evandro C. Bracht and Luis and A. A. Meira and F. K. Miyazawa A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique . . . . . . . 2.11:1--2.11:?? Cid C. de Souza and Andre M. Lima and Guido Araujo and Nahri B. Moreano The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation . . . . 2.2:1--2.2:?? Jingde Du and Stavros G. Kolliopoulos Implementing approximation algorithms for the single-source unsplittable flow problem . . . . . . . . . . . . . . . . 2.3:1--2.3:?? Amalia Duch and Conrado Martínez Improving the performance of multidimensional search using fingers 2.4:1--2.4:?? Martin Holzer and Frank Schulz and Dorothea Wagner and Thomas Willhalm Combining speed-up techniques for shortest-path computations . . . . . . . 2.5:1--2.5:?? Heikki Hyyrö and Kimmo Fredriksson and Gonzalo Navarro Increased bit-parallelism for approximate and multiple string matching 2.6:1--2.6:?? Nikola S. Nikolov and Alexandre Tarassov and Jürgen Branke In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes . . . . . . 2.7:1--2.7:?? Sriram V. Pemmaraju and Sriram Penumatcha and Rajiv Raman Approximating interval coloring and max-coloring in chordal graphs . . . . . 2.8:1--2.8:?? Haroldo G. Santos and Luiz S. Ochi and Marcone J. F. Souza A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem . . . 2.9:1--2.9:??
Leena Salmela and Jorma Tarhio and Jari Kytöjoki Multipattern string matching with $q$-grams . . . . . . . . . . . . . . . 1.1:1--1.1:?? Ranjan Sinha and Justin Zobel and David Ring Cache-efficient string sorting using copying . . . . . . . . . . . . . . . . 1.2:1--1.2:?? Michael Penner and Viktor K. Prasanna Cache-Friendly implementations of transitive closure . . . . . . . . . . . 1.3:1--1.3:?? Justin Goshi and Richard E. Ladner Algorithms for dynamic multicast key distribution . . . . . . . . . . . . . . 1.4:1--1.4:?? Lyudmil Aleksandrov and Hristo Djidjev and Hua Guo and Anil Maheshwari Partitioning planar graphs with costs and weights . . . . . . . . . . . . . . 1.5:1--1.5:?? Ivayio Ilinkin and Ravi Janardan and Michiel Smid and Eric Johnson and Paul Castillo and Jörg Schwerdt Heuristics for estimating contact area of supports in layered manufacturing . . 1.6:1--1.6:?? David J. Pearce and Paul H. J. Kelly A dynamic topological sort algorithm for directed acyclic graphs . . . . . . . . 1.7:1--1.7:?? Michele Flammini and Alfredo Navarra and Stephane Perennes The ``real'' approximation factor of the MST heuristic for the minimum energy broadcasting . . . . . . . . . . . . . . 2.10:1--2.10:?? Sotiris Nikoletseas JEA Special Section . . . . . . . . . . 2.1:1--2.1:?? Torsten Fahle and Karsten Tiemann A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques . . . . . . . . 2.2:1--2.2:?? Pierre Leone and Jose Rolim and Paul Albuquerque and Christian Mazza A framework for probabilistic numerical evaluation of sensor networks: a case study of a localization protocol . . . . 2.3:1--2.3:?? Paola Festa and Panos M. Pardalos and Leonidas S. Pitsoulis and Mauricio G. C. Resende GRASP with path relinking for the weighted MAXSAT problem . . . . . . . . 2.4:1--2.4:?? Kurt Mehlhorn and Dimitrios Michail Implementing minimum cycle basis algorithms . . . . . . . . . . . . . . . 2.5:1--2.5:?? Laura Heinrich-Litan and Marco E. Lübbecke Rectangle covers revisited computationally . . . . . . . . . . . . 2.6:1--2.6:?? Panagiota N. Panagopoulou and Paul G. Spirakis Algorithms for pure Nash equilibria in weighted congestion games . . . . . . . 2.7:1--2.7:?? Rolf H. Möhring and Heiko Schilling and Birk Schütz and Dorothea Wagner and Thomas Willhalm Partitioning graphs to speedup Dijkstra's algorithm . . . . . . . . . . 2.8:1--2.8:?? Azzedine Boukerche and Alba Cristina Magalhaes Alves De Melo Integrating coordinated checkpointing and recovery mechanisms into DSM synchronization barriers . . . . . . . . 2.9:1--2.9:??
Anonymous Engineering graph clustering: Models and experimental evaluation . . . . . . . . 1.1:1--1.1:?? Marina Barsky and Ulrike Stege and Alex Thomo and Chris Upton A graph approach to the threshold all-against-all substring matching problem . . . . . . . . . . . . . . . . 1.10:1--1.10:?? Martin Dietzfelbinger and Martin Hühne and Christoph Weidling A dictionary implementation based on dynamic perfect hashing . . . . . . . . 1.11:1--1.11:?? Michael A. Maniscalco and Simon J. Puglisi An efficient, versatile approach to suffix sorting . . . . . . . . . . . . . 1.2:1--1.2:?? Fadi A. Aloul and Arathi Ramani and Igor L. Markov and Karem A. Sakallah Symmetry breaking for pseudo-Boolean formulas . . . . . . . . . . . . . . . . 1.3:1--1.3:?? Marco Pellegrini and Giordano Fusco Efficient IP table lookup via adaptive stratified trees with selective reconstructions . . . . . . . . . . . . 1.4:1--1.4:?? Gonzalo Navarro and Nora Reyes Dynamic spatial approximation trees . . 1.5:1--1.5:?? Keqin Li Experimental average-case performance evaluation of online algorithms for routing and wavelength assignment and throughput maximization in WDM optical networks . . . . . . . . . . . . . . . . 1.7:1--1.7:?? Paul Biggar and Nicholas Nash and Kevin Williams and David Gregg An experimental study of sorting and branch prediction . . . . . . . . . . . 1.8:1--1.8:?? Thomas Hazel and Laura Toma and Jan Vahrenhold and Rajiv Wickremesinghe Terracost: Computing least-cost-path surfaces for massive grid terrains . . . 1.9:1--1.9:?? Lars Arge and Giuseppe F. Italiano Preface . . . . . . . . . . . . . . . . 2.1:1--2.1:?? Gerth Stòlting Brodal and Rolf Fagerberg and Kristoffer Vinther Engineering a cache-oblivious sorting algorithm . . . . . . . . . . . . . . . 2.2:1--2.2:?? Michael A. Bender and Bryan Bradley and Geetha Jagannathan and Krishnan Pillaipakkamnatt Sum-of-squares heuristics for bin packing and memory allocation . . . . . 2.3:1--2.3:?? Evangelia Pyrga and Frank Schulz and Dorothea Wagner and Christos Zaroliagis Efficient models for timetable information in public transportation systems . . . . . . . . . . . . . . . . 2.4:1--2.4:?? Andrew Leaver-Fay and Yuanxin Liu and Jack Snoeyink and Xueyi Wang Faster placement of hydrogens in protein structures by dynamic programming . . . 2.5:1--2.5:?? Camil Demetrescu and Roberto Tamassia Papers from ALENEX 2005 . . . . . . . . 3.1:1--3.1:?? Gerth Stòlting Brodal and Rolf Fagerberg and Gabriel Moruz On the adaptiveness of Quicksort . . . . 3.2:1--3.2:?? Bruno Codenotti and Benton Mccune and Sriram Pemmaraju and Rajiv Raman and Kasturi Varadarajan An experimental study of different approaches to solve the market equilibrium problem . . . . . . . . . . 3.3:1--3.3:?? Roman Dementiev and Juha Kärkkäinen and Jens Mehnert and Peter Sanders Better external memory suffix array construction . . . . . . . . . . . . . . 3.4:1--3.4:?? Krister M. Swenson and Mark Marron and Joel V. Earnest-Deyoung and Bernard M. E. Moret Approximating the true evolutionary distance between two genomes . . . . . . 3.5:1--3.5:?? Ioannis Krommidas and Christos Zaroliagis An experimental study of algorithms for fully dynamic transitive closure . . . . 16:1--16:??
Georg Gottlob and Marko Samer A backtracking-based algorithm for hypertree decomposition . . . . . . . . 1:1--1:?? Rajeev Raman and Matt Stallmann Preface . . . . . . . . . . . . . . . . 1:1--1:?? Jens Gramm and Jiong Guo and Falk Hüffner and Rolf Niedermeier Data reduction and exact algorithms for clique cover . . . . . . . . . . . . . . 2:1--2:?? Idit Haran and Dan Halperin An experimental study of point location in planar arrangements in CGAL . . . . . 3:1--3:?? Mark A. Lanthier and Doron Nussbaum and Tsuo-Jung Wang Computing an approximation of the $1$-center problem on weighted terrain surfaces . . . . . . . . . . . . . . . . 3:1--3:?? John Hershberger and Nisheeth Shrivastava and Subhash Suri Summarizing spatial data streams using ClusterHulls . . . . . . . . . . . . . . 4:1--4:?? Ilya Safro and Dorit Ron and Achi Brandt Multilevel algorithms for linear ordering problems . . . . . . . . . . . 4:1--4:?? Martin Holzer and Frank Schulz and Dorothea Wagner Engineering multilevel overlay graphs for shortest-path queries . . . . . . . 5:1--5:??
Bryant A. Julstrom Greedy heuristics for the bounded diameter minimum spanning tree problem 1:1--1:?? J. Ian Munro and Dorothea Wagner Preface: Section 2 --- Selected Papers from ALENEX 2008 . . . . . . . . . . . . 1:1--1:?? Daniel Dumitriu and Stefan Funke and Martin Kutz and Nikola Milosavljevi\'c How much geometry it takes to reconstruct a $2$-manifold in $R^3$ . . 2:1--2:?? Robert W. Irving and David F. Manlove Finding large stable matchings . . . . . 2:1--2:?? Amitabh Basu and Joseph S. B. Mitchell and Girish Kumar Sabhnani Geometric algorithms for optimal airspace design and air traffic controller workload balancing . . . . . 3:1--3:?? Reinhard Bauer and Daniel Delling SHARC: Fast and robust unidirectional routing . . . . . . . . . . . . . . . . 4:1--4:?? Tom Coleman and Anthony Wirth Ranking tournaments: Local search and a new algorithm . . . . . . . . . . . . . 6:1--6:?? Boris V. Cherkassky and Loukas Georgiadis and Andrew V. Goldberg and Robert E. Tarjan and Renato F. Werneck Shortest-path feasibility algorithms: An experimental evaluation . . . . . . . . 7:1--7:??
Camil Demetrescu Preface . . . . . . . . . . . . . . . . 1:1--1:?? Maria Serna and Carme Álvarez Preface to special section of selected papers from WEA 2006 . . . . . . . . . . 1:1--1:?? Jens Maue and Peter Sanders and Domagoj Matijevic Goal-directed shortest-path queries using precomputed cluster distances . . 2:1--2:?? N. Välimäki and V. Mäkinen and W. Gerlach and K. Dixit Engineering a compressed suffix tree implementation . . . . . . . . . . . . . 2:1--2:?? Friedrich Eisenbrand and Andreas Karrenbauer and Chihao Xu Algorithms for longer OLED lifetime . . 3:1--3:?? Matthias Englert and Heiko Röglin and Matthias Westermann Evaluation of online strategies for reordering buffers . . . . . . . . . . . 3:1--3:?? Mohammad Farshi and Joachim Gudmundsson Experimental study of geometric $t$-spanners . . . . . . . . . . . . . . 3:1--3:?? Daniel Cederman and Philippas Tsigas GPU-Quicksort: a practical Quicksort algorithm for graphics processors . . . 4:1--4:?? Markus Chimani and Carsten Gutwenger and Petra Mutzel Experiments on exact crossing minimization using column generation . . 4:1--4:?? Felix Putze and Peter Sanders and Johannes Singler Cache-, hash-, and space-efficient Bloom filters . . . . . . . . . . . . . . . . 4:1--4:?? Markus Chimani and Maria Kandyba and Ivana Ljubi\'c and Petra Mutzel Obtaining optimal $k$-cardinality trees fast . . . . . . . . . . . . . . . . . . 2.5:1--2.5:23 Leonor Frias and Jordi Petit and Salvador Roura Lists revisited: Cache-conscious STL lists . . . . . . . . . . . . . . . . . 5:1--5:?? Martin Holzer and Frank Schulz and Dorothea Wagner and Grigorios Prasinos and Christos Zaroliagis Engineering planar separator algorithms 5:1--5:?? Robert E. Tarjan and Renato F. Werneck Dynamic trees in practice . . . . . . . 5:1--5:?? Alaubek Avdil and Karsten Weihe Local search starting from an LP solution: Fast and quite good . . . . . 6:1--6:?? Vladimir Deineko and Alexander Tiskin Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough? . . . . . . . . . . . . 6:1--6:?? Karina Figueroa and Edgar Chavez and Gonzalo Navarro and Rodrigo Paredes Speeding up spatial approximation search in metric spaces . . . . . . . . . . . . 6:1--6:?? Jérémy Barbay and Alejandro López-Ortiz and Tyler Lu and Alejandro Salinger An experimental investigation of set intersection algorithms for text searching . . . . . . . . . . . . . . . 7:1--7:?? Vladimir Estivill-Castro and Apichat Heednacram and Francis Suraweera Reduction rules deliver efficient FPT-algorithms for covering points with lines . . . . . . . . . . . . . . . . . 7:1--7:?? Jesús A. De Loera and David C. Haws and Jon Lee and Allison O'Hair Computation in multicriteria matroid optimization . . . . . . . . . . . . . . 8:1--8:??
Tobias Jacobs An experimental study of recent hotlink assignment algorithms . . . . . . . . . 1.1:1--1.1:?? Ivor Spence \tt sgen1: a generator of small but difficult satisfiability benchmarks . . 1.2:1--1.2:?? Johannes Langguth and Fredrik Manne and Peter Sanders Heuristic initialization for bipartite matching problems . . . . . . . . . . . 1.3:1--1.3:?? François Delbot and Christian Laforest Analytical and experimental comparison of six algorithms for the vertex cover problem . . . . . . . . . . . . . . . . 14:1--14:?? Diego Arroyuelo and Gonzalo Navarro Practical approaches to reduce the space requirement of Lempel--Ziv-based compressed text indices . . . . . . . . 15:1--15:?? Julian R. Ullmann Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism . . . . . . . . . . . . . . 16:1--16:?? Nikolas Askitis and Justin Zobel Redesigning the string hash table, burst trie, and BST to exploit cache . . . . . 17:1--17:?? Catherine C. McGeoch Preface . . . . . . . . . . . . . . . . 2.1:1--2.1:?? Markus Chimani and Carsten Gutwenger and Petra Mutzel and Hoi-Ming Wong Layer-free upward crossing minimization 2.2:1--2.2:?? Reinhard Bauer and Daniel Delling and Peter Sanders and Dennis Schieferdecker and Dominik Schultes and Dorothea Wagner Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm . . . . . . . . . . . . . . . 2.3:1--2.3:?? Nicholas Nash and David Gregg Comparing integer data structures for 32- and 64-bit keys . . . . . . . . . . 2.4:1--2.4:?? Ranjan Sinha and Anthony Wirth Engineering burstsort: Toward fast in-place string sorting . . . . . . . . 2.5:1--2.5:??
Leonid Boytsov Indexing methods for approximate dictionary searching: Comparative analysis . . . . . . . . . . . . . . . . 1.1:1--1.1:?? Péter Biró and Robert W. Irving and Ildikó Schlotter Stable matching with couples: an empirical study . . . . . . . . . . . . 12:1--12:?? Stefan Huber and Martin Held Motorcycle graphs: Stochastic properties motivate an efficient yet simple implementation . . . . . . . . . . . . . 13:1--13:?? Dimitrios Michail An experimental comparison of single-sided preference matching algorithms . . . . . . . . . . . . . . . 14:1--14:?? Andriy Kot and Andrey N. Chernikov and Nikos P. Chrisochoides Effective out-of-core parallel Delaunay mesh refinement using off-the-shelf software . . . . . . . . . . . . . . . . 15:1--15:?? Patrick Prosser and Chris Unsworth Limited discrepancy search revisited . . 16:1--16:?? Lionel Tabourier and Camille Roth and Jean-Philippe Cointet Generating constrained random graphs using multiple edge switches . . . . . . 17:1--17:?? Charalampos E. Tsourakakis and Richard Peng and Maria A. Tsiarli and Gary L. Miller and Russell Schwartz Approximation algorithms for speeding up dynamic programming and denoising aCGH data . . . . . . . . . . . . . . . . . . 18:1--18:?? Jan Vahrenhold Preface . . . . . . . . . . . . . . . . 21:1--21:?? Bei Wang and Herbert Edelsbrunner and Dmitriy Morozov Computing elevation maxima by searching the Gauss sphere . . . . . . . . . . . . 22:1--22:?? Randolf Rotta and Andreas Noack Multilevel local search algorithms for modularity clustering . . . . . . . . . 23:1--23:?? Paolo Bertasi and Marco Bressan and Enoch Peserico \tt psort, yet another fast stable sorting software . . . . . . . . . . . . 24:1--24:?? Irene Finocchi and John Hershberger Guest editors' foreword . . . . . . . . 31:1--31:?? Djamal Belazzougui and Paolo Boldi and Rasmus Pagh and Sebastiano Vigna Theory and practice of monotone minimal perfect hashing . . . . . . . . . . . . 32:1--32:?? Benjamin Doerr and Tobias Friedrich and Marvin Künnemann and Thomas Sauerwald Quasirandom rumor spreading: an experimental analysis . . . . . . . . . 33:1--33:?? Herman Haverkort and Freek V. Walderveen Four-dimensional Hilbert curves for $R$-trees . . . . . . . . . . . . . . . 34:1--34:?? Cosmin Silvestru Negrucseri and Mircea Bogdan Pacsosi and Barbara Stanley and Clifford Stein and Cristian George Strat Solving maximum flow problems on real-world bipartite graphs . . . . . . 35:1--35:?? Siamak Tazari and Matthias Müller-Hannemann Dealing with large hidden constants: engineering a Planar Steiner Tree (PTAS) 36:1--36:??
Charles Reams Anatree: a Fast Data Structure for Anagrams . . . . . . . . . . . . . . . . 1.1:1--1.1:?? Robert Geisberger and Michael N. Rice and Peter Sanders and Vassilis J. Tsotras Route planning with flexible edge restrictions . . . . . . . . . . . . . . 1.2:1--1.2:??
Ittai Abraham and Daniel Delling and Andrew V. Goldberg and Renato F. Werneck Alternative routes in road networks . . 1.3:1--1.3:?? G. Veit Batz and Robert Geisberger and Peter Sanders and Christian Vetter Minimum time-dependent travel times with contraction hierarchies . . . . . . . . 1.4:1--1.4:?? Pierre Bonami and Jon Lee and Sven Leyffer and Andreas Wächter On branching rules for convex mixed-integer nonlinear optimization . . 2.6:1--2.6:?? Stefan Canzar and Khaled Elbassioni and Julián Mestre A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem 2.2:1--2.2:?? Charles Delort and Olivier Spanjaard A hybrid dynamic programming approach to the biobjective binary knapsack problem 1.2:1--1.2:??
David Eppstein and Maarten Löffler and Darren Strash Listing All Maximal Cliques in Large Sparse Real-World Graphs . . . . . . . . 3.1:1--3.1:??
Umberto Ferraro-Petrillo and Fabrizio Grandoni and Giuseppe F. Italiano Data structures resilient to memory faults: an experimental study of dictionaries . . . . . . . . . . . . . . 1.6:1--1.6:?? Paola Festa Foreword to the special issue SEA 2010 1.1:1--1.1:?? Simon Gog and Enno Ohlebusch Compressed suffix trees: Efficient computation and storage of LCP-values 2.1:1--2.1:?? Robert Görke and Pascal Maillard and Andrea Schumm and Christian Staudt and Dorothea Wagner Dynamic graph clustering combining modularity and smoothness . . . . . . . 1.5:1--1.5:?? Micha Hofri Optimal selection and sorting via dynamic programming . . . . . . . . . . 2.3:1--2.3:?? Tina M. Kouri and Dinesh P. Mehta Faster reaction mapping through improved naming techniques . . . . . . . . . . . 2.5:1--2.5:?? Charalampos S. Kouzinopoulos and Konstantinos G. Margaritis Exact online two-dimensional pattern matching using multiple pattern matching algorithms . . . . . . . . . . . . . . . 2.4:1--2.4:??
Chandrashekhar Nagarajan and David P. Williamson An Experimental Evaluation of Incremental and Hierarchical $k$-Median Algorithms . . . . . . . . . . . . . . . 3.2:1--3.2:??
Rodrigo González and Gonzalo Navarro and Héctor Ferrada Locally Compressed Suffix Arrays . . . . 1.1:1--1.1:?? Benjamin Doerr and Magnus Wahlström Randomized Rounding in the Presence of a Cardinality Constraint . . . . . . . . . 1.2:1--1.2:?? B. O. Fagginger Auer and R. H. Bisseling Efficient Matching for Column Intersection Graphs . . . . . . . . . . 1.3:1--1.3:?? Claudio Angione and Annalisa Occhipinti and Giuseppe Nicosia Satisfiability by Maxwell--Boltzmann and Bose--Einstein Statistical Distributions 1.4:1--1.4:?? Asaf Frieder and Liam Roditty An Experimental Study on Approximating $k$ Shortest Simple Paths . . . . . . . 1.5:1--1.5:?? Robert Görke and Andrea Kappes and Dorothea Wagner Experiments on Density-Constrained Graph Clustering . . . . . . . . . . . . . . . 1.6:1--1.6:?? Gustavo Rodrigues Galvão and Zanoni Dias An Audit Tool for Genome Rearrangement Algorithms . . . . . . . . . . . . . . . 1.7:1--1.7:?? Roberto Grossi and Giuseppe Ottaviano Fast Compressed Tries through Path Decompositions . . . . . . . . . . . . . 1.8:1--1.8:?? Tomasz Jurkiewicz and Kurt Mehlhorn On a Model of Virtual Address Translation . . . . . . . . . . . . . . 1.9:1--1.9:?? Ralf Klasing Editorial . . . . . . . . . . . . . . . 2.1:1--2.1:?? Ilya Safro and Peter Sanders and Christian Schulz Advanced Coarsening Schemes for Graph Partitioning . . . . . . . . . . . . . . 2.2:1--2.2:?? Gonzalo Navarro and Simon J. Puglisi and Daniel Valenzuela General Document Retrieval in Compact Space . . . . . . . . . . . . . . . . . 2.3:1--2.3:?? Gabriel Moruz and Andrei Negoescu and Christian Neumann and Volker Weichert Engineering Efficient Paging Algorithms 2.4:1--2.4:?? Dominik Kirchler and Leo Liberti and Roberto Wolfler Calvo Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks 2.5:1--2.5:?? David F. Manlove and Gregg O'Malley Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation 2.6:1--2.6:?? Dennis Luxen and Dennis Schieferdecker Candidate Sets for Alternative Routes in Road Networks . . . . . . . . . . . . . 2.7:1--2.7:?? David A. Bader and Petra Mutzel Introduction to Special Issue ALENEX'12 3.1:1--3.1:?? Julian Dibbelt and Thomas Pajor and Dorothea Wagner User-Constrained Multimodal Route Planning . . . . . . . . . . . . . . . . 3.2:1--3.2:??
Markus Chimani and Robert Zeranski Upward Planarity Testing in Practice: SAT Formulations and Comparative Study 1.2:1--1.2:?? Nathann Cohen and David Coudert and Aurélien Lancin On Computing the Gromov Hyperbolicity 1.6:1--1.6:?? Annalisa D'Andrea and Mattia D'Emidio and Daniele Frigioni and Stefano Leucci and Guido Proietti Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments . . . . . 1.5:1--1.5:?? Irene Finocchi and Marco Finocchi and Emanuele G. Fusco Clique Counting in MapReduce: Algorithms and Experiments . . . . . . . . . . . . 1.7:1--1.7:?? Ivo Hedtke Upgrading Subgroup Triple-Product-Property Triples . . . . 1.1:1--1.1:?? Ivor Spence Weakening Cardinality Constraints Creates Harder Satisfiability Benchmarks 1.4:1--1.4:?? Julian R. Ullmann Degree Reduction in Labeled Graph Retrieval . . . . . . . . . . . . . . . 1.3:1--1.3:??
Martin Bergner and Marco E. Lübbecke and Jonas T. Witt A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs . . . 1.2:1--1.2:?? Timo Bingmann and Johannes Fischer and Vitaly Osipov Inducing Suffix and LCP Arrays in External Memory . . . . . . . . . . . . 2.3:1--2.3:?? David Coudert and Dorian Mazauric and Nicolas Nisse Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth . . . . 1.3:1--1.3:?? Julian Dibbelt and Ben Strasser and Dorothea Wagner Customizable Contraction Hierarchies . . 1.5:1--1.5:?? Alexandros Efentakis and Dieter Pfoser ReHub: Extending Hub Labels for Reverse $k$-Nearest Neighbor Queries on Large-Scale Networks . . . . . . . . . . 1.13:1--1.13:?? Eli Fox-Epstein and Shay Mozes and Phitchaya Mangpo Phothilimthana and Christian Sommer Short and Simple Cycle Separators in Planar Graphs . . . . . . . . . . . . . 2.2:1--2.2:?? Andreas Gemsa and Martin Nöllenburg and Ignaz Rutter Evaluation of Labeling Strategies for Rotating Maps . . . . . . . . . . . . . 1.4:1--1.4:?? Roland Glantz and Henning Meyerhenke and Christian Schulz Tree-Based Coarsening and Partitioning of Complex Networks . . . . . . . . . . 1.6:1--1.6:?? Joachim Gudmundsson and Jyrki Katajainen Editorial, SEA 2014 Special Issue . . . 1.1:1--1.1:?? Juha Kärkkäinen and Dominik Kempa LCP Array Construction in External Memory . . . . . . . . . . . . . . . . . 1.7:1--1.7:?? Juha Kärkkäinen and Dominik Kempa and Simon J. Puglisi Lazy Lempel--Ziv Factorization Algorithms . . . . . . . . . . . . . . . 2.4:1--2.4:?? Martin Marinov and Nicholas Nash and David Gregg Practical Algorithms for Finding Extremal Sets . . . . . . . . . . . . . 1.9:1--1.9:?? Catherine Mcgeoch In Memoriam: David S. Johnson . . . . . 1.1:1--1.1:?? Gonzalo Navarro and Alberto Ordóñez Pereira Faster Compressed Suffix Trees for Repetitive Collections . . . . . . . . . 1.8:1--1.8:?? Jiju Peethambaran and Amal Dev Parakkat and Ramanathan Muthuganapathy An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets 1.10:1--1.10:?? Conrad W. Rosenbrock and Wiley S. Morgan and Gus L. W. Hart and Stefano Curtarolo and Rodney W. Forcade Numerical Algorithm for Pólya Enumeration Theorem . . . . . . . . . . . . . . . . 1.11:1--1.11:?? Peter Sanders and Norbert Zeh Introduction to Special Issue ALENEX 2013 . . . . . . . . . . . . . . . . . . 2.1:1--2.1:?? Takahisa Toda and Takehide Soh Implementing Efficient All Solutions SAT Solvers . . . . . . . . . . . . . . . . 1.12:1--1.12:?? Alexandros Efentakis and Dieter Pfoser ReHub: Extending Hub Labels for Reverse $k$-Nearest Neighbor Queries on Large-Scale Networks . . . . . . . . . . 1.13:1--1.13:?? Peter Sanders and Norbert Zeh Introduction to Special Issue ALENEX 2013 . . . . . . . . . . . . . . . . . . 2.1:1--2.1:?? Eli Fox-Epstein and Shay Mozes and Phitchaya Mangpo Phothilimthana and Christian Sommer Short and Simple Cycle Separators in Planar Graphs . . . . . . . . . . . . . 2.2:1--2.2:?? Timo Bingmann and Johannes Fischer and Vitaly Osipov Inducing Suffix and LCP Arrays in External Memory . . . . . . . . . . . . 2.3:1--2.3:?? Juha Kärkkäinen and Dominik Kempa and Simon J. Puglisi Lazy Lempel--Ziv Factorization Algorithms . . . . . . . . . . . . . . . 2.4:1--2.4:??
Uwe Baier and Timo Beller and Enno Ohlebusch Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies . . . . . . . . . . . . . . . 1.1:1--1.1:?? Kevin Buchin and Maike Buchin and Joachim Gudmundsson and Michael Horton and Stef Sijben Compact Flow Diagrams for State Sequences . . . . . . . . . . . . . . . 1.7:1--1.7:?? Simon Gog and Roberto Konow and Gonzalo Navarro Practical Compact Indexes for Top-$k$ Document Retrieval . . . . . . . . . . . 1.2:1--1.2:?? Tommi Hirvola and Jorma Tarhio Bit-Parallel Approximate Matching of Circular Strings with $k$ Mismatches . . 1.5:1--1.5:?? Michael Kerber and Dmitriy Morozov and Arnur Nigmetov Geometry Helps to Compare Persistence Diagrams . . . . . . . . . . . . . . . . 1.4:1--1.4:?? Paul-Virak Khuong and Pat Morin Array Layouts for Comparison-Based Searching . . . . . . . . . . . . . . . 1.3:1--1.3:?? Matthias Poloczek and David P. Williamson An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem . . . . . . . . . 1.6:1--1.6:??
Peyman Afshani and Mark De Berg and Henri Casanova and Ben Karsin and Colin Lambrechts and Nodari Sitchinava and Constantinos Tsirogiannis An Efficient Algorithm for the $1$D Total Visibility-Index Problem and Its Parallelization . . . . . . . . . . . . 2.3:1--2.3:?? Elisabetta Bergamini and Pierluigi Crescenzi and Gianlorenzo D'Angelo and Henning Meyerhenke and Lorenzo Severini and Yllka Velaj Improving the Betweenness Centrality of a Node by Adding Links . . . . . . . . . 1.5:1--1.5:?? Julian Dibbelt and Thomas Pajor and Ben Strasser and Dorothea Wagner Connection Scan Algorithm . . . . . . . 1.7:1--1.7:?? Michael Hamann and Ulrich Meyer and Manuel Penschuck and Hung Tran and Dorothea Wagner I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark . . . 2.5:1--2.5:?? Michael Hamann and Ben Strasser Graph Bisection with Pareto Optimization 1.2:1--1.2:?? Monika Henzinger and Alexander Noe and Christian Schulz and Darren Strash Practical Minimum Cut Algorithms . . . . 1.8:1--1.8:?? Moritz Von Looz and Henning Meyerhenke Updating Dynamic Random Hyperbolic Graphs in Sublinear Time . . . . . . . . 1.6:1--1.6:?? Zoltán Ádám Mann Complexity of Coloring Random Graphs: an Experimental Study of the Hardest Region 1.3:1--1.3:?? Nilakantha Paudel and Loukas Georgiadis and Giuseppe F. Italiano Computing Critical Nodes in Directed Graphs . . . . . . . . . . . . . . . . . 2.2:1--2.2:?? Valentin Polischchuk and Vijaya Ramachandran / Rezaul A. Chowdhury Editorial: ALENEX 2017 Special Issue . . 2.1:1--2.1:?? Jeffrey A. Robinson and Susan V. Vrbsky and Xiaoyan Hong and Brian P. Eddy Analysis of a High-Performance TSP Solver on the GPU . . . . . . . . . . . 1.1:1--1.1:?? Sami Sieranoja and Pasi Fränti Constructing a High-Dimensional $k$ NN-Graph Using a $Z$-Order Curve . . . . 1.9:1--1.9:?? Constantinos Tsirogiannis and Frank Staals and Vincent Pellissier Computing the Expected Value and Variance of Geometric Measures . . . . . 2.4:1--2.4:?? Flavio Vella and Massimo Bernaschi and Giancarlo Carbone Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality . . . . . . . . . 1.4:1--1.4:??
Reyan Ahmed and Patrizio Angelini and Faryad Darabi Sahneh and Alon Efrat and David Glickenstein and Martin Gronemann and Niklas Heinsohn and Stephen G. Kobourov and Richard Spence and Joseph Watkins and Alexander Wolff Multi-level Steiner Trees . . . . . . . 2.5:1--2.5:?? Katerina Altmanová and Dusan Knop and Martin Koutecký Evaluating and Tuning $n$-fold Integer Programming . . . . . . . . . . . . . . 2.2:1--2.2:??
Leonid Barenboim and Tzalik Maimon Fully Dynamic Graph Algorithms Inspired by Distributed Computing: Deterministic Maximal Matching and Edge Coloring in Sublinear Update-Time . . . . . . . . . 1.14:1--1.14:?? Moritz Baum and Valentin Buchhold and Julian Dibbelt and Dorothea Wagner Fast Exact Computation of Isocontours in Road Networks . . . . . . . . . . . . . 1.18:1--1.18:?? Matthias Bentert and Anne-Sophie Himmel and Hendrik Molter and Marco Morik and Rolf Niedermeier and René Saitenmacher Listing All Maximal $k$-Plexes in Temporal Graphs . . . . . . . . . . . . 1.13:1--1.13:?? Stephan Beyer and Markus Chimani Strong Steiner Tree Approximations in Practice . . . . . . . . . . . . . . . . 1.7:1--1.7:?? Andreas Björklund and Brajesh Gupt and Nicolás Quesada A Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer . . . . . . . . . . . . . 1.11:1--1.11:?? Michele Borassi and Emanuele Natale KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation . . 1.2:1--1.2:??
Valentin Buchhold and Peter Sanders and Dorothea Wagner Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies . . . . . . . . . . . . . . 2.4:1--2.4:??
Domenico Cantone and Simone Faro and Arianna Pavone Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition . . . . . . . . . . . . . . 1.8:1--1.8:?? F. Cazals and D. Mazauric and R. Tetley and R. Watrigant Comparing Two Clusterings Using Matchings between Clusters of Clusters 1.17:1--1.17:?? Markus Chimani and Ivo Hedtke and Tilo Wiedera Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments . . . . . . . . . . . . . . 2.1:1--2.1:?? Gianlorenzo D'Angelo and Mattia D'Emidio and Daniele Frigioni Fully Dynamic $2$-Hop Cover Labeling . . 1.6:1--1.6:??
Gianlorenzo D'Angelo Introduction to the Special Issue SEA 2018 . . . . . . . . . . . . . . . . . . 2.1:1--2.1:??
Tamal K. Dey and Dayu Shi and Yusu Wang SimBa: an Efficient Tool for Approximating Rips-filtration Persistence via Simplicial Batch Collapse . . . . . . . . . . . . . . . . 1.5:1--1.5:?? Stefan Edelkamp and Armin Weiß BlockQuicksort: Avoiding Branch Mispredictions in Quicksort . . . . . . 1.4:1--1.4:?? Demian Hespe and Christian Schulz and Darren Strash Scalable Kernelization for Maximum Independent Sets . . . . . . . . . . . . 1.16:1--1.16:?? Tobias Heuer and Peter Sanders and Sebastian Schlag Network Flow-Based Refinement for Multilevel Hypergraph Partitioning . . . 2.3:1--2.3:?? Juha Kärkkäinen and Dominik Kempa Better External Memory LCP Array Construction . . . . . . . . . . . . . . 1.3:1--1.3:?? Tuukka Korhonen and Jeremias Berg and Matti Järvisalo Solving Graph Problems via Potential Maximal Cliques: an Experimental Evaluation of the Bouchitté--Todinca Algorithm . . . . . . . . . . . . . . . 1.9:1--1.9:?? Harry A. Levin and Sorelle A. Friedler Automated Congressional Redistricting 1.10:1--1.10:??
Wojciech Nadara and Marcin Pilipczuk and Roman Rabinovich and Felix Reidl and Sebastian Siebertz Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness . . 2.6:1--2.6:??
Marcel Radermacher and Klara Reichard and Ignaz Rutter and Dorothea Wagner Geometric Heuristics for Rectilinear Crossing Minimization . . . . . . . . . 1.12:1--1.12:?? Stoicho D. Stoichev New Exact and Heuristic Algorithms for Graph Automorphism Group and Graph Isomorphism . . . . . . . . . . . . . . 1.15:1--1.15:?? Christos Zaroliagis Editorial --- ESA 2016 Special Issue . . 1.1:1--1.1:??
Micha\l Ziobro and Marcin Pilipczuk Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation . . . . . . . . . . . . . . . 2.7:1--2.7:18
Michael Mitzenmacher and Salvatore Pontarelli and Pedro Reviriego Adaptive Cuckoo Filters . . . . . . . . 1--20 Jakob L. Andersen and Daniel Merkle A Generic Framework for Engineering Graph Canonization Algorithms . . . . . 1--26 Thomas Bläsius and Tobias Friedrich and Maximilian Katzmann and Anton Krohmer Hyperbolic Embeddings for Near-Optimal Greedy Routing . . . . . . . . . . . . . 1--18 Allan Borodin and Christodoulos Karavasilis and Denis Pankratov An Experimental Study of Algorithms for Online Bipartite Matching . . . . . . . 1--37 Thomas Mueller Graf and Daniel Lemire Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters . . . . . . . . 1--16 Guillaume Escamocher and Barry O'Sullivan and Steven David Prestwich Generating Difficult CNF Instances in Unexplored Constrainedness Regions . . . 1--12 Alathea Jensen and Isabel Beichl A Sequential Importance Sampling Algorithm for Counting Linear Extensions 1--14 Panagiotis Charalampopoulos and Costas S. Iliopoulos and Chang Liu and Solon P. Pissis Property Suffix Array with Applications in Indexing Weighted Sequences . . . . . 1--16 Alexandra Henzinger and Alexander Noe and Christian Schulz ILP-Based Local Search for Graph Partitioning . . . . . . . . . . . . . . 1--26 Miguel Coviello Gonzalez and Marek Chrobak A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips . . . . . . . . . . . 1--22 Konrad Von Kirchbach and Christian Schulz and Jesper Larsson Träff Better Process Mapping and Sparse Quadratic Assignment . . . . . . . . . . 1--19 Rebecca J. Stones and Raúl M. Falcón and Daniel Kotlar and Trent G. Marbach Computing Autotopism Groups of Partial Latin Rectangles . . . . . . . . . . . . 1--39 Shunsuke Kanda and Dominik Köppl and Yasuo Tabei and Kazuhiro Morita and Masao Fuketa Dynamic Path-decomposed Tries . . . . . 1--28 Jacob Focke and Nicole Megow and Julie Meißner Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments 1--20
Zsuzsanna Lipták and Simon J. Puglisi and Massimiliano Rossi Pattern Discovery in Colored Strings . . 1--26 Gerth Stòlting Brodal and Konstantinos Mampentzidis Cache Oblivious Algorithms for Computing the Triplet Distance between Trees . . . 1--44 Tomohiro Koana and Viatcheslav Korenwein and André Nichterlein and Rolf Niedermeier and Philipp Zschoche Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments . . . . . . . . . . . . . . 1--30 Ali Baharev and Hermann Schichl and Arnold Neumaier and Tobias Achterberg An Exact Method for the Minimum Feedback Arc Set Problem . . . . . . . . . . . . 1--28 Michael Hecht and Krzysztof Gonciarz and Szabolcs Horvát Tight Localizations of Feedback Sets . . 1--19 Wolfgang Fischl and Georg Gottlob and Davide Mario Longo and Reinhard Pichler HyperBench: a Benchmark and Tool for Hypergraphs and Empirical Findings . . . 1--40 Zirou Qiu and Ruslan Shaydulin and Xiaoyuan Liu and Yuri Alexeev and Christopher S. Henry and Ilya Safro ELRUNA: Elimination Rule-based Network Alignment . . . . . . . . . . . . . . . 1--32 Patrick Dinklage and Jonas Ellert and Johannes Fischer and Florian Kurpicz and Marvin Löbel Practical Wavelet Tree Construction . . 1--67 Michael Jünger and Elisabeth Lobe and Petra Mutzel and Gerhard Reinelt and Franz Rendl and Giovanni Rinaldi and Tobias Stollenwerk Quantum Annealing versus Digital Computing: an Experimental Comparison 1--30 Giulia Bernardini and Huiping Chen and Gabriele Fici and Grigorios Loukides and Solon P. Pissis Reverse-Safe Text Indexing . . . . . . . 1--26 Martín Farach-Colton and Katia Leal and Miguel A. Mosteiro and Christopher Thraves Caro Dynamic Windows Scheduling with Reallocation . . . . . . . . . . . . . . 1--19 Timothy D. Goodrich and Eric Horton and Blair D. Sullivan An Updated Experimental Evaluation of Graph Bipartization Methods . . . . . . 12:1--12:24 Johannes K. Fichte and Markus Hecher and Florim Hamiti The Model Counting Competition 2020 . . 13:1--13:26 Diego Arroyuelo and Rodrigo Cánovas and Johannes Fischer and Dominik Köppl and Marvin Löbel and Gonzalo Navarro and Rajeev Raman Engineering Practical Lempel--Ziv Tries 14:1--14:47 Sebastian Schlag and Matthias Schmitt and Christian Schulz Faster Support Vector Machines . . . . . 15:1--15:21
Daniel S. N. Nunes and Felipe A. Louza and Simon Gog and Mauricio Ayala-Rincón and Gonzalo Navarro Grammar Compression by Induced Suffix Sorting . . . . . . . . . . . . . . . . 1.1:1--1.1:?? Abdurrahman Ya\csar and Muhammed Fati\.h Balin and Xiaojing An and Kaan Sancak and Ümit V. Çatalyürek On Symmetric Rectilinear Partitioning 1.2:1--1.2:?? Martin Grötschel and Michael Jünger and Gerhard Reinelt Comments on ``An Exact Method for the Minimum Feedback Arc Set Problem'' . . . 1.3:1--1.3:?? Marcelo Vaz Netto and Sahudy Montenegro González SSLC: a Search Algorithm Based on Linear Collisions and Poisson Probability Distribution . . . . . . . . . . . . . . 1.4:1--1.4:?? Thomas Mueller Graf and Daniel Lemire Binary Fuse Filters: Fast and Smaller Than Xor Filters . . . . . . . . . . . . 1.5:1--1.5:?? Eugenio Angriman and Micha\l Boro\'n and Henning Meyerhenke A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching 1.6:1--1.6:?? Alexander Grinten van der and Elisabetta Bergamini and Oded Green and David A. Bader and Henning Meyerhenke Scalable Katz Ranking Computation in Large Static and Dynamic Graphs . . . . 1.7:1--1.7:?? Sujoy Bhore and Guangping Li and Martin Nöllenburg An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling . . . 1.8:1--1.8:?? Sebastian Schlag and Tobias Heuer and Lars Gottesbüren and Yaroslav Akhremtsev and Christian Schulz and Peter Sanders High-Quality Hypergraph Partitioning . . 1.9:1--1.9:?? Marcelo Fonseca Faraj and Christian Schulz Buffered Streaming Graph Partitioning 1.10:1--1.10:?? Kathrin Hanauer and Monika Henzinger and Christian Schulz Recent Advances in Fully Dynamic Graph Algorithms --- a Quick Reference Guide 1.11:1--1.11:?? Xu Liu and Andrew Lumsdaine and Mahantesh Halappanavar and Kevin Barker and Assefaw Gebremedhin Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis . . . . . . . . . 1.12:1--1.12:?? Jules Bertrand and Fanny Dufossé and Somesh Singh and Bora Uçar Algorithms and Data Structures for Hyperedge Queries . . . . . . . . . . . 1.13:1--1.13:?? Jan-Hendrik Lorenz and Florian Wörz Toward an Understanding of Long-tailed Runtimes of SLS Algorithms . . . . . . . 1.14:1--1.14:?? David Coudert and André Nusser and Laurent Viennot Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation . . . . . . . 1.15:1--1.15:?? Georg Gottlob and Matthias Lanzinger and Davide Mario Longo and Cem Okulmus Incremental Updates of Generalized Hypertree Decompositions . . . . . . . . 1.16:1--1.16:??
Frederick Anderson and Anirban Ghosh and Matthew Graham and Lucas Mougeot and David Wisnosky Bounded-Degree Plane Geometric Spanners in Practice . . . . . . . . . . . . . . 1.1:1--1.1:?? Lo\"\ic Crombez and Guilherme D. Da Fonseca and Florian Fontan and Yan Gerard and Aldo Gonzalez-Lorenzo and Pascal Lafourcade and Luc Libralesso and Benjamin Mom\`ege and Jack Spalding-Jamieson and Brandon Zhang and Da Wei Zheng Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring . . . . . . 1.2:1--1.2:?? Apostolos Chalkis and Ioannis Z. Emiris and Vissarion Fisikopoulos A Practical Algorithm for Volume Estimation based on Billiard Trajectories and Simulated Annealing . . 1.3:1--1.3:?? Piotr Beling Fingerprinting-based Minimal Perfect Hashing Revisited . . . . . . . . . . . 1.4:1--1.4:?? André Schidler and Stefan Szeider SAT-boosted Tabu Search for Coloring Massive Graphs . . . . . . . . . . . . . 1.5:1--1.5:?? José Alejandro Cornejo-Acosta and Jesús García-Díaz and Julio César Pérez-Sansalvador and Roger Z. Ríos-Mercado and Saúl Eduardo Pomares-Hernández A Constructive Heuristic for the Uniform Capacitated Vertex $k$-center Problem 1.6:1--1.6:?? Rachel G. de Jong and Mark P. J. van der Loo and Frank W. Takes Algorithms for Efficiently Computing Structural Anonymity in Complex Networks 1.7:1--1.7:?? Hu Ding and Wenjie Liu and Mingquan Ye A Data-dependent Approach for High-dimensional (Robust) Wasserstein Alignment . . . . . . . . . . . . . . . 1.8:1--1.8:?? Sándor P. Fekete and Phillip Keldenich and Dominik Krupke and Stefan Schirra Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022 . . . . . . . 1.9:1--1.9:?? Simon D. Fink and Matthias Pfretzschner and Ignaz Rutter Experimental Comparison of PC-Trees and PQ-Trees . . . . . . . . . . . . . . . . 1.10:1--1.10:?? Ali Al Zoobi and David Coudert and Nicolas Nisse Finding the $k$ Shortest Simple Paths: Time and Space Trade-offs . . . . . . . 1.11:1--1.11:?? Renee Mirka and David P. Williamson An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut . . . . . . . . . 2.1:1--2.1:?? Leo Liberti and Benedetto Manca and Pierre-Louis Poirion Random Projections for Linear Programming: an Improved Retrieval Phase 2.2:1--2.2:?? Darko Drakulic and Christelle Loiodice and Vassilissa Lehoux Routing in Multimodal Transportation Networks with Non-scheduled Lines . . . 2.3:1--2.3:??