default search action
21. COCOON 2015: Beijing, China
- Dachuan Xu, Donglei Du
, Ding-Zhu Du:
Computing and Combinatorics - 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings. Lecture Notes in Computer Science 9198, Springer 2015, ISBN 978-3-319-21397-2
Graph Algorithms I
- Takeaki Uno, Yushi Uno:
Mining Preserving Structures in a Graph Sequence. 3-15 - Walid Ben-Ameur, Antoine Glorieux, José Neto:
On the Most Imbalanced Orientation of a Graph. 16-29 - T.-H. Hubert Chan, Zhihao Gavin Tang, Chenzi Zhang:
Cheeger Inequalities for General Edge-Weighted Directed Graphs. 30-41
Game Theory and Algorithms
- Deshi Ye, Lili Mei, Yong Zhang:
Strategy-Proof Mechanism for Obnoxious Facility Location on a Line. 45-56 - Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza:
Bin Packing Game with an Interest Matrix. 57-69 - Qizhi Fang, Bo Li
The Least-Core and Nucleolus of Path Cooperative Games. 70-82 - Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani:
Reversible Pebble Game on Trees. 83-94
Computational Complexity
- Kameng Nip, Zhenbo Wang, Wenxun Xing:
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms. 97-108 - Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy Coloring and Its Variants. 109-120 - T.-H. Hubert Chan, Charalampos Papamanthou, Zhichao Zhao:
On the Complexity of the Minimum Independent Set Partition Problem. 121-132 - Ashutosh Rai, Saket Saurabh:
Bivariate Complexity Analysis of Almost Forest Deletion. 133-144
Approximation Algorithms
- Wei Yu, Zhaohui Liu:
Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems. 147-158 - Peng Zhang, Tao Jiang
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. 159-170 - Yin Wang, Yinfeng Xu:
An Approximation Algorithm for the Smallest Color-Spanning Circle Problem. 171-182 - Lingxiao Huang
Approximation Algorithms for the Connected Sensor Cover Problem. 183-196
Circuits Algorithms
- Nikhil Balaji
Skew Circuits of Small Width. 199-210 - Ruiwen Chen, Valentine Kabanets:
Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits. 211-222 - Yasuhiro Takahashi, Seiichiro Tani
Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable. 223-234 - Daniel König, Markus Lohrey:
Evaluating Matrix Circuits. 235-248
Computing and Graph
- Haitao Jiang, Jingjing Ma, Junfeng Luan, Daming Zhu:
Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem. 251-263 - Yiping Lu, Danny Z. Chen, Jianzhong Cha:
Packing Cubes into a Cube in (D>3)-Dimensions. 264-276 - Shouwei Li, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf der Heide, Sören Riechers:
Towards Flexible Demands in Online Leasing Problems. 277-288 - Hiroki Morizumi:
Lower Bounds for the Size of Nondeterministic Circuits. 289-296 - Aléx F. Brandt, Miguel F. A. de Gaiowski, Pedro J. de Rezende, Cid C. de Souza:
Computing Minimum Dilation Spanning Trees in Geometric Graphs. 297-309 - W. Timothy J. White, Stephan Beyer
Speedy Colorful Subtrees. 310-322
Graph Algorithms II
- B. S. Panda, Arti Pandey, Subhabrata Paul:
Algorithmic Aspects of Disjunctive Domination in Graphs. 325-336 - Jin-Yong Lin, Ching-Hao Liu, Sheung-Hung Poon
Algorithmic Aspect of Minus Domination on Small-Degree Graphs. 337-348 - Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy, Saket Saurabh:
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. 349-360 - Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh:
Reducing Rank of the Adjacency Matrix by Graph Modification. 361-373
Knapsack and Allocation
- Kevin Balas, Csaba D. Tóth:
On the Number of Anchored Rectangle Packings for a Planar Point Set. 377-389 - Deshi Ye, Guochuan Zhang
Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem. 390-401 - Jiayin Pan, Yinfeng Xu:
Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead. 402-416 - Heidi Gebauer, Dennis Komm
Disjoint Path Allocation with Sublinear Advice. 417-429
Graph Algorithms III
- T.-H. Hubert Chan, Xiaowei Wu
Dynamic Tree Shortcut with Constant Degree. 433-444 - Jens Maßberg:
The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions. 445-456 - Xin He, Dayu He:
Compact Monotone Drawing of Trees. 457-468 - Bang Ye Wu:
A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion. 469-480
Random
- Anup Bhattacharya, Davis Issac, Ragesh Jaiswal
Sampling in Space Restricted Settings. 483-494 - Louay Bazzi:
Entropy of Weight Distributions of Small-Bias Spaces and Pseudobinomiality. 495-506 - Hongyu Liang, Shengxin Liu, Hao Yuan:
Optimal Algorithms for Running Max and Min Filters on Random Inputs. 507-520 - Zhenhua Duan, Kangkang Bu, Cong Tian, Nan Zhang:
Model Checking MSVL Programs Based on Dynamic Symbolic Execution. 521-533
Geometric Cover
- Van Bang Le, Sheng-Lung Peng:
On the Complete Width and Edge Clique Cover Problems. 537-547 - Pradeesha Ashok
Unique Covering Problems with Geometric Sets. 548-558 - Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang:
Linear Time Approximation Schemes for Geometric Maximum Coverage. 559-571
Complexity and Security
- Huaqun Wang, Jiguo Li:
Private Certificate-Based Remote Data Integrity Checking in Public Clouds. 575-586 - Sourav Chakraborty, Shamik Ghosh, Nitesh Jha, Sasanka Roy:
Maximal and Maximum Transitive Relation Contained in a Given Binary Relation. 587-600 - Shuai Hu, Wenjun Li, Jianxin Wang:
An Improved Kernel for the Complementary Maximal Strip Recovery Problem. 601-608 - Marc Hellmuth
On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions. 609-623 - Chia-Wen Cheng, Sun-Yuan Hsieh:
Bounds for the Super Extra Edge Connectivity of Graphs. 624-631
Encoding and Security
- Zhe Dang, Thomas R. Fischer, William J. Hutton III
Quantifying Communication in Synchronized Languages. 635-647 - Seungbum Jo, Srinivasa Rao Satti
Simultaneous Encodings for Range and Next/Previous Larger/Smaller Value Queries. 648-660 - Shenghui Su, Tao Xie, Shuwang Lü:
A New Non-Merkle-Damgård Structural Hash Function with Provable Security. 661-673 - Shenghui Su, Shuwang Lü, Maozhi Xu:
A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security. 674-686
Network and Algorithms
- Jan-Henrik Haunert
An Algorithmic Framework for Labeling Network Maps. 689-700 - Kamiel Cornelissen, Bodo Manthey:
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm. 701-712 - Kazumasa Omote, Tran Thao Phuong:
DD-POR: Dynamic Operations and Direct Repair in Network Coding-Based Proof of Retrievability. 713-730 - Andrew McGregor, Hoa T. Vu
Evaluating Bayesian Networks via Data Streams. 731-743
Algorithm
- Hans-Joachim Böckenhauer
On Energy-Efficient Computations With Advice. 747-758 - Yang Gao, Zhaoquan Gu, Qiang-Sheng Hua, Hai Jin:
Multi-Radio Channel Detecting Jamming Attack Against Enhanced Jump-Stay Based Rendezvous in Cognitive Radio Networks. 759-770 - Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh:
Upper Bounds on Fourier Entropy. 771-782
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 00: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: