default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID30th COCOON 2024: Shanghai, China - Part I
- Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang:
Computing and Combinatorics - 30th International Conference, COCOON 2024, Shanghai, China, August 23-25, 2024, Proceedings, Part I. Lecture Notes in Computer Science 15161, Springer 2025, ISBN 978-981-96-1089-1
Regular Papers Part I
- Chengcheng Sun, Haitao Jiang, Lusheng Wang, Daming Zhu:
Can the 1.375 Approximation Ratio of Unsigned Genomes Distances be Improved? 3-15 - Yue Sun, Donglei Du, Longkun Guo, Dachuan Xu:
An Optimal Absolute Approximation Algorithm for Computing k Restricted Shortest Paths. 16-28 - Hua Chen, Lin Chen, Shenghao Ye, Guochuan Zhang:
On Extensions of Min-k-Union$^\star $. 29-41 - Bin Fu, Yumei Huo, Hairong Zhao:
Sublinear Algorithms for Scheduling with Chain Precedence Constraints. 42-53 - Hao Zhang, Xiya Zheng, Xiaofei Liu:
Bicriteria Approximation Algorithms for the Unit Disk Coverage Problem. 54-65 - Hengcheng Zhou:
Private Neural Network Training with Packed Secret Sharing. 66-77 - Yifei Li, Donghua Yang, Jianzhong Li:
k-Balanced Biclique Partition on Signed Bipartite Graphs. 78-90 - Jiawei Huang, Wenjie Liu, Hu Ding:
Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions. 91-103 - Xin Tong, Haitao Jiang, Daming Zhu, Lianrong Pu:
On Sorting Signed Permutations by Flanked DCJs. 104-115 - Xinmeng Guo, Wei Yu, Zhaohui Liu:
Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two. 116-127 - Farzan Byramji, Vatsal Jha, Chandrima Kayal, Rajat Mittal:
Relations Between Monotone Complexity Measures Based on Decision Tree Complexity. 128-139 - Jingyi Liu, Yixin Cao, Ling Gai, Jianxin Wang:
Minimum Sum Vertex Cover: Kernelization and Parameterized Algorithms. 140-150 - Xiaowei Li, Xiwen Lu:
Facility Location Game for Maximizing the Social Satisfaction on a Line. 151-163 - Pinyan Lu, Zihan Luo, Jialin Zhang:
Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line. 164-177 - Enze Sun, Bo Wang, Quan Xue, Mengshi Zhao, Zixuan Zhu:
MPMD on Two Sources with Lookahead. 178-189 - Mingyang Gong, Guohui Lin, Bing Su:
Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling. 190-202 - Mengfan Ma, Tian Bai, Xin Cheng, Mingyu Xiao:
Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design. 203-215 - Rui Li, Xianhao Meng, Jian Sun, Yijing Wang:
1.6-Approximation Algorithm for Generalized Traveling Salesman Path Problem. 216-226 - Shaojie Tang, Shuzhang Cai, Jing Yuan, Kai Han:
Assortment Planning with Sponsored Products. 227-238 - Taisei Otsuji, Peter Fulla, Takuro Fukunaga:
NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam. 239-251 - Weian Li, Qi Qi, Bingzhe Wang, Tao Xiao, Changyuan Yu:
Near-Optimal Algorithm for Supporting Small and Medium-Sized Enterprises in Ad Systems. 252-263 - Niranka Banerjee, Duc A. Hoang:
The Complexity of Distance-r Dominating Set Reconfiguration. 264-275 - Asahi Takaoka:
A Characterization of Uniquely Representable Two-Directional Orthogonal Ray Graphs. 276-288 - Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng:
The Complexity of Strong Conflict-Free Vertex-Connection k-colorability. 289-300 - Yunlong Liu, Guang Xiao, Jingui Huang, Jianxin Wang:
Parameterized Algorithms for Planar 2-Layer Drawing by Vertex Splitting on a Given Subset. 301-313 - Changqing Xi, Jun Yue:
Bipartite Domination in Outerplanar Graphs. 314-325 - Youming Tao, Xiuzhen Cheng, Falko Dressler, Zhipeng Cai, Dongxiao Yu:
Robust Matroid Bandit Optimization Against Adversarial Contamination. 326-347 - Zhiwen Wang, Long Zhang, Jingwen Wang, Wei Sheng, Yuzhong Zhang:
Nash Equilibrium and Price of Anarchy for Scheduling Games Based on a Mixed Coordination Mechanism. 348-358 - Xinru Guo, Sijia Dai, Xinxin Han, Miao Shang, Yicheng Xu, Yong Zhang:
Trade-Off Between Maximum Flow Time and Energy Intake in EV Charging. 359-371 - Bin Deng:
Maximin Share Allocation Under Knapsack Constraints. 372-383 - Kun You, Bin Tang, Yifeng Chen, Baoliu Ye:
On the Minimum Edge Bisection of Graph. 384-396 - Geoffroy Caillat-Grenier:
Random Schreier Graphs as Expanders. 397-408 - Hao Wu:
Direct Sum Theorems From Fortification. 409-420 - Wenfeng Lai, Haitao Jiang, Daming Zhu, Binhai Zhu:
On Sorting by Unsigned Symmetric Reversals. 421-432 - Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang:
Some Results on Critical (P5,H)-Free Graphs. 433-444 - Feifeng Zheng, Na Li, Ming Liu, Yinfeng Xu:
Single Machine Lot Scheduling to Minimize Maximum Weighted Completion Time. 445-454 - Kangyi Tian, Haotian Pan, Mingyu Xiao:
A Quadratic Vertex Kernel for Diamond-Free Edge Deletion. 455-466 - Samuel N. Araújo, João Marcos Brito, Raquel Folz, Rosiane de Freitas, Rudini Menezes Sampaio:
Graph Convexity Partizan Games: Complexity and Winning Strategies. 467-481 - Ke Shi, Chao Xu:
Almost Optimum ℓ-Covering of $\mathbb {Z}_n$. 482-493 - Yuxiang Tian, Xiaoyi Zhu, Zengfeng Huang:
The Communication Complexity of Distributed Maximization. 494-504 - Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
Approximately Covering Vertices by Order-5 or Longer Paths. 505-517 - Jianqi Zhou, Zhongyi Zhang, Jiong Guo:
An FPT Constant-Factor Approximation Algorithm for Correlation Clustering. 518-530 - Jyothi Krishnan, Neeldhara Misra, Saraswati Girish Nanoti:
A Little Aggression Goes a Long Way. 531-543 - Xinjue Gao, Kaiyuan Zhou, Hao Li:
Monotone Properties of Uncertain Graphs. 544-555 - Jing Hu, Junran Yu, Xiaoyan Zhang:
Algorithms for 2-Balanced Connected k-Partition Problem in Graphs. 556-567
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.
last updated on 2025-03-21 23:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
