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 14 matches
- 2018
- Zihe Chen, Danyang Chen, Xiangyu Wang, Robert J. Damiano, Hui Meng, Jinhui Xu:
Novel geometric approach for virtual coiling. Theor. Comput. Sci. 734: 3-14 (2018) - Zhi-Zhong Chen, Youta Harada, Fei Guo, Lusheng Wang:
Approximation algorithms for the scaffolding problem and its generalizations. Theor. Comput. Sci. 734: 131-141 (2018) - Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang:
Compressed cliques graphs, clique coverings and positive zero forcing. Theor. Comput. Sci. 734: 119-130 (2018) - Qilong Feng, Neng Huang, Xiong Jiang, Jianxin Wang:
Dealing with several parameterized problems by random methods. Theor. Comput. Sci. 734: 94-104 (2018) - Qilong Feng, Shaohua Li, Zeyang Zhou, Jianxin Wang:
Parameterized algorithms for Edge Biclique and related problems. Theor. Comput. Sci. 734: 105-118 (2018) - Xingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu:
Solving the maximum internal spanning tree problem on interval graphs in polynomial time. Theor. Comput. Sci. 734: 32-37 (2018) - Yunlong Liu, Shaokai Wang, Jianxin Wang:
Parameterized counting matching and packing: A family of hard problems that admit FPTRAS. Theor. Comput. Sci. 734: 83-93 (2018) - Yuzhe Ma, Kun He, John E. Hopcroft, Pan Shi:
Neighbourhood-preserving dimension reduction via localised multidimensional scaling. Theor. Comput. Sci. 734: 58-71 (2018) - Lili Mei, Deshi Ye, Guochuan Zhang:
Mechanism design for one-facility location game with obnoxious effects on a line. Theor. Comput. Sci. 734: 46-57 (2018) - Lianrong Pu, Yu Lin, Daming Zhu, Haitao Jiang:
Can a breakpoint graph be decomposed into none other than 2-cycles? Theor. Comput. Sci. 734: 38-45 (2018) - Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin:
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops. Theor. Comput. Sci. 734: 24-31 (2018) - Yongjie Yang, Yash Raj Shrestha, Wenjun Li, Jiong Guo:
On the kernelization of split graph problems. Theor. Comput. Sci. 734: 72-82 (2018) - Daming Zhu, Sergey Bereg:
Preface. Theor. Comput. Sci. 734: 1-2 (2018) - Peng Zou, Hui Li, Wencheng Wang, Chunlin Xin, Binhai Zhu:
Finding disjoint dense clubs in a social network. Theor. Comput. Sci. 734: 15-23 (2018)
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-11-04 04:06 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