IWOCA 2018
International Workshop on Combinatorial Algorithms
Date: 16-19 July 2018
Location: Singapore


Registration at:

Go to and in Wellington, New Zealand following the IWOCA 2018.

Click here for Conference Proceedings

Find Out More



Steering Committee

Charles Colbourn, Arizona State University, USA
Costas Iliopoulos, King’s College, UK
Bill Smyth, McMaster University, Canada


Conference Program Chairs

Costas Iliopoulos, King’s College, UK
Hon Wai Leong, National University of Singapore, Singapore
Wing-Kin Sung, National University of Singapore, Singapore


Organizing Committee

Siew Foong Ho
Hon Wai Leong
Sing Ing Lim
Zaini Mohd
Wing-Kin Sung
Pei Pei Teo


Programme Committee

Donald Adjeroh,  West Virginia University, USA
Cristina Bazgan, Paris Dauphine University, France
Yeow Meng Chee, Nanyang Technological University, Singapore
Kwok Pui Choi, National University of Singapore, Singapore
Charles Colbourn, Arizona State University, USA
Bhaskar Dasgupta, University of Illinois at Chicago, USA
Vlad Estivill-Castro, Griffith University, Australia
Gabriele Fici, Università di Palermo, Italy
Dalibor Froncek, University of Minnesota, USA
Travis Gagie , Diego Portales University, Chile
Serge Gaspers, UNSW Sydney and Data61, CSIRO, Australia
Pinar Heggernes, University of Bergen, Norway
Wing-Kai Hon, National Tsing Hua University, Taiwan
Seok-Hee Hong, University of Sydney, Australia
Peter Horak, University of Washington, USA
Costas Iliopoulos, King’s College, UK
Jesper Jansson, The Hong Kong Polytechnic University, SAR China
Ralf Klasing, CNRS and University of Bordeaux, France
Jan Kratochvil, Charles University, Czech Republic
Dieter Kratsch, University of Lorraine, France
Thierry Lecroq, University of Rouen, France
Hon Wai Leong, National University of Singapore, Singapore
Zsuzsanna Liptak, University of Verona, Italy
Martin Milanič, University of Primorska, Slovenia
Lucia Moura, University of Ottawa, Canada
Veli Mäkinen, University of Helsinki, Finland
Gonzalo Navarro, University of Chile, Chile
Yen Kaow Ng, Tunku Abdul Rahman University, Malaysia
Hirotaka Ono, Nagoya University, Japan
Patric Ostergard, Aalto University, Finland
Vangelis Paschos, Paris Dauphine University, France
Solon Pissis, King’s College, UK
Simon Puglisi, University of Helsinki, Finland
M. Sohel Rahman, Bangladesh University of Engineering and Technology, Bangladesh
Hiroshi Sakamoto, Kyushu Institute of Technology, Japan
Jamie Simpson, Curtin University, Australia
Michiel Smid, Carleton University, Canada
Sagi Snir, University of Haifa, Israel
Wing-Kin Sung, National University of Singapore, Singapore
Ryuhei Uehara, Japan Advanced Institute of Science and Technology, Japan
Ugo Vaccaro, University of Salerno, Italy
Lusheng Wang, City University of Hong Kong, SAR China
Sue Whitesides, University of Victoria, Canada
Mingyu Xiao, University of Science and Technology of China, China
Christos Zaroliagis, University of Patras, Greece
Louxin Zhang, National University of Singapore, Singapore

Proposed Programme

Day 1: 16 July (Monday)

14:45-15:15 Registration
15:15-15:30 Opening session
15:30-16:30 StringMasters session
16:30-18:00 Session 1
18:00-20:00 Reception

Day 2: 17 July (Tuesday)

08:30-10:30 Session 2
10:30-11:00 Tea
11:00-12:00 Invited talk 1
12:00-13:30  Lunch + poster session
13:30-15:30 Session 3
15:30-16:00 Tea
16:00-18:00 Session 4

Day 3: 18 July (Wednesday)

08:30-10:00 Session 5
10:00-10:30 Tea
10:30-11:30 Invited talk 2
11:30-12:30  Session 6
12:30-12:45 Photo taking
12:45-14:15 Lunch
14:15-18:00  Excursion
18:00-20:00   Banquet

Day 4: 19 July (Thursday)

08:30-10:30 Session 7
10:30-11:00 Tea
11:00-12:00 Invited Talk 3
12:00-13:30 Lunch
13:30-15:30 Session 8
13:30-16:00 Tea
16:00-17:30 Session 9
17:30-17:45 Closing session

Invited Speakers

Sanjay Jain
Department of Computer Science, National University of Singapore
Kunihiko Sadakane
Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo
Michael Fellows
Department of Informatics, University of Bergen, Norway

The Elizabeth Hotel

Tourist Attractions

Call for Paper


We solicit high-quality proceedings papers and poster papers in the broad area of combinatorial algorithms. The topics include (but are not restricted to):

  • Complexity Theory
  • Graph Theory & Combinatorics
  • Combinatorial Optimization
  • Cryptography & Information Security
  • Algorithms on Strings & Graphs
  • Graph Drawing & Labelling
  • Computational Algebra & Geometry
  • Computational Biology
  • Probabilistic & Randomised Algorithms
  • Algorithms for Big Data Analytics
  • New Paradigms of Computation

