Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. AAIM 2014: Vancouver, BC, Canada
- Qianping Gu, Pavol Hell, Boting Yang:
Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings. Lecture Notes in Computer Science 8546, Springer 2014, ISBN 978-3-319-07955-4
Contributed Papers
- Peter Brass, Hyeon-Suk Na, Chan-Su Shin
:
Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme. 1-12 - Haitao Jiang, Bing Su, Mingyu Xiao, Yinfeng Xu, Farong Zhong, Binhai Zhu:
On the Exact Block Cover Problem. 13-22 - Guanqun Ni, Yinfeng Xu, Yucheng Dong:
Minimax Regret k-sink Location Problem in Dynamic Path Networks. 23-31 - Francis Y. L. Chin, Bin Fu, Minghui Jiang, Hing-Fung Ting, Yong Zhang:
Competitive Algorithms for Unbounded One-Way Trading. 32-43 - Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Degree Anonymization by Vertex Addition. 44-55 - Yumei Huo:
Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints. 56-65 - Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Yue-Li Wang:
Edge-Clique Covers of the Tensor Product. 66-74 - Shian-Hua Lin, Shao-Hong Ding, Wei-Sheng Zeng:
Protein Name Recognition Based on Dictionary Mining and Heuristics. 75-87 - Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid:
A Facility Coloring Problem in 1-D. 88-99 - Daiki Hoshika, Eiji Miyano:
Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes. 100-111 - Well Y. Chiu, Mario Szegedy, Chengu Wang, Yixin Xu:
The Garden Hose Complexity for the Equality Function. 112-123 - Barbara Geissmann, Rastislav Srámek:
Finding Robust Minimum Cuts. 124-136 - Hela Masri, Saoussen Krichen, Adel Guitouni:
A Hybrid Genetic Algorithm for Solving the Unsplittable Multicommodity Flow Problem: The Maritime Surveillance Case. 137-148 - Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Multiple Sink Location Problems in Dynamic Path Networks. 149-161 - Shenwei Huang, Matthew Johnson, Daniël Paulusma:
Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs. 162-173 - Hayk Grigoryan, Hovhannes A. Harutyunyan:
New Lower Bounds on Broadcast Function. 174-184 - Tamal Biswas, Kenneth W. Regan:
Efficient Memoization for Approximate Function Evaluation over Sequence Arguments. 185-196 - Wei Ding, Guohui Lin:
Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights. 197-207 - Chengwei Guo, Leizhen Cai:
Obtaining Split Graphs by Edge Contraction. 208-218 - Leizhen Cai, Junjie Ye:
Parameterized Complexity of Connected Induced Subgraph Problems. 219-230 - Taibo Luo, Yinfeng Xu:
Semi-online Hierarchical Load Balancing Problem with Bounded Processing Times. 231-240 - Tian Liu:
Restricted Bipartite Graphs: Comparison and Hardness Results. 241-252 - Fengmao Lv, Guowu Yang, Shuangbao Wang, Fuyou Fan:
The Research on Controlling the Iteration of Quantum-Inspired Evolutionary Algorithms for Artificial Neural Networks. 253-262 - Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza:
On P 3-Convexity of Graphs with Bounded Degree. 263-274 - Elham Roshanbin:
The Competitive Diffusion Game in Classes of Graphs. 275-287 - Mingyu Xiao:
A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler. 288-298 - H. K. Dai, H. C. Su:
Clustering Performance of 3-Dimensional Hilbert Curves. 299-311 - Hovhannes A. Harutyunyan:
Broadcast Networks with Near Optimal Cost. 312-322 - Rabeb Mbarek, Mohamed Tmar, Hawete Hattab:
An Optimal Context for Information Retrieval. 323-330 - Lili Ding, Xiaoling Wang, Wanglin Kang:
An Auction-Bargaining Model for Initial Emission Permits. 331-340
a service of 
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.
last updated on 2024-04-18 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
