<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body text="#000000" bgcolor="#FFFFFF">
<div class="moz-text-html" lang="x-unicode">
<div class="moz-text-html" lang="x-unicode">
===============================<br>
<div class="moz-forward-container"> === <b>IWOCA 2019 Call for
PARTICIPATION</b> ===<br>
===============================<br>
30th International Workshop On Combinatorial Algorithms<br>
<br>
Pisa, Italy, July 23-25, 2019<br>
<a class="moz-txt-link-freetext"
href="http://cpm2019.di.unipi.it/">http://iwoca2019.di.unipi.it/</a><br>
<br>
Related events: <u><b>STRINGMASTERS</b></u> and <u><b>GRAPHMASTERS</b></u><br>
<a class="moz-txt-link-freetext"
href="http://graphmasters.di.unipi.it/">http://graphmasters.di.unipi.it/</a><br>
<a class="moz-txt-link-freetext"
href="http://stringmasters.di.unipi.it/">http://stringmasters.di.unipi.it/</a><br>
<br>
<b><u>PROGRAMME</u> </b>is available and <u><b>REGISTRATION</b></u>
is open:<br>
<a class="moz-txt-link-freetext"
href="http://cpm2019.di.unipi.it/registration/">http://iwoca2019.di.unipi.it/</a><b><br>
<br>
<u>KEYNOTE SPEAKERS</u></b><br>
<br>
<strong>Marinella Sciortino (Università di Palermo)</strong><br>
<em>BWT Variants: A Combinatorial Investigation<br>
</em><br>
<strong>Stéphane Vialette (Université Paris-Est
Marne-la-Vallée)</strong><br>
<em>On Square Permutations</em><br>
<br>
<strong>Ugo Vaccaro (Università di Salerno)</strong><br>
<em>Superimposed Codes and their Applications: Old Results in
New Light</em><br>
<br>
<b><u>OPEN PROBLEMS SESSION</u> </b><br>
As for IWOCA tradition, an open problem session will take
place. If you have an open problem that you would like to
share with the conference's participants and with the IWOCa
community, please email to the IWOCA open problems chairs
Gabriele Fici (<a class="moz-txt-link-abbreviated" href="mailto:grabliele.fici@unipa.it">grabliele.fici@unipa.it</a>) and Dalibor Froncek
(<a class="moz-txt-link-abbreviated" href="mailto:dfroncek@d.umn.edu">dfroncek@d.umn.edu</a>).<br>
<a class="moz-txt-link-freetext"
href="https://nms.kcl.ac.uk/iwoca/index_problems.html">https://nms.kcl.ac.uk/iwoca/index_problems.html</a><br>
<br>
<b><u>ACCEPTED PAPERS</u><br>
</b><b><br>
</b>Simone Rinaldi, Brlek, Andrea Frosini, Elisa Pergola,
Ilaria Mancini. <br>
<em>Burrows-Wheeler transform of words defined by morphisms</em><br>
<br>
Florian Stober, Armin Weiss. <em><br>
On the Average Case of MergeInsertion<br>
</em><br>
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo
Bannai, Masayuki Takeda. <br>
<em><em>Shortest Unique Palindromic Substring Queries on
Run-Length Encoded Strings<br>
<br>
</em></em><em><em>Herman Haverkort, David Kübel, Elmar
Langetepe. <br>
<em>Shortest-Path-Preserving Rounding</em><br>
<br>
</em></em>Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos,
Jerome Monnot, Aris Pagourtzis. <br>
<em>Extension and its price for the connected vertex cover
problem</em><br>
<br>
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura. <br>
<em>An Efficient Algorithm for Enumerating Chordal Bipartite
Induced Subgraphs in Sparse Graphs</em><br>
<br>
Juho Lauri, Christodoulos Mitillos. <br>
<em>Complexity of fall coloring for restricted graph classes</em><br>
<br>
Pierre Cazals, Darties, Benoit Chateau, Rodolphe Giroudeau,
Mathias Weller. <br>
<em>Power Edge Set and Zero Forcing Set remain difficult in
cubic graphs</em><br>
<br>
Zola Donovan, K. Subramani, Vahan Mkrtchyan. <br>
<em>Disjoint clustering in combinatorial circuits</em><br>
<br>
Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru
Tamaki. <br>
<em>An Improved Fixed-Parameter Algorithm for Max-Cut
Parameterized by Crossing Number<br>
<br>
</em>Janka Chlebikova, Clément Dallard. <br>
<em>Towards a Complexity Dichotomy for Colourful Components
Problems on k-caterpillars and Small-Degree Planar Graphs</em><br>
<br>
Giordano Da Lozzo, Ignaz Rutter. <br>
<em>Reaching 3-Connectivity via Edge-edge Additions<br>
</em><br>
<em>Dalibor Froncek, Jiangyi Qiu. <br>
<em>Supermagic graphs with many odd degrees</em><br>
</em><br>
Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas
Shermer. <br>
<em>Computing the k-Crossing Visibility Region of a Point in a
Polygon</em><br>
<br>
Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag
Sodani. <br>
<em>An Improved Scheme in the Two Query Adaptive Bitprobe
Model</em><br>
<br>
Martin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel
Valtr. <br>
<em>On Erd\H{o}s–Szekeres-type problems for $k$-convex point
sets<br>
</em><br>
<em>Gennaro Cordasco, Luisa Gargano, Adele Rescigno. <br>
<em>Dual Domination</em></em><br>
<br>
Prajeesh Appattu Vallapil, Paramasivam Krishnan, Kamatchi
Nainarraj. <br>
<em>A note on handicap incomplete tournaments</em><br>
<br>
Arindam Biswas, Venkatesh Raman, Saket Saurabh. <br>
<em>Solving Group Interval Scheduling Efficently<br>
</em><br>
<em>Fumito Miyake, Eiji Takimoto, Kohei Hatano. <br>
<em>Succinct Representation of Linear Extensions via MDDs
and Its Application to Scheduling under Precedence
Constraints</em></em><br>
<br>
Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki
Uno. <br>
<em>Maximal irredundant set enumeration in bounded-degeneracy
and bounded-degree hypergraphs<br>
</em><br>
<em>Rahul Raj Gupta, Sushanta Karmakar. <br>
<em>Incremental algorithm for minimum cut and edge
connectivity in hypergraph</em><br>
</em><br>
Michel Habib, Fabien de Montgolfier, Lalla Mouatadid,
Mengchuan Zou. <br>
<em>A General Algorithmic Scheme for Modular Decompositions of
Hypergraphs and Applications<br>
</em><br>
<em>Lachlan Plant, Lucia Moura. <br>
<em>Maximum clique exhaustive search in circulant
k-hypergraphs</em><br>
</em><br>
Magsarjav Bataa, Kunsoo Park, Amihood Amir, Gad M Landau, Sung
Gwan Park. <br>
<em>Finding Periods in Cartesian Tree Matching<br>
<br>
</em><em>Hans-Joachim Boeckenhauer, Nina Corvelo Benz, Dennis
Komm. <br>
<em>Call Admission on Trees with Advice (Extended Abstract)</em><br>
</em><br>
Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby,
Wing-Kin Sung. <br>
<em>Computing the Rooted Triplet Distance between Phylogenetic
Networks<br>
</em><br>
<em>Anjeneya Swami Kare, I. Vinod Reddy. <br>
<em>Parameterized Algorithms for Graph Burning Problem<br>
</em></em><br>
<em><em>Sandip Banerjee, Sujoy Bhore. <br>
<em>Algorithms and Hardness results on Liar’s Dominating
Set and $k$-tuple Dominating Set</em><br>
</em></em><br>
<em><em>Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal,
Venkatesh Raman. <br>
<em>Fixed-parameter tractability of (n-k) List Coloring</em><br>
</em></em><br>
<em><em>Matthias Bentert, Roman Haag, Christian Hofer,
Tomohiro Koana, André Nichterlein. <br>
<em>Parameterized Complexity of Min-Power Asymmetric
Connectivity</em><br>
<br>
</em></em><em><em>Mitre C. Dourado, Lucia D. Penso, Dieter
Rautenbach. <br>
<em>The hull number in the convexity of induced paths of
order 3<br>
<br>
</em></em></em><em><em><em>Michael A Henning, Arti Pandey,
Vikash Tripathi. <br>
<em>Complexity and Algorithms for Semipaired Domination
in Graphs</em><br>
</em></em></em><br>
Suthee Ruangwises, Toshiya Itoh. <br>
<em>Stable Noncrossing Matchings</em><br>
<br>
Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen. <br>
<em>Cops and robber on some families of oriented graphs<br>
</em><br>
<em>Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles. <br>
<em>A Partition Approach to Lower Bounds for Zero-Visibility
Cops and Robber</em></em><em><em><em><br>
<br>
</em></em></em> WE LOOK FORWARD TO SEE YOU IN PISA!!!<br>
<br>
Charles Colbourn, Roberto Grossi, Nadia Pisanti<br>
</div>
</div>
</div>
<br>
</body>
</html>