Остановите войну!
for scientists:
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 437 matches
- 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 - Fabrice Lécuyer, Louis Jachiet, Clémence Magnien, Lionel Tabourier:
Tailored vertex ordering for faster triangle listing in large graphs. ALENEX 2023: 77-85 - Hans-Peter Lehmann, Peter Sanders, Stefan Walzer:
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. ALENEX 2023: 176-189 - Rajan Shankar, Jonathan Spreer:
A Uniform Sampling Procedure for Abstract Triangulations of Surfaces. ALENEX 2023: 15-26 - Florian Stober, Armin Weiß:
Lower Bounds for Sorting 16, 17, and 18 Elements. ALENEX 2023: 201-213 - Brian Wheatman, Randal C. Burns, Aydin Buluç, Helen Xu:
Optimizing Search Layouts in Packed Memory Arrays. ALENEX 2023: 148-161 - Gonzalo Navarro, Julian Shun:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023. SIAM 2023, ISBN 978-1-61197-756-1 [contents] - 2022
- Yifan Xu, Anchengcheng Zhou, Grace Q. Yin, Kunal Agrawal, I-Ting Angelina Lee, Tao B. Schardl:
Efficient Access History for Race Detection. ALENEX 2022: 117-130 - Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald:
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. ALENEX 2022: 27-40 - Daniel Bahrdt, Stefan Funke, Sokol Makolli, Claudius Proissl:
Distance Closures: Unifying Search- and Lookup-based Shortest Path Speedup Techniques. ALENEX 2022: 1-12 - Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder:
Load Balancing: The Long Road from Theory to Practice. ALENEX 2022: 104-116 - Emil Biju, Sundar Raman P.:
Perturbation Analysis of Practical Algorithms for the Maximum Scatter Travelling Salesman Problem. ALENEX 2022: 158-168 - Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand:
An Efficient Branch-and-Bound Solver for Hitting Set. ALENEX 2022: 209-220 - Guy E. Blelloch, Magdalen Dobson:
Parallel Nearest Neighbors in Low Dimensions with Batch Updates. ALENEX 2022: 195-208 - Jonas Charfreitag, Michael Jünger, Sven Mallach, Petra Mutzel:
McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems. ALENEX 2022: 54-66 - David Coudert, André Nusser, Laurent Viennot:
Computing Graph Hyperbolicity Using Dominating Sets. ALENEX 2022: 78-90 - Tamal K. Dey, Simon Zhang:
Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification. ALENEX 2022: 169-183 - Leszek Gasieniec, Benjamin Smith, Sebastian Wild:
Towards the 5/6-Density Conjecture of Pinwheel Scheduling. ALENEX 2022: 91-103 - Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Shared-Memory n-level Hypergraph Partitioning. ALENEX 2022: 131-144
skipping 407 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-06-13 02:52 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