default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th SEA 2020: Catania, Italy [Online event]
- Simone Faro
, Domenico Cantone:
18th International Symposium on Experimental Algorithms, SEA 2020, Catania, Italy, June 16-18, 2020. LIPIcs 160, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-148-1 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:12
- Martin Aumüller:
Algorithm Engineering for High-Dimensional Similarity Search Problems (Invited Talk). 1:1-1:3 - Stefan Edelkamp:
Algorithm Engineering for Sorting and Searching, and All That (Invited Talk). 2:1-2:3 - Nicola Prezza:
Indexing Compressed Text: A Tale of Time and Space (Invited Talk). 3:1-3:2 - Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz:
High-Quality Hierarchical Process Mapping. 4:1-4:15 - Sándor P. Fekete, Alexander Hill, Dominik Krupke, Tyler Mayer, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips:
Probing a Set of Trajectories to Maximize Captured Information. 5:1-5:14 - Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane:
Storing Set Families More Compactly with Top ZDDs. 6:1-6:13 - Dominik Köppl, Simon J. Puglisi, Rajeev Raman:
Fast and Simple Compact Hashing via Bucketing. 7:1-7:14 - Daniel Berend, Yochai Twitto:
Effect of Initial Assignment on Local Search Performance for Max Sat. 8:1-8:14 - Yu Nakahata, Masaaki Nishino, Jun Kawahara, Shin-ichi Minato:
Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams. 9:1-9:14 - Lars Gottesbüren, Michael Hamann, Philipp Schoch, Ben Strasser, Dorothea Wagner, Sven Zühlsdorf:
Engineering Exact Quasi-Threshold Editing. 10:1-10:14 - Lars Gottesbüren, Michael Hamann, Sebastian Schlag, Dorothea Wagner:
Advanced Flow-Based Multilevel Hypergraph Partitioning. 11:1-11:15 - Zsuzsanna Lipták, Simon J. Puglisi, Massimiliano Rossi:
Pattern Discovery in Colored Strings. 12:1-12:14 - Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences. 13:1-13:13 - Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Faster Fully Dynamic Transitive Closure in Practice. 14:1-14:14 - Tobias Maier, Peter Sanders, Robert Williger:
Concurrent Expandable AMQs on the Basis of Quotient Filters. 15:1-15:13 - Jonas Sauer, Dorothea Wagner, Tobias Zündorf:
Faster Multi-Modal Route Planning With Bike Sharing Using ULTRA. 16:1-16:14 - Alexander Kleff, Frank Schulz, Jakob Wagenblatt, Tim Zeitz:
Efficient Route Planning with Temporary Driving Bans, Road Closures, and Rated Parking Areas. 17:1-17:13 - Ali Al Zoobi, David Coudert, Nicolas Nisse:
Space and Time Trade-Off for the k Shortest Simple Paths Problem. 18:1-18:13 - James Trimble:
An Algorithm for the Exact Treedepth Problem. 19:1-19:14 - Frances Cooper, David F. Manlove:
Algorithms for New Types of Fair Stable Matchings. 20:1-20:13 - Dmytro Antypov, Argyrios Deligkas, Vladimir V. Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, Michail Theofilatos:
Crystal Structure Prediction via Oblivious Local Search. 21:1-21:14 - Kengo Nakamura, Shuhei Denzumi, Masaaki Nishino:
Variable Shift SDD: A More Succinct Sentential Decision Diagram. 22:1-22:13 - Elias Kuthe, Sven Rahmann:
Engineering Fused Lasso Solvers on Trees. 23:1-23:14 - Roberto Grossi, Andrea Marino, Shima Moghtasedi:
Finding Structurally and Temporally Similar Trajectories in Graphs. 24:1-24:13 - Lukas Barth, Dorothea Wagner:
Zipping Segment Trees. 25:1-25:13 - Valentin Buchhold, Daniel Delling, Dennis Schieferdecker, Michael Wegner:
Fast and Stable Repartitioning of Road Networks. 26:1-26:15 - Meng He, Serikzhan Kazi:
Path Query Data Structures in Practice. 27:1-27:16
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 2026-05-12 22:51 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:
