default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th COCOA 2017: Shanghai, China
- Xiaofeng Gao, Hongwei Du, Meng Han:
Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II. Lecture Notes in Computer Science 10628, Springer 2017, ISBN 978-3-319-71146-1
Combinatorial Optimization
- Xujin Chen, Xiaodong Hu, Zhongzheng Tang, Chenhao Wang
, Ying Zhang:
Algorithms for the Ring Star Problem. 3-16 - Björn Feldkord, Christine Markarian, Friedhelm Meyer auf der Heide:
Price Fluctuation in Online Leasing. 17-31 - Zaixin Lu, Jd Youngs, Zhi Chen, Miao Pan:
Novel Scheduling for Energy Management in Microgrid. 32-44 - Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto:
Improved Methods for Computing Distances Between Unordered Trees Using Integer Programming. 45-60 - Arash Ahadi, Amirhossein Mozafari, Alireza Zarei:
Touring Convex Polygons in Polygonal Domain Fences. 61-75 - Zishen Yang, Donghyun Kim, Wei Wang:
On Interdependent Failure Resilient Multi-path Routing in Smart Grid Communication Network. 76-93 - Wenjun Li, Chao Xu, Jianxin Wang, Yongjie Yang:
An Improved Branching Algorithm for (n, 3)-MaxSAT Based on Refined Observations. 94-108 - Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster Algorithms for 1-Mappability of a Sequence. 109-121 - K. Alex Mills, R. Chandrasekaran, Neeraj Mittal:
Lexico-Minimum Replica Placement in Multitrees. 122-137 - Naomi Nishimura, Vijay Subramanya:
Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable. 138-153 - Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr:
A New Graph Parameter to Measure Linearity. 154-168 - Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno:
Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. 169-181 - Huamei Qi, Tailong Xiao, Anfeng Liu, Jiang Su:
Toward Energy-Efficient and Robust Clustering Algorithm on Mobile Ad Hoc Sensor Networks. 182-195
Game Theory
- Ziyuan Gao, Boting Yang:
The Cop Number of the One-Cop-Moves Game on Planar Graphs. 199-213 - Deshi Ye, Lin Chen, Guochuan Zhang:
The Price of Anarchy in Two-Stage Scheduling Games. 214-225 - Cong Chen, Paolo Penna, Yinfeng Xu:
Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy. 226-240 - Xin Chen, Qingqin Nong, Qizhi Fang:
An Improved Mechanism for Selfish Bin Packing. 241-257
Approximation Algorithm and Graph Theory
- Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho:
Hamiltonian Cycles in Covering Graphs of Trees. 261-275 - Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
On k-Strong Conflict-Free Multicoloring. 276-290 - Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Tropical Paths in Vertex-Colored Graphs. 291-305 - Liying Kang, Wei Zhang, Erfang Shan:
The Spectral Radius and Domination Number of Uniform Hypergraphs. 306-316 - Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals. 317-332 - Eric Angel, Kim Thang Nguyen, Shikha Singh:
Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach. 333-347 - Arne Leitert, Feodor F. Dragan:
Parameterized Approximation Algorithms for Some Location Problems in Graphs. 348-361 - Longkun Guo, Min Li, Dachuan Xu:
Approximation Algorithms for Maximum Coverage with Group Budget Constraints. 362-376
Application
- Shengxin Liu, Chung Keung Poon:
A Simple Greedy Algorithm for the Profit-Aware Social Team Formation Problem. 379-393 - Anna Lavygina, Kris Welsh, Alan Crispin:
Doctor Rostering in Compliance with the New UK Junior Doctor Contract. 394-408 - Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav:
Bounds for Static Black-Peg AB Mastermind. 409-424 - Zhenzao Wen, Jiapeng Huang, Linghe Kong, Min-You Wu, Guihai Chen:
Classification Statistics in RFID Systems. 425-440 - Begum Genc, Mohamed Siala, Gilles Simonin, Barry O'Sullivan:
On the Complexity of Robust Stable Marriage. 441-448 - Liang Song, Hejiao Huang:
The Euclidean Vehicle Routing Problem with Multiple Depots and Time Windows. 449-456 - Aeshah Alsughayyir, Thomas Erlebach:
Online Algorithms for Non-preemptive Speed Scaling on Power-Heterogeneous Processors. 457-465 - Tunzi Tan, Jihong Gui, Sainan Wang, Suixiang Gao, Wenguo Yang:
An Efficient Algorithm for Judicious Partition of Hypergraphs. 466-474 - N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
On Structural Parameterizations of the Matching Cut Problem. 475-482 - Supaporn Chairungsee, Maxime Crochemore:
Longest Previous Non-overlapping Factors Table Computation. 483-491 - Nan Zhang, Zhenhua Duan, Cong Tian, Hongwei Du, Kai Yang:
Modeling and Verifying Multi-core Programs. 492-500 - Qilong Feng, Xiaolu Liao, Jianxin Wang:
Planar Vertex-Disjoint Cycle Packing: New Structures and Improved Kernel. 501-508 - Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
On the Linearization of Scaffolds Sharing Repeated Contigs. 509-517 - Taoqing Zhou, Zhipeng Lü, Tao Ye, Kan Zhou:
A Memetic Algorithm for the Linear Ordering Problem with Cumulative Costs. 518-526
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 2024-10-01 20:54 CEST 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:
