Остановите войну!
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 22 matches
- 2016
- Susan A. van Aardt, Marietjie Frick, Ortrud R. Oellermann, Johan P. de Wet:
Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs. Discret. Appl. Math. 205: 171-179 (2016) - José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Averaging 2-rainbow domination and Roman domination. Discret. Appl. Math. 205: 202-207 (2016) - Maria Axenovich, Jochen Harant, Jakub Przybylo, Roman Soták, Margit Voigt, Jenny Weidelich:
A note on adjacent vertex distinguishing colorings of graphs. Discret. Appl. Math. 205: 1-7 (2016) - Bahareh Bafandeh, Dara Moazzami, Amin Ghodousian:
On the first-order edge tenacity of a graph. Discret. Appl. Math. 205: 8-15 (2016) - Adam Borchert, Skylar Nicol, Ortrud R. Oellermann:
Global cycle properties of locally isometric graphs. Discret. Appl. Math. 205: 16-26 (2016) - Christine T. Cheng, Eric McDermid, Ichiro Suzuki:
Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings. Discret. Appl. Math. 205: 27-34 (2016) - Rayan Chikhi, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova:
On the readability of overlap digraphs. Discret. Appl. Math. 205: 35-44 (2016) - Peter Damaschke:
Adaptive group testing with a constrained number of positive responses improved. Discret. Appl. Math. 205: 208-212 (2016) - Kinkar Chandra Das, Muhuo Liu:
Complete split graph determined by its (signless) Laplacian spectrum. Discret. Appl. Math. 205: 45-51 (2016) - Malte Fliedner, Dirk Briskorn, Nils Boysen:
Vehicle scheduling under the warehouse-on-wheels policy. Discret. Appl. Math. 205: 52-61 (2016) - Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics:
Clique-width of path powers. Discret. Appl. Math. 205: 62-72 (2016) - Michael A. Henning, Felix Joos, Christian Löwenstein, Dieter Rautenbach:
Induced 2-regular subgraphs in k-chordal cubic graphs. Discret. Appl. Math. 205: 73-79 (2016) - Che-Nan Kuo:
Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes. Discret. Appl. Math. 205: 80-85 (2016) - Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
On self-clique shoal graphs. Discret. Appl. Math. 205: 86-100 (2016) - Xiaosong Li, Zhao Zhang, Xiaohui Huang:
Approximation algorithms for minimum (weight) connected k-path vertex cover. Discret. Appl. Math. 205: 101-108 (2016) - Daniel C. McDonald:
List rankings and on-line list rankings of graphs. Discret. Appl. Math. 205: 109-125 (2016) - Mohammad Reza Oboudi:
On the roots of domination polynomial of graphs. Discret. Appl. Math. 205: 126-131 (2016) - Jung-Heum Park, Joonsoo Choi, Hyeong-Seok Lim:
Algorithms for finding disjoint path covers in unit interval graphs. Discret. Appl. Math. 205: 132-149 (2016) - Alexander Reich:
Minimum strictly fundamental cycle bases of planar graphs are hard to find. Discret. Appl. Math. 205: 150-159 (2016) - Hiroki Sayama:
Estimation of Laplacian spectra of direct and strong product graphs. Discret. Appl. Math. 205: 160-170 (2016) - Xinhong Zhang, Ruijuan Li:
The (1, 2)-step competition graph of a pure local tournament that is not round decomposable. Discret. Appl. Math. 205: 180-190 (2016) - Zhongxun Zhu, Yunchao Hong:
Minimum degree distance among cacti with perfect matchings. Discret. Appl. Math. 205: 191-201 (2016)
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 02:48 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