default search action
10th COCOA 2016: Hong Kong, China
- T.-H. Hubert Chan, Minming Li, Lusheng Wang:
Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Hong Kong, China, December 16-18, 2016, Proceedings. Lecture Notes in Computer Science 10043, Springer 2016, ISBN 978-3-319-48748-9
Graph Theory
- Photchchara Pisantechakool
, Xuehou Tan:
On the Capture Time of Cops and Robbers Game on a Planar Graph. 3-17 - Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
The Mixed Evacuation Problem. 18-32 - Xiaotian You, Xiaofeng Gao, Yaru Dang, Guihai Chen
A Comprehensive Reachability Evaluation for Airline Networks with Multi-constraints. 33-48 - Peng Zhang, Chenchen Wu, Dachuan Xu
Approximation and Hardness Results for the Max k-Uncut Problem. 49-61 - Arne Leitert, Feodor F. Dragan:
On Strong Tree-Breadth. 62-76 - Takuro Fukunaga
Computing a Tree Having a Small Vertex Cover. 77-91 - Cristina Bazgan, Florent Foucaud, Florian Sikora:
On the Approximability of Partial VC Dimension. 92-106 - Tai-Ling Ye, Dun-Wei Cheng, Sun-Yuan Hsieh:
Improved Precise Fault Diagnosis Algorithm for Hypercube-Like Graphs. 107-112 - Riccardo Dondi, Florian Sikora:
Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis. 113-127 - Xujin Chen, Zhuo Diao
Total Dual Integrality of Triangle Covering. 128-143 - Petr Gregor
Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model. 144-158 - Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles:
Fast Searching on Complete k-partite Graphs. 159-174 - Ulrik Brandes, Eugenia Holm, Andreas Karrenbauer:
Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks. 175-186 - Pawan Aurora
Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem. 187-201 - Shamik Ghosh, Raibatak Sen Gupta, Malay K. Sen:
An Introduction to Coding Sequences of Graphs. 202-215 - Etienne Birmelé, Fabien de Montgolfier, Léo Planche:
Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem. 216-229 - Xianmin Liu, Zhipeng Cai
On the Complexity of Extracting Subtree with Keeping Distinguishability. 230-240 - Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi
Safe Sets in Graphs: Graph Classes and Structural Parameters. 241-253 - Sujoy Kumar Bhore, Dibyayan Chakraborty
On Local Structures of Cubicity 2 Graphs. 254-269 - Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. 270-284 - Chin-Fu Lin, Sheng-Lung Peng:
Algorithmic Aspects of Disjunctive Total Domination in Graphs. 285-293 - Clément Dallard
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. 294-308
Geometric Optimization
- Arne Hillebrand, Marjan van den Akker, Roland Geraerts, Han Hoogeveen:
Performing Multicut on Walkable Environments - Obtaining a Minimally Connected Multi-layered Environment from a Walkable Environment. 311-325 - Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka:
Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound. 326-339 - Yi Xu, Jigen Peng, Yinfeng Xu:
The Mixed Center Location Problem. 340-349 - Huamei Tian, Kui Wu, Sue Whitesides, Cuiying Feng:
Constrained Light Deployment for Reducing Energy Consumption in Buildings. 350-364 - Sergey Bereg:
On the 2-Center Problem Under Convex Polyhedral Distance Function. 365-377 - Olga Zasenko, Tamon Stephen:
Algorithms for Colourful Simplicial Depth and Medians in the Plane. 378-392 - Shaheena Sultana
Realizability of Graphs as Triangle Cover Contact Graphs. 393-407 - Wei Ding
A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract). 408-420
Complexity and Data Structure
- Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau
On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs. 423-437 - Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Algorithmic Analysis for Ridesharing of Personal Vehicles. 438-452 - Dongjing Miao, Yingshu Li, Xianmin Liu, Jianzhong Li:
On the Complexity of Bounded Deletion Propagation. 453-462 - Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet:
On Residual Approximation in Solution Extension Problems. 463-476 - Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
On the Parameterized Parallel Complexity and the Vertex Cover Problem. 477-488 - John Iacono
A Linear Potential Function for Pairing Heaps. 489-504 - Kung-Jui Pai, Ro-Yu Wu, Jou-Ming Chang
Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order. 505-518
Combinatorial Optimization
- Neal Barcelo, Peter Kling
Optimal Speed Scaling with a Solar Cell - (Extended Abstract). 521-535 - Chenchen Wu, Donglei Du
An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions. 536-546 - Carl Barton, Chang Liu, Solon P. Pissis
On-Line Pattern Matching on Uncertain Sequences and Applications. 547-562 - Jürgen König, Alexander Mäcker, Friedhelm Meyer auf der Heide, Sören Riechers:
Scheduling with Interjob Communication on Parallel Processors. 563-577 - Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Cost-Efficient Scheduling on Machines from the Cloud. 578-592 - Maximilian Drees, Björn Feldkord, Alexander Skopalik:
Strategic Online Facility Location. 593-607 - Lin Chen
An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints. 608-623 - Noriyuki Fujimoto:
A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space. 624-638
Game Theory
- Weian Li, Qizhi Fang, Wenjing Liu:
An Incentive Mechanism for Selfish Bin Covering. 641-654 - Matthias Feldotto
Congestion Games with Mixed Objectives. 655-669 - Gerold Jäger:
An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs. 670-682
Miscellaneous
- Ido Polak:
The Incentive Ratio in Exchange Economies. 685-692 - Erfang Shan, Liying Kang:
w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees. 693-701 - Xiaohan He, Xiaoli Zeng, Liang Song, Hejiao Huang, Hongwei Du:
Solving Dynamic Vehicle Routing Problem with Soft Time Window by iLNS and hPSO. 702-709 - Wing-Kai Hon
Convex Independence in Permutation Graphs. 710-717 - Chunsong Bai, Liying Kang, Erfang Shan:
The Connected p-Center Problem on Cactus Graphs. 718-725 - Sourour Elloumi, Amélie Lambert:
Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem. 726-734 - Xu Lu, Zhenhua Duan, Cong Tian:
Using Unified Model Checking to Verify Heaps. 735-743 - Linus Källberg, Thomas Larsson
A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids. 744-753 - Gustavo Angulo:
Relaxations of Discrete Sets with Semicontinuous Variables. 754-762 - Braulio Dumba
Unfolding the Core Structure of the Reciprocal Graph of a Massive Online Social Network. 763-771 - Abhishek Awasthi, Jörg Lässig, Thomas Weise, Oliver Kramer:
Tackling Common Due Window Problem with a Two-Layered Approach. 772-781 - Nan Liu, Peng Zou, Binhai Zhu:
A Polynomial Time Solution for Permutation Scaffold Filling. 782-789
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-12-26 01:01 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: