Volume 25, Issue 3

April 2013

Special Issue: Computing and Combinatorics

Issue Editor:

7 articles in this issue

On sorting unsigned permutations by double-cut-and-joins
Xin Chen
OriginalPaper 04 December 2010 Pages: 339 - 351
Constant time approximation scheme for largest well predicted subset
Bin Fu
Lusheng Wang
OriginalPaper 08 December 2010 Pages: 352 - 367
Computing maximum upward planar subgraphs of single-source embedded digraphs
Aimal Rextin
Patrick Healy
OriginalPaper 08 December 2010 Pages: 368 - 392
Clustering with or without the approximation
Frans Schalekamp
Michael Yu
Anke van Zuylen
OriginalPaper 04 February 2011 Pages: 393 - 429
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
Sayaka Kamei
Hirotsugu Kakugawa
Sébastien Tixeuil
OriginalPaper Open access 27 January 2011 Pages: 430 - 459
Minimum-segment convex drawings of 3-connected cubic plane graphs
Debajyoti Mondal
Rahnuma Islam Nishat
Md. Saidur Rahman
OriginalPaper 23 February 2011 Pages: 460 - 480
Near optimal solutions for maximum quasi-bicliques
Lusheng Wang
OriginalPaper 16 March 2011 Pages: 481 - 497

Search