Abstract is missing.
- Load-Balanced Virtual Backbone Construction for Wireless Sensor NetworksJing He, Shouling Ji, Yi Pan, Zhipeng Cai. 1-12 [doi]
- Maximum Matching in Multi-Interface NetworksAdrian Kosowski, Alfredo Navarra, Dominik Pajak, Maria Cristina Pinotti. 13-24 [doi]
- Stretch Factor in Wireless Sensor Networks with Directional AntennaeEvangelos Kranakis, Fraser MacQuarrie, Oscar Morales Ponce. 25-36 [doi]
- On the Minimum Diameter Cost-Constrained Steiner Tree ProblemWei Ding, Guoliang Xue. 37-48 [doi]
- The Edge-Centered Surface Area of the Arrangement GraphEddie Cheng, Ke Qiu, Zhizhang Shen. 49-60 [doi]
- On Zero Forcing Number of Permutation GraphsEunjeong Yi. 61-72 [doi]
- Complexity Results for the Empire Problem in Collection of StarsBasile Couëtoux, Jérôme Monnot, Sonia Toubaline. 73-82 [doi]
- Hamiltonian Paths and Cycles in Planar GraphsSudip Biswas, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat. 83-94 [doi]
- Feedback Vertex Sets on Tree Convex Bipartite GraphsChaoyi Wang, Tian Liu, Wei Jiang, Ke Xu. 95-102 [doi]
- Crossing Angles of Geometric GraphsKarin Arikushi, Csaba D. Tóth. 103-114 [doi]
- Multicut on Graphs of Bounded Clique-WidthMartin Lackner, Reinhard Pichler, Stefan Rümmele, Stefan Woltran. 115-126 [doi]
- Radiation Hybrid Map Construction Problem ParameterizedChihao Zhang, Haitao Jiang, Binhai Zhu. 127-137 [doi]
- On the Central Path ProblemYongding Zhu, Jinhui Xu. 138-150 [doi]
- On the Generalized Multiway Cut in Trees ProblemHong Liu, Peng Zhang. 151-162 [doi]
- Algorithms for Forest Local SimilarityZhewei Liang, Kaizhong Zhang. 163-175 [doi]
- Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians MethodYelena Frid, Dan Gusfield. 176-187 [doi]
- An Improved Approximation Algorithm for the Bandpass-2 ProblemZhi-Zhong Chen, Lusheng Wang. 188-199 [doi]
- The b-Matching Problem in Hypergraphs: Hardness and ApproximabilityMourad El Ouali, Gerold Jäger. 200-211 [doi]
- Resource Scheduling with Supply Constraint and Linear CostQiang Zhang, Weiwei Wu, Minming Li. 212-222 [doi]
- On Certain Geometric Properties of the Yao-Yao GraphsIyad A. Kanj, Ge Xia. 223-233 [doi]
- Distance-d Independent Set Problems for Bipartite and Chordal GraphsHiroshi Eto, Fengrui Guo, Eiji Miyano. 234-244 [doi]
- Domatic Partition on Several Classes of GraphsSheung-Hung Poon, William Chung-Kung Yen, Chin-Ting Ung. 245-256 [doi]
- Online Bottleneck MatchingBarbara M. Anthony, Christine Chung. 257-268 [doi]
- Streaming with Minimum Space: An Algorithm for Covering by Two Congruent BallsChung Keung Poon, Binhai Zhu. 269-280 [doi]
- Online Joint Pricing and Booking Policies in Airline Revenue ManagementGuanqun Ni, Yinfeng Xu. 281-290 [doi]
- Minimizing Total Weighted Completion Time with Unexpected Machine UnavailabilityYumei Huo, Boris Reznichenko, Hairong Zhao. 291-300 [doi]
- Characterizing Mechanisms in Obnoxious Facility GameKen Ibara, Hiroshi Nagamochi. 301-311 [doi]
- Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish MachinesXujin Chen, Xiaodong Hu, Weidong Ma, Changjun Wang. 312-323 [doi]
- Fast-Mixed Searching on GraphsBoting Yang. 324-335 [doi]
- Inapproximability after Uniqueness Phase Transition in Two-Spin SystemsJin-yi Cai, Xi Chen, Heng Guo, Pinyan Lu. 336-347 [doi]
- Dynamic Programming for a Biobjective Search Problem in a LineLuís Paquete, Mathias Jaschob, Kathrin Klamroth, Jochen Gorski. 348-359 [doi]
- Characterizing Graphs of Small Carving-WidthRémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos. 360-370 [doi]
- Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer ProgrammingNeng Fan, Jean-Paul Watson. 371-383 [doi]
- Measuring Structural Similarities of Graphs in Linear TimeZheng Fang, You Li, Jie Wang. 384-395 [doi]