Christian Schulz and Bora Uçar. LIPIcs, Volume 233, SEA 2022, Complete Volume. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 1-434, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@Proceedings{schulz_et_al:LIPIcs.SEA.2022, title = {{LIPIcs, Volume 233, SEA 2022, Complete Volume}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {1--434}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022}, URN = {urn:nbn:de:0030-drops-165331}, doi = {10.4230/LIPIcs.SEA.2022}, annote = {Keywords: LIPIcs, Volume 233, SEA 2022, Complete Volume} }
Christian Schulz and Bora Uçar. Front Matter, Table of Contents, Preface, Conference Organization. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 0:i-0:xii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{schulz_et_al:LIPIcs.SEA.2022.0, author = {Schulz, Christian and U\c{c}ar, Bora}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {0:i--0:xii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.0}, URN = {urn:nbn:de:0030-drops-165342}, doi = {10.4230/LIPIcs.SEA.2022.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Dorota Celińska-Kopczyńska and Eryk Kopczyński. Discrete Hyperbolic Random Graph Model. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 1:1-1:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{celinskakopczynska_et_al:LIPIcs.SEA.2022.1, author = {Celi\'{n}ska-Kopczy\'{n}ska, Dorota and Kopczy\'{n}ski, Eryk}, title = {{Discrete Hyperbolic Random Graph Model}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {1:1--1:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.1}, URN = {urn:nbn:de:0030-drops-165356}, doi = {10.4230/LIPIcs.SEA.2022.1}, annote = {Keywords: hyperbolic geometry, scale-free networks, routing, tessellation} }
Masakazu Ishihata and Fumiya Tokumasu. Solving and Generating Nagareru Puzzles. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 2:1-2:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{ishihata_et_al:LIPIcs.SEA.2022.2, author = {Ishihata, Masakazu and Tokumasu, Fumiya}, title = {{Solving and Generating Nagareru Puzzles}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {2:1--2:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.2}, URN = {urn:nbn:de:0030-drops-165366}, doi = {10.4230/LIPIcs.SEA.2022.2}, annote = {Keywords: Paper-and-pencil puzzle, SAT, CSP, ZDD} }
Tim Zeitz. Fast Computation of Shortest Smooth Paths and Uniformly Bounded Stretch with Lazy RPHAST. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 3:1-3:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{zeitz:LIPIcs.SEA.2022.3, author = {Zeitz, Tim}, title = {{Fast Computation of Shortest Smooth Paths and Uniformly Bounded Stretch with Lazy RPHAST}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {3:1--3:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.3}, URN = {urn:nbn:de:0030-drops-165378}, doi = {10.4230/LIPIcs.SEA.2022.3}, annote = {Keywords: realistic road networks, route planning, shortest paths, traffic-aware routing, live traffic, uniformly bounded stretch} }
Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, and Stefan Walzer. Fast Succinct Retrieval and Approximate Membership Using Ribbon. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 4:1-4:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{dillinger_et_al:LIPIcs.SEA.2022.4, author = {Dillinger, Peter C. and H\"{u}bschle-Schneider, Lorenz and Sanders, Peter and Walzer, Stefan}, title = {{Fast Succinct Retrieval and Approximate Membership Using Ribbon}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {4:1--4:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.4}, URN = {urn:nbn:de:0030-drops-165385}, doi = {10.4230/LIPIcs.SEA.2022.4}, annote = {Keywords: AMQ, Bloom filter, dictionary, linear algebra, randomized algorithm, retrieval data structure, static function data structure, succinct data structure, perfect hashing} }
Lars Gottesbüren, Tobias Heuer, and Peter Sanders. Parallel Flow-Based Hypergraph Partitioning. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 5:1-5:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{gottesburen_et_al:LIPIcs.SEA.2022.5, author = {Gottesb\"{u}ren, Lars and Heuer, Tobias and Sanders, Peter}, title = {{Parallel Flow-Based Hypergraph Partitioning}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {5:1--5:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.5}, URN = {urn:nbn:de:0030-drops-165393}, doi = {10.4230/LIPIcs.SEA.2022.5}, annote = {Keywords: multilevel hypergraph partitioning, shared-memory algorithms, maximum flow} }
Darko Drakulic, Christelle Loiodice, and Vassilissa Lehoux. Routing in Multimodal Transportation Networks with Non-Scheduled Lines. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 6:1-6:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{drakulic_et_al:LIPIcs.SEA.2022.6, author = {Drakulic, Darko and Loiodice, Christelle and Lehoux, Vassilissa}, title = {{Routing in Multimodal Transportation Networks with Non-Scheduled Lines}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {6:1--6:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.6}, URN = {urn:nbn:de:0030-drops-165406}, doi = {10.4230/LIPIcs.SEA.2022.6}, annote = {Keywords: Multimodal routing, on-demand public transportation, bicriteria shortest paths} }
Maria J. Blesa, Mihail Eduard Popa, and Maria Serna. Relating Real and Synthetic Social Networks Through Centrality Measures. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 7:1-7:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{blesa_et_al:LIPIcs.SEA.2022.7, author = {Blesa, Maria J. and Popa, Mihail Eduard and Serna, Maria}, title = {{Relating Real and Synthetic Social Networks Through Centrality Measures}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {7:1--7:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.7}, URN = {urn:nbn:de:0030-drops-165410}, doi = {10.4230/LIPIcs.SEA.2022.7}, annote = {Keywords: centrality measures, influence spread models, synthetic social networks} }
Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, and Manuel Penschuck. Efficient and Accurate Group Testing via Belief Propagation: An Empirical Study. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 8:1-8:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{cojaoghlan_et_al:LIPIcs.SEA.2022.8, author = {Coja-Oghlan, Amin and Hahn-Klimroth, Max and Loick, Philipp and Penschuck, Manuel}, title = {{Efficient and Accurate Group Testing via Belief Propagation: An Empirical Study}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {8:1--8:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.8}, URN = {urn:nbn:de:0030-drops-165422}, doi = {10.4230/LIPIcs.SEA.2022.8}, annote = {Keywords: Group testing, Probabilistic Construction, Belief Propagation, Simulation} }
Ramtin Afshar, Michael T. Goodrich, and Evrim Ozel. Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 9:1-9:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{afshar_et_al:LIPIcs.SEA.2022.9, author = {Afshar, Ramtin and Goodrich, Michael T. and Ozel, Evrim}, title = {{Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {9:1--9:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.9}, URN = {urn:nbn:de:0030-drops-165432}, doi = {10.4230/LIPIcs.SEA.2022.9}, annote = {Keywords: Road Networks, Exact Learning, Graph Reconstruction, Randomized Algorithms} }
Nico Bertram, Jonas Ellert, and Johannes Fischer. A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 10:1-10:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bertram_et_al:LIPIcs.SEA.2022.10, author = {Bertram, Nico and Ellert, Jonas and Fischer, Johannes}, title = {{A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.10}, URN = {urn:nbn:de:0030-drops-165441}, doi = {10.4230/LIPIcs.SEA.2022.10}, annote = {Keywords: maximum directed cut, graph partitioning, algorithm engineering, approximation, parallel algorithms} }
Alexander van der Grinten, Maria Predari, and Florian Willich. A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency Blocks. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 11:1-11:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{vandergrinten_et_al:LIPIcs.SEA.2022.11, author = {van der Grinten, Alexander and Predari, Maria and Willich, Florian}, title = {{A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency Blocks}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {11:1--11:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.11}, URN = {urn:nbn:de:0030-drops-165453}, doi = {10.4230/LIPIcs.SEA.2022.11}, annote = {Keywords: dynamic graph data structures, sparse matrix layout, dynamic algorithms, parallel algorithms, graph analysis} }
Kenneth Langedal, Johannes Langguth, Fredrik Manne, and Daniel Thilo Schroeder. Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural Networks. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 12:1-12:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{langedal_et_al:LIPIcs.SEA.2022.12, author = {Langedal, Kenneth and Langguth, Johannes and Manne, Fredrik and Schroeder, Daniel Thilo}, title = {{Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural Networks}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.12}, URN = {urn:nbn:de:0030-drops-165462}, doi = {10.4230/LIPIcs.SEA.2022.12}, annote = {Keywords: Minimum weighted vertex cover, Maximum weighted independent set, Graph neural networks, Reducing-peeling} }
Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, and Marcus Wilhelm. A Branch-And-Bound Algorithm for Cluster Editing. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 13:1-13:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{blasius_et_al:LIPIcs.SEA.2022.13, author = {Bl\"{a}sius, Thomas and Fischbeck, Philipp and Gottesb\"{u}ren, Lars and Hamann, Michael and Heuer, Tobias and Spinner, Jonas and Weyand, Christopher and Wilhelm, Marcus}, title = {{A Branch-And-Bound Algorithm for Cluster Editing}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {13:1--13:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.13}, URN = {urn:nbn:de:0030-drops-165473}, doi = {10.4230/LIPIcs.SEA.2022.13}, annote = {Keywords: cluster editing} }
Loukas Georgiadis, Dionysios Kefallinos, Anna Mpanti, and Stavros D. Nikolopoulos. An Experimental Study of Algorithms for Packing Arborescences. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 14:1-14:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{georgiadis_et_al:LIPIcs.SEA.2022.14, author = {Georgiadis, Loukas and Kefallinos, Dionysios and Mpanti, Anna and Nikolopoulos, Stavros D.}, title = {{An Experimental Study of Algorithms for Packing Arborescences}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {14:1--14:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.14}, URN = {urn:nbn:de:0030-drops-165480}, doi = {10.4230/LIPIcs.SEA.2022.14}, annote = {Keywords: Arborescences, Edge Connectivity, Graph Algorithms} }
Payas Rajan and Chinya V. Ravishankar. Stochastic Route Planning for Electric Vehicles. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 15:1-15:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{rajan_et_al:LIPIcs.SEA.2022.15, author = {Rajan, Payas and Ravishankar, Chinya V.}, title = {{Stochastic Route Planning for Electric Vehicles}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {15:1--15:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.15}, URN = {urn:nbn:de:0030-drops-165497}, doi = {10.4230/LIPIcs.SEA.2022.15}, annote = {Keywords: Stochastic Routing, Electric Vehicles, Route Planning Algorithms} }
Nathaniel K. Brown, Travis Gagie, and Massimiliano Rossi. RLBWT Tricks. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 16:1-16:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{brown_et_al:LIPIcs.SEA.2022.16, author = {Brown, Nathaniel K. and Gagie, Travis and Rossi, Massimiliano}, title = {{RLBWT Tricks}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {16:1--16:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.16}, URN = {urn:nbn:de:0030-drops-165500}, doi = {10.4230/LIPIcs.SEA.2022.16}, annote = {Keywords: Compressed String Indexes, Repetitive Text Collections, Burrows-Wheeler Transform} }
Hisao Tamaki. Heuristic Computation of Exact Treewidth. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 17:1-17:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{tamaki:LIPIcs.SEA.2022.17, author = {Tamaki, Hisao}, title = {{Heuristic Computation of Exact Treewidth}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {17:1--17:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.17}, URN = {urn:nbn:de:0030-drops-165512}, doi = {10.4230/LIPIcs.SEA.2022.17}, annote = {Keywords: graph algorithm, treewidth, heuristics, BT dynamic programming, contraction, obstruction, minimal forbidden minor, certifying algorithms} }
Vasily Alferov and Mateus de Oliveira Oliveira. On the Satisfiability of Smooth Grid CSPs. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 18:1-18:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{alferov_et_al:LIPIcs.SEA.2022.18, author = {Alferov, Vasily and de Oliveira Oliveira, Mateus}, title = {{On the Satisfiability of Smooth Grid CSPs}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.18}, URN = {urn:nbn:de:0030-drops-165526}, doi = {10.4230/LIPIcs.SEA.2022.18}, annote = {Keywords: Grid CSPs, Smoothness, SAT Solving, Linear Programming} }
Renee Mirka and David P. Williamson. An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 19:1-19:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{mirka_et_al:LIPIcs.SEA.2022.19, author = {Mirka, Renee and Williamson, David P.}, title = {{An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.19}, URN = {urn:nbn:de:0030-drops-165533}, doi = {10.4230/LIPIcs.SEA.2022.19}, annote = {Keywords: Max Cut, Approximation Algorithms} }
Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, and Gianpiero Monaco. Digraph k-Coloring Games: From Theory to Practice. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 20:1-20:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{dascenzo_et_al:LIPIcs.SEA.2022.20, author = {D'Ascenzo, Andrea and D'Emidio, Mattia and Flammini, Michele and Monaco, Gianpiero}, title = {{Digraph k-Coloring Games: From Theory to Practice}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {20:1--20:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.20}, URN = {urn:nbn:de:0030-drops-165540}, doi = {10.4230/LIPIcs.SEA.2022.20}, annote = {Keywords: Algorithmic Game Theory, Coloring Games, Experimental Algorithmics, Exact vs Approximate Nash Equilibria, Decentralized Dynamics} }
Leo Liberti, Benedetto Manca, and Pierre-Louis Poirion. Practical Performance of Random Projections in Linear Programming. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 21:1-21:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{liberti_et_al:LIPIcs.SEA.2022.21, author = {Liberti, Leo and Manca, Benedetto and Poirion, Pierre-Louis}, title = {{Practical Performance of Random Projections in Linear Programming}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {21:1--21:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.21}, URN = {urn:nbn:de:0030-drops-165550}, doi = {10.4230/LIPIcs.SEA.2022.21}, annote = {Keywords: Linear Programming, Johnson-Lindenstrauss Lemma, Computational testing} }
Sara Giuliani, Giuseppe Romana, and Massimiliano Rossi. Computing Maximal Unique Matches with the r-Index. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 22:1-22:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{giuliani_et_al:LIPIcs.SEA.2022.22, author = {Giuliani, Sara and Romana, Giuseppe and Rossi, Massimiliano}, title = {{Computing Maximal Unique Matches with the r-Index}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.22}, URN = {urn:nbn:de:0030-drops-165568}, doi = {10.4230/LIPIcs.SEA.2022.22}, annote = {Keywords: Burrows-Wheeler Transform, r-index, maximal unique matches, bioinformatics, pangenomics} }
Meenarli Sharma and Ashutosh Mahajan. Automatic Reformulations for Convex Mixed-Integer Nonlinear Optimization: Perspective and Separability. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 23:1-23:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{sharma_et_al:LIPIcs.SEA.2022.23, author = {Sharma, Meenarli and Mahajan, Ashutosh}, title = {{Automatic Reformulations for Convex Mixed-Integer Nonlinear Optimization: Perspective and Separability}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {23:1--23:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.23}, URN = {urn:nbn:de:0030-drops-165579}, doi = {10.4230/LIPIcs.SEA.2022.23}, annote = {Keywords: Convex MINLP, perspective reformulation, branch-and-bound, outer approximation, function separability} }
Akshay Gupte, Arie M. C. A. Koster, and Sascha Kuhnke. An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 24:1-24:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{gupte_et_al:LIPIcs.SEA.2022.24, author = {Gupte, Akshay and Koster, Arie M. C. A. and Kuhnke, Sascha}, title = {{An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {24:1--24:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.24}, URN = {urn:nbn:de:0030-drops-165585}, doi = {10.4230/LIPIcs.SEA.2022.24}, annote = {Keywords: Quadratically Constrained Quadratic Programs, Mixed Integer Linear Programming, Heuristics, BoxQP, Disjoint Bilinear} }
Feedback for Dagstuhl Publishing