default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th COCOA 2013: Chengdu, China
- Peter Widmayer, Yinfeng Xu, Binhai Zhu:
Combinatorial Optimization and Applications - 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings. Lecture Notes in Computer Science 8287, Springer 2013, ISBN 978-3-319-03779-0
Contributed Papers
- Zhi-Zhong Chen, Ying Fan, Lusheng Wang
:
Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings. 1-12 - Tim Wylie:
Discretely Following a Curve. 13-24 - Feifeng Zheng, Li Luo, E. Zhang:
NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation. 25-36 - Nadia Dahmani, Saoussen Krichen, François Clautiaux, El-Ghazali Talbi:
A Comparative Study of Multi-objective Evolutionary Algorithms for the Bi-objective 2-Dimensional Vector Packing Problem. 37-48 - Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin:
Approximation Algorithms for the Maximum Multiple RNA Interaction Problem. 49-59 - Bang Ye Wu:
On the Clustered Steiner Tree Problem. 60-71 - Xin Feng, Feifeng Zheng:
Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries. 72-83 - Cong X. Kang, Eunjeong Yi:
The Fractional Strong Metric Dimension of Graphs. 84-95 - Peihai Liu, Xiwen Lu:
Online Scheduling on Two Parallel Machines with Release Times and Delivery Times. 96-105 - Jueliang Hu, Qinghui Zhang, Jianming Dong, Yiwei Jiang:
Parallel Machine Scheduling with a Single Server: Loading and Unloading. 106-116 - Xiangzhong Xiang:
Prompt Mechanism for Online Auctions with Multi-unit Demands. 117-128 - Wlodzimierz Bielecki, Krzysztof Kraska, Tomasz Klimek:
Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm. 129-140 - Huan Ma, Zaixin Lu, Lidan Fan, Weili Wu, Deying Li, Yuqing Zhu:
A Nash Equilibrium Based Algorithm for Mining Hidden Links in Social Networks. 141-152 - Mingyu Xiao, Hiroshi Nagamochi:
An Improved Exact Algorithm for Undirected Feedback Vertex Set. 153-164 - Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Yuki Kobayashi:
An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs. 165-177 - Luérbio Faria, Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang:
On Complexities of Minus Domination. 178-189 - Yu Zheng, Taoyang Wu, Louxin Zhang:
A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree. 190-201 - Chenglin Fan, Jun Luo, Farong Zhong:
On Some Proximity Problems of Colored Sets. 202-213 - Jin Liu, Zhenhua Duan, Cong Tian:
An Extended Strange Planet Protocol. 214-225 - Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen:
Online Bin Covering: Expectations vs. Guarantees. 226-237 - Lei Xu, Evanthia Papadopoulou, Jinhui Xu:
Map of Geometric Minimal Cuts for General Planar Embedding. 238-249 - Xuehou Tan, Bo Jiang:
A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body. 250-259 - Jianxin Wang, Min Yang, Jiong Guo, Qilong Feng, Jianer Chen:
Parameterized Complexity of Control and Bribery for d-Approval Elections. 260-271 - Zhao Lu, Min Lu, Tian Liu, Ke Xu:
Circular Convex Bipartite Graphs: Feedback Vertex Set. 272-283 - Faisal N. Abu-Khzam:
The Multi-parameterized Cluster Editing Problem. 284-294 - Sukhyeun Cho, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
Fast Order-Preserving Pattern Matching. 295-305 - Mihai Burcea, Wing-Kai Hon, Hsiang-Hsuan Liu, Prudence W. H. Wong, David K. Y. Yau:
Scheduling for Electricity Cost in Smart Grid. 306-317 - Tomoyuki Yamakami:
Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems. 318-329 - Sheng Yu:
An Optimal Single-Machine Scheduling with Linear Deterioration Rate and Rate-Modifying Activities. 330-339 - Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai:
A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously. 340-350 - Arash Ahadi, Amirhossein Mozafari, Alireza Zarei:
Touring Disjoint Polygons Problem Is NP-Hard. 351-360 - Azadeh Tabatabaei, Mohammad Ghodsi:
Walking in Streets with Minimal Sensing. 361-372 - Chunlin Xin, Letu Qingge, Yin Bai:
Robust Optimization for the Hazardous Materials Transportation Network Design Problem. 373-386 - Jing Chen, Xin Han, Kazuo Iwama, Hing-Fung Ting:
Online Bin Packing with (1, 1) and (2, R) Bins. 387-401 - Nanao Kita:
Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász's Formulation. 402-413 - David Avis, Gary Roumanis:
A Portable Parallel Implementation of the lrs Vertex Enumeration Code. 414-429
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-09-29 23:56 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:
