Остановите войну!
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 34 matches
- 2010
- Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Xujin Chen, Xiaodong Hu, Bi Li:
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data. AAIM 2010: 13-24 - Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin:
The (K, k)-Capacitated Spanning Tree Problem. AAIM 2010: 25-34 - Qing-Guo Bai, Jian-Teng Xu:
Optimal Algorithms for the Economic Lot-Sizing Problem with Multi-supplier. AAIM 2010: 35-45 - Reinhard Bauer, Marcus Krug, Sascha Meinert, Dorothea Wagner:
Synthetic Road Networks. AAIM 2010: 46-57 - Vittorio Bilò, Angelo Fanelli:
Computing Exact and Approximate Nash Equilibria in 2-Player Games. AAIM 2010: 58-69 - Yajun Chai, Bo Liu:
Where Would Refinancing Preferences Go? AAIM 2010: 70-77 - Zhi-Zhong Chen, Michael R. Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang, Binhai Zhu:
A Linear Kernel for Co-Path/Cycle Packing. AAIM 2010: 90-102 - Zhi-Zhong Chen, Sayuri Konno, Yuki Matsushita:
Approximating Maximum Edge 2-Coloring in Simple Graphs. AAIM 2010: 78-89 - Wenqiang Dai:
Some Results on Incremental Vertex Cover Problem. AAIM 2010: 112-118 - Jun Dai, Liyun Ni, Xiangrong Wang, Weizhong Chen:
A VaR Algorithm for Warrants Portfolio. AAIM 2010: 103-111 - Christian Ernst, Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor:
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction. AAIM 2010: 119-130 - Chenglin Fan, Jun Luo:
Point Location in the Continuous-Time Moving Network. AAIM 2010: 131-140 - Bin Fu, Yumei Huo, Hairong Zhao:
Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints. AAIM 2010: 141-149 - Xiucui Guan, Binwu Zhang:
Inverse 1-median Problem on Trees under Weighted l∞ Norm. AAIM 2010: 150-160 - Qiaoming Han, Abraham P. Punnen:
On the Approximability of the Vertex Cover and Related Problems. AAIM 2010: 161-169 - Dag Haugland, Sin C. Ho:
Feasibility Testing for Dial-a-Ride Problems. AAIM 2010: 170-179 - Songbo Huang, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Siu-Ming Yiu:
Indexing Similar DNA Sequences. AAIM 2010: 180-190 - Ming Liu, Chengbin Chu, Yinfeng Xu, Lu Wang:
Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint. AAIM 2010: 191-198 - Lixia Liu, Sanyang Liu:
A New Smoothing Newton Method for Symmetric Cone Complementarity Problems. AAIM 2010: 199-208 - Yuting Liu, Zhiming Ma:
Comparison of Two Algorithms for Computing Page Importance. AAIM 2010: 1-11 - Wenchang Luo, Lin Chen, Guochuan Zhang:
Approximation Algorithms for Scheduling with a Variable Machine Maintenance. AAIM 2010: 209-219 - Cuixia Miao, Yuzhong Zhang, Chengfei Wang:
Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines. AAIM 2010: 220-228 - Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma:
Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles. AAIM 2010: 229-242 - Daniel Ralph, Yves Smeers:
The Invisible Hand for Risk Averse Investment in Electricity Generation. AAIM 2010: 12 - Zhen Wang, Donglei Du, Dachuan Xu:
A Primal-Dual Approximation Algorithm for the k-Level Stochastic Facility Location Problem. AAIM 2010: 253-260 - Lusheng Wang, Yong Yang, Guohui Lin:
Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive. AAIM 2010: 243-252 - Yong Wu, Qifan Yang:
Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision. AAIM 2010: 261-270 - Ge Xia, Yong Zhang:
Kernelization for Cycle Transversal Problems. AAIM 2010: 293-303 - Yong Zhang, Zhuo Chang, Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin:
Online Uniformly Inserting Points on Grid. AAIM 2010: 281-292 - Hui Zhang, Qing Guo, Costas S. Iliopoulos:
Varieties of Regularities in Weighted Sequences. AAIM 2010: 271-280
skipping 4 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-04-25 03:47 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