Workshop on Combinatorial Algorithms

 

The 22nd IWOCA was held July 20–22, 2011 on the green and spacious campus of the University of Victoria (UVic), itself located on green and spacious Vancouver Island, off the coast of British Columbia, a few scenic kilometers by ferry from the city of Vancouver. The meeting was sponsored and supported financially by the Pacific Institute for the Mathematical Sciences (PIMS); hosted by the UVic Department of Computer Science. The Local Arrangements Committee, cochaired by Wendy Myrvold and Venkatesh Srinivasan, did an outstanding job; the Program Committee was cochaired by Costas Iliopoulos and Bill Smyth; the intricacies of EasyChair were handled by German Tischler.

 

IWOCA descends from the original AustralasianWorkshop on Combinatorial Algorithms, first held in 1989, then renamed “International” in 2007 in response to consistent interest and support from researchers outside the Australasian region. The workshop’s permanent website can be accessed at iwoca.org, where links to previous meetings, as well as to IWOCA 2011, can be found.

 

The IWOCA 2011 call for papers was distributed around the world, resulting in 71 submitted papers. The EasyChair system was used to facilitate management of submissions and refereeing, with three referees selected from the 40-member Program Committee assigned to each paper. A total of 30 papers were accepted, subject to revision, for presentation at the workshop.

 

The workshop also featured a problem session, chaired — in the absence of IWOCA Problems Cochairs Yuqing Lin and Zsuzsanna Liptak — by UVic graduate student Alejandro Erickson. Four invited talks were given by Tetsuo Asano on “Nearest Larger Neighbors Problem and Memory-Constrained Algorithms,” Pavol Hell on “Graph Partitions,” J. IanMunro on “Creating a Partial Order and Finishing the Sort, with Graph Entropy” and Cenk Sahinalp on “Algorithmic Methods for Structural Variation Detection Among Multiple High-Throughput Sequenced Genomes.”