Остановите войну!
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
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 19 matches
- 2020
- Tatiana Belova, Ivan Bliznets:
Algorithms for (n, 3)-MAXSAT and parameterization above the all-true assignment. Theor. Comput. Sci. 803: 222-233 (2020) - Yong Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang:
Open-shop scheduling for unit jobs under precedence constraints. Theor. Comput. Sci. 803: 144-151 (2020) - Tiantian Chen, Bin Liu, Wenjing Liu, Qizhi Fang, Jing Yuan, Weili Wu:
A random algorithm for profit maximization in online social networks. Theor. Comput. Sci. 803: 36-47 (2020) - Yang Du, Yu-e Sun, He Huang, Liusheng Huang, Hongli Xu, Xiaocan Wu:
Quality-aware online task assignment mechanisms using latent topic model. Theor. Comput. Sci. 803: 130-143 (2020) - Qizhi Fang, Xin Chen, Qingqin Nong, Zongchao Zhang, Yongchang Cao, Yan Feng, Tao Sun, Suning Gong, Ding-Zhu Du:
General Rumor Blocking: An efficient random algorithm with martingale approach. Theor. Comput. Sci. 803: 82-93 (2020) - Chuangen Gao, Hai Du, Weili Wu, Hua Wang:
Viral marketing of online game by DS decomposition in social networks. Theor. Comput. Sci. 803: 10-21 (2020) - Xiao Han, Chunhong Zhang, Chenchen Guo, Yang Ji, Zheng Hu:
Distributed representation of knowledge graphs with subgraph-aware proximity. Theor. Comput. Sci. 803: 48-56 (2020) - Yi Hong, Jiandong Liu, Deying Li, Chuanwen Luo, Mengjie Chang:
Balanced-flow algorithm for path network planning in hierarchical spaces. Theor. Comput. Sci. 803: 196-206 (2020) - Franklin Kenter, Daphne E. Skipper, Dan Wilson:
Computing bounds on product graph pebbling numbers. Theor. Comput. Sci. 803: 160-177 (2020) - Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, Yao Xu, An Zhang:
Approximation algorithms for the three-machine proportionate mixed shop scheduling. Theor. Comput. Sci. 803: 57-70 (2020) - Bin Liu, Xiao Li, Huijuan Wang, Qizhi Fang, Junyu Dong, Weili Wu:
Profit Maximization problem with Coupons in social networks. Theor. Comput. Sci. 803: 22-35 (2020) - Hongtao Lv, Fan Wu, Tie Luo, Xiaofeng Gao, Guihai Chen:
Hardness of and approximate mechanism design for the bike rebalancing problem. Theor. Comput. Sci. 803: 105-115 (2020) - Heng-Zhao Ma, Jianzhong Li:
An O(logn) query time algorithm for reducing ϵ-NN to (c, r)-NN. Theor. Comput. Sci. 803: 178-195 (2020) - Dongjing Miao, Jiguo Yu, Zhipeng Cai:
The hardness of resilience for nested aggregation query. Theor. Comput. Sci. 803: 152-159 (2020) - Daiki Miyahara, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone:
Practical card-based implementations of Yao's millionaire protocol. Theor. Comput. Sci. 803: 207-221 (2020) - Yishuo Shi, Yingli Ran, Zhao Zhang, Ding-Zhu Du:
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem. Theor. Comput. Sci. 803: 1-9 (2020) - Ruidong Yan, Yuqing Zhu, Deying Li, Yongcai Wang:
Community based acceptance probability maximization for target users on social networks: Algorithms and analysis. Theor. Comput. Sci. 803: 116-129 (2020) - Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New LP relaxations for Minimum Cycle/Path/Tree Cover Problems. Theor. Comput. Sci. 803: 71-81 (2020) - Chaoli Zhang, Jiapeng Xie, Fan Wu, Xiaofeng Gao, Guihai Chen:
Pricing and allocation algorithm designs in dynamic ridesharing system. Theor. Comput. Sci. 803: 94-104 (2020)
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-29 12:32 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