Остановите войну!
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 32 matches
- 2019
- Wei Ding:
Low-Dimensional Vectors with Density Bounded by 5/6 Are Pinwheel Schedulable. AAIM 2019: 51-61 - Wei Ding, Ke Qiu:
Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs. AAIM 2019: 62-71 - Wei Ding, Ke Qiu:
Updating Matrix Polynomials. AAIM 2019: 72-82 - Shareef Ahmed, Shin-Ichi Nakano, Md. Saidur Rahman:
One-Dimensional r-Gathering Under Uncertainty. AAIM 2019: 1-15 - Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang:
Improved Algorithms for Ranking and Unranking (k, m)-Ary Trees. AAIM 2019: 16-28 - Wenbin Chen, Jianer Chen:
Approximating Closest Vector Problem in ℓ∞ Norm Revisited. AAIM 2019: 42-50 - Zhixiang Chen, Qilong Feng, Bin Fu, Mugang Lin, Jianxin Wang:
Exponential Time Approximation Scheme for TSP. AAIM 2019: 121-128 - Mingyan Chen, Zhenbing Zeng:
A Probabilistic Algorithm for Verification of Geometric Theorems. AAIM 2019: 29-41 - Andreas W. M. Dress, Hiroshi Maehara, Sabrina Xing Mei Pang, Zhenbing Zeng:
On the Structure of Discrete Metric Spaces Isometric to Circles. AAIM 2019: 83-94 - Qilong Feng, Xiangzhong Meng, Guanlan Tan, Jianxin Wang:
A 2.57-Approximation Algorithm for Contig-Based Genomic Scaffold Filling. AAIM 2019: 95-107 - Henning Fernau, Ulrike Stege:
Profit Parameterizations of Dominating Set. AAIM 2019: 108-120 - Chuangen Gao, Shuyang Gu, Ruiqi Yang, Jiguo Yu, Weili Wu, Dachuan Xu:
Interaction-Aware Influence Maximization and Iterated Sandwich Method. AAIM 2019: 129-141 - Yufei Huang, Bo Hou, Wen Liu, Lidong Wu, Stephen Rainwater, Suogang Gao:
On Approximation Algorithm for the Edge Metric Dimension Problem. AAIM 2019: 142-148 - Sai Ji, Dachuan Xu, Longkun Guo, Min Li, Dongmei Zhang:
The Seeding Algorithm for Spherical k-Means Clustering with Penalties. AAIM 2019: 149-158 - Sai Ji, Dachuan Xu, Min Li, Yishui Wang:
Approximation Algorithm for the Correlation Clustering Problem with Non-uniform Hard Constrained Cluster Sizes. AAIM 2019: 159-168 - Fei Li:
Two-Way Currency Trading Algorithms in the Discrete Setting. AAIM 2019: 169-178 - Menghong Li, Yingli Ran, Zhao Zhang:
Approximation Algorithms for the Minimum Power Partial Cover Problem. AAIM 2019: 179-191 - Junran Lichen, Jianping Li, Ko-Wei Lih, Xingxing Yu:
On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length. AAIM 2019: 192-202 - Xiaofei Liu, Weidong Li:
A Primal Dual Approximation Algorithm for the Multicut Problem in Trees with Submodular Penalties. AAIM 2019: 203-211 - Changhong Lu, Qingjie Ye, Chengru Zhu:
Algorithmic Aspect on the Minimum (Weighted) Doubly Resolving Set Problem of Graphs. AAIM 2019: 212-222 - Chuanwen Luo, Lidong Wu, Wenping Chen, Yongcai Wang, Deying Li, Weili Wu:
Trajectory Optimization of UAV for Efficient Data Collection from Wireless Sensor Networks. AAIM 2019: 223-235 - Pablo Luiz Araújo Munhoz, Felipe P. do Carmo, Uéverton S. Souza, Lúcia M. A. Drummond, Pedro Henrique González, Luiz S. Ochi, Philippe Michelon:
Locality Sensitive Algotrithms for Data Mule Routing Problem. AAIM 2019: 236-248 - Qingqin Nong, Tao Sun, Suning Gong, Qizhi Fang, Ding-Zhu Du, Xiaoyu Shao:
Maximize a Monotone Function with a Generic Submodularity Ratio. AAIM 2019: 249-260 - Jian Sun, Haiyun Sheng, Yuefang Sun, Xiaoyan Zhang:
Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem. AAIM 2019: 261-271 - João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza:
A General Framework for Path Convexities. AAIM 2019: 272-283 - Qichao Wang, Yongming Li, Wei Zhou:
Weighted Two-Dimensional Finite Automata. AAIM 2019: 292-303 - Limin Wang, Zhao Zhang, Dachuan Xu, Xiaoyan Zhang:
An Approximation Algorithm for the Dynamic k-level Facility Location Problem. AAIM 2019: 284-291 - Mingyu Xiao, Zimo Sheng:
Improved Parameterized Algorithms for Mixed Domination. AAIM 2019: 304-315 - Yuan Xue, Boting Yang, Sandra Zilles:
New Results on the Zero-Visibility Cops and Robber Game. AAIM 2019: 316-328 - Ruiqi Yang, Shuyang Gu, Chuangen Gao, Weili Wu, Hua Wang, Dachuan Xu:
A Two-Stage Constrained Submodular Maximization. AAIM 2019: 329-340
skipping 2 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-06-04 10:34 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