default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th COCOON 2022: Shenzhen, China
- Yong Zhang, Dongjing Miao, Rolf H. Möhring:
Computing and Combinatorics - 28th International Conference, COCOON 2022, Shenzhen, China, October 22-24, 2022, Proceedings. Lecture Notes in Computer Science 13595, Springer 2022, ISBN 978-3-031-22104-0 - Yuefang Lian, Dachuan Xu, Donglei Du, Yang Zhou:
A Stochastic Non-monotone DR-Submodular Maximization Problem over a Convex Set. 1-11 - Yuan Yuan
, Xin Han, Yan Lan:
Flow Shop Scheduling Problems with Transportation Constraints Revisited. 12-23 - Conrado Martínez, Gonzalo Solera-Pardo:
LotterySampling: A Randomized Algorithm for the Heavy Hitters and Top-k Problems in Data Streams. 24-35 - Liting Huang, Wei Yu, Zhaohui Liu:
Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants. 36-48 - Vahideh Keikha:
Large k-Gons in a 1.5D Terrain. 49-60 - Tomoyuki Yamakami:
Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-In Cascading Circuits - (Extended Abstract). 61-69 - Tianpeng Gao, Jianzhong Li:
Analysis of Approximate Sorting in I/O Model. 70-81 - Ivan Bliznets, Danil Sagunov:
Two Generalizations of Proper Coloring: Hardness and Approximability. 82-93 - Hongyi Jiang, Samitha Samaranayake:
Approximation Algorithms for Capacitated Assignment with Budget Constraints and Applications in Transportation Systems. 94-105 - Juhi Chaudhary, Sounaka Mishra, B. S. Panda:
On the Complexity of Minimum Maximal Acyclic Matchings. 106-117 - Junkai Feng, Ruiqi Yang, Haibin Zhang, Zhenning Zhang:
Online Non-monotone DR-Submodular Maximization: 1/4 Approximation Ratio and Sublinear Regret. 118-125 - Ivan Bliznets, Anton Bukov, Danil Sagunov:
Fair Division with Minimal Withheld Information in Social Networks. 126-137 - Hau Chan, Minming Li, Chenhao Wang, Yingchao Zhao:
Facility Location Games with Ordinal Preferences. 138-149 - T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang:
Fully Dynamic k-Center Clustering with Outliers. 150-161 - Milo Roucairol, Tristan Cazenave:
Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search. 162-176 - Hongxiang Zhang, Dachuan Xu, Ling Gai, Zhenning Zhang:
Online One-Sided Smooth Function Maximization. 177-185 - Hoa T. Vu:
Revisiting Maximum Satisfiability and Related Problems in Data Streams. 186-198 - Hengzhao Ma, Jianzhong Li, Xiangyu Gao, Tianpeng Gao:
Turing Machines with Two-Level Memory: A Deep Look into the Input/Output Complexity. 199-211 - Daniel Chicayban Bastos, Luis Antonio Brasil Kowada:
A Quantum Version of Pollard's Rho of Which Shor's Algorithm is a Particular Case. 212-219 - Liqi Zhang, Lingfa Lu:
Single Machine Scheduling with Rejection to Minimize the k-th Power of the Makespan. 220-231 - Kento Kimura, Kazuyuki Amano, Shin-Ichi Nakano:
Escape from the Room. 232-241 - Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik:
Algorithms for Hard-Constraint Point Processes via Discretization. 242-254 - Jianer Chen, Zirui Chu, Ying Guo, Wei Yang:
Space Limited Graph Algorithms on Big Data. 255-267 - Jin-Yi Cai, Ashwin Maran:
Counting Cycles on Planar Graphs in Subexponential Time. 268-279 - Jing Huang, Ying Ying Ye:
Semi-strict Chordal Digraphs. 280-291 - Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono:
Reallocation Problems with Minimum Completion Time. 292-304 - Xiaofei Liu, Zhonghao Liu:
The Bound Coverage Problem by Aligned Disks in L1 Metric. 305-312 - Houyu Zhou:
Facility Location Games with Group Externalities. 313-324 - Zhongzheng Tang, Zhuo Diao:
Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs. 325-332 - Koki Hamada, Shuichi Miyazaki:
Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps. 333-344 - Johannes Blum, Sabine Storandt:
Customizable Hub Labeling: Properties and Algorithms. 345-356 - Ta-Yu Mu, Ching-Chi Lin:
Linear-Time Algorithm for Paired-Domination on Distance-Hereditary Graphs. 357-367 - Giulia Punzi:
Bounding the Number of Eulerian Tours in Undirected Graphs. 368-380 - Conrado Martínez, Cyril Nicaud, Pablo Rotondo:
A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables. 381-393 - Sizhe Li, Jinghui Xue, Mingming Jin, Kai Wang, Kun He:
A 4-Space Bounded Approximation Algorithm for Online Bin Packing Problem. 394-405 - Keenan Lee, André van Renssen:
Generalized Sweeping Line Spanners. 406-418 - Jerzy Tiuryn, Natalia Rutecka, Pawel Górecki:
Rooting Gene Trees via Phylogenetic Networks. 419-431 - Anthony Bonato, Ryan Cushman, Trent G. Marbach, Zhiyuan Zhang:
An Evolving Network Model from Clique Extension. 432-443 - Man Xiao, Weidong Li:
Online Semi-matching Problem with Two Heterogeneous Sensors in a Metric Space. 444-451 - Hong Chang, Zhicheng Liu, Donglei Du, Xiaoyan Zhang:
Two-Stage BP Maximization Under p-matroid Constraint. 452-462 - Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides:
The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs. 463-475 - Fei Li:
An O(n3)-Time Algorithm for the Min-Gap Unit-Length Job Scheduling Problem. 476-487 - Xiangyan Kong, Zhen Zhang:
Approximation Schemes for k-Facility Location. 488-495 - Xiaoming Sun, Jialin Zhang, Shuo Zhang, Zhijie Zhang:
Improved Deterministic Algorithms for Non-monotone Submodular Maximization. 496-507 - Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Dominating Sets in Interval Graphs. 508-520 - Milutin Brankovic, Martin P. Seybold:
Optimal Window Queries on Line Segments Using the Trapezoidal Search DAG. 521-528 - S. K. M. Anoop, Jayalal Sarma:
Rotation Distance for Rank Bounded Trees. 529-536 - Minati De, Satyam Singh:
Hitting Geometric Objects Online via Points in $\mathbb {Z}^d$. 537-548 - Rajni Dabas, Neelima Gupta:
Capacitated Facility Location with Outliers/Penalties. 549-560 - Yuan Sha:
Improved Separated Red-Blue Center Clustering. 561-572 - Robert D. Barish, Tetsuo Shibuya:
Proper Colorability of Segment Intersection Graphs. 573-584
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-11-11 02:20 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:
