@Proceedings{faro_et_al:LIPIcs.SEA.2020,
title = {{LIPIcs, Volume 160, SEA 2020, Complete Volume}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {1--366},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020},
URN = {urn:nbn:de:0030-drops-120730},
doi = {10.4230/LIPIcs.SEA.2020},
annote = {Keywords: LIPIcs, Volume 160, SEA 2020, Complete Volume}
}
@InProceedings{faro_et_al:LIPIcs.SEA.2020.0,
author = {Faro, Simone and Cantone, Domenico},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {0:i--0:xii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.0},
URN = {urn:nbn:de:0030-drops-120741},
doi = {10.4230/LIPIcs.SEA.2020.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{aumuller:LIPIcs.SEA.2020.1,
author = {Aum\"{u}ller, Martin},
title = {{Algorithm Engineering for High-Dimensional Similarity Search Problems}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {1:1--1:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.1},
URN = {urn:nbn:de:0030-drops-120751},
doi = {10.4230/LIPIcs.SEA.2020.1},
annote = {Keywords: Nearest neighbor search, Benchmarking}
}
@InProceedings{edelkamp:LIPIcs.SEA.2020.2,
author = {Edelkamp, Stefan},
title = {{Algorithm Engineering for Sorting and Searching, and All That}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {2:1--2:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.2},
URN = {urn:nbn:de:0030-drops-120766},
doi = {10.4230/LIPIcs.SEA.2020.2},
annote = {Keywords: Sorting, Searching, Algorithm Engineering}
}
@InProceedings{prezza:LIPIcs.SEA.2020.3,
author = {Prezza, Nicola},
title = {{Indexing Compressed Text: A Tale of Time and Space}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {3:1--3:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.3},
URN = {urn:nbn:de:0030-drops-120772},
doi = {10.4230/LIPIcs.SEA.2020.3},
annote = {Keywords: Compressed Text Indexing}
}
@InProceedings{faraj_et_al:LIPIcs.SEA.2020.4,
author = {Faraj, Marcelo Fonseca and van der Grinten, Alexander and Meyerhenke, Henning and Tr\"{a}ff, Jesper Larsson and Schulz, Christian},
title = {{High-Quality Hierarchical Process Mapping}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {4:1--4:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.4},
URN = {urn:nbn:de:0030-drops-120782},
doi = {10.4230/LIPIcs.SEA.2020.4},
annote = {Keywords: Process Mapping, Graph Partitioning, Algorithm Engineering}
}
@InProceedings{fekete_et_al:LIPIcs.SEA.2020.5,
author = {Fekete, S\'{a}ndor P. and Hill, Alexander and Krupke, Dominik and Mayer, Tyler and Mitchell, Joseph S. B. and Parekh, Ojas and Phillips, Cynthia A.},
title = {{Probing a Set of Trajectories to Maximize Captured Information}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {5:1--5:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.5},
URN = {urn:nbn:de:0030-drops-120796},
doi = {10.4230/LIPIcs.SEA.2020.5},
annote = {Keywords: Algorithm engineering, optimization, complexity, approximation, trajectories}
}
@InProceedings{matsuda_et_al:LIPIcs.SEA.2020.6,
author = {Matsuda, Kotaro and Denzumi, Shuhei and Sadakane, Kunihiko},
title = {{Storing Set Families More Compactly with Top ZDDs}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {6:1--6:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.6},
URN = {urn:nbn:de:0030-drops-120809},
doi = {10.4230/LIPIcs.SEA.2020.6},
annote = {Keywords: top tree, Zero-suppressed Decision Diagram, space-efficient data structure}
}
@InProceedings{koppl_et_al:LIPIcs.SEA.2020.7,
author = {K\"{o}ppl, Dominik and Puglisi, Simon J. and Raman, Rajeev},
title = {{Fast and Simple Compact Hashing via Bucketing}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {7:1--7:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.7},
URN = {urn:nbn:de:0030-drops-120817},
doi = {10.4230/LIPIcs.SEA.2020.7},
annote = {Keywords: compact hashing, hash table, separate chaining}
}
@InProceedings{berend_et_al:LIPIcs.SEA.2020.8,
author = {Berend, Daniel and Twitto, Yochai},
title = {{Effect of Initial Assignment on Local Search Performance for Max Sat}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {8:1--8:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.8},
URN = {urn:nbn:de:0030-drops-120823},
doi = {10.4230/LIPIcs.SEA.2020.8},
annote = {Keywords: Combinatorial Optimization, Maximum Satisfiability, Local Search, Probabilistic Algorithms}
}
@InProceedings{nakahata_et_al:LIPIcs.SEA.2020.9,
author = {Nakahata, Yu and Nishino, Masaaki and Kawahara, Jun and Minato, Shin-ichi},
title = {{Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.9},
URN = {urn:nbn:de:0030-drops-120831},
doi = {10.4230/LIPIcs.SEA.2020.9},
annote = {Keywords: Subgraph, Enumeration, Decision Diagram, Zero-suppressed Sentential Decision Diagram (ZSDD), Top-down construction algorithm}
}
@InProceedings{gottesburen_et_al:LIPIcs.SEA.2020.10,
author = {Gottesb\"{u}ren, Lars and Hamann, Michael and Schoch, Philipp and Strasser, Ben and Wagner, Dorothea and Z\"{u}hlsdorf, Sven},
title = {{Engineering Exact Quasi-Threshold Editing}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {10:1--10:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.10},
URN = {urn:nbn:de:0030-drops-120849},
doi = {10.4230/LIPIcs.SEA.2020.10},
annote = {Keywords: Edge Editing, Integer Linear Programming, FPT algorithm, Quasi-Threshold Editing}
}
@InProceedings{gottesburen_et_al:LIPIcs.SEA.2020.11,
author = {Gottesb\"{u}ren, Lars and Hamann, Michael and Schlag, Sebastian and Wagner, Dorothea},
title = {{Advanced Flow-Based Multilevel Hypergraph Partitioning}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.11},
URN = {urn:nbn:de:0030-drops-120859},
doi = {10.4230/LIPIcs.SEA.2020.11},
annote = {Keywords: Hypergraph Partitioning, Maximum Flows, Refinement}
}
@InProceedings{liptak_et_al:LIPIcs.SEA.2020.12,
author = {Lipt\'{a}k, Zsuzsanna and Puglisi, Simon J. and Rossi, Massimiliano},
title = {{Pattern Discovery in Colored Strings}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.12},
URN = {urn:nbn:de:0030-drops-120862},
doi = {10.4230/LIPIcs.SEA.2020.12},
annote = {Keywords: property testing, suffix tree, pattern mining}
}
@InProceedings{kobayashi_et_al:LIPIcs.SEA.2020.13,
author = {Kobayashi, Satoshi and Hendrian, Diptarama and Yoshinaka, Ryo and Shinohara, Ayumi},
title = {{Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {13:1--13:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.13},
URN = {urn:nbn:de:0030-drops-120878},
doi = {10.4230/LIPIcs.SEA.2020.13},
annote = {Keywords: String matching algorithm, text processing}
}
@InProceedings{hanauer_et_al:LIPIcs.SEA.2020.14,
author = {Hanauer, Kathrin and Henzinger, Monika and Schulz, Christian},
title = {{Faster Fully Dynamic Transitive Closure in Practice}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {14:1--14:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.14},
URN = {urn:nbn:de:0030-drops-120887},
doi = {10.4230/LIPIcs.SEA.2020.14},
annote = {Keywords: Dynamic Graph Algorithms, Reachability, Transitive Closure}
}
@InProceedings{maier_et_al:LIPIcs.SEA.2020.15,
author = {Maier, Tobias and Sanders, Peter and Williger, Robert},
title = {{Concurrent Expandable AMQs on the Basis of Quotient Filters}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {15:1--15:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.15},
URN = {urn:nbn:de:0030-drops-120890},
doi = {10.4230/LIPIcs.SEA.2020.15},
annote = {Keywords: Quotient filter, Concurrent data structures, Locking}
}
@InProceedings{sauer_et_al:LIPIcs.SEA.2020.16,
author = {Sauer, Jonas and Wagner, Dorothea and Z\"{u}ndorf, Tobias},
title = {{Faster Multi-Modal Route Planning With Bike Sharing Using ULTRA}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {16:1--16:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.16},
URN = {urn:nbn:de:0030-drops-120905},
doi = {10.4230/LIPIcs.SEA.2020.16},
annote = {Keywords: Algorithms, Route Planning, Bike Sharing, Public Transportation}
}
@InProceedings{kleff_et_al:LIPIcs.SEA.2020.17,
author = {Kleff, Alexander and Schulz, Frank and Wagenblatt, Jakob and Zeitz, Tim},
title = {{Efficient Route Planning with Temporary Driving Bans, Road Closures, and Rated Parking Areas}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {17:1--17:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.17},
URN = {urn:nbn:de:0030-drops-120910},
doi = {10.4230/LIPIcs.SEA.2020.17},
annote = {Keywords: driving bans, realistic road networks, route planning, shortest paths}
}
@InProceedings{alzoobi_et_al:LIPIcs.SEA.2020.18,
author = {Al Zoobi, Ali and Coudert, David and Nisse, Nicolas},
title = {{Space and Time Trade-Off for the k Shortest Simple Paths Problem}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {18:1--18:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.18},
URN = {urn:nbn:de:0030-drops-120925},
doi = {10.4230/LIPIcs.SEA.2020.18},
annote = {Keywords: k shortest simple paths, graph algorithm, space-time trade-off}
}
@InProceedings{trimble:LIPIcs.SEA.2020.19,
author = {Trimble, James},
title = {{An Algorithm for the Exact Treedepth Problem}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.19},
URN = {urn:nbn:de:0030-drops-120938},
doi = {10.4230/LIPIcs.SEA.2020.19},
annote = {Keywords: Treedepth, Elimination Tree, Graph Algorithms}
}
@InProceedings{cooper_et_al:LIPIcs.SEA.2020.20,
author = {Cooper, Frances and Manlove, David},
title = {{Algorithms for New Types of Fair Stable Matchings}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {20:1--20:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.20},
URN = {urn:nbn:de:0030-drops-120945},
doi = {10.4230/LIPIcs.SEA.2020.20},
annote = {Keywords: Stable marriage, Algorithms, Optimality, Fair stable matchings, Regret-equality, Min-regret sum}
}
@InProceedings{antypov_et_al:LIPIcs.SEA.2020.21,
author = {Antypov, Dmytro and Deligkas, Argyrios and Gusev, Vladimir and Rosseinsky, Matthew J. and Spirakis, Paul G. and Theofilatos, Michail},
title = {{Crystal Structure Prediction via Oblivious Local Search}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {21:1--21:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.21},
URN = {urn:nbn:de:0030-drops-120950},
doi = {10.4230/LIPIcs.SEA.2020.21},
annote = {Keywords: crystal structure prediction, local search, combinatorial neighborhood}
}
@InProceedings{nakamura_et_al:LIPIcs.SEA.2020.22,
author = {Nakamura, Kengo and Denzumi, Shuhei and Nishino, Masaaki},
title = {{Variable Shift SDD: A More Succinct Sentential Decision Diagram}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {22:1--22:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.22},
URN = {urn:nbn:de:0030-drops-120968},
doi = {10.4230/LIPIcs.SEA.2020.22},
annote = {Keywords: Boolean function, Data structure, Sentential decision diagram}
}
@InProceedings{kuthe_et_al:LIPIcs.SEA.2020.23,
author = {Kuthe, Elias and Rahmann, Sven},
title = {{Engineering Fused Lasso Solvers on Trees}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {23:1--23:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.23},
URN = {urn:nbn:de:0030-drops-120977},
doi = {10.4230/LIPIcs.SEA.2020.23},
annote = {Keywords: fused lasso, regularization, tree traversal, cache effects}
}
@InProceedings{grossi_et_al:LIPIcs.SEA.2020.24,
author = {Grossi, Roberto and Marino, Andrea and Moghtasedi, Shima},
title = {{Finding Structurally and Temporally Similar Trajectories in Graphs}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {24:1--24:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.24},
URN = {urn:nbn:de:0030-drops-120989},
doi = {10.4230/LIPIcs.SEA.2020.24},
annote = {Keywords: Graph trajectory, approximated similarity, top-k similarity query}
}
@InProceedings{barth_et_al:LIPIcs.SEA.2020.25,
author = {Barth, Lukas and Wagner, Dorothea},
title = {{Zipping Segment Trees}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {25:1--25:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.25},
URN = {urn:nbn:de:0030-drops-120990},
doi = {10.4230/LIPIcs.SEA.2020.25},
annote = {Keywords: Segment Trees, Dynamic Segment Trees, Zip Trees, Data Structures}
}
@InProceedings{buchhold_et_al:LIPIcs.SEA.2020.26,
author = {Buchhold, Valentin and Delling, Daniel and Schieferdecker, Dennis and Wegner, Michael},
title = {{Fast and Stable Repartitioning of Road Networks}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {26:1--26:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.26},
URN = {urn:nbn:de:0030-drops-121000},
doi = {10.4230/LIPIcs.SEA.2020.26},
annote = {Keywords: Graph repartitioning, stable partitions, road networks, algorithm engineering}
}
@InProceedings{he_et_al:LIPIcs.SEA.2020.27,
author = {He, Meng and Kazi, Serikzhan},
title = {{Path Query Data Structures in Practice}},
booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)},
pages = {27:1--27:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-148-1},
ISSN = {1868-8969},
year = {2020},
volume = {160},
editor = {Faro, Simone and Cantone, Domenico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.27},
URN = {urn:nbn:de:0030-drops-121012},
doi = {10.4230/LIPIcs.SEA.2020.27},
annote = {Keywords: path query, path median, path counting, path reporting, weighted tree}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing