default search action
20th SEA 2022: Heidelberg, Germany
- Christian Schulz, Bora Uçar:
20th International Symposium on Experimental Algorithms, SEA 2022, July 25-27, 2022, Heidelberg, Germany. LIPIcs 233, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-251-8 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:12
- Dorota Celinska-Kopczynska, Eryk Kopczynski:
Discrete Hyperbolic Random Graph Model. 1:1-1:19 - Masakazu Ishihata, Fumiya Tokumasu:
Solving and Generating Nagareru Puzzles. 2:1-2:17 - Tim Zeitz:
Fast Computation of Shortest Smooth Paths and Uniformly Bounded Stretch with Lazy RPHAST. 3:1-3:18 - Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer:
Fast Succinct Retrieval and Approximate Membership Using Ribbon. 4:1-4:20 - Lars Gottesbüren, Tobias Heuer, Peter Sanders:
Parallel Flow-Based Hypergraph Partitioning. 5:1-5:21 - Darko Drakulic, Christelle Loiodice, Vassilissa Lehoux:
Routing in Multimodal Transportation Networks with Non-Scheduled Lines. 6:1-6:15 - Maria J. Blesa, Mihail Eduard Popa, Maria J. Serna:
Relating Real and Synthetic Social Networks Through Centrality Measures. 7:1-7:21 - Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Manuel Penschuck:
Efficient and Accurate Group Testing via Belief Propagation: An Empirical Study. 8:1-8:18 - Ramtin Afshar, Michael T. Goodrich, Evrim Ozel:
Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees. 9:1-9:18 - Nico Bertram, Jonas Ellert, Johannes Fischer:
A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs. 10:1-10:15 - Alexander van der Grinten, Maria Predari, Florian Willich:
A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency Blocks. 11:1-11:18 - Kenneth Langedal, Johannes Langguth, Fredrik Manne, Daniel Thilo Schroeder:
Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural Networks. 12:1-12:17 - Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
A Branch-And-Bound Algorithm for Cluster Editing. 13:1-13:19 - Loukas Georgiadis, Dionysios Kefallinos, Anna Mpanti, Stavros D. Nikolopoulos:
An Experimental Study of Algorithms for Packing Arborescences. 14:1-14:16 - Payas Rajan, Chinya V. Ravishankar:
Stochastic Route Planning for Electric Vehicles. 15:1-15:17 - Nathaniel K. Brown, Travis Gagie, Massimiliano Rossi:
RLBWT Tricks. 16:1-16:16 - Hisao Tamaki:
Heuristic Computation of Exact Treewidth. 17:1-17:16 - Vasily Alferov, Mateus de Oliveira Oliveira:
On the Satisfiability of Smooth Grid CSPs. 18:1-18:14 - Renee Mirka, David P. Williamson:
An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut. 19:1-19:14 - Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco:
Digraph k-Coloring Games: From Theory to Practice. 20:1-20:18 - Leo Liberti, Benedetto Manca, Pierre-Louis Poirion:
Practical Performance of Random Projections in Linear Programming. 21:1-21:15 - Sara Giuliani, Giuseppe Romana, Massimiliano Rossi:
Computing Maximal Unique Matches with the r-Index. 22:1-22:16 - Meenarli Sharma, Ashutosh Mahajan:
Automatic Reformulations for Convex Mixed-Integer Nonlinear Optimization: Perspective and Separability. 23:1-23:20 - Akshay Gupte, Arie M. C. A. Koster, Sascha Kuhnke:
An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP. 24:1-24:14
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.