Abstract is missing.
- Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote SchemePeter Brass, Hyeon-Suk Na, Chan-Su Shin. 1-12 [doi]
- On the Exact Block Cover ProblemHaitao Jiang, Bing Su, Mingyu Xiao, Yinfeng Xu, Farong Zhong, Binhai Zhu. 13-22 [doi]
- Minimax Regret k-sink Location Problem in Dynamic Path NetworksGuanqun Ni, Yinfeng Xu, Yucheng Dong. 23-31 [doi]
- Competitive Algorithms for Unbounded One-Way TradingFrancis Y. L. Chin, Bin Fu, Minghui Jiang, Hing-Fung Ting, Yong Zhang. 32-43 [doi]
- The Complexity of Degree Anonymization by Vertex AdditionRobert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon. 44-55 [doi]
- Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time ConstraintsYumei Huo. 56-65 [doi]
- Edge-Clique Covers of the Tensor ProductWing-Kai Hon, Ton Kloks, Hsiang Hsuan Liu, Yue-Li Wang. 66-74 [doi]
- Protein Name Recognition Based on Dictionary Mining and HeuristicsShian-Hua Lin, Shao-Hong Ding, Wei-Sheng Zeng. 75-87 [doi]
- A Facility Coloring Problem in 1-DSandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid. 88-99 [doi]
- Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal NodesDaiki Hoshika, Eiji Miyano. 100-111 [doi]
- The Garden Hose Complexity for the Equality FunctionWell Y. Chiu, Mario Szegedy, Chengu Wang, Yixin Xu. 112-123 [doi]
- Finding Robust Minimum CutsBarbara Geissmann, Rastislav Srámek. 124-136 [doi]
- A Hybrid Genetic Algorithm for Solving the Unsplittable Multicommodity Flow Problem: The Maritime Surveillance CaseHela Masri, Saoussen Krichen, Adel Guitouni. 137-148 [doi]
- Multiple Sink Location Problems in Dynamic Path NetworksYuya Higashikawa, Mordecai J. Golin, Naoki Katoh. 149-161 [doi]
- Narrowing the Complexity Gap for Colouring (C s , P t )-Free GraphsShenwei Huang, Matthew Johnson 0002, Daniël Paulusma. 162-173 [doi]
- New Lower Bounds on Broadcast FunctionHayk Grigoryan, Hovhannes A. Harutyunyan. 174-184 [doi]
- Efficient Memoization for Approximate Function Evaluation over Sequence ArgumentsTamal Biswas, Kenneth W. Regan. 185-196 [doi]
- Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive WeightsWei Ding, Guohui Lin. 197-207 [doi]
- Obtaining Split Graphs by Edge ContractionChengwei Guo, Leizhen Cai. 208-218 [doi]
- Parameterized Complexity of Connected Induced Subgraph ProblemsLeizhen Cai, Junjie Ye. 219-230 [doi]
- Semi-online Hierarchical Load Balancing Problem with Bounded Processing TimesTaibo Luo, Yinfeng Xu. 231-240 [doi]
- Restricted Bipartite Graphs: Comparison and Hardness ResultsTian Liu. 241-252 [doi]
- The Research on Controlling the Iteration of Quantum-Inspired Evolutionary Algorithms for Artificial Neural NetworksFengmao Lv, Guowu Yang, Shuangbao Wang, Fuyou Fan. 253-262 [doi]
- On P 3-Convexity of Graphs with Bounded DegreeLucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza. 263-274 [doi]
- The Competitive Diffusion Game in Classes of GraphsElham Roshanbin. 275-287 [doi]
- A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and SimplerMingyu Xiao. 288-298 [doi]
- Clustering Performance of 3-Dimensional Hilbert CurvesH. K. Dai, H. C. Su. 299-311 [doi]
- Broadcast Networks with Near Optimal CostHovhannes A. Harutyunyan. 312-322 [doi]
- An Optimal Context for Information RetrievalRabeb Mbarek, Mohamed Tmar, Hawete Hattab. 323-330 [doi]
- An Auction-Bargaining Model for Initial Emission PermitsLili Ding, Xiaoling Wang, Wanglin Kang. 331-340 [doi]