![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
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 25 matches
- 2001
- Alexander A. Ageev
:
Complexity of finding a join of maximum weight. Discret. Appl. Math. 114(1-3): 3-7 (2001) - Sergey V. Avgustinovich:
Perfect binary (n, 3) codes: the structure of graphs of minimum distances. Discret. Appl. Math. 114(1-3): 9-11 (2001) - Vladimir L. Beresnev:
An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix. Discret. Appl. Math. 114(1-3): 13-22 (2001) - V. A. Bojarshinov:
Edge and total coloring of interval graphs. Discret. Appl. Math. 114(1-3): 23-28 (2001) - Oleg V. Borodin:
Preface. Discret. Appl. Math. 114(1-3): 1 (2001) - Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
Acyclic colouring of 1-planar graphs. Discret. Appl. Math. 114(1-3): 29-41 (2001) - A. V. Chashkin:
Average case complexity for finite Boolean functions. Discret. Appl. Math. 114(1-3): 43-59 (2001) - A. V. Chashkin:
Lower bounds for the complexity of restrictions of Boolean functions. Discret. Appl. Math. 114(1-3): 61-93 (2001) - D. U. Cherukhin:
On an infinite sequence of improving Boolean bases. Discret. Appl. Math. 114(1-3): 95-108 (2001) - A. A. Evdokimov, A. L. Perezhogin:
Minimal enumerations of subsets of a finite set and the middle level problem. Discret. Appl. Math. 114(1-3): 109-114 (2001) - Anna E. Frid:
On the subword complexity of iteratively generated infinite words. Discret. Appl. Math. 114(1-3): 115-120 (2001) - Anna E. Frid:
On factor graphs of DOL words. Discret. Appl. Math. 114(1-3): 121-130 (2001) - Victor P. Il'ev:
An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function. Discret. Appl. Math. 114(1-3): 131-146 (2001) - K. N. Kashyrskikh, Chris N. Potts, Sergey V. Sevastianov
:
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. Discret. Appl. Math. 114(1-3): 255-271 (2001) - Oktay M. Kasim-Zade:
On minimal coverings of the Boolean cube by centered antichains. Discret. Appl. Math. 114(1-3): 147-153 (2001) - Alexander V. Klepinin, E. V. Sukhanov:
On combinatorial properties of the Arshon sequence. Discret. Appl. Math. 114(1-3): 155-169 (2001) - A. D. Korshunov:
On the asymptotics of the number of binary words with a given length of a maximal series. Discret. Appl. Math. 114(1-3): 171-201 (2001) - S. S. Marchenkov:
A-closed classes of idempotent functions of many-valued logic definable by binary relations. Discret. Appl. Math. 114(1-3): 203-225 (2001) - Yuri V. Merekin:
Upper bounds for the complexity of sequences generated by symmetric Boolean functions. Discret. Appl. Math. 114(1-3): 227-231 (2001) - Alexander A. Sapozhenko:
On the number of connected sets with the neighborhood of a given size in a graph. Discret. Appl. Math. 114(1-3): 233-247 (2001) - A. I. Serdjukov:
On finding a maximum spanning tree of bounded radius. Discret. Appl. Math. 114(1-3): 249-253 (2001) - Sergey V. Sevastianov
, Gerhard J. Woeginger:
Linear time approximation scheme for the multiprocessor open shop problem. Discret. Appl. Math. 114(1-3): 273-288 (2001) - Vadym G. Vizing:
On connected list colorings of graphs. Discret. Appl. Math. 114(1-3): 295-300 (2001) - A. J. van Zanten:
Cyclic distance-preserving codes on a constant-weight basis. Discret. Appl. Math. 114(1-3): 289-294 (2001) - Igor E. Zverovich:
Locally bounded hereditary subclasses of k-colourable graphs. Discret. Appl. Math. 114(1-3): 301-311 (2001)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-08-10 09:11 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