Остановите войну!
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 35 matches
- 2011
- Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff:
An exact algorithm for connected red-blue dominating set. J. Discrete Algorithms 9(3): 252-262 (2011) - Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
On the number of shortest descending paths on the surface of a convex terrain. J. Discrete Algorithms 9(2): 182-189 (2011) - Stephan Dominique Andres, Winfried Hochstättler:
Some heuristics for the binary paint shop problem and their expected number of colour changes. J. Discrete Algorithms 9(2): 203-211 (2011) - Stanislav Angelov, Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen:
Missing pattern discovery. J. Discrete Algorithms 9(2): 153-165 (2011) - Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann:
Fast RNA structure alignment for crossing input structures. J. Discrete Algorithms 9(1): 2-11 (2011) - Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson:
Sparse RNA folding: Time and space efficient algorithms. J. Discrete Algorithms 9(1): 12-31 (2011) - Matthias Bernt, Kuan-Yu Chen, Ming-Chiang Chen, An-Chiang Chu, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf:
Finding all sorting tandem duplication random loss operations. J. Discrete Algorithms 9(1): 32-48 (2011) - Philip Bille:
Fast searching in packed strings. J. Discrete Algorithms 9(1): 49-56 (2011) - Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk:
Breaking the 2n-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9(3): 214-230 (2011) - Prosenjit Bose, Paz Carmi, Mathieu Couture:
Spanners of additively weighted point sets. J. Discrete Algorithms 9(3): 287-298 (2011) - Jérémie Bourdon, Irena Rusu:
Statistical properties of factor oracles. J. Discrete Algorithms 9(1): 57-66 (2011) - Leizhen Cai, Boting Yang:
Parameterized complexity of even/odd subgraph problems. J. Discrete Algorithms 9(3): 231-240 (2011) - Tiziana Calamoneri, Josep Díaz:
Editorial. J. Discrete Algorithms 9(3): 213 (2011) - Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong:
A linear size index for approximate pattern matching. J. Discrete Algorithms 9(4): 358-364 (2011) - Panagiotis Cheilaris, Géza Tóth:
Graph unique-maximum and conflict-free colorings. J. Discrete Algorithms 9(3): 241-251 (2011) - Raphaël Clifford, Benjamin Sach:
Pattern matching in pseudo real-time. J. Discrete Algorithms 9(1): 67-81 (2011) - Johnny David, Zeev Nutov:
Approximating survivable networks with β-metric costs. J. Discrete Algorithms 9(2): 170-175 (2011) - Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Complexity issues in vertex-colored graph pattern matching. J. Discrete Algorithms 9(1): 82-99 (2011) - Andrzej Ehrenfeucht, Ross M. McConnell, Nissa Osheim, Sung-Whan Woo:
Position heaps: A simple and dynamic text indexing data structure. J. Discrete Algorithms 9(1): 100-121 (2011) - Patricia A. Evans:
Finding common RNA pseudoknot structures in polynomial time. J. Discrete Algorithms 9(4): 335-343 (2011) - Geoffrey Exoo, Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon:
Computational determination of (3, 11) and (4, 7) cages. J. Discrete Algorithms 9(2): 166-169 (2011) - Gianni Franceschini, Torben Hagerup:
Finding the maximum suffix with fewer comparisons. J. Discrete Algorithms 9(3): 279-286 (2011) - Travis Gagie, Yakov Nekrich:
Tight bounds for online stable sorting. J. Discrete Algorithms 9(2): 176-181 (2011) - Christian Hundt, Maciej Liskiewicz:
New complexity bounds for image matching under rotation and scaling. J. Discrete Algorithms 9(1): 122-136 (2011) - Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Contracting planar graphs to contractions of triangulations. J. Discrete Algorithms 9(3): 299-306 (2011) - Carl Kingsford, Elena Zaslavsky, Mona Singh:
A cost-aggregating integer linear program for motif finding. J. Discrete Algorithms 9(4): 326-334 (2011) - Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring. J. Discrete Algorithms 9(1): 137-151 (2011) - Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen:
Approximation of RNA multiple structural alignment. J. Discrete Algorithms 9(4): 365-376 (2011) - Gregory Kucherov, Esko Ukkonen:
Editorial. J. Discrete Algorithms 9(1): 1 (2011) - Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel:
Faster algorithms for computing longest common increasing subsequences. J. Discrete Algorithms 9(4): 314-325 (2011)
skipping 5 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-30 18:46 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