Collection
COCOON 2022
- Submission status
- Closed
Editors
-
Dongjing Miao
Harbin Institute of Technology
Dongjing Miao is a Professor in Massive Data Computing Lab, Harbin Institute of Technology (HIT). He received his PhD degree in the Harbin Institute of Technology in 2016 and PhD degree in the Georgia State University in 2019. His research interests include computational complexity theory on big data computing, quality management and 3D modelling techniques. He has published more than 30 high-quality research papers. He also gets the Excellent Doctoral Dissertation Award of CCF in 2018 and ACM SIGMOD CHINA RISING STAR AWARD in 2019.
-
Shengxin Liu
Harbin Institute of Technology, Shenzhen, China
Harbin Institute of Technology, Shenzhen, ChinaShengxin Liu is currently an Assistant Professor with the School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, China. He was a Post-Doctoral Research Fellow with the School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore. He received a Ph.D. degree from the Department of Computer Science, the City University of Hong Kong, China. His research interests include theoretical computer science and computational economics. He was a recipient of the Outstanding Student Paper.
-
Rolf Möhring
Technische Universität Berlin, Germany
Rolf Möhring is a Professor in Technische Universität Berlin (TUB). He received his Ph.D. in RWTH Aachen in Aachen, North Rhine-Westphalia, Germany in 1975 and Habilitation in 1982. Before joining TUB, he worked as Full Professor in Institute of Applied Optimization, School of Artificial Intelligence and Big Data of the Hefei University. His research interests include graph and network algorithms, combinatorial optimization, scheduling, operations research, and their industrial applications.
Articles (7 in this collection)
-
-
Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
Authors
- Mingyu Xiao
- Sen Huang
- Xiaoyu Chen
- Content type: OriginalPaper
- Published: 15 December 2023
- Pages: 1293 - 1334
-
Approximation Algorithms for the Min–Max Mixed Rural Postmen Cover Problem and Its Variants
Authors
- Liting Huang
- Wei Yu
- Zhaohui Liu
- Content type: OriginalPaper
- Published: 23 November 2023
- Pages: 1135 - 1162
-
Counting Cycles on Planar Graphs in Subexponential Time
Authors
- Jin-Yi Cai
- Ashwin Maran
- Content type: OriginalPaper
- Published: 30 October 2023
- Pages: 656 - 693
-
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs
Authors (first, second and last of 4)
- Giulia Punzi
- Alessio Conte
- Romeo Rizzi
- Content type: OriginalPaper
- Published: 11 August 2023
- Pages: 194 - 217
-
Fully Dynamic k-Center Clustering with Outliers
Authors (first, second and last of 4)
- T.-H. Hubert Chan
- Silvio Lattanzi
- Bo Wang
- Content type: OriginalPaper
- Published: 10 August 2023
- Pages: 171 - 193
-
A Semi Brute-Force Search Approach for (Balanced) Clustering
Authors (first, second and last of 6)
- Yicheng Xu
- Vincent Chau
- Yifei Zou
- Content type: OriginalPaper
- Published: 01 August 2023
- Pages: 130 - 146