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 26 matches
- 2018
- Nan Zhang, Zhenhua Duan, Cong Tian, Hongwei Du:
A Novel Approach to Verifying Context Free Properties of Programs. AAIM 2018: 74-87 - Wei Ding, Ke Qiu:
Minimum Diameter k-Steiner Forest. AAIM 2018: 1-11 - Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems. AAIM 2018: 221-232 - Robert Benkoczi, Daya Ram Gaur, Xiao Zhang:
Order Preserving Barrier Coverage with Weighted Sensors on a Line. AAIM 2018: 244-255 - Changjie Cheng, Changhong Lu, Yu Zhou:
The k-power Domination Problem in Weighted Trees. AAIM 2018: 149-160 - Francis Y. L. Chin, Sheung-Hung Poon, Hing-Fung Ting, Dachuan Xu, Dongxiao Yu, Yong Zhang:
Approximation and Competitive Algorithms for Single-Minded Selling Problem. AAIM 2018: 98-110 - Yang Du, Yu-e Sun, He Huang, Liusheng Huang, Hongli Xu, Xiaocan Wu:
Quality-Aware Online Task Assignment Using Latent Topic Model. AAIM 2018: 124-135 - 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. AAIM 2018: 161-176 - András Faragó:
A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory. AAIM 2018: 281-292 - Krishnendu Ghosh:
Computation of Kullback-Leibler Divergence Between Labeled Stochastic Systems with Non-identical State Spaces. AAIM 2018: 233-243 - Jihong Gui, Wenguo Yang, Suixiang Gao, Zhipeng Jiang:
A Robust Power Optimization Algorithm to Balance Base Stations' Load in LTE-A Network. AAIM 2018: 177-189 - Xiao Han, Chunhong Zhang, Chenchen Guo, Tingting Sun, Yang Ji:
Knowledge Graph Embedding Based on Subgraph-Aware Proximity. AAIM 2018: 306-318 - Bin Liu, Xiao Li, Huijuan Wang, Qizhi Fang, Junyu Dong, Weili Wu:
Profit Maximization Problem with Coupons in Social Networks. AAIM 2018: 49-61 - Longcheng Liu, Guanqun Ni, Yong Chen, Randy Goebel, Yue Luo, An Zhang, Guohui Lin:
Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop. AAIM 2018: 268-280 - Hongtao Lv, Fan Wu, Tie Luo, Xiaofeng Gao, Guihai Chen:
Achieving Location Truthfulness in Rebalancing Supply-Demand Distribution for Bike Sharing. AAIM 2018: 256-267 - Tianyi Mao:
Determination of Dual Distances for a Kind of Perfect Mixed Codes. AAIM 2018: 88-97 - Daniel R. Page, Roberto Solis-Oba:
Makespan Minimization on Unrelated Parallel Machines with a Few Bags. AAIM 2018: 24-35 - Yishuo Shi, Zhao Zhang, Ding-Zhu Du:
A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem. AAIM 2018: 62-73 - Ian Albuquerque Raymundo Da Silva, Gruia Calinescu, Nathan De Graaf:
Faster Compression of Patterns to Rectangle Rule Lists. AAIM 2018: 190-208 - K. Subramani, Piotr Wojciechowski, Zachary Santer, Matthew Anderson:
An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints. AAIM 2018: 111-123 - Tingting Sun, Chunhong Zhang, Yang Ji:
Factors Impacting the Label Denoising of Neural Relation Extraction. AAIM 2018: 12-23 - Kai Wang:
Calibration Scheduling with Time Slot Cost. AAIM 2018: 136-148 - Ruidong Yan, Yuqing Zhu, Deying Li, Yongcai Wang:
Community-Based Acceptance Probability Maximization for Target Users on Social Networks. AAIM 2018: 293-305 - Chaoli Zhang, Jiapeng Xie, Fan Wu, Xiaofeng Gao, Guihai Chen:
Algorithm Designs for Dynamic Ridesharing System. AAIM 2018: 209-220 - Junlei Zhu, Yuehua Bu:
Channel Assignment with r-Dynamic Coloring. AAIM 2018: 36-48 - Shaojie Tang, Ding-Zhu Du, David L. Woodruff, Sergiy Butenko:
Algorithmic Aspects in Information and Management - 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3-4, 2018, Proceedings. Lecture Notes in Computer Science 11343, Springer 2018, ISBN 978-3-030-04617-0 [contents]
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-10 06:28 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