Остановите войну!
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 711 matches
- 2018
- Jacqueline Banks, Scott Garrabrant, Mark L. Huber, Anne Perizzolo:
Using TPA to count linear extensions. J. Discrete Algorithms 51: 1-11 (2018) - Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
A separation between RLSLPs and LZ77. J. Discrete Algorithms 50: 36-39 (2018) - Sudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Space-efficient indexes for forbidden extension queries. J. Discrete Algorithms 50: 23-35 (2018) - Ljiljana Brankovic, Joe Ryan, William F. Smyth:
Editorial. J. Discrete Algorithms 52-53: 1 (2018) - Dario Catalano, Mario Di Raimondo, Simone Faro:
Verifiable pattern matching on outsourced texts. J. Discrete Algorithms 51: 39-50 (2018) - Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity dichotomies for the MinimumF-Overlay problem. J. Discrete Algorithms 52-53: 133-142 (2018) - Colin Cooper, Nicolás Rivera:
Threshold behaviour of discordant voting on the complete graph. J. Discrete Algorithms 50: 10-22 (2018) - Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Approximating the 3-period Incremental Knapsack Problem. J. Discrete Algorithms 52-53: 55-69 (2018) - Benoît Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Complexity and lowers bounds for Power Edge Set Problem. J. Discrete Algorithms 52-53: 70-91 (2018) - Matthias Gallé, Matías Tealdi:
xkcd-repeats: A new taxonomy of repeats defined by their context diversity. J. Discrete Algorithms 48: 1-16 (2018) - Hanyu Gu, Alexander V. Kononov, Julia Memar, Yakov Zinder:
Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. J. Discrete Algorithms 52-53: 143-155 (2018) - Ghada Ben Hassine, Pierre Bergé, Arpad Rimmel, Joanna Tomasik:
A lower bound for weak Schur numbers with a deterministic algorithm. J. Discrete Algorithms 51: 12-25 (2018) - Kunihiko Hiraishi, Koichi Kobayashi:
A pathfinding problem for search trees with unknown edge length. J. Discrete Algorithms 49: 1-7 (2018) - Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Algorithms and combinatorial properties on shortest unique palindromic substrings. J. Discrete Algorithms 52-53: 122-132 (2018) - Andrei Kelarev, Joe Ryan, Leanne Rylands, Jennifer Seberry, Xun Yi:
Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller. J. Discrete Algorithms 52-53: 112-121 (2018) - Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer:
Minimal sum labeling of graphs. J. Discrete Algorithms 52-53: 29-37 (2018) - Ritu Kundu, Manal Mohamed:
Editorial. J. Discrete Algorithms 50: 1 (2018) - Rhyd Lewis, Kate Smith-Miles:
A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems. J. Discrete Algorithms 52-53: 2-17 (2018) - Felipe A. Louza, William F. Smyth, Giovanni Manzini, Guilherme P. Telles:
Lyndon array construction during Burrows-Wheeler inversion. J. Discrete Algorithms 50: 2-9 (2018) - Sven Mallach:
Linear ordering based MIP formulations for the vertex separation or pathwidth problem. J. Discrete Algorithms 52-53: 156-167 (2018) - Alexandre Blondin Massé, Julien de Carufel, Alain Goupil:
Saturated fully leafed tree-like polyforms and polycubes. J. Discrete Algorithms 52-53: 38-54 (2018) - Ryan McIntyre, Michael Soltys:
An improved upper bound and algorithm for clique covers. J. Discrete Algorithms 48: 42-56 (2018) - Neerja Mhaskar, William F. Smyth:
String covering with optimal covers. J. Discrete Algorithms 51: 26-38 (2018) - Robin Milosz, Sylvie Hamel:
Exploring the median of permutations problem. J. Discrete Algorithms 52-53: 92-111 (2018) - Tatsuya Ohno, Kensuke Sakai, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
A faster implementation of online RLBWT and its application to LZ77 parsing. J. Discrete Algorithms 52-53: 18-28 (2018) - Léo Pelletier, Irena Rusu:
Common intervals and permutation reconstruction from MinMax-betweenness constraints. J. Discrete Algorithms 49: 8-26 (2018) - Seema Rani, Dharmveer Singh Rajpoot:
Improvised divide and conquer approach for the LIS problem. J. Discrete Algorithms 48: 17-26 (2018) - Cheol Ryu, Kunsoo Park:
Improved pattern-scan-order algorithms for string matching. J. Discrete Algorithms 49: 27-36 (2018) - Uwe Schauz:
Computing the list chromatic index of graphs. J. Discrete Algorithms 52-53: 182-191 (2018) - Narayan Vikas:
Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction. J. Discrete Algorithms 52-53: 168-181 (2018)
skipping 681 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-07-16 08:02 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