default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th SEA 2018: L'Aquila, Italy
- Gianlorenzo D'Angelo:
17th International Symposium on Experimental Algorithms, SEA 2018, June 27-29, 2018, L'Aquila, Italy. LIPIcs 103, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-070-5 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xi
- Tobias Heuer, Peter Sanders, Sebastian Schlag
:
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. 1:1-1:19 - Ruslan Shaydulin, Ilya Safro:
Aggregative Coarsening for Multilevel Hypergraph Partitioning. 2:1-2:15 - Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster:
Memetic Graph Clustering. 3:1-3:15 - Alexandra Henzinger, Alexander Noe, Christian Schulz:
ILP-based Local Search for Graph Partitioning. 4:1-4:15 - Kosuke Matsumoto, Kohei Hatano, Eiji Takimoto:
Decision Diagrams for Solving a Job Scheduling Problem Under Precedence Constraints. 5:1-5:12 - Nafiseh Sedaghat, Tamon Stephen, Leonid Chindelevitch:
Speeding up Dualization in the Fredman-Khachiyan Algorithm B. 6:1-6:13 - M. Oguzhan Külekci:
An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes. 7:1-7:13 - Frances Cooper, David F. Manlove:
A 3/2-Approximation Algorithm for the Student-Project Allocation Problem. 8:1-8:13 - Krishnapriya A. M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat:
How Good Are Popular Matchings?. 9:1-9:14 - Katerina Altmanová, Dusan Knop, Martin Koutecký:
Evaluating and Tuning n-fold Integer Programming. 10:1-10:14 - Michael Bastubbe, Marco E. Lübbecke, Jonas T. Witt:
A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations. 11:1-11:12 - Krzysztof Kiljan, Marcin Pilipczuk:
Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set. 12:1-12:12 - Kazuya Haraguchi:
An Efficient Local Search for the Minimum Independent Dominating Set Problem. 13:1-13:13 - Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz:
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. 14:1-14:16 - Abu Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen G. Kobourov, Richard Spence, Joseph Watkins, Alexander Wolff:
Multi-Level Steiner Trees. 15:1-15:14 - Solon P. Pissis, Ahmad Retha:
Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line. 16:1-16:14 - Djamal Belazzougui, Fabio Cunial, Olgert Denas:
Fast matching statistics in small space. 17:1-17:14 - Bastien Cazaux, Samuel Juhel, Eric Rivals:
Practical lower and upper bounds for the Shortest Linear Superstring. 18:1-18:14 - Jean-François Baffier, Yago Diez, Matias Korman:
Experimental Study of Compressed Stack Algorithms in Limited Memory Environments. 19:1-19:13 - Martin Wilhelm:
Restructuring Expression Dags for Efficient Parallelization. 20:1-20:13 - Yu Nakahata, Jun Kawahara, Shoji Kasahara:
Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams. 21:1-21:13 - Markus Chimani, Ivo Hedtke, Tilo Wiedera:
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. 22:1-22:15 - Shixun Huang, Zhifeng Bao, J. Shane Culpepper, Ping Zhang, Bang Zhang:
A Linear-Time Algorithm for Finding Induced Planar Subgraphs. 23:1-23:15 - Luca Castelli Aleardi, Gaspard Denis, Éric Fusy:
Fast Spherical Drawing of Triangulations: An Experimental Study of Graph Drawing Tools. 24:1-24:14 - Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler:
Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks. 25:1-25:14 - Vinicius N. G. Pereira, Mário César San Felice, Pedro Henrique Del Bianco Hokama, Eduardo C. Xavier:
The Steiner Multi Cycle Problem with Applications to a Collaborative Truckload Problem. 26:1-26:13 - Valentin Buchhold, Peter Sanders, Dorothea Wagner:
Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies. 27:1-27:15 - Petteri Kaski, Juho Lauri, Suhas Thejaswi:
Engineering Motif Search for Large Motifs. 28:1-28:19 - Michal Ziobro, Marcin Pilipczuk:
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. 29:1-29:14 - Adolfo Piperno:
Isomorphism Test for Digraphs with Weighted Edges. 30:1-30:13
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-02 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
