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 510 matches
- 2024
- Cintia Izabel Cararo, Sheila Morais de Almeida, Cândida Nunes da Silva:
Further split graphs known to be Class 1 and a characterization of subgraph-overfull split graphs. Discret. Appl. Math. 345: 114-124 (2024) - Tithi Dwary, Kanduru V. Krishna:
Word-representability of graphs with respect to split recomposition. Discret. Appl. Math. 357: 310-321 (2024) - Jun Ge, Yucui Liao, Bohan Zhang:
Resistance distances and the Moon-type formula of a vertex-weighted complete split graph. Discret. Appl. Math. 359: 10-15 (2024) - Wei Xiong, Xing Chen, Yang Wu, Zhifu You, Hong-Jian Lai:
Spanning connectivity of K1,r-free split graphs. Discret. Appl. Math. 358: 176-183 (2024) - Karen L. Collins, Ann N. Trenk, Rebecca Whitman:
Split graphs and block representations. Discret. Math. 347(4): 113857 (2024) - Yongjiang Wu, Qinghong Guo, Jing Yang, Lihua Feng:
Splitting fields of some matrices of normal (mixed) Cayley graphs. Discret. Math. 347(5): 113914 (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) - Sergey Kitaev, Artem V. Pyatkin:
On semi-transitive orientability of split graphs. Inf. Process. Lett. 184: 106435 (2024) - Avisek Banerjee, Sk Amanathulla:
Optimization of disaster management using split domination in picture fuzzy graphs. J. Appl. Math. Comput. 70(1): 435-459 (2024) - A. Mohanapriya, P. Renjith, N. Sadagopan:
On convexity in split graphs: complexity of Steiner tree and domination. J. Comb. Optim. 47(2): 8 (2024) - Joyashree Mondal, S. Vijayakumar:
Star covers and star partitions of double-split graphs. J. Comb. Optim. 47(3): 17 (2024) - Fei Wan, Ping Li:
A neural machine translation method based on split graph convolutional self-attention encoding. PeerJ Comput. Sci. 10: e1886 (2024) - Yanjun Liu, Hongwei Li, Meng Hao:
SVFGNN: A privacy-preserving vertical federated graph neural network model training framework based on split learning. Peer Peer Netw. Appl. 17(1): 246-260 (2024) - Chengjun Liu, Zhuo Peng, Weiguo Zheng, Lei Zou:
FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition. Proc. VLDB Endow. 17(9): 2378-2391 (2024) - Tian Bai, Mingyu Xiao:
Exact algorithms for restricted subset feedback vertex set in chordal and split graphs. Theor. Comput. Sci. 984: 114326 (2024) - Xiaohui Hua, Qin Zhao:
The h-faulty-block connectivity of alternating group graphs and split-star networks. J. Supercomput. 80(15): 21996-22019 (2024) - Yilin Liu, Jiale Chen, Shanshan Pan, Daniel Cohen-Or, Hao Zhang, Hui Huang:
Split-and-Fit: Learning B-Reps via Structure-Aware Voronoi Partitioning. ACM Trans. Graph. 43(4): 108:1-108:13 (2024) - Zheng Shi, Ilya Chugunov, Mario Bijelic, Geoffroi Côté, Jiwoon Yeom, Qiang Fu, Hadi Amata, Wolfgang Heidrich, Felix Heide:
Split-Aperture 2-in-1 Computational Cameras. ACM Trans. Graph. 43(4): 141:1-141:19 (2024) - Rong Chen, Xingda Wei, Xiating Xie, Haibo Chen:
Locality-Preserving Graph Traversal With Split Live Migration. IEEE Trans. Parallel Distributed Syst. 35(10): 1810-1825 (2024) - Bing-Jia Chen, Ronald Y. Chang, Feng-Tsun Chien, H. Vincent Poor:
Energy-Efficient Multi-RIS-Aided Rate-Splitting Multiple Access: A Graph Neural Network Approach. IEEE Wirel. Commun. Lett. 13(7): 2003-2007 (2024) - D. Divya, S. Vijayakumar:
On Star Partition of Split Graphs. CALDAM 2024: 209-223 - M. A. Shalu, V. K. Kirubakaran:
Open Packing in H-free Graphs and Subclasses of Split Graphs. CALDAM 2024: 239-251 - Leonid Kostrykin, Karl Rohr:
Robust Graph Pruning for Efficient Segmentation and Cluster Splitting of Cell Nuclei Using Deformable Shape Models. ISBI 2024: 1-4 - Yixin Cao, Haowei Chen, Shenghua Wang:
Self-complementary (Pseudo-)Split Graphs. LATIN (2) 2024: 3-18 - Tithi Dwary, K. V. Krishna:
Word-Representability of Graphs with respect to Split Recomposition. CoRR abs/2401.01954 (2024) - Alexander Firbas, Manuel Sorge:
On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting. CoRR abs/2401.16296 (2024) - Yixin Cao, Jan Derbisz, Tomasz Krawczyk:
Characterization of Chordal Circular-arc Graphs: I. Split Graphs. CoRR abs/2403.01947 (2024) - Aaron Kujawa, Reuben Dorent, Sébastien Ourselin, Tom Vercauteren:
Label merge-and-split: A graph-colouring approach for memory-efficient brain parcellation. CoRR abs/2404.10572 (2024) - Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs. CoRR abs/2405.10556 (2024) - Marko Lalovic:
Exact Algorithms for MaxCut on Split Graphs. CoRR abs/2405.20599 (2024)
skipping 480 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-09-26 12: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