Abstract is missing.
- The Square Root Phenomenon in Planar GraphsDániel Marx. 1 [doi]
- An Algorithm for Determining Whether a Pair of Polygons Is ReversibleJin Akiyama, Hyunwoo Seong. 2-3 [doi]
- Disjoint Small Cycles in Graphs and Bipartite GraphsDing Ma, Yunshu Gao. 4-11 [doi]
- An Algorithm for Listing All Minimal 2-Dominating Sets of a TreeMarcin Krzywkowski. 12-16 [doi]
- Algorithms for Testing Length Four PermutationsYijie Han, Sanjeev Saxena. 17-23 [doi]
- Partial Degree Bounded Edge Packing Problem with Arbitrary BoundsPawan Aurora, Sumit Singh, Shashank K. Mehta. 24-35 [doi]
- Faster Exact Computation of rSPR DistanceZhi-Zhong Chen, Lusheng Wang. 36-47 [doi]
- Arbitrated Quantum Signature Schemes: Attacks and SecurityXiangfu Zou, Daowen Qiu. 48-59 [doi]
- Randomized Algorithms for Removable Online Knapsack ProblemsXin Han, Yasushi Kawase, Kazuhisa Makino. 60-71 [doi]
- An Exact Algorithm for Maximum Independent Set in Degree-5 GraphsMingyu Xiao, Hiroshi Nagamochi. 72-83 [doi]
- FWLS: A Local Search for Graph ColoringWei Wu, Chuan Luo, Kaile Su. 84-93 [doi]
- A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square RhomboidsMark Korenblit, Vadim E. Levit. 94-105 [doi]
- Monomial Testing and ApplicationsShenshi Chen. 106-117 [doi]
- The Optimal Rescue Path Set Problem in Undirected GraphsHuili Zhang, Yinfeng Xu. 118-129 [doi]
- Expected Computations on Color Spanning SetsChenglin Fan, Jun Luo, Farong Zhong, Binhai Zhu. 130-141 [doi]
- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite GraphsMin Lu, Tian Liu, Ke Xu. 142-152 [doi]
- Spanning Distribution Trees of GraphsMasaki Kawabata, Takao Nishizeki. 153-162 [doi]
- A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman ProblemJinghao Sun, Yakun Meng, Guozhen Tan. 163-174 [doi]
- Zero-Visibility Cops and Robber Game on a GraphDariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang. 175-186 [doi]
- k, ℓ)-Graph Sandwich ProblemsFernanda Couto, Luerbio Faria, Sulamita Klein, Fábio Protti, Loana Tito Nogueira. 187-197 [doi]
- Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority ConstraintsJason Crampton, Robert Crowston, Gregory Gutin, Mark Jones, M. S. Ramanujan. 198-209 [doi]
- Two-Round Discrete Voronoi Game along a LineAritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das. 210-220 [doi]
- Inverse Maximum Flow Problems under the Combining NormsLongcheng Liu. 221-230 [doi]
- The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and DigraphsCarlos A. Martinhon, Luérbio Faria. 231-240 [doi]
- A Cost-Efficient Scheduling Algorithm for Traffic GroomingXianrong Liu, Wenhong Tian, Minxian Xu, Qin Xiong. 241-249 [doi]
- Strategies of Groups Evacuation from a Convex Region in the PlaneYinfeng Xu, Lan Qin. 250-260 [doi]
- Kernelization and Lower Bounds of the Signed Domination ProblemYing Zheng, Jianxin Wang, Qilong Feng. 261-271 [doi]
- On Edge-Independent SetsTon Kloks, Ching-Hao Liu, Sheung-Hung Poon. 272-283 [doi]
- On the Complexity of Approximate Sum of Sorted ListBin Fu. 284-293 [doi]
- Large Hypertree Width for Sparse Random HypergraphsChaoyi Wang, Tian Liu, Ke Xu. 294-302 [doi]
- On Perfect Absorbants in De Bruijn DigraphsYue-Li Wang, Kuo-Hua Wu, Ton Kloks. 303-314 [doi]
- Multi-Multiway Cut Problem on Graphs of Bounded Branch WidthXiaojie Deng, Bingkai Lin, Chihao Zhang. 315-324 [doi]
- Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability ConstraintsYumei Huo, Hairong Zhao. 325-338 [doi]
- Zero-Sum Flow Numbers of Hexagonal GridsTao-Ming Wang, Guang-Hui Zhang. 339-349 [doi]
- k-AnonymityRobert Bredereck, André Nichterlein, Rolf Niedermeier. 350-361 [doi]