[CPM-SPIRE-L] IWOCA 2019 CALL FOR PARTICIPATION

[Nadia Pisanti]

*IWOCA 2019 Call for PARTICIPATION*
30th International Workshop On Combinatorial Algorithms

Pisa, Italy, July 23-25, 2019
http://iwoca2019.di.unipi.it/

*PROGRAMME* is available and *REGISTRATION* is open:
http://iwoca2019.di.unipi.it/*

Related events: *STRINGMASTERS* and *GRAPHMASTERS*
http://graphmasters.di.unipi.it/
http://stringmasters.di.unipi.it/

*KEYNOTE SPEAKERS*

*Marinella Sciortino (Università di Palermo)*
BWT Variants: A Combinatorial Investigation

*Stéphane Vialette (Université Paris-Est Marne-la-Vallée)*
On Square Permutations/

*Ugo Vaccaro (Università di Salerno)*
Superimposed Codes and their Applications: Old Results in New Light

*OPEN PROBLEMS SESSION*
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 (grabliele.fici at unipa.it) and Dalibor 
Froncek (dfroncek at d.umn.edu).
https://nms.kcl.ac.uk/iwoca/index_problems.html

*ACCEPTED PAPERS*

*Simone Rinaldi, Brlek, Andrea Frosini, Elisa Pergola, Ilaria Mancini.
Burrows-Wheeler transform of words defined by morphisms/

Florian Stober, Armin Weiss.
On the Average Case of MergeInsertion

Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, 
Masayuki Takeda.
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings

Herman Haverkort, David Kübel, Elmar Langetepe.
Shortest-Path-Preserving Rounding

Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jerome Monnot, Aris 
Pagourtzis.
Extension and its price for the connected vertex cover problem

Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura.
An Efficient Algorithm for Enumerating Chordal Bipartite Induced 
Subgraphs in Sparse Graphs

Juho Lauri, Christodoulos Mitillos.
Complexity of fall coloring for restricted graph classes

Pierre Cazals, Darties, Benoit Chateau, Rodolphe Giroudeau, Mathias Weller.
Power Edge Set and Zero Forcing Set remain difficult in cubic graphs

Zola Donovan, K. Subramani, Vahan Mkrtchyan.
Disjoint clustering in combinatorial circuits

Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki.
An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by 
Crossing Number

Janka Chlebikova, Clément Dallard.
Towards a Complexity Dichotomy for Colourful Components Problems on 
k-caterpillars and Small-Degree Planar Graphs

Giordano Da Lozzo, Ignaz Rutter.
Reaching 3-Connectivity via Edge-edge Additions

Dalibor Froncek, Jiangyi Qiu.
Supermagic graphs with many odd degrees

Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas Shermer.
Computing the k-Crossing Visibility Region of a Point in a Polygon

Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani.
An Improved Scheme in the Two Query Adaptive Bitprobe Model

Martin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel Valtr.
On Erd\H{o}s–Szekeres-type problems for $k$-convex point sets

Gennaro Cordasco, Luisa Gargano, Adele Rescigno.
Dual Domination

Prajeesh Appattu Vallapil, Paramasivam Krishnan, Kamatchi Nainarraj.
A note on handicap incomplete tournaments

Arindam Biswas, Venkatesh Raman, Saket Saurabh.
Solving Group Interval Scheduling Efficently

Fumito Miyake, Eiji Takimoto, Kohei Hatano.
Succinct Representation of Linear Extensions via MDDs and Its 
Application to Scheduling under Precedence Constraints

Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno.
Maximal irredundant set enumeration in bounded-degeneracy and 
bounded-degree hypergraphs

Rahul Raj Gupta, Sushanta Karmakar.
Incremental algorithm for minimum cut and edge connectivity in hypergraph/

Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou.
A General Algorithmic Scheme for Modular Decompositions of Hypergraphs 
and Applications

Lachlan Plant, Lucia Moura.
Maximum clique exhaustive search in circulant k-hypergraphs

Magsarjav Bataa, Kunsoo Park, Amihood Amir, Gad M Landau, Sung Gwan Park.
Finding Periods in Cartesian Tree Matching

Hans-Joachim Boeckenhauer, Nina Corvelo Benz, Dennis Komm.
Call Admission on Trees with Advice (Extended Abstract)

Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung.
Computing the Rooted Triplet Distance between Phylogenetic Networks

Anjeneya Swami Kare, I. Vinod Reddy.
Parameterized Algorithms for Graph Burning Problem

Sandip Banerjee, Sujoy Bhore.
Algorithms and Hardness results on Liar’s Dominating Set and $k$-tuple 
Dominating Set

Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman.
Fixed-parameter tractability of (n-k) List Coloring

Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André 
Nichterlein.
Parameterized Complexity of Min-Power Asymmetric Connectivity

Mitre C. Dourado, Lucia D. Penso, Dieter Rautenbach.
The hull number in the convexity of induced paths of order 3

Michael A Henning, Arti Pandey, Vikash Tripathi.
Complexity and Algorithms for Semipaired Domination in Graphs

Suthee Ruangwises, Toshiya Itoh.
Stable Noncrossing Matchings

Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen.
Cops and robber on some families of oriented graphs

Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles.
A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber

WE LOOK FORWARD TO SEE YOU IN PISA!!!

Charles Colbourn, Roberto Grossi, Nadia Pisanti

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://fenris.cs.ucr.edu/pipermail/cpm-spire-l/attachments/20190703/3ba62394/attachment.html>