Остановите войну!
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 409 matches
- 2023
- Frederick Anderson, Anirban Ghosh, Matthew Graham, Lucas Mougeot, David Wisnosky:
Bounded-Degree Plane Geometric Spanners in Practice. ACM J. Exp. Algorithmics 28: 1:1-1:36 (2023) - Piotr Beling:
Fingerprinting-based Minimal Perfect Hashing Revisited. ACM J. Exp. Algorithmics 28: 1.4:1-1.4:16 (2023) - Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos:
A Practical Algorithm for Volume Estimation based on Billiard Trajectories and Simulated Annealing. ACM J. Exp. Algorithmics 28: 1.3:1-1.3:34 (2023) - José Alejandro Cornejo-Acosta, Jesus Garcia-Diaz, Julio César Pérez Sansalvador, Roger Z. Ríos-Mercado, Saúl Eduardo Pomares Hernández:
A Constructive Heuristic for the Uniform Capacitated Vertex k-center Problem. ACM J. Exp. Algorithmics 28: 1.6:1-1.6:26 (2023) - Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. ACM J. Exp. Algorithmics 28: 1.2:1-1.2:13 (2023) - Hu Ding, Wenjie Liu, Mingquan Ye:
A Data-dependent Approach for High-dimensional (Robust) Wasserstein Alignment. ACM J. Exp. Algorithmics 28: 1.8:1-1.8:32 (2023) - Darko Drakulic, Christelle Loiodice, Vassilissa Lehoux:
Routing in Multimodal Transportation Networks with Non-scheduled Lines. ACM J. Exp. Algorithmics 28: 2.3:1-2.3:16 (2023) - Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra:
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022. ACM J. Exp. Algorithmics 28: 1.9:1-1.9:13 (2023) - Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Experimental Comparison of PC-Trees and PQ-Trees. ACM J. Exp. Algorithmics 28: 1.10:1-1.10:24 (2023) - Rachel G. de Jong, Mark P. J. van der Loo, Frank W. Takes:
Algorithms for Efficiently Computing Structural Anonymity in Complex Networks. ACM J. Exp. Algorithmics 28: 1.7:1-1.7:22 (2023) - Leo Liberti, Benedetto Manca, Pierre-Louis Poirion:
Random Projections for Linear Programming: An Improved Retrieval Phase. ACM J. Exp. Algorithmics 28: 2.2:1-2.2:33 (2023) - Renee Mirka, David P. Williamson:
An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut. ACM J. Exp. Algorithmics 28: 2.1:1-2.1:18 (2023) - André Schidler, Stefan Szeider:
SAT-boosted Tabu Search for Coloring Massive Graphs. ACM J. Exp. Algorithmics 28: 1.5:1-1.5:19 (2023) - Ali Al Zoobi, David Coudert, Nicolas Nisse:
Finding the k Shortest Simple Paths: Time and Space Trade-offs. ACM J. Exp. Algorithmics 28: 1.11:1-1.11:23 (2023) - 2022
- Eugenio Angriman, Michal Boron, Henning Meyerhenke:
A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching. ACM J. Exp. Algorithmics 27: 1.6:1-1.6:41 (2022) - Jules Bertrand, Fanny Dufossé, Somesh Singh, Bora Uçar:
Algorithms and Data Structures for Hyperedge Queries. ACM J. Exp. Algorithmics 27: 1.13:1-1.13:23 (2022) - Sujoy Bhore, Guangping Li, Martin Nöllenburg:
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. ACM J. Exp. Algorithmics 27: 1.8:1-1.8:36 (2022) - Kevin Buchin, Alexander Hill, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs:
Minimum Scan Cover and Variants: Theory and Experiments. ACM J. Exp. Algorithmics 27: 4.5:1-4.5:28 (2022) - Marco Calamai, Pierluigi Crescenzi, Andrea Marino:
On Computing the Diameter of (Weighted) Link Streams. ACM J. Exp. Algorithmics 27: 4.3:1-4.3:28 (2022) - David Coudert, André Nusser, Laurent Viennot:
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation. ACM J. Exp. Algorithmics 27: 1.15:1-1.15:29 (2022) - Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Greedy and Local Search Heuristics to Build Area-Optimal Polygons. ACM J. Exp. Algorithmics 27: 2.2:1-2.2:11 (2022) - Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso:
Shadoks Approach to Low-Makespan Coordinated Motion Planning. ACM J. Exp. Algorithmics 27: 3.2:1-3.2:17 (2022) - Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Area-Optimal Simple Polygonalizations: The CG Challenge 2019. ACM J. Exp. Algorithmics 27: 2.4:1-2.4:12 (2022) - Günther Eder, Martin Held, Steinþór Jasonarson, Philipp Mayer, Peter Palfrader:
2-Opt Moves and Flips for Area-optimal Polygonizations. ACM J. Exp. Algorithmics 27: 2.7:1-2.7:12 (2022) - Marcelo Fonseca Faraj, Christian Schulz:
Buffered Streaming Graph Partitioning. ACM J. Exp. Algorithmics 27: 1.10:1-1.10:26 (2022) - Sándor P. Fekete, Andreas Haas, Phillip Keldenich, Michael Perk, Arne Schmidt:
Computing Area-Optimal Simple Polygonizations. ACM J. Exp. Algorithmics 27: 2.6:1-2.6:23 (2022) - Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Computing Coordinated Motion Plans for Robot Swarms: The CG: SHOP Challenge 2021. ACM J. Exp. Algorithmics 27: 3.1:1-3.1:12 (2022) - Max Franck, Sorrachai Yingchareonthawornchai:
Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity. ACM J. Exp. Algorithmics 27: 4.4:1-4.4:29 (2022) - Nir Goren, Efi Fogel, Dan Halperin:
Area Optimal Polygonization Using Simulated Annealing. ACM J. Exp. Algorithmics 27: 2.3:1-2.3:17 (2022) - Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus:
Incremental Updates of Generalized Hypertree Decompositions. ACM J. Exp. Algorithmics 27: 1.16:1-1.16:28 (2022)
skipping 379 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-05-14 22:13 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