Остановите войну!
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 583 matches
- 2022
- Yuehua Bu, Wenwen Chen, Junlei Zhu:
Injective Edge Coloring of Power Graphs and Necklaces. AAIM 2022: 413-420 - Yuehua Bu, Ruiying Yang, Hongguo Zhu:
The r-Dynamic Chromatic Number of Planar Graphs Without Special Short Cycles. AAIM 2022: 316-326 - Zian Chen, Bin Chen, Zhongzheng Tang, Zhuo Diao:
On the Transversal Number of k-Uniform Connected Hypergraphs. AAIM 2022: 376-387 - Jingwen Chen, Zhongzheng Tang, Chenhao Wang:
Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm. AAIM 2022: 144-155 - Yunlong Cheng, Hao Zhou, Xiaofeng Gao, Jiaqi Zheng, Guihai Chen:
Incremental SDN Deployment to Achieve Load Balance in ISP Networks. AAIM 2022: 278-290 - Qingzhen Dong, Xianyue Li, Yu Yang:
Partial Inverse Min-Max Spanning Tree Problem Under the Weighted Bottleneck Hamming Distance. AAIM 2022: 351-362 - Liman Du, Wenguo Yang, Suixiang Gao:
Adaptive Competition-Based Diversified-Profit Maximization with Online Seed Allocation. AAIM 2022: 183-194 - Ling Gai, Mengpei Liang, Chenhao Wang:
Obnoxious Facility Location Games with Candidate Locations. AAIM 2022: 96-105 - Mengxue Geng, Shufang Gong, Bin Liu, Weili Wu:
Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function Under Noise. AAIM 2022: 133-143 - Shuyang Gu, Chuangen Gao, Weili Wu:
A Binary Search Double Greedy Algorithm for Non-monotone DR-submodular Maximization. AAIM 2022: 3-14 - Xiaofeng Gu, William Zhang:
Cyclically Orderable Generalized Petersen Graphs. AAIM 2022: 303-315 - Jianxiong Guo, Qiufen Ni, Xingjian Ding:
A Decentralized Auction Framework with Privacy Protection in Mobile Crowdsourcing. AAIM 2022: 207-218 - Bo Hou, Zhenzhen Pang, Suogang Gao, Wen Liu:
Improved Approximation Algorithm for the Asymmetric Prize-Collecting TSP. AAIM 2022: 28-32 - Na Kang, Zhiquan Li, Lihang Hou, Jing Qu:
Mixed Metric Dimension of Some Plane Graphs. AAIM 2022: 363-375 - Huan Lan:
Energy-Constrained Geometric Coverage Problem. AAIM 2022: 268-277 - Quan-Lin Li, Yi-Meng Li, Jing-Yu Ma, Heng-Li Liu:
The Optimal Dynamic Rationing Policy in the Stock-Rationing Queue. AAIM 2022: 66-82 - Peng Li, Aifa Wang:
Polynomial Time Algorithm for k-vertex-edge Dominating Problem in Interval Graphs. AAIM 2022: 293-302 - Yan Li, Ye Wang:
Class Ramsey Numbers Involving Induced Graphs. AAIM 2022: 406-412 - Wanting Li, Yongcai Wang, Deying Li, Xiaojia Xu:
MCM: A Robust Map Matching Method by Tracking Multiple Road Candidates. AAIM 2022: 231-243 - Jianping Li, Runtao Xie, Junran Lichen, Guojun Hu, Pengxiang Pan, Ping Yang:
The Constrained Parallel-Machine Scheduling Problem with Divisible Processing Times and Penalties. AAIM 2022: 83-95 - Xiaofei Liu, Yaoyu Zhu, Weidong Li, Lei Ma:
On-line Single Machine Scheduling with Release Dates and Submodular Rejection Penalties. AAIM 2022: 55-65 - Zekun Lu, Qiancheng Yu, Xiaofeng Wang, Xiaoning Li:
Learning Signed Network Embedding via Muti-attention Mechanism. AAIM 2022: 444-455 - Chuanwen Luo, Yunan Hou, Yi Hong, Zhibo Chen, Ning Liu, Deying Li:
AoI Minimizing of Wireless Rechargeable Sensor Network Based on Trajectory Optimization of Laser-Charged UAV. AAIM 2022: 255-267 - Haobin Luo, Guowei Su, Yi Wang, Jiajia Zhang, Luobing Dong:
Hyperspectral Image Reconstruction for SD-CASSI Systems Based on Residual Attention Network. AAIM 2022: 466-475 - Qiufen Ni, Jianxiong Guo:
Profit Maximization for Multiple Products in Community-Based Social Networks. AAIM 2022: 219-230 - Bei Niu, Xin Zhang:
An Improvement of the Bound on the Odd Chromatic Number of 1-Planar Graphs. AAIM 2022: 388-393 - Ruiqing Sun, Xiaofei Liu:
Approximation Scheme for Single-Machine Rescheduling with Job Delay and Rejection. AAIM 2022: 35-45 - Shaojie Tang:
Constrained Stochastic Submodular Maximization with State-Dependent Costs. AAIM 2022: 121-132 - Shaojie Tang, Jing Yuan:
Streaming Adaptive Submodular Maximization. AAIM 2022: 109-120 - Yi Tian, Na Kang, Weili Wu, Ding-Zhu Du, Suogang Gao:
Distance Magic Labeling of the Halved Folded n-Cube. AAIM 2022: 327-338
skipping 553 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-20 13:42 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