Authors are invited to submit proceedings paper or poster paper.

Proceedings paper cannot exceed 12 single-spaced pages, which includes references, figures, title, authors, affiliations, e-mail addresses, and a short (one paragraph) abstract. The authors are strongly advised to use the LaTeX style file supplied by Springer Verlag for Lecture Notes in Computer Science. Final proceedings papers must be camera-ready in this format. A clearly marked Appendix, which will not count toward the 12 page submission limit, can be included and will be read at the referees' discretion.

Poster paper cannot exceed 2 single-spaced pages, which includes references, figures, title, authors, affiliations, e-mail addresses, and a short (one paragraph) abstract.

All submissions have to be made via the EasyChair submission page for the conference at

Papers submitted for review should represent original, previously unpublished work and surveys of important results. At the time the paper is submitted to IWOCA, and for the entire review period, the paper (or essentially the same paper) should not be under review by any other conference with published proceedings or by a scientific journal. At least one author of each accepted paper will be expected to attend the conference and present the paper.

Proceedings will be published in Springer Lecture Notes in Computer Science (LNCS) and made available at the Workshop. Authors of selected papers will be invited to submit extended versions of their papers to a special issue of the Journal of Discrete Algorithms (JDA).


  • March 15th 2018: Abstract due date
  • March 21st 2018: Proceedings paper due date
  • April 15th 2018: Notification for Proceedings paper
  • April 30th 2018: Camera ready for Proceedings paper
  • April 15th 2018: Poster paper due date
  • May 15th 2018: Notification for Poster paper
  • July 16th - 19th 2018: IWOCA

Click for full detail.


Accepted Papers

  • Robin Milosz, Sylvie Hamel and Adeline Pierrot : Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem
  • Takaaki Mizuki and Yuichi Komano : Analysis of Information Leakage due to Operative Errors in Card-based Protocols
  • Rameshwar Pratap and Sandeep Sen : Faster coreset construction for projective clustering via low rank approximation
  • Barbara Covella, Fabrizio Frati and Maurizio Patrignani : On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees
  • Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti and Rossella Petreschi : Graphs that are Not Pairwise Compatible: A New Proof Technique (Extended Abstract)
  • Christine Dahn, Nils M. Kriege and Petra Mutzel : A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
  • Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno and Ryuhei Uehara : Computational Complexity of Robot Arm Simulation Problems
  • Petra Mutzel and Lutz Oettershagen : The Crossing Number of Seq-Shellable Drawings of Complete Graphs
  • Laurent Bulteau, Romeo Rizzi and Stéphane Vialette : Pattern matching for $k$-track permutations
  • Mikito Nanashima : Cryptographic limitations on polynomial-time posteriori query learning
  • Yen Kaow Ng, Wenlong Jia and Shuai Cheng Li : Placing Segments On Parallel Arcs
  • Hiroki Morizumi : Zero-Suppression and Computation Models
  • Kentaro Sumigawa and Kunihiko Sadakane : An Efficient Representation of Partitions of Integers
  • Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I and Hiroshi Sakamoto : LZ-ABT: A Practical Algorithm for \alpha-Balanced Grammar Compression
  • Moritz Beck and Sabine Storandt : Minimum Polygons for Fixed Visibility VC-Dimension
  • Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung and Ralf Klasing : Approximation algorithms for the $p$-hub center routing problem in parameterized metric graphs
  • Jammigumpula Ajay and Sasanka Roy : Collision-free Routing Problem with Restricted L-path
  • Kristoffer Kleine, Ilias Kotsireas and Dimitris E. Simos : Evaluation of Tie-breaking and Parameter ordering for the IPO Family of Algorithms used in Covering Array Generation
  • Bogdan Alecu, Vadim Lozin and Viktor Zamaraev : Linear clique-width of bi-complement reducible graphs
  • Riccardo Dondi, Giancarlo Mauri, Florian Sikora and Italo Zoppis : Covering with Clubs: Complexity and Approximability
  • Neeldhara Misra : Structural Parameterizations for Colorful Components
  • Aistis Atminas, Vadim Lozin and Viktor Zamaraev : Linear Ramsey numbers
  • Philippe Duchon and Cyril Nicaud : On the Expected Number of Distinct Gapped Palindromic Factors
  • Stephen Seidel, Kaushik Sarkar, Charles Colbourn and Violet Syrotiuk : Separating Interaction Effects Using Locating and Detecting Arrays
  • Mariusz Meszka :Decompositions of complete multipartite graphs into matchings
  • Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda and Naoki Katoh : Minsum $k$-Sink Problem on Dynamic Flow Path Networks
  • Thaís Bardini Idalino and Lucia Moura :Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families
  • Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno and Hiroki Arimura : Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
  • Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau and Elise Vandomme : Fully leafed induced subtrees
  • Alexey Nikolaev and Mikhail Batsyn : Branch-and-bound algorithm for Symmetric Travelling Salesman Problem
  • Sophie Toulouse and Jean-François Culus : How far from a worst solution a random solution of a k-CSP instance may be?
  • Christine Markarian : An Optimal Algorithm for Online Prize-collecting Node-weighted Steiner Forest

Contact Us

IWOCA, School of Computing

National University of Singapore
Computing 1
13 Computing Drive
Singapore 117417
Republic of Singapore
Telephone: +65 660 13349