Abstract is missing.
- An Efficient Local Search Algorithm for Correlation Clustering on Large GraphsNathan Cordner, George Kollios. 3-15 [doi]
- Algorithms on a Path Covering Problem with Applications in TransportationRuxandra Marinescu-Ghemeci, Alexandru Popa 0001, Tiberiu Sîrbu. 16-28 [doi]
- Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated EdgesYuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni. 29-42 [doi]
- An O(log n)-Competitive Posted-Price Algorithm for Online Matching on the LineStephen Arndt, Josh Ascher, Kirk Pruhs. 43-67 [doi]
- Online Dominating Set and ColoringMinati De, Sambhav Khurana, Satyam Singh. 68-81 [doi]
- Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on Graphs Having Small Dominating SetsMaria Luíza L. da Cruz, Raquel S. F. Bravo, Rodolfo Oliveira, Uéverton S. Souza. 82-93 [doi]
- Exactly k MSTs: How Many Vertices Suffice?Apratim Dutta, Rahul Muthu, Anuj Tawari, V. Sunitha. 94-106 [doi]
- Minimum Monotone Tree Decomposition of Density Functions Defined on GraphsLucas Magee, Yusu Wang 0001. 107-125 [doi]
- Exact and Approximation Algorithms for the Multi-depot Data Mule Scheduling with Handling Time and Time Span ConstraintsMinqin Liu, Wei Yu, Zhaohui Liu, Xinmeng Guo. 129-140 [doi]
- Two Exact Algorithms for the Packet Scheduling ProblemFei Li 0001, Ningshi Yao. 141-153 [doi]
- Improved Scheduling with a Shared ResourceChristoph Damerius, Peter Kling, Florian Schneider. 154-167 [doi]
- An Energy-Efficient Scheduling Method for Real-Time Multi-workflow in Container CloudZai-Xing Sun, Zhikai Li, Chonglin Gu, Hejiao Huang. 168-181 [doi]
- Weakly Nondominated Solutions of Set-Valued Optimization Problems with Variable Ordering Structures in Linear SpacesZhiang Zhou, Wenbin Wei, Kequan Zhao. 185-195 [doi]
- The MaxIS-Shapley Value in Perfect GraphsJunqi Tan, Dongjing Miao, Pengyu Chen. 196-210 [doi]
- Asteroidal Sets and Dominating PathsOleksiy Al-saadi, Jamie Radcliffe. 211-225 [doi]
- A Novel Approximation Algorithm for Max-Covering Circle ProblemKaiqi Zhang, Siyuan Zhang, Jirun Gao, Hongzhi Wang, Hong Gao, Jianzhong Li. 226-238 [doi]
- GAMA: Genetic Algorithm for k-Coverage and Connectivity with Minimum Sensor Activation in Wireless Sensor NetworksSyed F. Zaidi, Kevin W. Gutama, Habib M. Ammari. 239-251 [doi]
- Simple Heuristics for the Rooted Max Tree Coverage ProblemJiang Zhou, Peng Zhang. 252-264 [doi]
- Efficient Algorithms for k-Submodular Function Maximization with p-System and d-Knapsack ConstraintWenzhe Zhang, Shufang Gong, Bin Liu 0009. 265-276 [doi]
- Data Summarization Beyond Monotonicity: Non-monotone Two-Stage Submodular MaximizationShaoJie Tang. 277-286 [doi]
- Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack MaximizationZhongzheng Tang, Jingwen Chen, Chenhao Wang, Tian Wang, Weijia Jia. 287-299 [doi]
- Improved Lower Bound for Estimating the Number of Defective ItemsNader H. Bshouty. 303-315 [doi]
- Popularity on the Roommate Diversity ProblemSteven Ge, Toshiya Itoh. 316-329 [doi]
- On Half Guarding PolygonsErik Krohn, Alex Pahlow, Zhongxiu Yang. 330-353 [doi]
- Dynamic Programming for the Fixed Route Hybrid Electric Aircraft Charging ProblemAnthony Deschênes, Raphaël Boudreault, Vanessa Simard, Jonathan Gaudreault, Claude-Guy Quimper. 354-365 [doi]
- Algorithms for the Ridesharing with Profit Constraint ProblemQian-Ping Gu, Jiajian Leo Liang. 366-379 [doi]
- Multi-Candidate Carpooling Routing Problem and Its Approximation AlgorithmsJiale Zhang, Xiuqi Huang, Zifeng Liu, Xiaofeng Gao 0001, Guihai Chen. 380-391 [doi]
- Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like GraphsTesshu Hanaka, Airi Ikeyama, Hirotaka Ono 0001. 392-405 [doi]
- The Line-Constrained Maximum Coverage Facility Location ProblemHiroki Maegawa, Naoki Katoh, Yuki Tokuni, Yuya Higashikawa. 406-418 [doi]
- On Connectedness of Solutions to Integer Linear SystemsTakasugu Shigenobu, Naoyuki Kamiyama. 421-433 [doi]
- An Exact Algorithm for the Line-Constrained Bottleneck k-Steiner Tree ProblemJianping Li, Suding Liu, Junran Lichen. 434-445 [doi]
- The Longest Subsequence-Repeated Subsequence ProblemManuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu. 446-458 [doi]
- +-PathsMingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang. 459-470 [doi]
- V-Words, Lyndon Words and Substring circ-UMFFsJacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth. 471-484 [doi]
- The Two-Center Problem of Uncertain Points on TreesHaitao Xu, Jingru Zhang. 485-497 [doi]
- Space-Time Graph Planner for Unsignalized Intersections with CAVsCaner Mutlu, Ionut Cardei, Mihaela Cardei. 498-511 [doi]
- The Two Sheriffs Problem: Cryptographic Formalization and GeneralizationKota Sugimoto, Takeshi Nakai, Yohei Watanabe 0001, Mitsugu Iwamoto. 512-523 [doi]