Volume 64, Issue 3

November 2012

Special Issue: Algorithms and Computation

Issue Editors:

9 articles in this issue

Guest Editorial: Special Issue on Algorithms and Computation
Kyung-Yong Chwa
Kunsoo Park
EditorialNotes 03 August 2012 Pages: 327 - 328
Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
Henning Meyerhenke
Thomas Sauerwald
OriginalPaper 15 June 2012 Pages: 329 - 361
Improved Algorithms for Even Factors and Square-Free Simple b-Matchings
Maxim A. Babenko
OriginalPaper 19 April 2012 Pages: 362 - 383
3-Colouring AT-Free Graphs in Polynomial Time
Juraj Stacho
OriginalPaper 02 March 2012 Pages: 384 - 399
Minimum Cost Partitions of Trees with Supply and Demand
Takehiro Ito
Takuya Hara
Takao Nishizeki
OriginalPaper 30 September 2011 Pages: 400 - 415
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size
Qian-Ping Gu
Hisao Tamaki
OriginalPaper Open access 07 March 2012 Pages: 416 - 453
Computing Sparse Multiples of Polynomials
Mark Giesbrecht
Daniel S. Roche
Hrushikesh Tilak
OriginalPaper 08 May 2012 Pages: 454 - 480
Identifying Shapes Using Self-assembly
Matthew J. Patitz
Scott M. Summers
OriginalPaper 11 August 2011 Pages: 481 - 510
From Holant to #CSP and Back: Dichotomy for Holant^c Problems
Jin-Yi Cai
Sangxia Huang
Pinyan Lu
OriginalPaper 01 March 2012 Pages: 511 - 533

Search