Lecture Notes in Computer Science 10755

Commenced Publication in 1973Founding and Former Series Editors:Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen

Editorial Board

David HutchisonLancaster University, Lancaster, UK

Takeo KanadeCarnegie Mellon University, Pittsburgh, PA, USA

Josef KittlerUniversity of Surrey, Guildford, UK

Jon M. KleinbergCornell University, Ithaca, NY, USA

Friedemann MatternETH Zurich, Zurich, Switzerland

John C. MitchellStanford University, Stanford, CA, USA

Moni NaorWeizmann Institute of Science, Rehovot, Israel

C. Pandu RanganIndian Institute of Technology, Madras, India

Bernhard SteffenTU Dortmund University, Dortmund, Germany

Demetri TerzopoulosUniversity of California, Los Angeles, CA, USA

Doug TygarUniversity of California, Berkeley, CA, USA

Gerhard WeikumMax Planck Institute for Informatics, Saarbrücken, Germany

More information about this series at http://www.springer.com/series/7407

M. Sohel Rahman • Wing-Kin SungRyuhei Uehara (Eds.)

WALCOM: Algorithmsand Computation12th International Conference, WALCOM 2018Dhaka, Bangladesh, March 3–5, 2018Proceedings

123

EditorsM. Sohel RahmanBangladesh University of Engineeringand Technology

DhakaBangladesh

Wing-Kin SungNational University of SingaporeSingaporeSingapore

Ryuhei UeharaJapan Advanced Institute of Scienceand Technology

IshikawaJapan

ISSN 0302-9743 ISSN 1611-3349 (electronic)Lecture Notes in Computer ScienceISBN 978-3-319-75171-9 ISBN 978-3-319-75172-6 (eBook)https://doi.org/10.1007/978-3-319-75172-6

Library of Congress Control Number: 2018930748

LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues

© Springer International Publishing AG, part of Springer Nature 2018This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of thematerial is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,broadcasting, reproduction on microfilms or in any other physical way, and transmission or informationstorage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology nowknown or hereafter developed.The use of general descriptive names, registered names, trademarks, service marks, etc. in this publicationdoes not imply, even in the absence of a specific statement, that such names are exempt from the relevantprotective laws and regulations and therefore free for general use.The publisher, the authors and the editors are safe to assume that the advice and information in this book arebelieved to be true and accurate at the date of publication. Neither the publisher nor the authors or the editorsgive a warranty, express or implied, with respect to the material contained herein or for any errors oromissions that may have been made. The publisher remains neutral with regard to jurisdictional claims inpublished maps and institutional affiliations.

Printed on acid-free paper

This Springer imprint is published by the registered company Springer International Publishing AGpart of Springer NatureThe registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland

Preface

This proceedings volume contains papers presented at WALCOM 2018, the 12thInternational Conference and Workshop on Algorithms and Computation, held duringMarch 3–5, 2018, at the Department of Computer Science and Engineering (CSE),Bangladesh University of Engineering and Technology (BUET), Dhaka, Bangladesh.The conference covered diverse areas of algorithms and computation, namely,approximation algorithms, computational geometry, combinatorial algorithms, com-putational biology, computational complexity, data structures, graph and networkalgorithms, and online algorithms. The conference was organized jointly by BangladeshAcademy of Sciences (BAS), and the Department of Computer Science and Engi-neering, BUET in cooperation with IEICE Technical Committee on TheoreticalFoundations of Computing (COMP), the Special Interest Group for Algorithms(SIGAL) of the Information Processing Society of Japan (IPSJ) and EATCS JapanChapter.

WALCOM is an annual conference series on all aspects of algorithms and com-putation and this year marked the 12th successful organization of this event, which hasa special meaning and carries a strong value in our culture. WALCOM started quitehumbly with a vision to patronize the less privileged researchers, especially, in theSouth Asian countries without compromising the scientific quality through providingan international platform to disseminate their high-quality research works. From thevery inception of WALCOM, it was led by a strong Steering Committee comprisingeminent and senior scientists from Bangladesh, Germany, India, Japan, Korea, and theUK and for each and every event, the technical program was finalized by selecting thehighest quality papers from among those submitted through a rigorous reviewing anddiscussion process by the respective Program Committees comprising computer sci-entists of international repute from different parts of the globe. Notably, the ProgramCommittee of WALCOM 2018 comprised 37 eminent researchers from Australia,Bangladesh, Canada, Chile, Egypt, Finland, France, Greece, Hong Kong, India, Israel,Italy, Japan, Singapore, South Africa, South Korea, Taiwan, UK and USA.

