Abstract is missing.
- Termination of Multipartite Graph Series Arising from Complex Network ModellingMatthieu Latapy, Thi Ha Duong Phan, Christophe Crespelle, Thanh Qui Nguyen. 1-10 [doi]
- Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid GridsAndreas Emil Feldmann, Shantanu Das, Peter Widmayer. 11-20 [doi]
- Evacuation of Rectilinear PolygonsSándor P. Fekete, Chris Gray, Alexander Kröller. 21-30 [doi]
- A Fast Algorithm for Powerful Alliances in TreesArarat Harutyunyan. 31-40 [doi]
- NP-Completeness of Spreading Colored PointsOvidiu Daescu, Wenqi Ju, Jun Luo. 41-50 [doi]
- Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search ApproachLoreto Gonzalez-Hernandez, Nelson Rangel-Valdez, Jose Torres-Jimenez. 51-64 [doi]
- Feasibility-Based Bounds Tightening via Fixed PointsPietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti. 65-76 [doi]
- A Characterisation of Stable Sets in Games with Transitive PreferenceTakashi Matsuhisa. 77-84 [doi]
- Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set ClusteringYi Shi, Maryam Hasan, Zhipeng Cai, Guohui Lin, Dale Schuurmans. 85-103 [doi]
- An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple RelationsWlodzimierz Bielecki, Tomasz Klimek, Marek Palkowski, Anna Beletska. 104-113 [doi]
- Bases of Primitive Nonpowerful Sign PatternsGuanglong Yu, Zhengke Miao, Jinlong Shu. 114-127 [doi]
- Extended Dynamic Subgraph Statistics Using ::::h::::-Index Parameterized Data StructuresDavid Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott. 128-141 [doi]
- Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level SetsYakov Zinder, Julia Memar, Gaurav Singh. 142-156 [doi]
- Finding Strong Bridges and Strong Articulation Points in Linear TimeGiuseppe F. Italiano, Luigi Laura, Federico Santaroni. 157-169 [doi]
- Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing NetworksNeng Fan, Panos M. Pardalos. 170-183 [doi]
- An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn GraphsVamsi Kundeti, Sanguthevar Rajasekaran, Dinh Heiu. 184-196 [doi]
- On the Hardness and Inapproximability of Optimization Problems on Power Law GraphsYilin Shen, Dung T. Nguyen, My T. Thai. 197-211 [doi]
- Cyclic Vertex Connectivity of Star GraphsZhihua Yu, Qinghai Liu, Zhao Zhang. 212-221 [doi]
- The Number of Shortest Paths in the (::::n::::, ::::k::::)-Star GraphsEddie Cheng, Ke Qiu, Zhizhang Shen. 222-236 [doi]
- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location ProblemsCristina Bazgan, Sonia Toubaline, Daniel Vanderpooten. 237-251 [doi]
- PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor NetworksHongwei Du, Qiang Ye, Jioafei Zhong, Yuexuan Wang, Wonjun Lee, Haesun Park. 252-259 [doi]
- A Primal-Dual Approximation Algorithm for the Asymmetric Prize-Collecting TSPViet Hung Nguyen. 260-269 [doi]
- Computing Toolpaths for 5-Axis NC MachinesDanny Z. Chen, Ewa Misiolek. 270-284 [doi]
- A Randomized Algorithm for Weighted Approximation of Points by a Step FunctionJin-Yi Liu. 300-308 [doi]
- Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate PolynomialsZhixiang Chen, Bin Fu. 309-323 [doi]
- The Union of Colorful Simplices Spanned by a Colored Point SetAndré Schulz, Csaba D. Tóth. 324-338 [doi]
- Compact Visibility Representation of 4-Connected Plane GraphsXin He, Jiun-Jie Wang, Huaming Zhang. 339-353 [doi]
- Some Variations on Constrained Minimum Enclosing Circle ProblemArindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya. 354-368 [doi]
- Searching for an Axis-Parallel ShorelineElmar Langetepe. 369-384 [doi]
- Bounded Length, 2-Edge Augmentation of Geometric Planar GraphsEvangelos Kranakis, Danny Krizanc, Oscar Morales Ponce, Ladislav Stacho. 385-397 [doi]
- Scheduling Packets with Values and Deadlines in Size-Bounded BuffersFei Li. 398-407 [doi]
- Transporting Jobs through a Processing Center with Two Parallel MachinesHans Kellerer, Alan J. Soper, Vitaly A. Strusevich. 408-422 [doi]