Остановите войну!
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 3,466 matches
- 2024
- Oswin Aichholzer, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber:
Perfect Matchings with Crossings. Algorithmica 86(3): 697-716 (2024) - Youhei Akimoto:
Analysis of Surrogate-Assisted Information-Geometric Optimization Algorithms. Algorithmica 86(1): 33-63 (2024) - Shyan Akmal, Ce Jin:
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. Algorithmica 86(5): 1623-1656 (2024) - Andrew Alseth, Matthew J. Patitz:
The Need for Seed (in the Abstract Tile Assembly Model). Algorithmica 86(1): 218-280 (2024) - Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
Recognizing Map Graphs of Bounded Treewidth. Algorithmica 86(2): 613-637 (2024) - Denis Antipov, Maxim Buzdalov, Benjamin Doerr:
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution. Algorithmica 86(2): 442-484 (2024) - Stepan Artamonov, Maxim A. Babenko:
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. Algorithmica 86(3): 717-734 (2024) - Henry Bambury, Antoine Bultel, Benjamin Doerr:
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics. Algorithmica 86(1): 1-32 (2024) - Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi:
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica 86(3): 735-756 (2024) - Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz:
Token Sliding on Graphs of Girth Five. Algorithmica 86(2): 638-655 (2024) - Cristina Bazgan, Henning Fernau:
Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022. Algorithmica 86(3): 695-696 (2024) - Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant:
1-Extendability of Independent Sets. Algorithmica 86(3): 757-781 (2024) - Philip Bille, Inge Li Gørtz, Tord Stordalen:
Predecessor on the Ultra-Wide Word RAM. Algorithmica 86(5): 1578-1599 (2024) - Liad Blumrosen, Shahar Dobzinski:
Combinatorial Reallocation Mechanisms. Algorithmica 86(4): 1246-1262 (2024) - Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List Covering of Regular Multigraphs with Semi-edges. Algorithmica 86(3): 782-807 (2024) - Sergio Cabello, David Gajser:
Connectivity with Uncertainty Regions Given as Line Segments. Algorithmica 86(5): 1512-1544 (2024) - Jin-Yi Cai, Ashwin Maran:
Counting Cycles on Planar Graphs in Subexponential Time. Algorithmica 86(2): 656-693 (2024) - T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang:
Fully Dynamic k-Center Clustering with Outliers. Algorithmica 86(1): 171-193 (2024) - Julien Courtiel, Paul Dorbec, Romain Lecoq:
Theoretical Analysis of Git Bisect. Algorithmica 86(5): 1365-1399 (2024) - Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
Exploration of High-Dimensional Grids by Finite State Machines. Algorithmica 86(5): 1700-1729 (2024) - Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim:
Runtime Analysis for Permutation-based Evolutionary Algorithms. Algorithmica 86(1): 90-129 (2024) - Benjamin Doerr, Timo Kötzing:
Lower Bounds from Fitness Levels Made Easy. Algorithmica 86(2): 367-395 (2024) - Benjamin Doerr, Amirhossein Rajabi, Carsten Witt:
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. Algorithmica 86(1): 64-89 (2024) - Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki:
Computing Generalized Convolutions Faster Than Brute Force. Algorithmica 86(1): 334-366 (2024) - Mario Alejandro Hevia Fajardo, Dirk Sudholt:
Self-adjusting Population Sizes for Non-elitist Evolutionary Algorithms: Why Success Rates Matter. Algorithmica 86(2): 526-565 (2024) - Michal Feldman, Federico Fusco, Stefano Leonardi, Simon Mauras, Rebecca Reiffenhäuser:
Truthful Matching with Online Items and Offline Agents. Algorithmica 86(5): 1600-1622 (2024) - Moran Feldman, Ariel Szarf:
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model. Algorithmica 86(4): 1173-1209 (2024) - Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
A Meta-Theorem for Distributed Certification. Algorithmica 86(2): 585-612 (2024) - Ajinkya Gaikwad, Soumen Maity:
On Structural Parameterizations of the Harmless Set Problem. Algorithmica 86(5): 1475-1511 (2024) - Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. Algorithmica 86(5): 1428-1474 (2024)
skipping 3,436 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-17 17:49 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