17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@Proceedings{dangelo:LIPIcs.SEA.2018, title = {{LIPIcs, Volume 103, SEA'18, Complete Volume}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018}, URN = {urn:nbn:de:0030-drops-92438}, doi = {10.4230/LIPIcs.SEA.2018}, annote = {Keywords: Theory of computation, Design and analysis of algorithms} }
17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 0:i-0:xi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dangelo:LIPIcs.SEA.2018.0, author = {D'Angelo, Gianlorenzo}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {0:i--0:xi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.0}, URN = {urn:nbn:de:0030-drops-89357}, doi = {10.4230/LIPIcs.SEA.2018.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Tobias Heuer, Peter Sanders, and Sebastian Schlag. Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 1:1-1:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{heuer_et_al:LIPIcs.SEA.2018.1, author = {Heuer, Tobias and Sanders, Peter and Schlag, Sebastian}, title = {{Network Flow-Based Refinement for Multilevel Hypergraph Partitioning}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {1:1--1:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.1}, URN = {urn:nbn:de:0030-drops-89368}, doi = {10.4230/LIPIcs.SEA.2018.1}, annote = {Keywords: Multilevel Hypergraph Partitioning, Network Flows, Refinement} }
Ruslan Shaydulin and Ilya Safro. Aggregative Coarsening for Multilevel Hypergraph Partitioning. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 2:1-2:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{shaydulin_et_al:LIPIcs.SEA.2018.2, author = {Shaydulin, Ruslan and Safro, Ilya}, title = {{Aggregative Coarsening for Multilevel Hypergraph Partitioning}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {2:1--2:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.2}, URN = {urn:nbn:de:0030-drops-89371}, doi = {10.4230/LIPIcs.SEA.2018.2}, annote = {Keywords: hypergraph partitioning, multilevel algorithms, coarsening, matching, combinatorial scientific computing} }
Sonja Biedermann, Monika Henzinger, Christian Schulz, and Bernhard Schuster. Memetic Graph Clustering. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{biedermann_et_al:LIPIcs.SEA.2018.3, author = {Biedermann, Sonja and Henzinger, Monika and Schulz, Christian and Schuster, Bernhard}, title = {{Memetic Graph Clustering}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {3:1--3:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.3}, URN = {urn:nbn:de:0030-drops-89389}, doi = {10.4230/LIPIcs.SEA.2018.3}, annote = {Keywords: Graph Clustering, Evolutionary Algorithms} }
Alexandra Henzinger, Alexander Noe, and Christian Schulz. ILP-based Local Search for Graph Partitioning. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 4:1-4:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{henzinger_et_al:LIPIcs.SEA.2018.4, author = {Henzinger, Alexandra and Noe, Alexander and Schulz, Christian}, title = {{ILP-based Local Search for Graph Partitioning}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {4:1--4:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.4}, URN = {urn:nbn:de:0030-drops-89399}, doi = {10.4230/LIPIcs.SEA.2018.4}, annote = {Keywords: Graph Partitioning, Integer Linear Programming} }
Kosuke Matsumoto, Kohei Hatano, and Eiji Takimoto. Decision Diagrams for Solving a Job Scheduling Problem Under Precedence Constraints. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 5:1-5:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{matsumoto_et_al:LIPIcs.SEA.2018.5, author = {Matsumoto, Kosuke and Hatano, Kohei and Takimoto, Eiji}, title = {{Decision Diagrams for Solving a Job Scheduling Problem Under Precedence Constraints}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {5:1--5:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.5}, URN = {urn:nbn:de:0030-drops-89402}, doi = {10.4230/LIPIcs.SEA.2018.5}, annote = {Keywords: decision diagram, permutation, scheduling, NP-hardness, precedence constraints, MDD} }
Nafiseh Sedaghat, Tamon Stephen, and Leonid Chindelevitch. Speeding up Dualization in the Fredman-Khachiyan Algorithm B. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 6:1-6:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{sedaghat_et_al:LIPIcs.SEA.2018.6, author = {Sedaghat, Nafiseh and Stephen, Tamon and Chindelevitch, Leonid}, title = {{Speeding up Dualization in the Fredman-Khachiyan Algorithm B}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {6:1--6:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.6}, URN = {urn:nbn:de:0030-drops-89413}, doi = {10.4230/LIPIcs.SEA.2018.6}, annote = {Keywords: Monotone boolean functions, dualization, Fredman-Khachiyan algorithm, algorithm engineering, metabolic networks} }
M. Oguzhan Külekci. An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 7:1-7:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kulekci:LIPIcs.SEA.2018.7, author = {K\"{u}lekci, M. Oguzhan}, title = {{An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {7:1--7:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.7}, URN = {urn:nbn:de:0030-drops-89424}, doi = {10.4230/LIPIcs.SEA.2018.7}, annote = {Keywords: Non-prefix-free codes, selective encryption, massive data security, multimedia data security, high-entropy data security, source coding, security in resource-limited environments} }
Frances Cooper and David Manlove. A 3/2-Approximation Algorithm for the Student-Project Allocation Problem. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 8:1-8:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{cooper_et_al:LIPIcs.SEA.2018.8, author = {Cooper, Frances and Manlove, David}, title = {{A 3/2-Approximation Algorithm for the Student-Project Allocation Problem}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {8:1--8:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.8}, URN = {urn:nbn:de:0030-drops-89439}, doi = {10.4230/LIPIcs.SEA.2018.8}, annote = {Keywords: Matching problems, Approximation, Algorithms, Stability} }
Krishnapriya A M, Meghana Nasre, Prajakta Nimbhorkar, and Amit Rawat. How Good Are Popular Matchings?. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{am_et_al:LIPIcs.SEA.2018.9, author = {A M, Krishnapriya and Nasre, Meghana and Nimbhorkar, Prajakta and Rawat, Amit}, title = {{How Good Are Popular Matchings?}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {9:1--9:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.9}, URN = {urn:nbn:de:0030-drops-89440}, doi = {10.4230/LIPIcs.SEA.2018.9}, annote = {Keywords: bipartite graphs, hospital residents, lower-quotas, popular matchings} }
Katerina Altmanová, Dusan Knop, and Martin Koutecký. Evaluating and Tuning n-fold Integer Programming. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{altmanova_et_al:LIPIcs.SEA.2018.10, author = {Altmanov\'{a}, Katerina and Knop, Dusan and Kouteck\'{y}, Martin}, title = {{Evaluating and Tuning n-fold Integer Programming}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.10}, URN = {urn:nbn:de:0030-drops-89454}, doi = {10.4230/LIPIcs.SEA.2018.10}, annote = {Keywords: n-fold integer programming, integer programming, analysis of algorithms, primal heuristic, local search} }
Michael Bastubbe, Marco E. Lübbecke, and Jonas T. Witt. A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 11:1-11:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bastubbe_et_al:LIPIcs.SEA.2018.11, author = {Bastubbe, Michael and L\"{u}bbecke, Marco E. and Witt, Jonas T.}, title = {{A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {11:1--11:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.11}, URN = {urn:nbn:de:0030-drops-89464}, doi = {10.4230/LIPIcs.SEA.2018.11}, annote = {Keywords: Dantzig-Wolfe reformulation, strength of reformulations, Lagrangean relaxation, partial convexification, column generation, hierarchy of relaxations} }
Krzysztof Kiljan and Marcin Pilipczuk. Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 12:1-12:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kiljan_et_al:LIPIcs.SEA.2018.12, author = {Kiljan, Krzysztof and Pilipczuk, Marcin}, title = {{Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {12:1--12:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.12}, URN = {urn:nbn:de:0030-drops-89477}, doi = {10.4230/LIPIcs.SEA.2018.12}, annote = {Keywords: Empirical Evaluation of Algorithms, Feedback Vertex Set} }
Kazuya Haraguchi. An Efficient Local Search for the Minimum Independent Dominating Set Problem. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 13:1-13:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{haraguchi:LIPIcs.SEA.2018.13, author = {Haraguchi, Kazuya}, title = {{An Efficient Local Search for the Minimum Independent Dominating Set Problem}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {13:1--13:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.13}, URN = {urn:nbn:de:0030-drops-89484}, doi = {10.4230/LIPIcs.SEA.2018.13}, annote = {Keywords: Minimum independent dominating set problem, local search, plateau search, metaheuristics} }
Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, and Sebastian Siebertz. Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 14:1-14:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{nadara_et_al:LIPIcs.SEA.2018.14, author = {Nadara, Wojciech and Pilipczuk, Marcin and Rabinovich, Roman and Reidl, Felix and Siebertz, Sebastian}, title = {{Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {14:1--14:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.14}, URN = {urn:nbn:de:0030-drops-89493}, doi = {10.4230/LIPIcs.SEA.2018.14}, annote = {Keywords: Empirical Evaluation of Algorithms, Sparse Graph Classes, Generalized Coloring Numbers, Uniform Quasi-Wideness} }
Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen G. Kobourov, Richard Spence, Joseph Watkins, and Alexander Wolff. Multi-Level Steiner Trees. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 15:1-15:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{ahmed_et_al:LIPIcs.SEA.2018.15, author = {Ahmed, Reyan and Angelini, Patrizio and Sahneh, Faryad Darabi and Efrat, Alon and Glickenstein, David and Gronemann, Martin and Heinsohn, Niklas and Kobourov, Stephen G. and Spence, Richard and Watkins, Joseph and Wolff, Alexander}, title = {{Multi-Level Steiner Trees}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {15:1--15:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.15}, URN = {urn:nbn:de:0030-drops-89506}, doi = {10.4230/LIPIcs.SEA.2018.15}, annote = {Keywords: Approximation algorithm, Steiner tree, multi-level graph representation} }
Solon P. Pissis and Ahmad Retha. Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 16:1-16:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{pissis_et_al:LIPIcs.SEA.2018.16, author = {Pissis, Solon P. and Retha, Ahmad}, title = {{Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {16:1--16:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.16}, URN = {urn:nbn:de:0030-drops-89515}, doi = {10.4230/LIPIcs.SEA.2018.16}, annote = {Keywords: on-line algorithms, algorithms on strings, dictionary matching, elastic-degenerate string, Variant Call Format} }
Djamal Belazzougui, Fabio Cunial, and Olgert Denas. Fast matching statistics in small space. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 17:1-17:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{belazzougui_et_al:LIPIcs.SEA.2018.17, author = {Belazzougui, Djamal and Cunial, Fabio and Denas, Olgert}, title = {{Fast matching statistics in small space}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {17:1--17:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.17}, URN = {urn:nbn:de:0030-drops-89528}, doi = {10.4230/LIPIcs.SEA.2018.17}, annote = {Keywords: Matching statistics, maximal repeat, Burrows-Wheeler transform, wavelet tree, suffix tree topology} }
Bastien Cazaux, Samuel Juhel, and Eric Rivals. Practical lower and upper bounds for the Shortest Linear Superstring. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{cazaux_et_al:LIPIcs.SEA.2018.18, author = {Cazaux, Bastien and Juhel, Samuel and Rivals, Eric}, title = {{Practical lower and upper bounds for the Shortest Linear Superstring}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.18}, URN = {urn:nbn:de:0030-drops-89530}, doi = {10.4230/LIPIcs.SEA.2018.18}, annote = {Keywords: greedy, approximation, overlap, Concat-Cycles, cyclic cover, linear time, text compression} }
Jean-François Baffier, Yago Diez, and Matias Korman. Experimental Study of Compressed Stack Algorithms in Limited Memory Environments. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 19:1-19:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{baffier_et_al:LIPIcs.SEA.2018.19, author = {Baffier, Jean-Fran\c{c}ois and Diez, Yago and Korman, Matias}, title = {{Experimental Study of Compressed Stack Algorithms in Limited Memory Environments}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {19:1--19:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.19}, URN = {urn:nbn:de:0030-drops-89549}, doi = {10.4230/LIPIcs.SEA.2018.19}, annote = {Keywords: Stack algorithms, time-space trade-off, convex hull, implementation} }
Martin Wilhelm. Restructuring Expression Dags for Efficient Parallelization. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 20:1-20:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{wilhelm:LIPIcs.SEA.2018.20, author = {Wilhelm, Martin}, title = {{Restructuring Expression Dags for Efficient Parallelization}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {20:1--20:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.20}, URN = {urn:nbn:de:0030-drops-89551}, doi = {10.4230/LIPIcs.SEA.2018.20}, annote = {Keywords: exact computation, expression dag, parallel evaluation, restructuring} }
Yu Nakahata, Jun Kawahara, and Shoji Kasahara. Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 21:1-21:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{nakahata_et_al:LIPIcs.SEA.2018.21, author = {Nakahata, Yu and Kawahara, Jun and Kasahara, Shoji}, title = {{Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {21:1--21:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.21}, URN = {urn:nbn:de:0030-drops-89560}, doi = {10.4230/LIPIcs.SEA.2018.21}, annote = {Keywords: Graph algorithm, Graph partitioning, Decision diagram, Frontier-based search, Enumeration problem} }
Markus Chimani, Ivo Hedtke, and Tilo Wiedera. Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 22:1-22:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chimani_et_al:LIPIcs.SEA.2018.22, author = {Chimani, Markus and Hedtke, Ivo and Wiedera, Tilo}, title = {{Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {22:1--22:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.22}, URN = {urn:nbn:de:0030-drops-89572}, doi = {10.4230/LIPIcs.SEA.2018.22}, annote = {Keywords: maximum planar subgraph, integer linear programming, pseudo boolean satisfiability, graph drawing, algorithm engineering} }
Shixun Huang, Zhifeng Bao, J. Shane Culpepper, Ping Zhang, and Bang Zhang. A Linear-Time Algorithm for Finding Induced Planar Subgraphs. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 23:1-23:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{huang_et_al:LIPIcs.SEA.2018.23, author = {Huang, Shixun and Bao, Zhifeng and Culpepper, J. Shane and Zhang, Ping and Zhang, Bang}, title = {{A Linear-Time Algorithm for Finding Induced Planar Subgraphs}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {23:1--23:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.23}, URN = {urn:nbn:de:0030-drops-89589}, doi = {10.4230/LIPIcs.SEA.2018.23}, annote = {Keywords: induced planar subgraphs, experimental analysis} }
Luca Castelli Aleardi, Gaspard Denis, and Éric Fusy. Fast Spherical Drawing of Triangulations: An Experimental Study of Graph Drawing Tools. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 24:1-24:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{aleardi_et_al:LIPIcs.SEA.2018.24, author = {Aleardi, Luca Castelli and Denis, Gaspard and Fusy, \'{E}ric}, title = {{Fast Spherical Drawing of Triangulations: An Experimental Study of Graph Drawing Tools}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {24:1--24:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.24}, URN = {urn:nbn:de:0030-drops-89597}, doi = {10.4230/LIPIcs.SEA.2018.24}, annote = {Keywords: Graph drawing, planar triangulations, spherical parameterizations} }
Sahar Bsaybes, Alain Quilliot, and Annegret K. Wagler. Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 25:1-25:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bsaybes_et_al:LIPIcs.SEA.2018.25, author = {Bsaybes, Sahar and Quilliot, Alain and Wagler, Annegret K.}, title = {{Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.25}, URN = {urn:nbn:de:0030-drops-89600}, doi = {10.4230/LIPIcs.SEA.2018.25}, annote = {Keywords: fleet management, offline and online pickup and delivery problem, multicommodity flows} }
Vinicius N. G. Pereira, Mário César San Felice, Pedro Henrique D. B. Hokama, and Eduardo C. Xavier. The Steiner Multi Cycle Problem with Applications to a Collaborative Truckload Problem. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 26:1-26:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{pereira_et_al:LIPIcs.SEA.2018.26, author = {Pereira, Vinicius N. G. and San Felice, M\'{a}rio C\'{e}sar and Hokama, Pedro Henrique D. B. and Xavier, Eduardo C.}, title = {{The Steiner Multi Cycle Problem with Applications to a Collaborative Truckload Problem}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {26:1--26:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.26}, URN = {urn:nbn:de:0030-drops-89617}, doi = {10.4230/LIPIcs.SEA.2018.26}, annote = {Keywords: Steiner Cycle, Routing, Pickup-and-Delivery, Less-than-Truckload} }
Valentin Buchhold, Peter Sanders, and Dorothea Wagner. Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 27:1-27:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{buchhold_et_al:LIPIcs.SEA.2018.27, author = {Buchhold, Valentin and Sanders, Peter and Wagner, Dorothea}, title = {{Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {27:1--27:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.27}, URN = {urn:nbn:de:0030-drops-89623}, doi = {10.4230/LIPIcs.SEA.2018.27}, annote = {Keywords: traffic assignment, equilibrium flow pattern, customizable contraction hierarchies, batched shortest paths} }
Petteri Kaski, Juho Lauri, and Suhas Thejaswi. Engineering Motif Search for Large Motifs. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 28:1-28:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kaski_et_al:LIPIcs.SEA.2018.28, author = {Kaski, Petteri and Lauri, Juho and Thejaswi, Suhas}, title = {{Engineering Motif Search for Large Motifs}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {28:1--28:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.28}, URN = {urn:nbn:de:0030-drops-89631}, doi = {10.4230/LIPIcs.SEA.2018.28}, annote = {Keywords: algorithm engineering, constrained multilinear sieving, graph motif problem, multi-GPU, vector-parallel, vertex-localization} }
Michal Ziobro and Marcin Pilipczuk. Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 29:1-29:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{ziobro_et_al:LIPIcs.SEA.2018.29, author = {Ziobro, Michal and Pilipczuk, Marcin}, title = {{Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {29:1--29:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.29}, URN = {urn:nbn:de:0030-drops-89648}, doi = {10.4230/LIPIcs.SEA.2018.29}, annote = {Keywords: Empirical Evaluation of Algorithms, Treewidth, Hamiltonian Cycle} }
Adolfo Piperno. Isomorphism Test for Digraphs with Weighted Edges. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 30:1-30:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{piperno:LIPIcs.SEA.2018.30, author = {Piperno, Adolfo}, title = {{Isomorphism Test for Digraphs with Weighted Edges}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {30:1--30:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.30}, URN = {urn:nbn:de:0030-drops-89659}, doi = {10.4230/LIPIcs.SEA.2018.30}, annote = {Keywords: Practical Graph Isomorphism, Weighted Directed Graphs, Partition Refinement} }
Feedback for Dagstuhl Publishing