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 84 matches
- 2018
- Ali Zeydi Abdian, S. Morteza Mirafzal:
The spectral characterizations of the connected multicone graphs Kw ▽ LHS and Kw ▽ LGQ(3, 9). Discret. Math. Algorithms Appl. 10(2): 1850019:1-1850019:16 (2018) - V. Aghapouramin, Mohammad Javad Nikmehr:
Perfectness of a graph associated with annihilating ideals of a ring. Discret. Math. Algorithms Appl. 10(4): 1850047:1-1850047:11 (2018) - Saieed Akbari, Nazanin Alipourfard, Pegah Jandaghi, Mehrnoosh Sadat Mirtaheri:
On N2-vertex coloring of graphs. Discret. Math. Algorithms Appl. 10(1): 1850007:1-1850007:7 (2018) - Abdollah Alhevaz, Maryam Baghipur, Somnath Paul:
On the distance signless Laplacian spectral radius and the distance signless Laplacian energy of graphs. Discret. Math. Algorithms Appl. 10(3): 1850035:1-1850035:19 (2018) - Anwar Alwardi, Akram Alqesmah, R. Rangarajan, Ismail Naci Cangül:
Entire Zagreb indices of graphs. Discret. Math. Algorithms Appl. 10(3): 1850037:1-1850037:16 (2018) - Jafar Amjadi:
The signed total Roman domatic number of a digraph. Discret. Math. Algorithms Appl. 10(2): 1850020:1-1850020:9 (2018) - Jafar Amjadi, A. Alilou:
The co-annihilating graph of a commutative ring. Discret. Math. Algorithms Appl. 10(1): 1850013:1-1850013:12 (2018) - Jafar Amjadi, R. Khoeilar, Marzieh Soroudi:
A correction on the signed bad number. Discret. Math. Algorithms Appl. 10(1): 1850009:1-1850009:3 (2018) - Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Mina Valinavaz, Nasrin Dehgardi:
Independent Roman domination and 2-independence in trees. Discret. Math. Algorithms Appl. 10(4): 1850052:1-1850052:10 (2018) - Ismail Aydogdu, Taher Abualrub:
The structure of ℤ2ℤ2s-additive cyclic codes. Discret. Math. Algorithms Appl. 10(4): 1850048:1-1850048:12 (2018) - Tushar Bag, Habibul Islam, Om Prakash, Ashish Kumar Upadhyay:
A study of constacyclic codes over the ring ℤ4[u]/〈u2 - 3〉. Discret. Math. Algorithms Appl. 10(4): 1850056:1-1850056:10 (2018) - Manjanna Basappa, Gautam K. Das:
Discrete unit square cover problem. Discret. Math. Algorithms Appl. 10(6): 1850072:1-1850072:18 (2018) - Kent D. Boklan:
A note on identities for elementary symmetric and power sum polynomials. Discret. Math. Algorithms Appl. 10(1): 1850004:1-1850004:5 (2018) - Yuehua Bu, Chao-Yuan Huang:
List injective coloring of a class of planar graphs without short cycles. Discret. Math. Algorithms Appl. 10(5): 1850068:1-1850068:12 (2018) - Yuehua Bu, Chentao Qi:
Injective edge coloring of sparse graphs. Discret. Math. Algorithms Appl. 10(2): 1850022:1-1850022:16 (2018) - Brahim Chaourar:
The Kth TSP is pseudopolynomial when TSP is polynomial. Discret. Math. Algorithms Appl. 10(5): 1850058:1-1850058:7 (2018) - T. Tamizh Chelvam, Sekar Raja:
Integral circulant graphs with four distinct eigenvalues. Discret. Math. Algorithms Appl. 10(5): 1850057:1-1850057:11 (2018) - T. Tamizh Chelvam, Krishnan Selvakumar, P. Subbulakshmi:
On the nil-graph of ideals of commutative Artinian rings. Discret. Math. Algorithms Appl. 10(5): 1850062:1-1850062:10 (2018) - Zichong Chen:
The number of subtrees of trees with given diameter. Discret. Math. Algorithms Appl. 10(1): 1850001:1-1850001:16 (2018) - Hanlin Chen, Hanyuan Deng:
The inverse sum indeg index of graphs with some given parameters. Discret. Math. Algorithms Appl. 10(1): 1850006:1-1850006:9 (2018) - Qingqing Chen, Xiaohui Huang, Yingli Ran:
Approximation algorithm for distance constraint sweep coverage without predetermined base stations. Discret. Math. Algorithms Appl. 10(5): 1850064:1-1850064:9 (2018) - Zhihao Chen, Zhao Zhang:
What network topology can tell in election prediction. Discret. Math. Algorithms Appl. 10(2): 1850027:1-1850027:12 (2018) - Giampiero Chiaselotti, Tommaso Gentile, Federico G. Infusino, F. Tropeano:
Rough sets on graphs: New dependency and accuracy measures. Discret. Math. Algorithms Appl. 10(5): 1850063:1-1850063:27 (2018) - M. Emami, Ozra Naserian:
New large sets of t-designs from t-homogeneous groups. Discret. Math. Algorithms Appl. 10(4): 1850051:1-1850051:6 (2018) - Debashis Ghosh, Joydeb Pal, Lakshmi Kanta Dey:
The classification of self-orthogonal codes of length 42. Discret. Math. Algorithms Appl. 10(6): 1850083:1-1850083:8 (2018) - Pinkimani Goswami, Madan Mohan Singh:
An applications of signed quadratic residues in public key cryptography. Discret. Math. Algorithms Appl. 10(6): 1850081:1-1850081:14 (2018) - Mokshi Goyal, Madhu Raka:
Duadic negacyclic codes over a finite non-chain ring. Discret. Math. Algorithms Appl. 10(6): 1850080:1-1850080:16 (2018) - Purnima Gupta, Deepti Jain:
Bounds on 2-point set domination number of a graph. Discret. Math. Algorithms Appl. 10(1): 1850012:1-1850012:15 (2018) - P. Hemalatha:
Gregarious star factorization of the tensor product of graphs. Discret. Math. Algorithms Appl. 10(4): 1850055:1-1850055:7 (2018) - Farideh Heydari:
The M-intersection graph of ideals of a commutative ring. Discret. Math. Algorithms Appl. 10(3): 1850038:1-1850038:11 (2018)
skipping 54 more matches
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-12-26 00:19 CET 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