Since its inception, WALCOM has grown substantially in reputation and has beenable to attract researchers and scientists around the globe. Although, initially the ideawas to host WALCOM in Bangladesh and India on alternate years, recently it has gonebeyond that. In particular, in 2016 and 2017, WALCOM was successfully hosted inNepal and Taiwan, respectively, and it is planned that in 2020, it will be hosted inSingapore.

This year we could accept only 22 high-quality papers, which were selected basedon thorough reviewing (at least three review reports per paper) followed by in-depthdiscussion sessions by the Program Committee. Following the recent tradition that wasinitiated in WALCOM 2015, two Best Paper Awards were also given. We are pleasedto announce that “Online Facility Assignment” authored by Abu Reyan Ahmed,Md. Saidur Rahman, and Stephen Kobourov and “Boosting over Non-deterministic

ZDDs” authored by Takahiro Fujita, Kohei Hatano, and Eiji Takimoto were selectedfor the Best Paper Awards by the Program Committee. We are also delighted tohighlight that following the tradition of the previous years, two special issues—one inthe Journal of Graph Algorithms and Applications and the other in TheoreticalComputer Science—are planned featuring the extended versions of selected papersfrom WALCOM 2018.

In addition to the 22 contributed talks, the scientific program of the workshopincluded invited talks by three eminent researchers, namely, Prof. Giuseppe Di Battistaof Università Roma Tre, Italy, Prof. Naoki Katoh of Kwansei Gakuin University,Japan, and Prof. Limsoon Wong, National University of Singapore. We are extremelygrateful to our invited speakers for their excellent talks at the workshop. We thank allthe authors who submitted their works for consideration to WALCOM 2018. Wedeeply appreciate the contribution of all Program Committee members and externalreviewers for handling the submissions in a timely manner despite their extremely busyschedule. We must acknowledge the EasyChair conference management system againfor providing us with their celebrated platform for conference administration. We aregrateful to Springer for publishing the proceedings of WALCOM 2018 in the LNCSseries. As always, we are deeply indebted to the WALCOM Steering Committee fortheir continuous guidance, support, and leadership. Above all, we are extremelygrateful to the Organizing Committee of WALCOM 2018 for making the event a grandsuccess. Last but not the least, we express our heartiest gratitude to the sponsors,namely, IPDC Finance Ltd. and Dynamic Solutions Innovators (DSi) Ltd. for their kindand generous support.

March 2018 M. Sohel RahmanWing-Kin SungRyuhei Uehara

VI Preface

Organization

WALCOM Steering Committee

Kyung-Yong Chwa KAIST, KoreaCostas S. Iliopoulos KCL, UKM. Kaykobad BUET, BangladeshPetra Mutzel TU Dortmund, GermanyShin-ichi Nakano Gunma University, JapanSubhas Chandra Nandy ISI, IndiaTakao Nishizeki Tohoku University, JapanC. Pandu Rangan IIT, Madras, IndiaMd. Saidur Rahman BUET, Bangladesh

WALCOM 2018 Organizers

WALCOM 2018 Supporters

WALCOM 2018 Program Committee

Hee-Kap Ahn POSTECH, South KoreaMuhammad Jawaherul

AlamAmazon, USA

Md. Shamsuzzoha Bayzid BUET, BangladeshGuillaume Blin Université de Bordeaux, FranceJackie Daykin King’s College, London, UKAmr Elmasry Alexandria University, EgyptWing-Kai Hon Nation Tsing Hua University, TaiwanSeok-Hee Hong University of Sydney, AustraliaGiuseppe F. Italiano University of Rome Tor Vergata, ItalyJesper Jansson The Hong Kong Polytechnic University, Hong Kong,

SAR ChinaRalf Klasing CNRS and University of Bordeaux, FranceGad M. Landau University of Haifa, IsraelHon Wai Leong National University of Singapore, SingaporeGiuseppe Liotta University of Perugia, ItalyStefano Lonardi University of California, Riverside, USADebajyoti Mondal University of Saskatchewan, CanadaKrishnendu

MukhopadhyayaIndian Statistical Institute, India

Subhas Chandra Nandy Indian Statistical Institute, IndiaGonzalo Navarro University of Chile, ChileSolon P. Pissis King’s College, London, UK

VIII Organization

Simon J. Puglisi University of Helsinki, FinlandTomasz Radzik King’s College, London, UKAtif Hasan Rahman BUET, BangladeshM. Sohel Rahman BUET, BangladeshMd. Saidur Rahman BUET, BangladeshC. Pandu Rangan Indian Institute of Technology, Madras, IndiaKunihiko Sadakane The University of Tokyo, JapanWilliam F. Smyth McMaster University, CanadaPaul Spirakis University of Liverpool, UKWing-Kin Sung National University of Singapore, SingaporeEtsuji Tomita The University of Electro-Communications, JapanRyuhei Uehara Japan Advanced Institute of Science and Technology,

JapanOsamu Watanabe Tokyo Institute of Technology, JapanBruce Watson Stellenbosch University, South AfricaSue Whitesides University of Victoria, CanadaPrudence Wong University of Liverpool, UKHsu-Chun Yen National Taiwan University, Taiwan

WALCOM 2018 Advisory Committee

Mesbahuddin Ahmed(Secretary)

BAS, Bangladesh

M. Shamsher Ali (Fellow) BAS, BangladeshNaiyyum Choudhury

(Fellow)BAS, Bangladesh

Quazi Abdul Fattah(President)

BAS, Bangladesh

Saiful Islam(Vice-Chancellor)

BUET, Bangladesh

Md. Saidur Rahman CSE, BUET, BangladeshM. Kaykobad CSE, BUET, Bangladesh

WALCOM 2018 Organizing Committee

Muhammad AbdullahAdnan

CSE, BUET, Bangladesh

Ishtiyaque Ahmad CSE, BUET, BangladeshMd. Benzir Ahmed CSE, BUET, BangladeshToufique Ahmed CSE, BUET, BangladeshShareef Ahmed CSE, BUET, BangladeshMd. Mostofa Akbar CSE, BUET, BangladeshMuhammad Rashed Alam CSE, BUET, BangladeshZahangir Alam CSE, BUET, BangladeshMohammed Eunus Ali CSE, BUET, BangladeshMuhammad Masroor Ali CSE, BUET, Bangladesh

Organization IX

M. Shamsher Ali BAS, BangladeshMohammad Al-Mahmud CSE, BUET, BangladeshAbdus Salam Azad CSE, BUET, BangladeshMd. Aashikur Rahman

AzimCSE, BUET, Bangladesh

Madhusudan Basak CSE, BUET, BangladeshMd. Muradul Bashir CSE, BUET, BangladeshMd. Shamsuzzoha Bayzid CSE, BUET, BangladeshMd. Shariful Islam Bhuyan CSE, BUET, BangladeshNaiyyum Choudhury .Siddhartha Shankar Das CSE, BUET, BangladeshSujoy Das CSE, BUET, BangladeshQuazi Abdul Fattah CSE, BUET, BangladeshCh. Md. Rakin Haider CSE, BUET, BangladeshMd. Manzurul Hasan CSE, BUET, BangladeshTanzima Hashem CSE, BUET, BangladeshMahmudur Rahman Hera CSE, BUET, BangladeshAbu Sayed Md. Latiful

HoqueCSE, BUET, Bangladesh

Md. Saddam Hossain CSE, BUET, BangladeshMohammad Sajjad Hossain CSE, BUET, BangladeshMd. Shohrab Hossain CSE, BUET, BangladeshAnindya Iqbal CSE, BUET, BangladeshMd. Monirul Islam CSE, BUET, BangladeshMohammad Mahfuzul Islam CSE, BUET, BangladeshA. B. M. Alim Al Islam CSE, BUET, BangladeshMd. Saiful Islam CSE, BUET, BangladeshMd. Monirul Islam CSE, BUET, BangladeshMd. Rezaul Karim CSE, BUET, BangladeshM. Kaykobad CSE, BUET, BangladeshShahidul Islam Khan CSE, BUET, BangladeshMehnaz Tabassum Mahin CSE, BUET, BangladeshM. A. Mazed .Md. Abul Kashem Mia CSE, BUET, BangladeshMd Amir Hossain Mollah CSE, BUET, BangladeshMahjabin Nahar CSE, BUET, BangladeshMuhammad Ali Nayeem CSE, BUET, BangladeshMahmuda Naznin CSE, BUET, BangladeshNovia Nurain CSE, BUET, BangladeshMd. Tarikul Islam Papon CSE, BUET, BangladeshAdnan Quaium CSE, BUET, BangladeshMd. Ishat - E - Rabban CSE, BUET, BangladeshA. K. M. Ashikur Rahman CSE, BUET, BangladeshAtif Hasan Rahman CSE, BUET, BangladeshMd. Mizanur Rahman CSE, BUET, BangladeshMd. Saidur Rahman CSE, BUET, Bangladesh

X Organization

Mohammad Saifur Rahman CSE, BUET, BangladeshM. Sohel Rahman CSE, BUET, BangladeshMd. Iftekharul Islam Sakib CSE, BUET, BangladeshRakib Ahmed Saleh CSE, BUET, BangladeshNazmus Saquib CSE, BUET, BangladeshMd. Abdus Sattar CSE, BUET, BangladeshKhaled Mahmud Shahriar CSE, BUET, BangladeshRifat Shahriyar (Secretary) CSE, BUET, BangladeshSadia Sharmin (Joint

Secretary)CSE, BUET, Bangladesh

Abida Sanjana Shemonti CSE, BUET, BangladeshShaheena Sultana CSE, BUET, BangladeshAbu Wasif CSE, BUET, Bangladesh

WALCOM 2018 Additional Reviewers

Ahn, TaehoonAkrida, Eleni C.Aravind, N. R.Bae, Sang WonBaisya, Dipankar RanjanBalaji, NikhilBampas, EvangelosBandyapadhyay, SayanBanik, AritraBarua, RanaBentert, MatthiasBhagat, SubhashBhattacharya, BinayBilò, DavideCanzar, StefanCharalampopoulos, PanagiotisChoi, JongminChoi, YujinConte, AlessioD’Emidio, MattiaDas, Gautam K.Das, SyamantakDe Luca, FeliceDeligkas, ArgyriosDi Stefano, GabrieleDrineas, PetrosDunkelman, OrrElbassioni, Khaled

Epstein, LeahEvans, WillFukunaga, TakuroGhosh, SasthiGiot, RomainGiraud, MathieuGrabowski, SzymonGronemann, MartinHan, XinIdrees, SamahJohnson, TimothyKalyanasundaram, SubrahmanyamKardoš, FrantišekKarmakar, ArindamKawamura, AkitoshiKhramtcova, ElenaKim, MincheolKindermann, PhilippKirousis, LefterisKolay, SudeshnaKrohn, ErikLaekhanukit, BunditLamprou, IoannisLauri, JuhoLee, SeungjoonMandal, Partha SarathiMarino, AndreaMestre, Julian

Organization XI

Mhaskar, NeerjaMinato, Shin-IchiMukhopadhyaya, SrabaniMulzer, WolfgangMusco, ChristopherNayeem, Muhammad AliNicholson, Patrick K.Nikolaev, AlexeyOh, EunjinPandey, ArtiPisanti, NadiaRao Satti, SrinivasaReddy, VinodRoy, SasankaSalson, Mikaël

Schieber, BaruchSchmidt, Jens M.Seki, ShinnosukeShahrokhi, FarhadShatabda, SwakkharSilveira, RodrigoSubramani, K.Tappini, AlessandraUddin, Md Yusuf SarwarUno, TakeakiUricaru, RalucaValenzuela, DanielViglietta, GiovanniWismath, SteveYoshinaka, Ryo

WALCOM 2018 Sponsors

XII Organization

Invited Talks

Optimal Sink Location Problems on DynamicFlow Networks

Naoki Katoh

Kwansei Gakuin Universitynaoki.katoh@gmail.com

Abstract. In recent years, catastrophic disasters by massive natural disasterssuch as typhoon, earthquake, tsunami, volcano eruption have been increasing inthe world, and disaster management is becoming extremely important more thanever. For example, in the Tohoku-Pacific Ocean Earthquake that happened inJapan on March 11, 2011, serious damage was caused by a tsunami. Althoughdisaster prevention in civil and architectural engineering fields in Japan has beenconsidered previously mainly from physical aspects, it is difficult to preventlarge tsunamis physically. Therefore, disaster prevention from non-physicalaspects, such as city planning and evacuation planning, has become moreimportant recently.

In particular, to reduce the deaths due to tsunami is critically important oncoastal areas of Japan. For this, we need to prepare evacuation building so thatpeople can protect their lives. Such problems are formulated by the use of adynamic network which consists of a graph that models a road network in whicha capacity as well as a transit time is associated with each edge, and asks to finda way to evacuate evacuees originally existing at vertices to facilities (evacua-tion centers) as quickly as possible. The problem can be viewed as a general-ization of classical k-center and k-median problems. We shall show recentresults about the difficulty and approximability of a single-facility location forgeneral networks and polynomial time algorithms for k-facility location prob-lems in path and tree networks. We also mention the minimax regret versionof these problems, and multi-commodity dynamic flow problems.

Keywords: Disaster prevention • Disaster management • Evacuationk-center problem • k-median problems • Facility locationMulti-commodity dynamic flow problem

Logic in Computational Biology

Limsoon Wong

National University of Singapore13 Computing Drive, 117417, Singapore

wongls@comp.nus.edu.sg

Abstract. I will describe some problem-solving principles that are common tomultiple types of problems, even in different disciplines. I will illustrate usingdifferent areas in computer science, medicine, biology, and biotechnology.These principles are simple logical ways to exploit fundamental properties ofeach problem domain, highlighting the value of both logical thought and domainknowledge, and bringing out the sometimes creative way of applying the formerto the latter in the context of each problem being solved. In the specific contextof computational biology, I will discuss the use of deductive, abductive, andinductive inference in de-noising protein-protein interaction networks, identi-fying homologous proteins, inferring key mutations, and diagnosing specificpediatric leukemias. In the course of this discussion, I will illustrate also theuseful tactics of fixing violation of invariants and guilt by association. As ademonstration of the universality of logic as a scientific problem-solving para-digm, I will show parallels in common computer science applications (e.g.deriving a better database design and securing computers against rootkitattacks).

Keywords: Computational biology • Logical inference from invariantsViolation of invariants • Guilt by association

This work was supported in part by a Kwan-Im-Thong-Hood-Cho-Temple chair professorship.

Morphing Planar Graph Drawings

Giuseppe Di Battista

Roma Tre University, Rome, Italygiuseppe.dibattista@uniroma3.it

Abstract. Given two drawings C0 and C1 of the same graph G a morph betweenC0 and C1 is a continuously changing family of drawings of G indexed by timet 2 ½0; 1�, such that the drawing at time t ¼ 0 is C0 and the drawing at time t ¼ 1is C1.

Suppose that both C0 and C1 have a certain geometric property. E.g. theyare planar, their edges are straight-line segments, or their edges are polygonallines composed of horizontal and vertical segments. It is interesting, both fromthe theoretical and from the applications perspectives, that all the drawingsof the morph preserve that property.

The problem of finding a morph between two drawings of the same graphthat preserves one or more properties is not trivial and attracted the attention ofseveral researchers since the first half of the twentieth century. As an example,Cairns in 1944 proved that a morph that preserves planarity of a triangulationalways exists. Thomassen in 1983 extended the result to all planar straight-linedrawings of embedded graphs.

Morphs that preserve a certain property can be classified from severalperspectives. As an example they can be different in terms of vertex trajectories,in terms of vertex speed, in terms of number of steps, or in terms of arithmeticprecision that is needed to compute the position of the geometric componentsof the drawings.

We survey the state-of-the-art on this intriguing topic focusing the attentionon morphs that preserve planarity.

Contents

A Simple Algorithm for r-gatherings on the Line . . . . . . . . . . . . . . . . . . . . 1Shin-ichi Nakano

Enumeration of Nonisomorphic Interval Graphs and NonisomorphicPermutation Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8

Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, and Ryuhei Uehara

Secret Key Amplification from Uniformly Leaked Key ExchangeComplete Graph . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20

Tatsuya Sasaki, Bateh Mathias Agbor, Shingo Masuda,Yu-ichi Hayashi, Takaaki Mizuki, and Hideaki Sone

Approximating Partially Bounded Degree Deletion on Directed Graphs . . . . . 32Toshihiro Fujito, Kei Kimura, and Yuki Mizuno

Minimum-Width Annulus with Outliers: Circular, Square,and Rectangular Cases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44

Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jongmin Choi,Mincheol Kim, Eunjin Oh, Chan-Su Shin, and Sang Duk Yoon

Minimum-Width Square Annulus Intersecting Polygons . . . . . . . . . . . . . . . . 56Hee-Kap Ahn, Taehoon Ahn, Jongmin Choi, Mincheol Kim,and Eunjin Oh

Two New Schemes in the Bitprobe Model . . . . . . . . . . . . . . . . . . . . . . . . . 68Mirza Galib Anwarul Husain Baig and Deepanjan Kesh

Faster Network Algorithms Based on Graph Decomposition . . . . . . . . . . . . . 80Manas Jyoti Kashyop, Tsunehiko Nagayama, and Kunihiko Sadakane

An Improvement of the Algorithm of Hertli for the Unique3SAT Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93

Tong Qin and Osamu Watanabe

Random Popular Matchings with Incomplete Preference Lists. . . . . . . . . . . . 106Suthee Ruangwises and Toshiya Itoh

Scheduling Batch Processing in Flexible Flowshop with Job DependentBuffer Requirements: Lagrangian Relaxation Approach . . . . . . . . . . . . . . . . 119

Hanyu Gu, Julia Memar, and Yakov Zinder

Computing Periods. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132Junhee Cho, Sewon Park, and Martin Ziegler

A Note on Online Colouring Problems in Overlap Graphsand Their Complements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 144

Marc Demange and Martin Olsen

Online Facility Assignment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 156Abu Reyan Ahmed, Md. Saidur Rahman,and Stephen Kobourov

Fault-Tolerant Complete Visibility for Asynchronous Robotswith Lights Under One-Axis Agreement . . . . . . . . . . . . . . . . . . . . . . . . . . 169

Aisha Aljohani, Pavan Poudel, and Gokarna Sharma

A Simple, Fast, Filter-Based Algorithm for CircularSequence Comparison . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 183

Md. Aashikur Rahman Azim, Mohimenul Kabir,and M. Sohel Rahman

Boosting over Non-deterministic ZDDs . . . . . . . . . . . . . . . . . . . . . . . . . . . 195Takahiro Fujita, Kohei Hatano, and Eiji Takimoto

On Multiple Longest Common Subsequence and Common Motifswith Gaps (Extended Abstract) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 207

Suri Dipannita Sayeed, M. Sohel Rahman,and Atif Rahman

FPT Algorithms Exploiting Carving Decomposition for EulerianOrientations and Ice-Type Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 216

Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi,and Hiroshi Imai

On Structural Parameterizations of Happy Coloring, Empire Coloringand Boxicity. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228

Jayesh Choudhari and I. Vinod Reddy

Complexity of the Maximum k-Path Vertex Cover Problem . . . . . . . . . . . . . 240Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita,and Tom C. van der Zanden

On the Parallel Parameterized Complexity of the GraphIsomorphism Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 252

Bireswar Das, Murali Krishna Enduri, and I. Vinod Reddy

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 265

XX Contents