Остановите войну!
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 101 matches
- 2024
- Subarsha Banerjee:
Distance energy change of complete split graph due to edge deletion. Discret. Math. Algorithms Appl. 16(3): 2350033:1-2350033:11 (2024) - Haolun Wang, Tingjun Xu, Dragan Pamucar, Xuxiang Li, Liangqing Feng:
A Lance Distance-Based MAIRCA Method for q-Rung Orthopair Fuzzy MCDM with Completely Unknown Weight Information. Informatica 35(1): 179-202 (2024) - 2023
- B. R. Rakshith, Kinkar Chandra Das:
On distance Laplacian spectral determination of complete multipartite graphs. Appl. Math. Comput. 443: 127787 (2023) - Salvador Romaguera:
An Application of wt-Distances to Characterize Complete b-Metric Spaces. Axioms 12(2): 121 (2023) - Jiulin Jin, Harish Garg, Taijie You:
Generalized picture fuzzy distance and similarity measures on the complete lattice and their applications. Expert Syst. Appl. 220: 119710 (2023) - Shu Sugita, Toru Koizumi, Ryota Shioya, Hidetsugu Irie, Shuichi Sakai:
A Sound and Complete Algorithm for Code Generation in Distance-Based ISA. CC 2023: 73-84 - 2022
- Zhiwen Wang, Xianhao Meng:
Effects on distance energy of complete bipartite graphs by embedding edges. Appl. Math. Comput. 430: 127275 (2022) - Jia Pu, Yiran Liu, Hongxing Li:
Organizational quality specific immune evaluation of manufacturing enterprises: Multi-attribute group decision-making method with complete ignorance of weight information based on evidence distance an... J. Comput. Methods Sci. Eng. 22(4): 1287-1296 (2022) - Ju-Mok Oh, Yong Chan Kim:
Topological structures and distance functions in complete co-residuated lattices. J. Intell. Fuzzy Syst. 43(1): 49-65 (2022) - Evan DeCorte, Fernando Mário de Oliveira Filho, Frank Vallentin:
Complete positivity and distance-avoiding sets. Math. Program. 191(2): 487-558 (2022) - Victor H. Lutfalla:
Geometrical tilings : distance, topology, compacity and completeness. CoRR abs/2208.14922 (2022) - Yang Liu, Ruihu Li, Qiang Fu, Hao Song:
Minimum distances of binary optimal LCD codes of dimension five are completely determined. CoRR abs/2210.05238 (2022) - 2021
- Wuxian Chen, Weigen Yan:
Resistance distances in vertex-weighted complete multipartite graphs. Appl. Math. Comput. 409: 126382 (2021) - Jabulani Owen Nene:
Exploring Student Support in a Completely Online Module Within an Open Distance eLearning Institution. Int. J. Online Pedagog. Course Des. 11(4): 33-44 (2021) - 2020
- Eunpil Park, Jae-Young Sim:
Underwater Image Restoration Using Geodesic Color Distance and Complete Image Formation Model. IEEE Access 8: 157918-157930 (2020) - Jing Zhao, Jia-Bao Liu, Ali Zafari:
Complete Characterization of Resistance Distance for Linear Octagonal Networks. Complex. 2020: 5917098:1-5917098:13 (2020) - Jun Ge, Fengming Dong:
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs. Discret. Appl. Math. 283: 542-554 (2020) - Mesfin Masre, Samuel Asefa Fufa, Tomás Vetrík:
Distance-based indices of complete m-ary trees. Discret. Math. Algorithms Appl. 12(4): 2050041:1-2050041:22 (2020) - Vishal Gupta, R. K. Saini, Manu Verma:
Fixed point theorem by altering distance technique in complete fuzzy metric spaces. Int. J. Comput. Aided Eng. Technol. 13(4): 437-447 (2020) - Taiga Kawaguchi, Takuya Yoshino, Kouichi Hirata:
Path histogram distance and complete subtree histogram distance for rooted labelled caterpillars. J. Inf. Telecommun. 4(2): 199-212 (2020) - Weijun Fang, Bin Chen, Shu-Tao Xia, Fang-Wei Fu:
Complete Characterization of Optimal LRCs with Minimum Distance 6 and Locality 2: Improved Bounds and Constructions. ISIT 2020: 595-599 - Shuhei Saito, Wei Wu, Naoki Matsumoto:
Rainbow Perfect and Near-Perfect Matchings in Complete Graphs with Edges Colored by Circular Distance. CoRR abs/2012.06083 (2020) - 2019
- Ajay Arora, Eddie Cheng, Colton Magnant:
Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles. Parallel Process. Lett. 29(4): 1950016:1-1950016:9 (2019) - Karim Labib, Przemyslaw Uznanski, Daniel Wolleb-Graf:
Hamming Distance Completeness. CPM 2019: 14:1-14:17 - Ivan Avramovic, Richards Dana S:
NP-completeness of Shortest Leaf-to-Leaf Distance in a Tree. ICNC 2019: 747-752 - 2018
- Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare:
A Complete Quantitative Deduction System for the Bisimilarity Distance on Markov Chains. Log. Methods Comput. Sci. 14(4) (2018) - Ze Jin, David S. Matteson:
Generalizing distance covariance to measure and test multivariate mutual dependence via complete and incomplete V-statistics. J. Multivar. Anal. 168: 304-322 (2018) - Xiao-Bin Liang, Bo Li, Biao-Liang Ye, Shao-Ming Fei, Xianqing Li-Jost:
Complete optimal convex approximations of qubit states under \(B_2\) distance. Quantum Inf. Process. 17(7): 185 (2018) - Daniel Graf, Karim Labib, Przemyslaw Uznanski:
Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. ICALP 2018: 109:1-109:4 - Taiga Kawaguchi, Takuya Yoshino, Kouichi Hirata:
Earth Mover's Distance Between Rooted Labeled Unordered Trees Formulated from Complete Subtrees. ICPRAM (Revised Selected Papers) 2018: 65-88
skipping 71 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-05-11 04:08 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