default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 25 matches
- 2021
- Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
Multi-Level Weighted Additive Spanners. SEA 2021: 16:1-16:23 - Ernst Althaus, Daniela Schnurbusch, Julian Wüschner, Sarah Ziegler:
On Tamaki's Algorithm to Compute Treewidths. SEA 2021: 9:1-9:18 - Emmanuel Arrighi, Mateus de Oliveira Oliveira:
Three Is Enough for Steiner Trees. SEA 2021: 5:1-5:15 - Mark Blacher, Joachim Giesen, Lars Kuehne:
Fast and Robust Vectorized In-Place Sorting of Primitive Types. SEA 2021: 3:1-3:16 - Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann:
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. SEA 2021: 22:1-22:18 - Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, Hung Tran:
An Experimental Study of External Memory Algorithms for Connected Components. SEA 2021: 23:1-23:23 - Valentin Buchhold, Dorothea Wagner:
Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications. SEA 2021: 18:1-18:18 - Kevin Buchin, Sándor P. Fekete, Alexander Hill, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs:
Minimum Scan Cover and Variants - Theory and Experiments. SEA 2021: 4:1-4:16 - Marco Calamai, Pierluigi Crescenzi, Andrea Marino:
On Computing the Diameter of (Weighted) Link Streams. SEA 2021: 11:1-11:21 - Frédéric Cazals, Bernard Delmas, Timothée O'Donnell:
Fréchet Mean and p-Mean on the Unit Circle: Decidability, Algorithm, and Applications to Clustering on the Flat Torus. SEA 2021: 15:1-15:16 - Samantha Chen, Yusu Wang:
Approximation Algorithms for 1-Wasserstein Distance Between Persistence Diagrams. SEA 2021: 14:1-14:19 - Patrick Dinklage, Johannes Fischer, Alexander Herlez:
Engineering Predecessor Data Structures for Dynamic Integer Sets. SEA 2021: 7:1-7:19 - Max Franck, Sorrachai Yingchareonthawornchai:
Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity. SEA 2021: 1:1-1:18 - Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice. SEA 2021: 20:1-20:19 - Coline Gianfrotta, Vladimir Reinharz, Dominique Barth, Alain Denise:
A Graph-Based Similarity Approach to Classify Recurrent Complex Motifs from Their Context in RNA Structures. SEA 2021: 19:1-19:18 - Kathrin Hanauer, Christian Schulz, Jonathan Trummer:
O'Reach: Even Faster Reachability in Large Graphs. SEA 2021: 13:1-13:24 - Miki Hermann:
How to Find the Exit from a 3-Dimensional Maze. SEA 2021: 21:1-21:12 - Demian Hespe, Sebastian Lamm, Christian Schorr:
Targeted Branching for the Maximum Independent Set Problem. SEA 2021: 17:1-17:21 - Tobias Heuer, Nikolai Maas, Sebastian Schlag:
Multilevel Hypergraph Partitioning with Vertex Weights Revisited. SEA 2021: 8:1-8:20 - Louisa Ruixue Huang, Jessica Shi, Julian Shun:
Parallel Five-Cycle Counting Algorithms. SEA 2021: 2:1-2:18 - Seungbum Jo, Wooyoung Park, Srinivasa Rao Satti:
Practical Implementation of Encoding Range Top-2 Queries. SEA 2021: 10:1-10:13 - Simon J. Puglisi, Bella Zhukova:
Document Retrieval Hacks. SEA 2021: 12:1-12:12 - Ben Strasser, Tim Zeitz:
A Fast and Tight Heuristic for A* in Road Networks. SEA 2021: 6:1-6:16 - Front Matter, Table of Contents, Preface, Conference Organization. SEA 2021: 0:1-0:12
- David Coudert, Emanuele Natale:
19th International Symposium on Experimental Algorithms, SEA 2021, June 7-9, 2021, Nice, France. LIPIcs 190, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-185-6 [contents]
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-02 13:12 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint