default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 455 matches
- 2024
- Olivier Bernard
, Pierre-Alain Fouque, Andrea Lesavourey:
Computing e-th roots in number fields. ALENEX 2024: 207-219 - Daniel Allendorf:
Maintaining Discrete Probability Distributions in Practice. ALENEX 2024: 182-193 - Gill Barequet, Gil Ben-Shachar:
Counting Polyominoes, Revisited. ALENEX 2024: 133-143 - Benjamin Aram Berendsohn:
Fast and simple unrooted dynamic forests. ALENEX 2024: 46-58 - Dominik Bez, Jonas Sauer:
Fast and Delay-Robust Multimodal Journey Planning. ALENEX 2024: 105-117 - Simon D. Fink, Ignaz Rutter:
Constrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm. ALENEX 2024: 1-14 - Emil Toftegaard Gæde, Inge Li Gørtz, Ivor van der Hoog, Christoffer Krogh, Eva Rotenberg:
Simple and Robust Dynamic Two-Dimensional Convex Hull. ALENEX 2024: 144-156 - Loukas Georgiadis, Evangelos Kosinas, Daniel Tsokaktsis:
2-Fault-Tolerant Strong Connectivity Oracles. ALENEX 2024: 91-104 - Kathrin Hanauer, Martin P. Seybold, Julian Unterweger:
Covering Rectilinear Polygons with Area-Weighted Rectangles. ALENEX 2024: 157-169 - Monika Henzinger, David Saulpic, Leonhard Sidl:
Experimental Evaluation of Fully Dynamic k-Means via Coresets. ALENEX 2024: 220-233 - Tobias Heuer:
A Direct k-Way Hypergraph Partitioning Algorithm for Optimizing the Steiner Tree Metric. ALENEX 2024: 15-31 - Dominik Krupke:
Near-Optimal Coverage Path Planning with Turn Costs. ALENEX 2024: 118-132 - Moritz Laupichler, Peter Sanders:
Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points. ALENEX 2024: 74-90 - Hans-Peter Lehmann, Peter Sanders, Stefan Walzer:
ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. ALENEX 2024: 194-206 - Nikolai Maas, Lars Gottesbüren, Daniel Seemaier:
Parallel Unconstrained Local Search for Partitioning Irregular Graphs. ALENEX 2024: 32-45 - Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun:
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. ALENEX 2024: 59-73 - Felix Weitbrecht:
Interactive Exploration of the Temporal α-Shape. ALENEX 2024: 170-181 - Rezaul Chowdhury, Solon P. Pissis:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2024, Alexandria, VA, USA, January 7-8, 2024. SIAM 2024, ISBN 978-1-61197-792-9 [contents] - 2023
- Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. ALENEX 2023: 65-76 - Ángel Javier Alonso, Michael Kerber, Siddharth Pritam:
Filtration-Domination in Bifiltered Graphs. ALENEX 2023: 27-38 - Timon Behr, Sabine Storandt:
Lossy Reduction Rules for the Directed Feedback Vertex Set Problem. ALENEX 2023: 53-64 - Maximilian Böther, Otto Kißig, Christopher Weyand:
Efficiently Computing Directed Minimum Spanning Trees. ALENEX 2023: 86-95 - Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Local Motif Clustering via (Hyper)Graph Partitioning. ALENEX 2023: 96-109 - Sándor P. Fekete, Dominik Krupke, Michael Perk, Christian Rieck, Christian Scheffer:
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours. ALENEX 2023: 1-14 - Shion Fukuzawa, Christopher Ho, Sandy Irani, Jasen Zion:
Modified Iterative Quantum Amplitude Estimation is Asymptotically Optimal. ALENEX 2023: 135-147 - William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild:
Multiway Powersort. ALENEX 2023: 190-200 - Aaron Hong, Massimiliano Rossi, Christina Boucher:
LZ77 via Prefix-Free Parsing. ALENEX 2023: 123-134 - Ivan Khomutovskiy, Rebekka Dunker, Jessica Dierking, Julian Egbert, Christian Helms, Finn Schöllkopf, Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Davis Issac, Simon Krogmann, Pascal Lenzner:
Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm. ALENEX 2023: 110-122 - Rafael Kiesel, André Schidler:
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets. ALENEX 2023: 39-52 - Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders:
PaCHash: Packed and Compressed Hash Tables. ALENEX 2023: 162-175
skipping 425 more matches
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-11-11 13:54 CET 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
