Abstract is missing.
- Complexity and Enumeration in Models of Genome RearrangementLora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Elizabeth Bailey Matson, Inne Singgih, Grace Stadnyk, Xinyi Wang, Alexander Wiedemann. 3-14 [doi]
- Conditional Automatic Complexity and Its MetricsBjørn Kjos-Hanssen. 15-28 [doi]
- Streaming and Query Once Space Complexity of Longest Increasing SubsequenceXin Li, Yu Zheng. 29-60 [doi]
- Approximating Decision Trees with Priority HypothesesJing Yuan 0002, ShaoJie Tang. 61-70 [doi]
- Approximating the λ-low-density ValueJoachim Gudmundsson, Zijin Huang, Sampson Wong. 71-82 [doi]
- Exponential Time Complexity of the Complex Weighted Boolean #CSPYing Liu. 83-96 [doi]
- Hardness and Approximation for the Star β-Hub Routing Cost Problem in $\varDelta _\beta $-Metric GraphsMeng-Shiou Tsai, Sun-Yuan Hsieh, Ling-Ju Hung. 97-111 [doi]
- Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx GraphsMarc Hellmuth, Guillaume E. Scholz. 115-126 [doi]
- Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-WidthWeidong Luo. 127-140 [doi]
- Shortest Longest-Path Graph OrientationsYuichi Asahiro, Jesper Jansson 0001, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono 0001, Quan Xue, Shay Zakov. 141-154 [doi]
- Sink Location Problems in Dynamic Flow Grid NetworksYuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni. 155-167 [doi]
- List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite GraphsBanu Baklan Sen, Öznur Yasar Diner, Thomas Erlebach. 168-181 [doi]
- Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General GraphsKangyi Tian, Mingyu Xiao 0001, Boting Yang. 182-194 [doi]
- Sum-of-Local-Effects Data Structures for Separable GraphsXing Lyu, Travis Gagie, Meng He 0001, Yakov Nekrich, Norbert Zeh. 195-206 [doi]
- Variants of Euclidean k-Center ClusteringsShin-Ichi Nakano. 209-219 [doi]
- Red-Black Spanners for Mixed-Charging Vehicular NetworksSergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu. 220-231 [doi]
- Self-stabilizing $(\varDelta +1)$-Coloring in Sublinear (in $\varDelta $) Rounds via Locally-Iterative AlgorithmsXinyu Fu 0009, Yitong Yin, Chaodong Zheng. 232-243 [doi]
- On Detecting Some Defective Items in Group TestingNader H. Bshouty, Catherine A. Haddad-Zaknoon. 244-271 [doi]
- An Efficient Data Analysis Method for Big Data Using Multiple-Model Linear RegressionBohan Lyu, Jianzhong Li 0001. 272-284 [doi]
- Multi-Load Agent Path Finding for Online Pickup and Delivery ProblemYifei Li, Hao Ye, Ruixi Huang, Hejiao Huang, Hongwei Du. 285-296 [doi]
- Improved Sourcewise Roundtrip Spanners with Constant StretchEli Stafford, Chunjiang Zhu. 297-309 [doi]
- Randomized Data Partitioning with Efficient Search, Retrieval and Privacy-PreservationM. Oguzhan Külekci. 310-323 [doi]
- The k Edge-Vertex Domination ProblemPeng Li, Xingli Zhou, Zhiang Zhou. 324-334 [doi]
- Resource-Adaptive Newton's Method for Distributed LearningShuzhen Chen 0001, Yuan Yuan, Youming Tao 0001, Zhipeng Cai 0001, Dongxiao Yu. 335-346 [doi]
- DR-Submodular Function Maximization with Adaptive StepsizeYanfei Li, Min Li, Qian Liu, Yang Zhou. 347-358 [doi]
- On the Routing Problems in Graphs with Ordered Forbidden TransitionsKota Kumakura, Akira Suzuki, Yuma Tamura, Xiao Zhou 0001. 359-370 [doi]
- Delaying Decisions and Reservation CostsElisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith. 371-383 [doi]
- A PTAS Framework for Clustering Problems in Doubling MetricsDi Wu, Jinhui Xu, Jianxin Wang. 384-397 [doi]
- A Physical Zero-Knowledge Proof for Sumplete, a Puzzle Generated by ChatGPTKyosuke Hatsugai, Kyoichi Asano, Yoshiki Abe. 398-410 [doi]