*** First Call for Participation ***
IWOCA 2020
31st International Workshop on
Combinatorial Algorithms
8-10 June 2020
Bordeaux, France
**********************************************************************
*** Registration is now open at https://iwoca2020.labri.fr/
*** Early registration deadline: 27 April 2020.
*** Registration fees:
- Early student: 250 euros
- Early non-student: 350 euros
- Late student: 350 euros
- Late non-student: 450 euros
- Accompanying person: 90 euros
**********************************************************************
===========
ABOUT IWOCA
===========
Since its inception in 1989 as AWOCA (Australasian Workshop on
Combinatorial Algorithms), IWOCA has provided an annual forum for
researchers who design algorithms for the myriad combinatorial problems
that underlie computer applications in science, engineering and
business. Previous IWOCA and AWOCA meetings have been held in Australia,
Canada, Czech Republic, Finland, France, India, Indonesia, Italy, Japan,
Singapore, South Korea, UK, and USA. Previous IWOCAs can be found at
http://www.iwoca.org/
IWOCA 2020 will take place in Bordeaux, France. Bordeaux is located in
the South West of France and is easy to reach by plane and by fast train
(TGV). The region is famous for its wines and its gastronomy. The city
centre of Bordeaux is classified at the Unesco World Heritage.
================
INVITED SPEAKERS
================
There will be three invited talks at IWOCA 2020. The invited speakers are:
- Dan Alistarh (Institute of Science and Technology, Austria).
- Sándor Fekete (Technische Universität Braunschweig, Germany).
- Tatiana Starikovskaya (École normale supérieure, Paris, France).
===============
ACCEPTED PAPERS (in submission order)
===============
1. Guy Kortsarz and Zeev Nutov. Bounded Degree Group Steiner problems
2. Ewa Drgas-Burchardt, Hanna Furmanczyk and Elżbieta Sidorowicz.
Equitable $d$-degenerate choosability of graphs
3. Vicente Acuña, Leandro I. S. De Lima, Giuseppe F. Italiano, Luca Pepè
Sciarria, Marie-France Sagot and Blerina Sinaimeri. A family of
tree-based generators for bubbles in directed graphs
4. Florent Foucaud, Benjamin Gras, Anthony Perez and Florian Sikora. On
the complexity of Broadcast Domination and Multipacking in digraphs
5. Ioannis Lamprou, Ioannis Sigalas and Vassilis Zissimopoulos. Improved
Budgeted Connected Domination and Budgeted Edge-Vertex Domination
6. Peter Damaschke. Two Robots Patrolling on a Line: Integer Version and
Approximability
7. Peter Damaschke. Ordering a Sparse Graph to Minimize the Sum of Right
Ends of Edges
8. Koki Hamada, Shuichi Miyazaki and Kazuya Okamoto. Strongly Stable and
Maximum Weakly Stable Noncrossing Matchings
9. Nina Chiarelli, Matjaž Krnc, Martin Milanič, Ulrich Pferschy, Nevena
Pivač and Joachim Schauer. Fair packing of independent sets
10. Bogdan Alecu, Vadim Lozin and Dominique de Werra. The micro-world of
cographs
11. Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi,
Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono and
Yota Otachi. Parameterized Complexity of (A,l)-Path Packing
12. Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze and Peter Rossmanith.
Further Results on Online Node- and Edge-Deletion Problems with Advice
13. Alexandre Blanché, Haruka Mizuta, Paul Ouvrard and Akira Suzuki.
Decremental Optimization of Dominating Sets Under the Reconfiguration
Framework
14. Ananya Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li,
Scott Westvold and Xinyue Xu. The SBP Algorithm for Maximizing Revenue
in Online Dial-a-Ride
15. Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias Kotsireas
and Vijay Ganesh. Nonexistence Certificates for Ovals in a Projective
Plane of Order Ten
16. Julien Bensmail, Foivos Fioravantes and Nicolas Nisse. On Proper
Labellings of Graphs with Minimum Label Sum
17. B S Panda and Juhi Chaudhary. Acyclic Matching in Some Subclasses of
Graphs
18. Vahan Mkrtchyan, Garik Petrosyan, K. Subramani and Piotr
Wojciechowski. Parameterized algorithms for partial vertex covers in
bipartite graphs
19. Tibor Jordan, Yusuke Kobayashi, Ryoga Mahara and Kazuhisa Makino.
The Steiner problem for count matroids
20. Gennaro Cordasco, Luisa Gargano and Adele Rescigno. Iterated Type
Partitions
21. Dimitri Lajou, Hervé Hocquard and Borut Lužar. Between proper and
strong edge-colorings of subcubic graphs
22. Victor Campos, Raul Lopes, Andrea Marino and Ana Silva.
Edge-Disjoint Branchings in Temporal Graphs
23. Benoît Groz, Frederik Mallmann-Trenn, Claire Mathieu and Victor
Verdugo. Skyline Computation with Noisy Comparisons
24. Toni Böhnlein and Oliver Schaudt. On the Complexity of Stackelberg
Matroid Pricing Problems
25. Toru Hasunuma. Connectivity Keeping Trees in 2-Connected Graphs with
Girth Conditions
26. Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk,
Nidhi Purohit and Saket Saurabh. On the Complexity of Singly Connected
Vertex Deletion
27. Pratibha Choudhary. Polynomial Time Algorithms for Tracking Path
Problems
28. Sankardeep Chakraborty, Kunihiko Sadakane and Srinivasa Rao Satti.
Optimal In-place Algorithms for Basic Graph Problems
29. Erin Lanus and Charles Colbourn. Algorithms for Constructing
Anonymizing Arrays
30. Kishen Gowda, Neeldhara Misra and Vraj Patel. A Parameterized
Perspective on Attacking and Defending Elections
===============================
FURTHER INFORMATION AND CONTACT
===============================
For more details, please visit the IWOCA 2020 website:
https://iwoca2020.labri.fr/ (now open for registration).
For further information, please send an e-mail to iwoca2020@labri.fr.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
