Остановите войну!
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 21 matches
- 2016
- Liliana Alcón, Marisa Gutierrez, István Kovács, Martin Milanic, Romeo Rizzi:
Strong cliques and equistability of EPT graphs. Discret. Appl. Math. 203: 13-25 (2016) - Martin Anthony, Endre Boros, Yves Crama, Aritanan Gruber:
Quadratization of symmetric pseudo-Boolean functions. Discret. Appl. Math. 203: 1-12 (2016) - Marianna Bolla:
Relating multiway discrepancy and singular values of nonnegative rectangular matrices. Discret. Appl. Math. 203: 26-34 (2016) - Yair Caro, Adriana Hansberg, Ryan Pepper:
Regular independent sets. Discret. Appl. Math. 203: 35-46 (2016) - Hortensia Galeana-Sánchez, Juan José Montellano-Ballesteros:
Richardson's Theorem for k-colored kernels in strongly connected digraphs. Discret. Appl. Math. 203: 47-52 (2016) - Severino Villanueva Gervacio:
Resistance distance in complete n-partite graphs. Discret. Appl. Math. 203: 53-61 (2016) - Alain Hertz, Hadrien Mélot:
Counting the number of non-equivalent vertex colorings of a graph. Discret. Appl. Math. 203: 62-71 (2016) - Pranava K. Jha:
A family of efficient six-regular circulants representable as a Kronecker product. Discret. Appl. Math. 203: 72-84 (2016) - Vadim E. Levit, Eugen Mandrescu:
On the independence polynomial of the corona of graphs. Discret. Appl. Math. 203: 85-93 (2016) - Faxu Li, Liang Wei, Haixing Zhao, Feng Hu, Xiujuan Ma:
On the Estrada index of cactus graphs. Discret. Appl. Math. 203: 94-105 (2016) - Wenshui Lin, Yuan Zhang, Qi'an Chen, Jiwen Chen, Chi Ma, Junjie Chen:
Ordering trees by their distance spectral radii. Discret. Appl. Math. 203: 106-110 (2016) - Jia-Bao Liu, Wen-Rui Wang, Yong-Ming Zhang, Xiang-Feng Pan:
On degree resistance distance of cacti. Discret. Appl. Math. 203: 217-225 (2016) - Xianliang Liu, Zishen Yang, Wei Wang:
Exact solutions for Latency-Bounded Target Set Selection Problem on some special families of graphs. Discret. Appl. Math. 203: 111-116 (2016) - Dmitriy S. Malyshev:
A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs. Discret. Appl. Math. 203: 117-126 (2016) - Santanu Sarkar:
Revisiting Prime Power RSA. Discret. Appl. Math. 203: 127-133 (2016) - Yunfang Tang, Douglas B. West, Bo Zhou:
Extremal problems for degree-based topological indices. Discret. Appl. Math. 203: 134-143 (2016) - Xi Wang, Jianxi Fan, Jingya Zhou, Cheng-Kuan Lin:
The restricted h-connectivity of the data center network DCell. Discret. Appl. Math. 203: 144-157 (2016) - Tingzeng Wu, Heping Zhang:
Per-spectral and adjacency spectral characterizations of a complete graph removing six edges. Discret. Appl. Math. 203: 158-170 (2016) - Kexiang Xu, Kinkar Chandra Das:
Some extremal graphs with respect to inverse degree. Discret. Appl. Math. 203: 171-183 (2016) - Yu Yang, Hongbo Liu, Hua Wang, Shigang Feng:
On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs. Discret. Appl. Math. 203: 184-203 (2016) - Manouchehr Zaker:
Lower bounds for the independence and k-independence number of graphs using the concept of degenerate degrees. Discret. Appl. Math. 203: 204-216 (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-04-28 01:42 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