Abstract is missing.
- Algorithms for the Ring Star ProblemXujin Chen, Xiaodong Hu, Zhongzheng Tang, Chenhao Wang, Ying Zhang. 3-16 [doi]
- Price Fluctuation in Online LeasingBjörn Feldkord, Christine Markarian, Friedhelm Meyer auf der Heide. 17-31 [doi]
- Novel Scheduling for Energy Management in MicrogridZaixin Lu, Jd Youngs, Zhi Chen, Miao Pan. 32-44 [doi]
- Improved Methods for Computing Distances Between Unordered Trees Using Integer ProgrammingEunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto. 45-60 [doi]
- Touring Convex Polygons in Polygonal Domain FencesArash Ahadi, Amirhossein Mozafari, Alireza Zarei. 61-75 [doi]
- On Interdependent Failure Resilient Multi-path Routing in Smart Grid Communication NetworkZishen Yang, Donghyun Kim, Wei Wang. 76-93 [doi]
- An Improved Branching Algorithm for (n, 3)-MaxSAT Based on Refined ObservationsWenjun Li, Chao Xu 0010, Jianxin Wang, Yongjie Yang. 94-108 [doi]
- Faster Algorithms for 1-Mappability of a SequenceMai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung. 109-121 [doi]
- Lexico-Minimum Replica Placement in MultitreesK. Alex Mills, R. Chandrasekaran, Neeraj Mittal. 122-137 [doi]
- Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter TractableNaomi Nishimura, Vijay Subramanya. 138-153 [doi]
- A New Graph Parameter to Measure LinearityPierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr. 154-168 [doi]
- Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed GraphsAlessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno. 169-181 [doi]
- Toward Energy-Efficient and Robust Clustering Algorithm on Mobile Ad Hoc Sensor NetworksHuamei Qi, Tailong Xiao, Anfeng Liu, Su Jiang. 182-195 [doi]
- The Cop Number of the One-Cop-Moves Game on Planar GraphsZiyuan Gao, Boting Yang. 199-213 [doi]
- The Price of Anarchy in Two-Stage Scheduling GamesDeshi Ye, Lin Chen 0009, Guochuan Zhang. 214-225 [doi]
- Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of AnarchyCong Chen, Paolo Penna, Yinfeng Xu. 226-240 [doi]
- An Improved Mechanism for Selfish Bin PackingXin Chen, Qingqin Nong, Qizhi Fang. 241-257 [doi]
- Hamiltonian Cycles in Covering Graphs of TreesPavol Hell, Hiroshi Nishiyama, Ladislav Stacho. 261-275 [doi]
- On k-Strong Conflict-Free MulticoloringLuisa Gargano, Adele A. Rescigno, Ugo Vaccaro. 276-290 [doi]
- Tropical Paths in Vertex-Colored GraphsJohanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, Hong Phong Pham. 291-305 [doi]
- The Spectral Radius and Domination Number of Uniform HypergraphsLiying Kang, Wei Zhang, Erfang Shan. 306-316 [doi]
- Complexity and Online Algorithms for Minimum Skyline Coloring of IntervalsThomas Erlebach, Fu-Hong Liu, Hsiang Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks. 317-332 [doi]
- Approximating k-Forest with Resource Augmentation: A Primal-Dual ApproachEric Angel, Nguyen Kim Thang, Shikha Singh. 333-347 [doi]
- Parameterized Approximation Algorithms for Some Location Problems in GraphsArne Leitert, Feodor F. Dragan. 348-361 [doi]
- Approximation Algorithms for Maximum Coverage with Group Budget ConstraintsLongkun Guo, Min Li, Dachuan Xu. 362-376 [doi]
- A Simple Greedy Algorithm for the Profit-Aware Social Team Formation ProblemShengxin Liu, Chung Keung Poon. 379-393 [doi]
- Doctor Rostering in Compliance with the New UK Junior Doctor ContractAnna Lavygina, Kris Welsh, Alan Crispin. 394-408 [doi]
- Bounds for Static Black-Peg AB MastermindChristian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav. 409-424 [doi]
- Classification Statistics in RFID SystemsZhenzao Wen, Jiapeng Huang, Linghe Kong, Min-You Wu, Guihai Chen. 425-440 [doi]
- On the Complexity of Robust Stable MarriageBegum Genc, Mohamed Siala 0002, Gilles Simonin, Barry O'Sullivan. 441-448 [doi]
- The Euclidean Vehicle Routing Problem with Multiple Depots and Time WindowsLiang Song, Hejiao Huang. 449-456 [doi]
- Online Algorithms for Non-preemptive Speed Scaling on Power-Heterogeneous ProcessorsAeshah Alsughayyir, Thomas Erlebach. 457-465 [doi]
- An Efficient Algorithm for Judicious Partition of HypergraphsTunzi Tan, Jihong Gui, Sainan Wang, Suixiang Gao, Wenguo Yang. 466-474 [doi]
- On Structural Parameterizations of the Matching Cut ProblemN. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare. 475-482 [doi]
- Longest Previous Non-overlapping Factors Table ComputationSupaporn Chairungsee, Maxime Crochemore. 483-491 [doi]
- Modeling and Verifying Multi-core ProgramsNan Zhang 0001, Zhenhua Duan, Cong Tian, Hongwei Du, Kai Yang. 492-500 [doi]
- Planar Vertex-Disjoint Cycle Packing: New Structures and Improved KernelQilong Feng, Xiaolu Liao, Jianxin Wang. 501-508 [doi]
- On the Linearization of Scaffolds Sharing Repeated ContigsMathias Weller, Annie Chateau, Rodolphe Giroudeau. 509-517 [doi]
- A Memetic Algorithm for the Linear Ordering Problem with Cumulative CostsTaoqing Zhou, Zhipeng Lü, Tao Ye, Kan Zhou. 518-526 [doi]