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 16 matches
- 2020
- Bansidhar Joshi, Manish K. Thakur:
Stable Matching based Virtual Channels Allocation Scheme in Network-on-Chip. J. Interconnect. Networks 20(2): 2050008:1-2050008:31 (2020) - Johan Kok, Sudev Naduvath:
Tattooing and the Tattoo Number of Graphs. J. Interconnect. Networks 20(2): 2050006:1-2050006:10 (2020) - Yinkui Li, Xiaoxiao Qin, Fengwei Li, Wen Li:
Note for Constructing Minimum Integrity Trees with Given Order and Maximum Degree*. J. Interconnect. Networks 20(3): 2050012:1-2050012:6 (2020) - Lan Lin, Yixun Lin:
The Minimum Stretch Spanning Tree Problem for Hamming Graphs and Higher-Dimensional Grids. J. Interconnect. Networks 20(1): 2050004:1-2050004:15 (2020) - P. C. Lisna, M. S. Sunitha:
On the b-Chromatic Sum of Mycielskian of Km, n, Kn and Cn. J. Interconnect. Networks 20(2): 2050007:1-2050007:9 (2020) - Wenjun Liu:
The Relationship Between Extra Connectivity and t/k-Diagnosability of Regular Networks. J. Interconnect. Networks 20(1): 2050003:1-2050003:11 (2020) - Garima Mahendru, Anil K. Shukla, L. M. Patnaik:
Novel Spectrum Sensing Technique and Its Evaluation for Cognitive Radio Wireless Sensor Network. J. Interconnect. Networks 20(3): 2050009:1-2050009:13 (2020) - Manel Majdoub, Ali El Kamel, Habib Youssef:
DQR: An Efficient Deep Q-Based Routing Approach in Multi-Controller Software Defined WAN (SD-WAN). J. Interconnect. Networks 20(4): 2150002:1-2150002:26 (2020) - J. Mohan, Shweta M. Devanagaonkar, Vineeta V. Garur, A. Karthik, K. Rohitaksha, A. B. Rajendra:
An Improved Approach for Eliminating the Loop in Hybrid Software Defined Network (SDN) Using Modified Bellman-Ford Algorithm. J. Interconnect. Networks 20(4): 2150001:1-2150001:15 (2020) - Hemmat Sheikhi, Wafa Barkhoda:
Solving the k-Coverage and m-Connected Problem in Wireless Sensor Networks through the Imperialist Competitive Algorithm. J. Interconnect. Networks 20(1): 2050002:1-2050002:18 (2020) - Amita A. Shinde, Y. M. Borse:
On Edge-Fault Tolerance in Augmented Cubes. J. Interconnect. Networks 20(4): 2050013:1-2050013:9 (2020) - Deepa Sinha, Anita Kumari Rao:
Co-maximal Graph, its Planarity and Domination Number. J. Interconnect. Networks 20(2): 2050005:1-2050005:14 (2020) - Yuxing Yang, Lingling Zhang:
Prescribed Hamiltonian Connectedness of 2D Torus. J. Interconnect. Networks 20(1): 2050001:1-2050001:31 (2020) - Hewei Yu, Meiyuan Guo, Jingxi Yu:
A Novel Heterogeneous Wireless Network Selection Algorithm Based on INFAHP and IGRA. J. Interconnect. Networks 20(3): 2050010:1-2050010:19 (2020) - Jutao Zhao, Shiying Wang:
Connectivity and Nature Diagnosability of Leaf-Sort Graphs. J. Interconnect. Networks 20(3): 2050011:1-2050011:28 (2020) - Jinyu Zou, Chengfu Ye, Haizhen Ren:
Fractional Matching Preclusion for Folded Petersen Cube Networks. J. Interconnect. Networks 20(4): 2150003:1-2150003:16 (2020)
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-09-17 14:40 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