default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 36 matches
- 2024
- Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu
, Daniel J. Zhang:
Distance queries over dynamic interval graphs. Comput. Geom. 122: 102103 (2024) - 2023
- Muhammad Farhan, Qing Wang:
Efficient maintenance of highway cover labelling for distance queries on large dynamic graphs. World Wide Web (WWW) 26(5): 2427-2452 (2023) - Lohan Meunier, Ying Zhao:
Reachability Queries on Dynamic Temporal Bipartite Graphs. SIGSPATIAL/GIS 2023: 97:1-97:11 - Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang:
Distance Queries over Dynamic Interval Graphs. ISAAC 2023: 18:1-18:19 - Chenglin Zeng, Chuan Hu, Huajin Wang, Zhihong Shen:
SciDG: Benchmarking Scientific Dynamic Graph Queries. SSDBM 2023: 4:1-4:12 - 2022
- Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Using Active Queries to Infer Symmetric Node Functions of Graph Dynamical Systems. J. Mach. Learn. Res. 23: 251:1-251:43 (2022) - Khaled Ammar, Siddhartha Sahu, Semih Salihoglu, M. Tamer Özsu:
Optimizing Differentially-Maintained Recursive Queries on Dynamic Graphs. Proc. VLDB Endow. 15(11): 3186-3198 (2022) - Qing Chen, Oded Lachish, Sven Helmer, Michael H. Böhlen:
Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs. Proc. VLDB Endow. 15(11): 3263-3276 (2022) - Xin Chen, You Peng, Sibo Wang, Jeffrey Xu Yu:
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs. Proc. VLDB Endow. 15(8): 1645-1657 (2022) - Minxin Du, Shuangke Wu, Qian Wang, Dian Chen, Peipei Jiang, Aziz Mohaisen:
GraphShield: Dynamic Large Graphs for Secure Queries With Forward Privacy. IEEE Trans. Knowl. Data Eng. 34(7): 3295-3308 (2022) - Zequan Xu, Siqiang Luo, Jieming Shi, Hui Li, Chen Lin, Qihang Sun, Shaofeng Hu:
Efficiently Answering k-hop Reachability Queries in Large Dynamic Graphs for Fraud Feature Extraction. MDM 2022: 238-245 - Qing Chen, Oded Lachish, Sven Helmer, Michael H. Böhlen:
Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs (Extended version). CoRR abs/2207.06887 (2022) - Khaled Ammar, Siddhartha Sahu, Semih Salihoglu, M. Tamer Özsu:
Optimizing Differentially-Maintained Recursive Queries on Dynamic Graphs. CoRR abs/2208.00273 (2022) - 2021
- You Peng, Wenjie Zhao, Wenjie Zhang, Xuemin Lin, Ying Zhang:
DLQ: A System for Label-Constrained Reachability Queries on Dynamic Graphs. CIKM 2021: 4764-4768 - Qiuyi Lyu, Yuchen Li, Bingsheng He, Bin Gong:
DBL: Efficient Reachability Queries on Dynamic Graphs. DASFAA (2) 2021: 761-777 - Qiuyi Lyu, Yuchen Li, Bingsheng He, Bin Gong:
DBL: Efficient Reachability Queries on Dynamic Graphs (Complete Version). CoRR abs/2101.09441 (2021) - 2020
- Luo Xiangyu, Luo Yingxiao, Xiaolin Gui, Zhenhua Yu:
An Efficient Snapshot Strategy for Dynamic Graph Storage Systems to Support Historical Queries. IEEE Access 8: 90838-90846 (2020) - Xuanming Liu, Tingjian Ge:
Mining Dynamic Graph Streams for Predictive Queries Under Resource Constraints. PAKDD (2) 2020: 31-43 - Suman Banerjee, Bithika Pal, Mamata Jenamani:
DySky: Dynamic Skyline Queries on Uncertain Graphs. WISE (1) 2020: 242-254 - Suman Banerjee, Bithika Pal:
DySky: Dynamic Skyline Queries on Uncertain Graphs. CoRR abs/2004.02564 (2020) - 2018
- Anand Tripathi, Rahul R. Sharma, Manu Khandelwal, Tanmay Mehta:
Incremental parallel computing for continuous queries in dynamic graphs using a transactional model. Concurr. Comput. Pract. Exp. 30(18) (2018) - 2016
- Joong-Hyun Choi, Kang-Woo Lee, Eun-Sun Cho:
Experience of event stream processing for top-k queries and dynamic graphs. DEBS 2016: 330-335 - Jayanta Mondal, Amol Deshpande:
CASQD: continuous detection of activity-based subgraph pattern queries on dynamic graphs. DEBS 2016: 226-237 - Marco Minutoli, Vito Giovanni Castellana, Antonino Tumeo, Fabrizio Ferrandi, Marco Lattuada:
A Dynamically Scheduled Architecture for the Synthesis of Graph Database Queries. FCCM 2016: 136 - Pablo Muñoz, Nils Vortmeier, Thomas Zeume:
Dynamic Graph Queries. ICDT 2016: 14:1-14:18 - 2015
- Yishi Lin, Xiaowei Chen, John C. S. Lui:
I/O Efficient Algorithms for Exact Distance Queries on Disk-Resident Dynamic Graphs. ASONAM 2015: 440-447 - Pablo Muñoz, Nils Vortmeier, Thomas Zeume:
Dynamic Graph Queries. CoRR abs/1512.05511 (2015) - 2014
- Meng He, Ganggui Tang, Norbert Zeh:
Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries. ISAAC 2014: 128-140 - Jayanta Mondal, Amol Deshpande:
EAGr: supporting continuous ego-centric aggregate queries over large dynamic graphs. SIGMOD Conference 2014: 1335-1346 - Andy Diwen Zhu, Wenqing Lin, Sibo Wang, Xiaokui Xiao:
Reachability queries on large dynamic graphs: a total order approach. SIGMOD Conference 2014: 1323-1334
skipping 6 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-12-07 06:09 CET 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
