Abstract is missing.
- Optimizing over the Efficient Set of a Multi-Objective Discrete Optimization ProblemSatya Tamby, Daniel Vanderpooten. [doi]
- Fast Reachability Using DAG DecompositionGiorgos Kritikakis, Ioannis G. Tollis. [doi]
- Engineering a Preprocessor for Symmetry DetectionMarkus Anders, Pascal Schweitzer, Julian Stieß. [doi]
- Multilinear Formulations for Computing a Nash Equilibrium of Multi-Player GamesMiriam Fischer, Akshay Gupte. [doi]
- Greedy Heuristics for Judicious Hypergraph PartitioningNoah Wahl, Lars Gottesbüren. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex CoverSebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich 0001, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt 0002, Leo Wendt. [doi]
- Hierarchical Relative Lempel-Ziv CompressionPhilip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon R. Tarnow. [doi]
- Proxying Betweenness Centrality Rankings in Temporal NetworksRuben Becker, Pierluigi Crescenzi, Antonio Cruciani, Bojana Kodric. [doi]
- Arc-Flags Meet Trip-Based Public Transit RoutingErnestine Großmann, Jonas Sauer, Christian Schulz 0003, Patrick Steil. [doi]
- Exact and Approximate Range Mode Query Data Structures in PracticeMeng He 0001, Zhen Liu. [doi]
- Simple Runs-Bounded FM-Index Designs Are FastDiego Díaz-Domínguez, Saska Dönges, Simon J. Puglisi, Leena Salmela. [doi]
- Subset Wavelet TreesJarno N. Alanko, Elena Biagi, Simon J. Puglisi, Jaakko Vuohtoniemi. [doi]
- Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison ErrorsRamtin Afshar, Michael B. Dillencourt, Michael T. Goodrich, Evrim Ozel. [doi]
- FREIGHT: Fast Streaming Hypergraph PartitioningKamal Eyubov, Marcelo Fonseca Faraj, Christian Schulz 0003. [doi]
- Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree ProblemÖmer Burak Onar, Tínaz Ekim, Z. Caner Taskin. [doi]
- CompDP: A Framework for Simultaneous Subgraph Counting Under Connectivity ConstraintsKengo Nakamura 0001, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato. [doi]
- Maximum Coverage in Sublinear Space, FasterStephen Jaud, Anthony Wirth, Farhana Murtaza Choudhury. [doi]
- A Graph-Theoretic Formulation of Exploratory BlockmodelingAlexander Bille, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz. [doi]
- Engineering Shared-Memory Parallel Shuffling to Generate Random Permutations In-PlaceManuel Penschuck. [doi]
- Efficient Yao Graph ConstructionDaniel Funke, Peter Sanders 0001. [doi]
- Partitioning the Bags of a Tree Decomposition into CliquesThomas Bläsius, Maximilian Katzmann, Marcus Wilhelm. [doi]