Остановите войну!
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 37 matches
- 2014
- Michael Hirsch, Shmuel T. Klein, Yair Toaff:
Improving deduplication techniques by accelerating remainder calculations. Discret. Appl. Math. 163: 307-315 (2014) - Abdullah Al-Azemi, Anton Betten, Dieter Betten:
Unital designs with blocking sets. Discret. Appl. Math. 163: 102-112 (2014) - Mais Alkhateeb, Anja Kohl:
Investigating the b-chromatic number of bipartite graphs by using the bicomplement. Discret. Appl. Math. 163: 113-126 (2014) - Claudia Archetti, Gianfranco Guastaroba, Maria Grazia Speranza:
An ILP-refined tabu search for the Directed Profitable Rural Postman Problem. Discret. Appl. Math. 163: 3-16 (2014) - Roberto Baldacci, Marco A. Boschetti, Maurizio Ganovelli, Vittorio Maniezzo:
Algorithms for nesting with defects. Discret. Appl. Math. 163: 17-33 (2014) - Harald Birkholz, Konrad Engel:
Partition into almost straight trails. Discret. Appl. Math. 163: 127-135 (2014) - Natashia Boland, Thomas Kalinowski, Hamish Waterer, Lanbo Zheng:
Scheduling arc maintenance jobs in a network to maximize total flow over time. Discret. Appl. Math. 163: 34-52 (2014) - Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender:
Preface. Discret. Appl. Math. 163: 101 (2014) - Johannes Bubenzer:
Cycle-aware minimization of acyclic deterministic finite-state automata. Discret. Appl. Math. 163: 238-246 (2014) - Valentina Cacchiani, Vera C. Hemmelmayr, Fabien Tricoire:
A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discret. Appl. Math. 163: 53-64 (2014) - Sonia Cafieri, Pierre Hansen, Leo Liberti:
Improving heuristics for network modularity maximization using an exact algorithm. Discret. Appl. Math. 163: 65-72 (2014) - Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Text searching allowing for inversions and translocations of factors. Discret. Appl. Math. 163: 247-257 (2014) - Marco Caserta, Stefan Voß:
A hybrid algorithm for the DNA sequencing problem. Discret. Appl. Math. 163: 87-99 (2014) - François Clautiaux, Mauro Dell'Amico, Manuel Iori, Ali Khanafer:
Lower and upper bounds for the Bin Packing Problem with Fragile Objects. Discret. Appl. Math. 163: 73-86 (2014) - Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen:
New simple efficient algorithms computing powers and runs in strings. Discret. Appl. Math. 163: 258-267 (2014) - Antoine Deza, Frantisek Franek:
A d-step approach to the maximum number of distinct squares and runs in strings. Discret. Appl. Math. 163: 268-274 (2014) - Karl F. Doerner, Pierre Hansen, Vittorio Maniezzo, Stefan Voß:
Editorial. Discret. Appl. Math. 163: 1-2 (2014) - Mitre Costa Dourado, Luérbio Faria, Miguel A. Pizaña, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On defensive alliances and strong global offensive alliances. Discret. Appl. Math. 163: 136-141 (2014) - Daniel Dressler, Martin Strehler:
Polynomial-time algorithms for special cases of the maximum confluent flow problem. Discret. Appl. Math. 163: 142-154 (2014) - Maria Federico, Pierre Peterlongo, Nadia Pisanti, Marie-France Sagot:
Rime: Repeat identification. Discret. Appl. Math. 163: 275-286 (2014) - Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Algorithms for computing Abelian periods of words. Discret. Appl. Math. 163: 287-297 (2014) - Jan Foniok, Bernd Gärtner, Lorenz Klaus, Markus Sprecher:
Counting unique-sink orientations. Discret. Appl. Math. 163: 155-164 (2014) - Szymon Grabowski, Wojciech Bieniecki:
Tight and simple Web graph compression for forward and reverse neighbor queries. Discret. Appl. Math. 163: 298-306 (2014) - Martin Grüttmüller, Ian T. Roberts, Leanne J. Rylands:
Antichains and completely separating systems - A catalogue and applications. Discret. Appl. Math. 163: 165-180 (2014) - Lawrence H. Harper:
Morphisms for resistive electrical networks. Discret. Appl. Math. 163: 181-193 (2014) - Jan Holub:
Stringology algorithms. Discret. Appl. Math. 163: 237 (2014) - Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring strings from suffix trees and links on a binary alphabet. Discret. Appl. Math. 163: 316-325 (2014) - Shmuel T. Klein, Dana Shapira:
Practical fixed length Lempel-Ziv coding. Discret. Appl. Math. 163: 326-333 (2014) - Kazuhiko Kusano, Ayumi Shinohara:
Average number of occurrences of repetitions in a necklace. Discret. Appl. Math. 163: 334-342 (2014) - Jan Lahoda, Jan Zdárek:
Simple tree pattern matching for trees in the prefix bar notation. Discret. Appl. Math. 163: 343-351 (2014)
skipping 7 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-02 03:04 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