![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 22 matches
- 2017
- Daniele D'Angeli, Alfredo Donno
:
Shuffling matrices, Kronecker product and Discrete Fourier Transform. Discret. Appl. Math. 233: 1-18 (2017) - Alak Kumar Datta
, Chinmay Debnath:
Spanning cactus: Complexity and extensions. Discret. Appl. Math. 233: 19-28 (2017) - Xiaolan Hu
, Yunqing Zhang, Zhengke Miao:
Upper bounds on adjacent vertex distinguishing total chromatic number of graphs. Discret. Appl. Math. 233: 29-32 (2017) - Charles R. Johnson, António Leal Duarte
, Paul R. McMichael:
Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue. Discret. Appl. Math. 233: 33-51 (2017) - Adam Kasperski
, Pawel Zielinski
:
Robust recoverable and two-stage selection problems. Discret. Appl. Math. 233: 52-64 (2017) - Antti Laaksonen, Patric R. J. Östergård:
Constructing error-correcting binary codes using transitive permutation groups. Discret. Appl. Math. 233: 65-70 (2017) - Clément Lecat
, Corinne Lucet, Chu-Min Li:
Minimum sum coloring problem: Upper bounds for the chromatic strength. Discret. Appl. Math. 233: 71-82 (2017) - Seung Chul Lee, Jihoon Choi, Suh-Ryung Kim, Yoshio Sano:
On the phylogeny graphs of degree-bounded digraphs. Discret. Appl. Math. 233: 83-93 (2017) - Xiaodong Liang, Heping Zhang
:
Single coronoid systems with an anti-forcing edge. Discret. Appl. Math. 233: 94-103 (2017) - Ruizhi Lin
, Heping Zhang
:
Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs. Discret. Appl. Math. 233: 104-117 (2017) - Yan Liu, Aimei Yu, Mei Lu, Rong-Xia Hao:
On the Szeged index of unicyclic graphs with given diameter. Discret. Appl. Math. 233: 118-130 (2017) - Hui-Chuan Lu
, Hung-Lin Fu:
The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs. Discret. Appl. Math. 233: 131-142 (2017) - Mikko Pelto:
The number of completely different optimal identifying codes in the infinite square grid. Discret. Appl. Math. 233: 143-158 (2017) - Jakub Przybylo
:
Distant irregularity strength of graphs with bounded minimum degree. Discret. Appl. Math. 233: 159-165 (2017) - Xuli Qi, Bo Zhou
, Jiyong Li:
Zagreb eccentricity indices of unicyclic graphs. Discret. Appl. Math. 233: 166-174 (2017) - Zehui Shao
, Sandi Klavzar
, Zepeng Li, Pu Wu, Jin Xu:
On the signed Roman k-domination: Complexity and thin torus graphs. Discret. Appl. Math. 233: 175-186 (2017) - Lingjuan Shi, Hongwei Wang, Heping Zhang
:
On the maximum forcing and anti-forcing numbers of (4, 6)-fullerenes. Discret. Appl. Math. 233: 187-194 (2017) - Kin Cheong Sou
:
Minimum equivalent precedence relation systems. Discret. Appl. Math. 233: 195-214 (2017) - Kenjiro Takazawa
:
Decomposition theorems for square-free 2-matchings in bipartite graphs. Discret. Appl. Math. 233: 215-223 (2017) - Gui-Xian Tian:
The asymptotic behavior of (degree-)Kirchhoff indices of iterated total graphs of regular graphs. Discret. Appl. Math. 233: 224-230 (2017) - Shujing Wang:
On extremal cacti with respect to the revised Szeged index. Discret. Appl. Math. 233: 231-239 (2017) - Kexiang Xu
, Yaser Alizadeh, Kinkar Chandra Das:
On two eccentricity-based topological indices of graphs. Discret. Appl. Math. 233: 240-251 (2017)
loading more results
failed to load more results, please try again later
![](https://dblp1.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-07-13 00:09 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