![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 21 matches
- 2020
- Elham Abdali, Reza Fallahnejad
:
A bargaining game model for measuring efficiency of two-stage network DEA with non-discretionary inputs. Int. J. Comput. Math. Comput. Syst. Theory 5(1): 48-59 (2020) - Oluwasefunmi 'Tale Arogundade
, Samuel Ibukun Olotu
, Olusola Abayomi-Alli, Sanjay Misra
, Abiodun Motunrayo Ikotun:
A study of existing use case extensions and experience: a systematic review. Int. J. Comput. Math. Comput. Syst. Theory 5(4): 263-281 (2020) - Sean Bailey, David Brown:
Bipartite dot product graphs. Int. J. Comput. Math. Comput. Syst. Theory 5(3): 148-158 (2020) - Wu-Lin Chen, Kuo-Hsiung Wang:
Reliability and sensitivity analysis of a retrial machine repair problem with warm standbys and imperfect coverage. Int. J. Comput. Math. Comput. Syst. Theory 5(2): 72-86 (2020) - Eddie Cheng, Ke Qiu, Zhizhang Shen
:
The g-extra diagnosability of the generalized exchanged hypercube. Int. J. Comput. Math. Comput. Syst. Theory 5(2): 112-123 (2020) - Samuel Dobson
, Steven D. Galbraith
, Jason T. LeGrow
, Yan Bo Ti
, Lukas Zobernig
:
An adaptive attack on 2-SIDH. Int. J. Comput. Math. Comput. Syst. Theory 5(4): 282-299 (2020) - Ramón Flores, Delaram Kahrobaei
, Thomas Koberda:
A cryptographic application of the Thurston norm. Int. J. Comput. Math. Comput. Syst. Theory 5(1): 15-24 (2020) - James Hallas, Maria Talanda-Fisher, Ping Zhang:
Dominating functions in graphs - regularity versus irregularity. Int. J. Comput. Math. Comput. Syst. Theory 5(2): 98-111 (2020) - Masaaki Harada:
Construction of s-extremal optimal unimodular lattices in dimension 52. Int. J. Comput. Math. Comput. Syst. Theory 5(2): 87-91 (2020) - Jie-Fu Huang, Sun-Yuan Hsieh:
Recursive and parallel constructions of independent spanning trees in alternating group networks. Int. J. Comput. Math. Comput. Syst. Theory 5(4): 234-262 (2020) - Yufei Huang, Weihua He, Guixian Huang, Hong-Jian Lai
, Sulin Song:
A characterization of graphs with supereulerian line graphs. Int. J. Comput. Math. Comput. Syst. Theory 5(1): 1-14 (2020) - Chun-Nan Hung, Mohamad Abdallah
, Jui-I Weng, Tzu-Liang Kung:
Edge-pancyclicity of pancake graph. Int. J. Comput. Math. Comput. Syst. Theory 5(3): 125-133 (2020) - Amir Khamseh
:
A note on (t - 1)-chromatic Ramsey number of linear forests. Int. J. Comput. Math. Comput. Syst. Theory 5(2): 92-97 (2020) - R. Kuppan, L. Shobana
, Ismail Naci Cangül
:
Encrypting and decrypting algorithms using strong face graph of a tree. Int. J. Comput. Math. Comput. Syst. Theory 5(4): 225-233 (2020) - Chuan-Min Lee:
The complexity of total k-domatic partition and total R-domination on graphs with weak elimination orderings. Int. J. Comput. Math. Comput. Syst. Theory 5(3): 134-147 (2020) - Guanqin Lian, Shuming Zhou, Eddie Cheng, Jiafei Liu, Gaolin Chen, Zhendong Gu:
Reliability and conditional diagnosability of hyper bijective connection networks. Int. J. Comput. Math. Comput. Syst. Theory 5(1): 25-47 (2020) - Ophir Nave:
Adding features from the mathematical model of breast cancer to predict the tumour size. Int. J. Comput. Math. Comput. Syst. Theory 5(3): 159-174 (2020) - Sourav Pradhan:
A discrete-time batch transmission channel with random serving capacity under batch-size-dependent service. Int. J. Comput. Math. Comput. Syst. Theory 5(3): 175-197 (2020) - Sujit Kumar Samanta
, B. Bank
:
Analysis of stationary queue-length distributions of the BMAP/R(a, b)/1 queue. Int. J. Comput. Math. Comput. Syst. Theory 5(3): 198-223 (2020) - Mohammad Reza Zarrabi
, Nasrollah Moghaddam Charkari
:
On approximations to minimum link visibility paths in simple polygons. Int. J. Comput. Math. Comput. Syst. Theory 5(4): 300-307 (2020) - Hong Zhang, Laijiang Zhang, Jixiang Meng:
Hybrid fault diagnosis capability analysis of regular graphs under the PMC model. Int. J. Comput. Math. Comput. Syst. Theory 5(2): 61-71 (2020)
loading more results
failed to load more results, please try again later
![](https://dblp.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-10 23:00 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