Abstract is missing.
- A Linear-Time Algorithm for Finding Induced Planar SubgraphsShixun Huang, Zhifeng Bao, J. Shane Culpepper, Ping Zhang, Bang Zhang. [doi]
- An Ambiguous Coding Scheme for Selective Encryption of High Entropy VolumesM. Oguzhan Külekci. [doi]
- ILP-based Local Search for Graph PartitioningAlexandra Henzinger, Alexander Noe, Christian Schulz 0003. [doi]
- Network Flow-Based Refinement for Multilevel Hypergraph PartitioningTobias Heuer, Peter Sanders 0001, Sebastian Schlag. [doi]
- How Good Are Popular Matchings?Krishnapriya A. M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat. [doi]
- Decision Diagrams for Solving a Job Scheduling Problem Under Precedence ConstraintsKosuke Matsumoto, Kohei Hatano, Eiji Takimoto. [doi]
- Experimental Evaluation of Parameterized Algorithms for Feedback Vertex SetKrzysztof Kiljan, Marcin Pilipczuk. [doi]
- Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction HierarchiesValentin Buchhold, Peter Sanders 0001, Dorothea Wagner. [doi]
- The Steiner Multi Cycle Problem with Applications to a Collaborative Truckload ProblemVinicius N. G. Pereira, Mário César San Felice, Pedro Henrique Del Bianco Hokama, Eduardo C. Xavier. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision DiagramsYu Nakahata, Jun Kawahara, Shoji Kasahara. [doi]
- Fast matching statistics in small spaceDjamal Belazzougui, Fabio Cunial, Olgert Denas. [doi]
- Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and ExperimentsMarkus Chimani, Ivo Hedtke, Tilo Wiedera. [doi]
- Engineering Motif Search for Large MotifsPetteri Kaski, Juho Lauri, Suhas Thejaswi. [doi]
- A Computational Investigation on the Strength of Dantzig-Wolfe ReformulationsMichael Bastubbe, Marco E. Lübbecke, Jonas T. Witt. [doi]
- Experimental Study of Compressed Stack Algorithms in Limited Memory EnvironmentsJean-François Baffier, Yago Diez, Matias Korman. [doi]
- Aggregative Coarsening for Multilevel Hypergraph PartitioningRuslan Shaydulin, Ilya Safro. [doi]
- Speeding up Dualization in the Fredman-Khachiyan Algorithm BNafiseh Sedaghat, Tamon Stephen, Leonid Chindelevitch. [doi]
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental EvaluationMichal Ziobro, Marcin Pilipczuk. [doi]
- Isomorphism Test for Digraphs with Weighted EdgesAdolfo Piperno. [doi]
- Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded NetworksSahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler. [doi]
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-WidenessWojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz. [doi]
- Restructuring Expression Dags for Efficient ParallelizationMartin Wilhelm. [doi]
- Fast Spherical Drawing of Triangulations: An Experimental Study of Graph Drawing ToolsLuca Castelli Aleardi, Gaspard Denis, Éric Fusy. [doi]
- Multi-Level Steiner TreesAbu Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen G. Kobourov, Richard Spence, Joseph Watkins, Alexander Wolff. [doi]
- A 3/2-Approximation Algorithm for the Student-Project Allocation ProblemFrances Cooper, David Manlove. [doi]
- Memetic Graph ClusteringSonja Biedermann, Monika Henzinger, Christian Schulz 0003, Bernhard Schuster. [doi]
- An Efficient Local Search for the Minimum Independent Dominating Set ProblemKazuya Haraguchi. [doi]
- Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-lineSolon P. Pissis, Ahmad Retha. [doi]
- Evaluating and Tuning n-fold Integer ProgrammingKaterina Altmanová, Dusan Knop, Martin Koutecký. [doi]
- Practical lower and upper bounds for the Shortest Linear SuperstringBastien Cazaux, Samuel Juhel, Eric Rivals. [doi]