Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2015

Computing and Combinatorics

21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings

Editors:

  1. Dachuan Xu

    1. Beijing University of Technology, Beijing, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Donglei Du

    1. University of New Brunswick, Fredericton, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Dingzhu Du

    1. University of Texas at Dallas, Richardson, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up-to-date results
  • Fast track conference proceedings
  • State-of-the-art report

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9198)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): COCOON: International Computing and Combinatorics Conference

Conference proceedings info: COCOON 2015.

Sections

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (60 papers)

  1. Circuits Algorithms

    1. Front Matter

      Pages 197-197
      PDF

    2. Skew Circuits of Small Width

      • Nikhil Balaji, Andreas Krebs, Nutan Limaye
      Pages 199-210

    3. Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits

      • Ruiwen Chen, Valentine Kabanets
      Pages 211-222

    4. Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable

      • Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka
      Pages 223-234

    5. Evaluating Matrix Circuits

      • Daniel König, Markus Lohrey
      Pages 235-248

  2. Computing and Graph

    1. Front Matter

      Pages 249-249
      PDF

    2. Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem

      • Haitao Jiang, Jingjing Ma, Junfeng Luan, Daming Zhu
      Pages 251-263

    3. Packing Cubes into a Cube in (D>3)-Dimensions

      • Yiping Lu, Danny Z. Chen, Jianzhong Cha
      Pages 264-276

    4. Towards Flexible Demands in Online Leasing Problems

      • Shouwei Li, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf der Heide, Sören Riechers
      Pages 277-288

    6. Computing Minimum Dilation Spanning Trees in Geometric Graphs

      • Aléx F. Brandt, Miguel F. A. de Gaiowski, Pedro J. de Rezende, Cid C. de Souza
      Pages 297-309

    7. Speedy Colorful Subtrees

      • W. Timothy J. White, Stephan Beyer, Kai Dührkop, Markus Chimani, Sebastian Böcker
      Pages 310-322

  3. Graph Algorithms II

    1. Front Matter

      Pages 323-323
      PDF

    2. Algorithmic Aspects of Disjunctive Domination in Graphs

      • B. S. Panda, Arti Pandey, S. Paul
      Pages 325-336

    3. Algorithmic Aspect of Minus Domination on Small-Degree Graphs

      • Jin-Yong Lin, Ching-Hao Liu, Sheung-Hung Poon
      Pages 337-348

    4. Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs

      • Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy, Saket Saurabh
      Pages 349-360

    5. Reducing Rank of the Adjacency Matrix by Graph Modification

      • S. M. Meesum, Pranabendu Misra, Saket Saurabh
      Pages 361-373

  4. Knapsack and Allocation

    1. Front Matter

      Pages 375-375
      PDF

    2. On the Number of Anchored Rectangle Packings for a Planar Point Set

      • Kevin Balas, Csaba D. Tóth
      Pages 377-389
Back to top

Other Volumes

  1. Computing and Combinatorics

Back to top

About this book

This book constitutes the refereed proceedings of the 21st International Conference on Computing and Combinatorics, COCOON 2015, held in Beijing, China, in August 2015. The 49 revised full papers and 11 shorter papers presented were carefully reviewed and selected from various submissions. The papers cover various topics including algorithms and data structures; algorithmic game theory; approximation algorithms and online algorithms; automata, languages, logic and computability; complexity theory; computational learning theory; cryptography, reliability and security; database theory, computational biology and bioinformatics; computational algebra, geometry, number theory, graph drawing and information visualization; graph theory, communication networks, optimization and parallel and distributed computing.
Back to top

Keywords

Back to top

Editors and Affiliations

  • Beijing University of Technology, Beijing, China

    Dachuan Xu

  • University of New Brunswick, Fredericton, Canada

    Donglei Du

  • University of Texas at Dallas, Richardson, USA

    Dingzhu Du

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation