default search action
29th COCOON 2023: Hawaii, HI, USA - Part I
- Weili Wu, Guangmo Tong:
Computing and Combinatorics - 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part I. Lecture Notes in Computer Science 14422, Springer 2024, ISBN 978-3-031-49189-4
Complexity and Approximation
- Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Elizabeth Bailey Matson, Inne Singgih, Grace Stadnyk, Xinyi Wang, Alexander Wiedemann:
Complexity and Enumeration in Models of Genome Rearrangement. 3-14 - Bjørn Kjos-Hanssen:
Conditional Automatic Complexity and Its Metrics. 15-28 - Xin Li, Yu Zheng:
Streaming and Query Once Space Complexity of Longest Increasing Subsequence. 29-60 - Jing Yuan, Shaojie Tang:
Approximating Decision Trees with Priority Hypotheses. 61-70 - Joachim Gudmundsson, Zijin Huang, Sampson Wong:
Approximating the λ-low-density Value. 71-82 - Ying Liu:
Exponential Time Complexity of the Complex Weighted Boolean #CSP. 83-96 - Meng-Shiou Tsai, Sun-Yuan Hsieh, Ling-Ju Hung:
Hardness and Approximation for the Star β-Hub Routing Cost Problem in $\varDelta _\beta $-Metric Graphs. 97-111
Graph Algorithms
- Marc Hellmuth, Guillaume E. Scholz:
Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs. 115-126 - Weidong Luo:
Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width. 127-140 - Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov:
Shortest Longest-Path Graph Orientations. 141-154 - Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni:
Sink Location Problems in Dynamic Flow Grid Networks. 155-167 - Banu Baklan Sen, Öznur Yasar Diner, Thomas Erlebach:
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. 168-181 - Kangyi Tian, Mingyu Xiao, Boting Yang:
Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs. 182-194 - Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh:
Sum-of-Local-Effects Data Structures for Separable Graphs. 195-206
Applied Algorithms
- Shin-Ichi Nakano:
Variants of Euclidean k-Center Clusterings. 209-219 - Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu:
Red-Black Spanners for Mixed-Charging Vehicular Networks. 220-231 - Xinyu Fu, Yitong Yin, Chaodong Zheng:
Self-stabilizing $(\varDelta +1)$-Coloring in Sublinear (in $\varDelta $) Rounds via Locally-Iterative Algorithms. 232-243 - Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
On Detecting Some Defective Items in Group Testing. 244-271 - Bohan Lyu, Jianzhong Li:
An Efficient Data Analysis Method for Big Data Using Multiple-Model Linear Regression. 272-284 - Yifei Li, Hao Ye, Ruixi Huang, Hejiao Huang, Hongwei Du:
Multi-Load Agent Path Finding for Online Pickup and Delivery Problem. 285-296 - Eli Stafford, Chunjiang Zhu:
Improved Sourcewise Roundtrip Spanners with Constant Stretch. 297-309 - M. Oguzhan Külekci:
Randomized Data Partitioning with Efficient Search, Retrieval and Privacy-Preservation. 310-323 - Peng Li, Xingli Zhou, Zhiang Zhou:
The k Edge-Vertex Domination Problem. 324-334 - Shuzhen Chen, Yuan Yuan, Youming Tao, Zhipeng Cai, Dongxiao Yu:
Resource-Adaptive Newton's Method for Distributed Learning. 335-346 - Yanfei Li, Min Li, Qian Liu, Yang Zhou:
DR-Submodular Function Maximization with Adaptive Stepsize. 347-358 - Kota Kumakura, Akira Suzuki, Yuma Tamura, Xiao Zhou:
On the Routing Problems in Graphs with Ordered Forbidden Transitions. 359-370 - Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith:
Delaying Decisions and Reservation Costs. 371-383 - Di Wu, Jinhui Xu, Jianxin Wang:
A PTAS Framework for Clustering Problems in Doubling Metrics. 384-397 - Kyosuke Hatsugai, Kyoichi Asano, Yoshiki Abe:
A Physical Zero-Knowledge Proof for Sumplete, a Puzzle Generated by ChatGPT. 398-410
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.