Остановите войну!
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 13 matches
- 2017
- Kazutoshi Ando, Ryosuke Inagaki, Kazuya Shoji:
Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions. Discret. Appl. Math. 225: 1-10 (2017) - Kirk Boyer, Paul Horn, Mario Alberto López:
On the barrier graph of an arrangement of ray sensors. Discret. Appl. Math. 225: 11-21 (2017) - Walter Carballosa, José M. Rodríguez, José María Sigarreta, Yadira Torres-Nuñez:
Alliance polynomial of regular graphs. Discret. Appl. Math. 225: 22-32 (2017) - Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Sequences of radius k for complete bipartite graphs. Discret. Appl. Math. 225: 51-63 (2017) - Jennifer Diemunsch, Nathan Graber, Lucas Kramer, Victor Larsen, Lauren M. Nelsen, Luke L. Nelsen, Devon Sigler, Derrick Stolee, Charlie Suer:
Color-blind index in graphs of very low degree. Discret. Appl. Math. 225: 122-129 (2017) - Shannon L. Fitzpatrick, John Paul Larkin:
The game of Cops and Robber on circulant graphs. Discret. Appl. Math. 225: 64-73 (2017) - P. Francis, S. Francis Raj:
On b-coloring of powers of hypercubes. Discret. Appl. Math. 225: 74-86 (2017) - Jan Gorzny, Jing Huang:
End-vertices of LBFS of (AT-free) bigraphs. Discret. Appl. Math. 225: 87-94 (2017) - José F. De Jesús, Alexander K. Kelmans:
k-circular matroids of graphs. Discret. Appl. Math. 225: 33-50 (2017) - Veli Mäkinen, Valeria Staneva, Alexandru I. Tomescu, Daniel Valenzuela, Sebastian Wilzbach:
Interval scheduling maximizing minimum coverage. Discret. Appl. Math. 225: 130-135 (2017) - Barnaby Martin, Franco Raimondi, Taolue Chen, Jos Martin:
The packing chromatic number of the infinite square lattice is between 13 and 15. Discret. Appl. Math. 225: 136-142 (2017) - Wolfgang F. Riedl:
A complete characterization of jump inequalities for the hop-constrained shortest path problem. Discret. Appl. Math. 225: 95-113 (2017) - Biao Wu, Yuejian Peng:
The connection between polynomial optimization, maximum cliques and Turán densities. Discret. Appl. Math. 225: 114-121 (2017)
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-07 16: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