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 23 matches
- 2023
- Dan McQuillan, James M. McQuillan:
Strong vertex-magic and super edge-magic total labelings of the disjoint union of a cycle with 3-cycles. Discret. Math. 346(9): 113482 (2023) - Subhajit Sahu:
Selecting a suitable Parallel Label-propagation based algorithm for Disjoint Community Detection. CoRR abs/2301.09125 (2023) - Federica Spinola, Philipp Benz, Minhyeong Yu, Taehoon Kim:
Knowledge Assembly: Semi-Supervised Multi-Task Learning from Multiple Datasets with Disjoint Labels. CoRR abs/2306.08839 (2023) - 2022
- Tarun Kalluri, Manmohan Chandraker:
Cluster-to-adapt: Few Shot Domain Adaptation for Semantic Segmentation across Disjoint Labels. CVPR Workshops 2022: 4120-4130 - Tarun Kalluri, Manmohan Chandraker:
Cluster-to-adapt: Few Shot Domain Adaptation for Semantic Segmentation across Disjoint Labels. CoRR abs/2208.02804 (2022) - 2021
- Francisco Flórez-Revuelta:
EvoSplit: An evolutionary approach to split a multi-label data set into disjoint subsets. CoRR abs/2102.06154 (2021) - 2019
- Xiaobin Chang, Yongxin Yang, Tao Xiang, Timothy M. Hospedales:
Disjoint Label Space Transfer Learning with Common Factorised Space. AAAI 2019: 3288-3295 - 2018
- Faisal Susanto:
On super (a, d)-Cn-antimagic total labeling of disjoint union of cycles. AKCE Int. J. Graphs Comb. 15(1): 22-26 (2018) - Nathan Greenberg, Trapit Bansal, Patrick Verga, Andrew McCallum:
Marginal Likelihood Training of BiLSTM-CRF for Biomedical Named Entity Recognition from Disjoint Label Sets. EMNLP 2018: 2824-2829 - Xiaobin Chang, Yongxin Yang, Tao Xiang, Timothy M. Hospedales:
Disjoint Label Space Transfer Learning with Common Factorised Space. CoRR abs/1812.02605 (2018) - 2017
- Jean-Philippe Attal:
Nouveaux algorithmes pour la détection de communautés disjointes et chevauchantes basés sur la propagation de labels et adaptés aux grands graphes. (New algorithms for disjoint and overlapping community detection based on the labels propagation and adapted to large graphs). Cergy-Pontoise University, France, 2017 - Mahipal Jadeja, Rahul Muthu, V. Sunitha:
Set Labelling Vertices To Ensure Adjacency Coincides With Disjointness. Electron. Notes Discret. Math. 63: 237-244 (2017) - 2016
- Joseph A. Gallian, Danielle Stewart:
Corrigendum to "Even harmonious labelings of disjoint graphs with a small component" [AKCE Inter. J. Graphs Combin. 12 (2015) 204-215]. AKCE Int. J. Graphs Comb. 13(1): 101 (2016) - Soung-Yue Liew, Ming-Lee Gan:
Toggling dual label: an exact algorithm for finding the optimal pair of link-disjoint paths in α + 1 path protection. Telecommun. Syst. 61(3): 451-469 (2016) - 2015
- Joseph A. Gallian, Danielle Stewart:
Even harmonious labelings of disjoint graphs with a small component. AKCE Int. J. Graphs Comb. 12(Issues): 204-215 (2015) - 2014
- Ali Ahmad, Martin Baca, Muhammad Kamran Siddiqui:
Irregular total labeling of disjoint union of prisms and cycles. Australas. J Comb. 59: 98-106 (2014) - Jose Gomez, Petr Kovar:
On Super Vertex-Magic Total Labeling of the Disjoint Union of k Copies of Kn. Ars Comb. 113: 175-192 (2014) - 2012
- Ian D. Gray, Jim A. MacDougall:
Vertex-magic labeling of regular graphs: Disjoint unions and assemblages. Discret. Appl. Math. 160(7-8): 1114-1125 (2012) - 2009
- Wenchao Jiang, Hai Jin, Yanhong Zhou:
Probing multiple node-disjoint paths using multi-labelled tree traversing. Int. J. Auton. Adapt. Commun. Syst. 2(2): 175-200 (2009) - 2008
- Larry Shoemaker, Robert E. Banfield, Lawrence O. Hall, Kevin W. Bowyer, W. Philip Kegelmeyer:
Using classifier ensembles to label spatially disjoint data. Inf. Fusion 9(1): 120-133 (2008) - 2006
- Ken-ichi Kawarabayashi, Paul Wollan:
Non-zero disjoint cycles in highly connected group labelled graphs. J. Comb. Theory B 96(2): 296-301 (2006) - 2005
- Ramón M. Figueroa-Centeno, Rikio Ichishima, Francesc A. Muntaner-Batle:
On edge-magic labelings of certain disjoint unions of graphs. Australas. J Comb. 32: 225-242 (2005) - Ken-ichi Kawarabayashi, Paul Wollan:
Non-zero disjoint cycles in highly connected group labeled graphs. Electron. Notes Discret. Math. 22: 271-275 (2005)
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-23 13:54 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