default search action
19. COCOON 2013: Hangzhou, China
- Ding-Zhu Du, Guochuan Zhang:
Computing and Combinatorics, 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings. Lecture Notes in Computer Science 7936, Springer 2013, ISBN 978-3-642-38767-8
Keynote
- Susanne Albers:
Recent Results for Online Makespan Minimization. 1-3 - Robert Kleinberg:
Optimal Stopping Meets Combinatorial Optimization. 4
Game Theory
- Davide Bilò
, Vittorio Bilò
New Bounds for the Balloon Popping Problem. 5-16 - Anna Angelucci, Vittorio Bilò
On the Sequential Price of Anarchy of Isolation Games. 17-28 - Konstantinos Georgiou, George Karakostas
Social Exchange Networks with Distant Bargaining. 29-40 - Walter Kern, Xian Qiu:
The 1/4-Core of the Uniform Bin Packing Game Is Nonempty. 41-52
Randomized Algorithms
- Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen:
On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles. 53-64 - Khaled M. Elbassioni
On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets. 65-76 - Otfried Cheong, Radwa El Shawi, Joachim Gudmundsson
A Fast Algorithm for Data Collection along a Fixed Track. 77-88 - Qilong Feng, Jianxin Wang, Shaohua Li, Jianer Chen:
Random Methods for Parameterized Problems. 89-100
Scheduling Algorithms
- Zongxu Mu, Minming Li
DVS Scheduling in a Line or a Star Network of Processors. 101-113 - Peihai Liu, Xiwen Lu:
Online Algorithms for Batch Machines Scheduling with Delivery Times. 114-121 - Zhigang Cao, Xujin Chen, Changjun Wang:
How to Schedule the Marketing of Products with Negative Externalities. 122-133 - Evripidis Bampis, Alexander V. Kononov
From Preemptive to Non-preemptive Speed-Scaling Scheduling. 134-146
Computational Theory
- Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
Selection from Read-Only Memory with Limited Workspace. 147-157 - Cong Tian, Zhenhua Duan, Mengfei Yang:
Deternimization of Büchi Automata as Partitioned Automata. 158-168 - Joshua Baron, Yuval Ishai, Rafail Ostrovsky:
On Linear-Size Pseudorandom Generators and Hardcore Functions. 169-181 - Andrzej Kisielewicz, Jakub Kowalski
A Fast Algorithm Finding the Shortest Reset Words. 182-196
Computational Geometry
- Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid:
The Discrete Voronoi Game in a Simple Polygon. 197-207 - Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Christiane Schmidt:
Facets for Art Gallery Problems. 208-220 - Ninad Rajgopal, Pradeesha Ashok
Hitting and Piercing Rectangles Induced by a Point Set. 221-232 - Jessica Sherette, Sang Duk Yoon:
Realistic Roofs over a Rectilinear Polygon Revisited. 233-244
Graph Algorithms I
- Shiho Morishita, Takao Nishizeki:
Parametric Power Supply Networks. 245-256 - Weitian Tong
Approximating the Minimum Independent Dominating Set in Perturbed Graphs. 257-267 - Chih-Hsuan Li, Jhih-Hong Ye, Biing-Feng Wang:
A Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property. 268-279 - Miroslav Chlebík
On the Conjunctive Capacity of Graphs. 280-291
Approximation Algorithms
- Yu Li, Donglei Du
Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty. 292-303 - Chenchen Wu, Donglei Du
An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems. 304-315 - Eric Angel, Kim Thang Nguyen, Damien Regnault:
Improved Local Search for Universal Facility Location. 316-324 - Longkun Guo, Hong Shen, Kewen Liao
Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints. 325-336
Graph Algorithms II
- Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto:
The k-Separator Problem. 337-348 - Bernard Mans
On the Treewidth of Dynamic Graphs. 349-360 - Yu-An Lin, Sheung-Hung Poon
Square-Orthogonal Drawing with Few Bends per Edge. 361-372 - Jan Baumbach
Covering Tree with Stars. 373-384
Computational Biology
- Weidong Li
A Polynomial Time Approximation Scheme for the Closest Shared Center Problem. 385-396 - Nan Liu, Haitao Jiang, Daming Zhu, Binhai Zhu:
An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies. 397-408 - Kun-Tze Chen, Chi-Long Li, Chung-Han Yang, Chin Lung Lu:
An Efficient Algorithm for One-Sided Block Ordering Problem with Block-Interchange Distance. 409-420 - Syed Ali Ahmed, Saad Mneimneh, Nancy L. Greenbaum:
A Combinatorial Approach for Multiple RNA Interaction: Formulations, Approximations, and Heuristics. 421-433
Graph Algorithms III
- Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia:
Maximum Balanced Subgraph Problem Parameterized above Lower Bound. 434-445 - Peter Damaschke, Azam Sheikh Muhammad
A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies. 446-457 - Yasuaki Kobayashi
A Linear Edge Kernel for Two-Layer Crossing Minimization. 458-468 - Christophe Crespelle, Eric Thierry, Thomas Lambert:
A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product. 469-480
Online Algorithms
- Ashish Chiplunkar, Sundar Vishwanathan:
Metrical Service Systems with Multiple Servers. 481-492 - Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. 493-505 - Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han, Chung Keung Poon
Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing. 506-517 - Hiroshi Fujiwara, Koji M. Kobayashi:
Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints. 518-530
Parameterized Algorithms
- Uéverton dos Santos Souza
Parameterized Complexity of Flood-Filling Games on Trees. 531-542 - Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Approximability of Maximizing the Spread of Influence in Networks. 543-554 - Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen:
An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs. 555-566 - Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang:
Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees. 567-578
Computational Complexity
- Pavol Hell, Aurosish Mishra:
Small H-Coloring Problems for Bounded Degree Digraphs. 579-590 - Zhenhua Duan, Cong Tian, Mengfei Yang, Jia He:
Bounded Model Checking for Propositional Projection Temporal Logic. 591-602 - Yiping Lu, Danny Z. Chen, Jianzhong Cha:
Packing Cubes into a Cube Is NP-Hard in the Strong Sense. 603-613 - Manoel B. Campêlo
On the Complexity of Solving or Approximating Convex Recoloring Problems. 614-625
Algorithms
- Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth. 626-637 - Vladimir Braverman, Ran Gelles, Rafail Ostrovsky:
How to Catch L 2-Heavy-Hitters on Sliding Windows. 638-650 - Pierre-Alain Fouque
Time/Memory/Data Tradeoffs for Variants of the RSA Problem. 651-662 - Tao Hu, Xianyi Ren, Jihong Zhang:
An Improved Algorithm for Extraction of Exact Boundaries and Boundaries Inclusion Relationship. 663-671
Workshop I
- Md. Iqbal Hossain, Md. Saidur Rahman
Straight-Line Monotone Grid Drawings of Series-Parallel Graphs. 672-679 - Kameng Nip, Zhenbo Wang:
Combination of Two-Machine Flow Shop Scheduling and Shortest Path Problems. 680-687 - Chao Peng, Jie Zhou, Binhai Zhu, Hong Zhu:
The Program Download Problem: Complexity and Algorithms. 688-696 - Hongbiao Gao, Kai Shi, Yuichi Goto
Finding Theorems in NBG Set Theory by Automated Forward Deduction Based on Strong Relevant Logic. 697-704
Workshop II
- Xingwu Liu, Shang-Hua Teng:
Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data. 705-712 - Bin Fu, Wenfeng Li, Zhiyong Peng:
Sublinear Time Approximate Sum via Uniform Random Sampling. 713-720 - Zhao Lu, Tian Liu, Ke Xu:
Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract). 721-728 - Taku Okada, Akira Suzuki
On the Minimum Caterpillar Problem in Digraphs. 729-736
CSoNet I
- Lidan Fan, Zaixin Lu, Weili Wu, Yuanjun Bi, Ailian Wang:
A New Model for Product Adoption over Social Networks. 737-746 - Meng Han, Mingyuan Yan, Jinbao Li, Shouling Ji, Yingshu Li:
Generating Uncertain Networks Based on Historical Network Snapshots. 747-758 - Juanjuan Zhao, Weili Wu, Xiaolong Zhang
A Short-Term Prediction Model of Topic Popularity on Microblogs. 759-769 - Yan Qiang, Junzuo Lu, Weili Wu, Juanjuan Zhao, Xiaolong Zhang
Social Network Path Analysis Based on HBase. 770-779
CSoNet II
- Yuanjun Bi, Weili Wu, Ailian Wang, Lidan Fan:
Community Expansion Model Based on Charged System Theory. 780-790 - Danica Vukadinovic Greetham
Centrality and Spectral Radius in Dynamic Communication Networks. 791-800 - You Li, Jie Wang, Benyuan Liu, Qilian Liang:
Finding Network Communities Using Random Walkers with Improved Accuracy. 801-810 - Adib Rastegarnia, Meysam Mohajer, Vahid Solouk
Homophilies and Communities Detection among a Subset of Blogfa Persian Weblogs: Computer and Internet Category. 811-820
CSoNet III
- Li Wang, Yuanjun Bi, Weili Wu, Biao Lian, Wen Xu:
Neighborhood-Based Dynamic Community Detection with Graph Transform for 0-1 Observed Networks. 821-830 - Anurag Singh
Effects of Inoculation Based on Structural Centrality on Rumor Dynamics in Social Networks. 831-840 - Donghyun Kim, Deying Li, Omid Asgari, Yingshu Li, Alade O. Tokuta:
A Dominating Set Based Approach to Identify Effective Leader Group of Social Network. 841-848 - Douglas Oliveira, Marco M. Carvalho
Using Network Sciences to Evaluate the Brazilian Airline Network. 849-858
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-13 18:59 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: