Остановите войну!
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
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 105 matches
- 2023
- Qian-Ping Gu, Jiajian Leo Liang:
Algorithms for the Ridesharing with Profit Constraint Problem. COCOA (1) 2023: 366-379 - Qian-Ping Gu, Jiajian Leo Liang:
Algorithms and Computational Study on a Transportation System Integrating Public Transit and Ridesharing of Personal Vehicles. CoRR abs/2308.09191 (2023) - Qian-Ping Gu, Jiajian Leo Liang:
Algorithms for the Ridesharing with Profit Constraint Problem. CoRR abs/2310.04933 (2023) - 2022
- Ye Gong, Qian-Ping Gu:
An efficient oracle for counting shortest paths in planar graphs. Theor. Comput. Sci. 921: 75-85 (2022) - 2021
- Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang:
Approximate ridesharing of personal vehicles problem. Theor. Comput. Sci. 871: 30-50 (2021) - Ye Gong, Qian-Ping Gu:
An Efficient Oracle for Counting Shortest Paths in Planar Graphs. AAIM 2021: 406-417 - Qian-Ping Gu, Jiajian Leo Liang:
Multimodal Transportation with Ridesharing of Personal Vehicles. ISAAC 2021: 39:1-39:16 - Qian-Ping Gu, Jiajian Leo Liang:
Multimodal Transportation with Ridesharing of Personal Vehicles. CoRR abs/2106.00232 (2021) - 2020
- Anxiao He, Kai Bu, Yucong Li, Eikoh Chida, Qianping Gu, Kui Ren:
Atomos: Constant-Size Path Validation Proof. IEEE Trans. Inf. Forensics Secur. 15: 3832-3847 (2020) - Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang:
Approximate Ridesharing of Personal Vehicles Problem. COCOA 2020: 3-18 - Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang:
Approximate Ridesharing of Personal Vehicles Problem. CoRR abs/2007.15154 (2020) - 2019
- Qian-Ping Gu, Gengchun Xu:
Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs. Discret. Appl. Math. 257: 186-205 (2019) - Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang:
Efficient algorithms for ridesharing of personal vehicles. Theor. Comput. Sci. 788: 79-94 (2019) - Qian-Ping Gu, Gengchun Xu:
Constant query time (1 + ϵ)-approximate distance oracle for planar graphs. Theor. Comput. Sci. 761: 78-88 (2019) - 2018
- Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang:
Algorithmic analysis for ridesharing of personal vehicles. Theor. Comput. Sci. 749: 36-46 (2018) - 2017
- Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang:
Efficient Algorithms for Ridesharing of Personal Vehicles. COCOA (1) 2017: 340-354 - Qian-Ping Gu, Gengchun Xu:
Constant Query Time $(1 + ε)$-Approximate Distance Oracle for Planar Graphs. CoRR abs/1706.03108 (2017) - 2016
- Qianping Guo, Jinsong Leng, Deguang Han, Qingyu Fan, Houbiao Li, Qing Gao:
Adaptive Optimal Dual Frames for Signal Reconstruction With Erasures. IEEE Access 4: 7577-7584 (2016) - Zhengbing Bian, Qian-Ping Gu, Mingzhe Zhu:
Practical algorithms for branch-decompositions of planar graphs. Discret. Appl. Math. 199: 156-171 (2016) - Jiahua Yu, Qian-Ping Gu:
A Practical Algorithm for Embedding Graphs on Torus. Int. J. Netw. Comput. 6(2): 149-166 (2016) - Yingjie Xia, Mingzhe Zhu, Qianping Gu, Luming Zhang, Xuelong Li:
Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs. Inf. Sci. 374: 164-178 (2016) - Marjan Marzban, Qian-Ping Gu, Xiaohua Jia:
New analysis and computational study for the planar connected dominating set problem. J. Comb. Optim. 32(1): 198-225 (2016) - Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang:
Algorithmic Analysis for Ridesharing of Personal Vehicles. COCOA 2016: 438-452 - Qianping Guo, Jinsong Leng, Houbiao Li:
Distribution of Frame Coefficients. ISCID (2) 2016: 75-78 - 2015
- Qian-Ping Gu, Pavol Hell, Boting Yang:
Preface. Theor. Comput. Sci. 607: 1 (2015) - Jiahua Yu, Qian-Ping Gu:
A Practical Algorithm for Embedding Graphs on Torus. CANDAR 2015: 50-57 - Qian-Ping Gu, Gengchun Xu:
Constant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar Graphs. ISAAC 2015: 625-636 - 2014
- Qian-Ping Gu, Gengchun Xu:
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs. WG 2014: 238-249 - Qianping Gu, Pavol Hell, Boting Yang:
Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings. Lecture Notes in Computer Science 8546, Springer 2014, ISBN 978-3-319-07955-4 [contents] - Qianping Gu, Gengchun Xu:
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs. CoRR abs/1407.6761 (2014)
skipping 75 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-21 15:46 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