![](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 62 matches
- 2014
- Mojgan Afkhami
, Kazem Khashyarmanesh:
The intersection graph of ideals of a poset. Discret. Math. Algorithms Appl. 6(3) (2014) - Bijo S. Anand
, Manoj Changat, Iztok Peterin, Prasanth G. Narasimha-Shenoi
:
Some Steiner concepts on lexicographic products of graphs. Discret. Math. Algorithms Appl. 6(4) (2014) - Júlio Araújo
, Jean-Claude Bermond, Guillaume Ducoffe:
Eulerian and Hamiltonian dicycles in Directed hypergraphs. Discret. Math. Algorithms Appl. 6(1) (2014) - Naveed Ahmed Azam, Tariq Shah, Antonio Aparecido de Andrade:
A new transmission model in cognitive radio based on cyclic generalized polynomial codes for bandwidth reduction. Discret. Math. Algorithms Appl. 6(4) (2014) - Manjusri Basu, Monojit Das:
Tribonacci Matrices and a New coding Theory. Discret. Math. Algorithms Appl. 6(1) (2014) - Manjusri Basu, Monojit Das:
Coding Theory on Fibonacci n-Step numbers. Discret. Math. Algorithms Appl. 6(2) (2014) - Ahmed Bouchou, Mostafa Blidia, Mustapha Chellali:
Relations between the Roman k-domination and Roman domination numbers in graphs. Discret. Math. Algorithms Appl. 6(3) (2014) - Yuehua Bu, Sheng Yang:
List Injective Coloring of Planar graphs with girth G ≥ 5. Discret. Math. Algorithms Appl. 6(1) (2014) - Huiping Cai, Juan Liu, Lingzhi Qian:
The domination number of Strong Product of Directed cycles. Discret. Math. Algorithms Appl. 6(2) (2014) - Mustapha Chellali, Nader Jafari Rad
:
Trees with unique Roman dominating functions of minimum weight. Discret. Math. Algorithms Appl. 6(3) (2014) - Shenshi Chen, Yaqing Chen, Quanhai Yang:
Toward Randomized Testing of Q-Monomials in multivariate polynomials. Discret. Math. Algorithms Appl. 6(2) (2014) - Eddie Cheng, Ke Qiu, Zhizhang Shen
:
The number of shortest paths in the (n, k)-star graph. Discret. Math. Algorithms Appl. 6(4) (2014) - M. R. Chithra, Ambat Vijayakumar:
The diameter variability of the Cartesian Product of graphs. Discret. Math. Algorithms Appl. 6(1) (2014) - Swadesh Choudhary, Hrishikesh Sharma, Sachin Patkar:
Optimal Folding of Data Flow graphs Based on Finite Projective Geometry using Vector Space Partitioning. Discret. Math. Algorithms Appl. 6(1) (2014) - Charles J. Colbourn:
Covering arrays, augmentation, and quilting arrays. Discret. Math. Algorithms Appl. 6(3) (2014) - Irene Marquez Corbella
, Edgar Martínez-Moro
, Emilio Suárez-Canedo:
On the Composition of Secret Sharing Schemes Related to codes. Discret. Math. Algorithms Appl. 6(1) (2014) - Shibing Deng, Shuchao Li, Feifei Song:
The extremal problems on the inertia of weighted bicyclic graphs. Discret. Math. Algorithms Appl. 6(3) (2014) - Adrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski:
The Minimum Guarding Tree Problem. Discret. Math. Algorithms Appl. 6(1) (2014) - A. Tamil Elakkiya
, Appu Muthusamy:
P5-Factorization of Cartesian Product of graphs. Discret. Math. Algorithms Appl. 6(2) (2014) - Jingcheng Fu, Guanghui Wang, Jianliang Wu, Jin Xu:
A note on Edge Weight choosability of graphs. Discret. Math. Algorithms Appl. 6(1) (2014) - Fanica Gavril:
Algorithms on Subgraph Overlap graphs. Discret. Math. Algorithms Appl. 6(2) (2014) - Alexandros V. Gerbessiotis, Constantinos J. Siniolakis:
A randomized sorting algorithm on the BSP model. Discret. Math. Algorithms Appl. 6(4) (2014) - Behrooz Bagheri Gh., Behnaz Omoomi:
On the simultaneous edge coloring of graphs. Discret. Math. Algorithms Appl. 6(4) (2014) - I. Sahul Hamid
, M. Rajeswari:
Global dominating sets in minimum coloring. Discret. Math. Algorithms Appl. 6(3) (2014) - P. Hemalatha, Appu Muthusamy:
-Factorization of the symmetric digraph of wreath product of graphs. Discret. Math. Algorithms Appl. 6(4) (2014) - Victoria Horan
, Glenn H. Hurlbert:
Gray codes and overlap cycles for restricted weight words. Discret. Math. Algorithms Appl. 6(4) (2014) - Xiaoxue Hu, Yiqiao Wang:
Plane graphs are entirely (δ + 5)-Choosable. Discret. Math. Algorithms Appl. 6(2) (2014) - Yu-Pei Huang, Chih-Wen Weng:
Spectral radius and Average 2-Degree sequence of a Graph. Discret. Math. Algorithms Appl. 6(2) (2014) - R. Kala, S. Kavitha:
Nilpotent graphs of genus one. Discret. Math. Algorithms Appl. 6(3) (2014) - Debajit Kalita
:
Algebraic connectivity of lollipop graphs: a New Approach. Discret. Math. Algorithms Appl. 6(2) (2014)
skipping 32 more matches
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-02 21:07 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