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