{"id":10,"date":"2020-02-24T13:24:52","date_gmt":"2020-02-24T13:24:52","guid":{"rendered":"http:\/\/easyconferences.eu\/ciac2021\/?page_id=10"},"modified":"2025-06-16T09:29:48","modified_gmt":"2025-06-16T09:29:48","slug":"program","status":"publish","type":"page","link":"https:\/\/easyconferences.eu\/ciac2025\/program\/","title":{"rendered":"Program"},"content":{"rendered":"

[et_pb_section fb_built=”1″ _builder_version=”4.18.0″ min_height=”113px” custom_padding=”||0px|||” top_divider_style=”wave2″ top_divider_color=”#5390c1″ global_colors_info=”{}”][et_pb_row _builder_version=”4.16″ custom_margin=”40px|auto||auto||” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.16″ global_colors_info=”{}”][et_pb_text _builder_version=”4.16″ global_colors_info=”{}”]<\/p>\n

PROGRAM<\/span><\/strong><\/h1>\n

[\/et_pb_text][et_pb_divider color=”#e09900″ _builder_version=”4.16″ global_colors_info=”{}”][\/et_pb_divider][\/et_pb_column][\/et_pb_row][\/et_pb_section][et_pb_section fb_built=”1″ _builder_version=”4.16″ global_colors_info=”{}”][et_pb_row disabled_on=”on|on|on” _builder_version=”4.18.0″ disabled=”on” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.16″ global_colors_info=”{}”][et_pb_text _builder_version=”4.16″ global_colors_info=”{}”]<\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\u00a0<\/strong><\/span><\/td>\n10 May 2021<\/strong><\/span><\/td>\n\u00a0<\/strong><\/span><\/td>\n11 May 2021<\/strong><\/span><\/td>\n\u00a0<\/strong><\/span><\/td>\n12 May 2021<\/strong><\/span><\/td>\n<\/tr>\n
10:30 \u2013 10:45<\/strong><\/span><\/td>\nVirtual Gathering (on Zoom)\u00a0 <\/strong><\/span><\/td>\n\u00a0<\/strong><\/span><\/p>\n

11:00-11:45<\/strong><\/span><\/td>\n

Invited Talk Katharina Huber<\/strong><\/span><\/td>\n\u00a0<\/strong><\/span><\/p>\n

11:00-11:45<\/strong><\/span><\/td>\n

Invited Talk Seffi Naor<\/strong><\/span><\/td>\n<\/tr>\n
10:45 \u2013 11:00<\/strong><\/span><\/td>\nWELCOME<\/strong><\/span><\/td>\n<\/tr>\n
11:00 \u2013 11:45<\/strong><\/span><\/td>\nInvited Talk Henning Fernau<\/strong><\/span><\/td>\n<\/tr>\n
11:45 \u2013 12:00<\/strong><\/span><\/td>\nBreak<\/strong><\/span><\/td>\n11:45 \u2013 12:00<\/strong><\/span><\/td>\nBreak<\/strong><\/span><\/td>\n11:45 \u2013 12:00<\/strong><\/span><\/td>\nBreak<\/strong><\/span><\/td>\n<\/tr>\n
12:00 \u00ad\u2013 13:00<\/strong><\/span><\/td>\nSession 1 (3×20\u2019) <\/strong>GT&DO1<\/strong><\/span><\/td>\n12:00-13:00<\/strong><\/span><\/td>\nSession 5 (3×20\u2019) E&PC2<\/strong><\/span><\/td>\n12:00 \u2013 13:00<\/strong><\/span><\/td>\nSession 9 (3×20\u2019) GA<\/strong><\/span><\/td>\n<\/tr>\n
13:00 \u2013 13:15<\/strong><\/span><\/td>\nBreak<\/strong><\/span><\/td>\n13:00 \u2013 13:15<\/strong><\/span><\/td>\nBreak<\/strong><\/span><\/td>\n13:00 \u2013 13:15<\/strong><\/span><\/td>\nBreak<\/strong><\/span><\/td>\n<\/tr>\n
13:15 \u2013 14:15<\/strong><\/span><\/td>\nSession 2 (3×20\u2019) OLA<\/strong><\/span><\/td>\n13:15 \u2013 13:55<\/strong><\/span><\/td>\nSession 6 (2×20\u2019) AA1<\/strong><\/span><\/td>\n13:15 \u2013 13:55<\/strong><\/span><\/td>\nSession 10 (2×20\u2019) AA2<\/strong><\/span><\/td>\n<\/tr>\n
14:15 \u201315:30<\/strong><\/span><\/td>\nLunch Break<\/strong><\/span><\/td>\n13:55 \u201315:30<\/strong><\/span><\/td>\nLunch Break<\/strong><\/span><\/td>\n13:55 \u2013 14:05<\/strong><\/span><\/td>\nCLOSING<\/strong><\/span><\/td>\n<\/tr>\n
15:30 \u2013 16:30<\/strong><\/span><\/td>\nSession 3 (3×20\u2019)<\/strong> E&PC1<\/strong><\/span><\/td>\n15:30 \u2013 16:30<\/strong><\/span><\/td>\nSession 7 (3×20\u2019) AACC2<\/strong><\/span><\/td>\n\u00a0<\/strong><\/span><\/td>\n\u00a0<\/strong><\/span><\/td>\n<\/tr>\n
16:30 \u2013 16:45<\/strong><\/span><\/td>\nBreak<\/strong><\/span><\/td>\n16:30 \u2013 16:45<\/strong><\/span><\/td>\nBreak<\/strong><\/span><\/td>\n\u00a0<\/strong><\/span><\/td>\n\u00a0<\/strong><\/span><\/td>\n<\/tr>\n
16:45 \u2013 17:25<\/strong><\/span><\/td>\nSession 4 (2×20\u2019) AACC1<\/strong><\/span><\/td>\n16:45 \u2013 17:45<\/strong><\/span><\/td>\nSession 8 (3×20\u2019) <\/strong>GT&DO2<\/strong><\/span><\/td>\n\u00a0<\/strong><\/span><\/td>\n\u00a0<\/strong><\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section][et_pb_section fb_built=”1″ disabled_on=”off|off|off” _builder_version=”4.27.4″ custom_padding=”0px|||||” saved_tabs=”all” global_colors_info=”{}”][et_pb_row _builder_version=”4.16″ custom_padding=”||4px|||” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.16″ global_colors_info=”{}”][et_pb_text module_id=”submission” _builder_version=”4.27.4″ background_color=” #204861″ custom_padding=”10px|10px|10px|10px|false|false” global_colors_info=”{}”]<\/p>\n

Tuesday, 10 June 2025<\/strong><\/span><\/h1>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_margin=”1px||1px||true|” global_colors_info=”{}”]<\/p>\n

09:00 – 09:10<\/strong><\/span><\/p>\n

[\/et_pb_text][et_pb_text _builder_version=”4.27.4″ background_color=”#FFFFFF” custom_margin=”1px||1px||true|” global_colors_info=”{}”][\/et_pb_text][et_pb_text _builder_version=”4.27.4″ custom_margin=”10px||10px||true|” global_colors_info=”{}”]<\/p>\n

09:10 – 10:10<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ width=”100%” global_colors_info=”{}”]<\/p>\n

Opening Remarks<\/strong><\/p>\n

[\/et_pb_text][et_pb_text _builder_version=”4.21.0″ width=”100%” custom_padding=”0px|||||” global_colors_info=”{}”]<\/p>\n

\n

<\/b><\/span><\/p>\n

<\/b><\/span><\/p>\n

Invited Talk – Sophie Huiberts<\/strong><\/p>\n

Open problems about the simplex method<\/span><\/strong><\/p>\n

Chair: Loukas Georgiadis<\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” hover_enabled=”0″ global_colors_info=”{}” sticky_enabled=”0″][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

10:10 – 11:10<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Session 1 – Scheduling<\/strong><\/p>\n

Chair: Vincenzo Bonifaci<\/p>\n

Exact and Approximate High-Multiplicity Scheduling on Identical Machines<\/strong>
Klaus Jansen, Kai Kahler and Esther Zwanger.<\/p>\n

Perpetual Scheduling with Explorable Uncertainty<\/strong>
William Evans and Seyed Ali Tabatabaee.<\/p>\n

Pinwheel Covering<\/strong>
Akitoshi Kawamura, Yusuke Kobayashi and Yosuke Kusano.<\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

11:10 – 11:40<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.20.2″ background_color=” #d68b1b” global_colors_info=”{}”]<\/p>\n

COFFEE BREAK<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

11:40 – 13:00<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Session 2: Models of computation and complexity<\/strong><\/p>\n

Chair: Nader Bshouty<\/p>\n

Branching Programs with Extended Memory: New Insights<\/span><\/strong>
Suryajith Chillara and Nithish Raja.<\/p>\n

Almost-catalytic Computation<\/span><\/strong>
Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Deep Rai and Jayalal Sarma.<\/p>\n

Bounded degree QBF and positional games<\/span><\/strong>
Nacim Oijid.<\/p>\n

Arithmetic Circuits with Division<\/span><\/strong>
Silas Cato Sacher.<\/p>\n

<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

13:00 – 14:20<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.20.2″ background_color=” #d68b1b” custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

LUNCH<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

14:20 – 15:40<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Session 3: Complexity and Learning<\/strong><\/p>\n

Chair: Loukas Georgiadis<\/p>\n

Computational Complexity of Combinatorial Distance Matrix Realisation<\/strong>
David Fairbairn, George Mertzios and Norbert Peyerimhoff.<\/p>\n

On Exact Learning of $d$-Monotone Functions<\/strong>
Nader Bshouty.<\/p>\n

Efficient Certifying Algorithms for Linear Classification<\/strong>
Vincenzo Bonifaci and Sara Galatro.<\/p>\n

On Two Simple[st] Learning Tasks<\/strong>
Omrit Filtser, Kien Huynh, Anastasia Lemetti, Joseph Mitchell, Tatiana Polishchuk and Valentin Polishchuk.<\/p>\n

 <\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

15:40 – 16:10<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.20.2″ background_color=” #d68b1b” custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

COFFEE BREAK<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

16:10 – 17:30<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Session 4: Graph classes and parameterized complexity<\/strong><\/p>\n

Chair: Andrea Marino<\/p>\n

On the Structural Parameterizations of Locating-Dominating Set and Test Cover<\/strong>
\nDipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale.<\/p>\n

A Parameterized Perspective of All-Colors <\/strong>
Peter Strulo, V\u00e1clav Bla\u017eej and Satyabrata Jana.<\/p>\n

Longest path transversals in claw-free and $P_5$-free graphs<\/strong>
\nPaloma Lima and Amir Nikabadi.<\/p>\n

Happy set problems on cubic graphs and convex bipartite graphs<\/strong>
\nYuichi Asahiro, Hiroshi Eto, Guohui Lin, Eiji Miyano and Yudai Oka.<\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row _builder_version=”4.16″ custom_padding=”||4px|||” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.16″ global_colors_info=”{}”][et_pb_text module_id=”submission” _builder_version=”4.16″ background_color=”#204861″ custom_padding=”10px|10px|10px|10px|false|false” global_colors_info=”{}”]<\/p>\n

Wednesday, 11 June 2025<\/strong><\/span><\/h1>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_margin=”-7px||-7px||true|” custom_padding=”||18px|||” global_colors_info=”{}”]<\/p>\n

<\/strong><\/span><\/p>\n

09:00 – 10:00<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.16″ width=”100%” min_height=”40px” global_colors_info=”{}”]<\/p>\n

<\/b><\/span><\/p>\n

Invited Talk – Susanna F. de Rezende<\/strong><\/p>\n

Lower Bounds in Monotone Circuit Complexity<\/strong><\/p>\n

Chair: Loukas Georgiadis<\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

10:00 – 11:00<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Session 5: Computational geometry<\/strong><\/p>\n

Chair: Kien Huynh<\/p>\n

\u00a0 \u00a0 \u00a0General Position Subset Selection in Line Arrangements<\/span>
Adrian Dumitrescu.\u00a0<\/span><\/p>\n

On the Discrete and Semi-Continuous Versions of the Two Watchtowers Problem in the Plane<\/span>
Leonidas Palios.<\/p>\n

Online Range Assignment Problems<\/span>
Paz Carmi, Matthew Katz and Idan Tomer.<\/p>\n

\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_margin=”||-8px|||” global_colors_info=”{}”]<\/p>\n

11:00 – 11:30<\/strong><\/span><\/p>\n

<\/strong><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.20.2″ background_color=” #d68b1b” global_colors_info=”{}”]<\/p>\n

COFFEE BREAK<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

11:30 – 12:50<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_padding=”||2px|||” global_colors_info=”{}”]<\/p>\n

Session 6: Game theory and cryptography<\/strong><\/p>\n

Chair: Loukas Georgiadis<\/p>\n

\u00a0 \u00a0 \u00a0\u00a0On the Price of Anarchy in Packet Routing Games with FIFO<\/strong>
Daniel Schmand, Torben Sch\u00fcrenberg and Martin Strehler.<\/p>\n

On The Computational Complexity of Games with Uncertainty<\/strong>
Bruce M. Kapron and Koosha Samieefar.<\/p>\n

Network Creation Games with 2-Neighborhood Maximization<\/strong>
Merlin de la Haye, Pascal Lenzner, Daniel Schmand and Nicole Schr\u00f6der.<\/p>\n

Tatami Printer: Physical ZKPs for Tatami Puzzles<\/strong>
Suthee Ruangwises.<\/p>\n

\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_margin=”||-8px|||” global_colors_info=”{}”]<\/p>\n

12:50 – 14:10<\/strong><\/span><\/p>\n

<\/strong><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.20.2″ background_color=” #d68b1b” global_colors_info=”{}”]<\/p>\n

LUNCH<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

14:10 – 15:10<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Best Paper Awards<\/strong><\/p>\n

Chair: Irene Finocchi<\/p>\n

Atoms versus Avoiding Simplicial Vertices<\/strong>\u00a0
Karl Boddy, Konrad K. Dabrowski and Daniel Paulusma.<\/p>\n

Realizing Graphs with Cut Constraints<\/strong>
Lucas de Oliveira Silva, V\u00edtor Gomes Chagas, Samuel Pla\u00e7a de Paula, Greis Yvet Oropeza Quesqu\u00e9n and U\u00e9verton dos Santos Souza.<\/p>\n

\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

15:10 – 16:10<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Session 7: Certifying algorithms, online algorithms, and strings<\/strong><\/p>\n

Chair: Adrian Dumitrescu<\/span><\/p>\n

Online Bichromatic Piercing Set Problem<\/span><\/strong>
<\/span><\/span>Minati De and Ratnadip Mandal.<\/span><\/span><\/p>\n

Subsequence Matching and LCS with Segment Number Constraints<\/span>
Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka and Ayumi Shinohara.<\/strong><\/p>\n

Unit refutations in Horn constraint systems<\/span>
Piotr Wojciechowski and K. Subramani.<\/p>\n

\n

\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

16:10 – evening<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ background_color=” #d68b1b” custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

SOCIAL EVENT (GUIDED TOUR & DINNER)<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row _builder_version=”4.16″ min_height=”145.9px” custom_margin=”|auto|-38px|auto||” custom_padding=”||4px|||” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.16″ global_colors_info=”{}”][et_pb_text module_id=”submission” _builder_version=”4.16″ background_color=”#204861″ custom_margin=”||21px|||” custom_padding=”10px|10px|10px|10px|false|false” global_colors_info=”{}”]<\/p>\n

Thursday, 12 June 2025<\/strong><\/span><\/h1>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_margin=”-7px||-7px||true|” custom_padding=”||18px|||” global_colors_info=”{}”]<\/p>\n

<\/strong><\/span><\/p>\n

09:00 – 10:00<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.16″ width=”100%” min_height=”40px” global_colors_info=”{}”]<\/p>\n

<\/b><\/span><\/p>\n

Invited Talk – Paolo Ferragina<\/strong><\/p>\n

Chair: Irene Finocchi<\/p>\n

Learning for Data Compression and Indexing<\/strong><\/p>\n

\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

10:00 – 11:00<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Session 8: Fixed-parameter algorithms<\/strong><\/p>\n

Chair: Tiziana Calamoneri\u00a0<\/p>\n

A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering<\/span>
Kensuke Oowa, Peter Fulla and Takuro Fukunaga.<\/p>\n

Nonpartisan Feedback Vertex Set<\/span>
Nidhi Purohit, Souvik Saha, Saket Saurabh and Anannya Upasana.<\/p>\n

Parameterized Complexity of Disconnected Matchings<\/span>
Sushmita Gupta, Pallavi Jain, Lawqueen Kanesh, Sounak Modak and Saket Saurabh.<\/p>\n

\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

11:00 – 11:30<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.20.2″ background_color=” #d68b1b” global_colors_info=”{}”]<\/p>\n

COFFEE BREAK<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

11:30 – 12:50<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Session 9: Graph algorithms<\/strong><\/p>\n

Chair: Irene Finocchi<\/p>\n

Degree Realization by Bipartite Cactus Graphs<\/span>
Amotz Bar-Noy, Toni B\u00f6hnlein, David Peleg, Yingli Ran and Dror Rawitz.<\/p>\n

Disjoint Temporal Walks Under Waiting Time Constraints<\/strong>
Allen Ibiapina, Raul Lopes, Andrea Marino and Ana Silva.<\/p>\n

Supereulerian Testing on Semi-Eulerian Graphs<\/span>
Wing-Kai Hon, Meng-Tsung Tsai and Ching-Yu Yang.<\/p>\n

Packing dimers to maximum occupancy under soft-core constraints <\/span>
Robert Barish and Tetsuo Shibuya.<\/p>\n

\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

12:50 – 14:20<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.20.2″ background_color=” #d68b1b” global_colors_info=”{}”]<\/p>\n

LUNCH<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

14:20 – 15:40<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Session 10: Shortest paths and delivery<\/strong><\/p>\n

Chair: Blerina Sinaimeri<\/p>\n

Improved Bounds for Geodetic Hulls<\/span>
Gregor Diatzko, Sabine Storandt and Tobias T\u00f6pfer.<\/p>\n

Fast Geographic Routing in Fixed-Growth Graphs<\/span>
Ofek Gila, Michael Goodrich, Abraham Illickan and Vinesh Sridhar.<\/p>\n

On the Hardness of the Drone Delivery Problem<\/span>
Simon Bartlmae, Andreas Hene and Kelin Luo.<\/p>\n

The Complexity of Landmark Hub Labeling<\/span>
Louann Coste, Ruoying Li, Sabine Storandt and Tobias T\u00f6pfer.<\/p>\n

\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

15:40 – 16:10<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.20.2″ background_color=” #d68b1b” global_colors_info=”{}”]<\/p>\n

COFFEE BREAK<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

16:10 – 17:30<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Session 11: Graph algorithms and sublinear algorithms<\/strong><\/p>\n

Chair: Blerina Sinaimeri<\/p>\n

On the Computational Complexity of Graph Reconstruction<\/span>
<\/strong>Cristina Bazgan, Morgan Chopin, Andr\u00e9 Nichterlein and Camille Richer.<\/p>\n

Burning Path-like and Clique-like Graphs<\/strong>
Radhika Aggarwal, Pradeesha Ashok and Dhairya Gupta.<\/p>\n

Exact and Parameterized Algorithms for Window Minimization in Bipartite Arrangement<\/strong>
Shashank Chauhan, Tanmay Inamdar, Lawqueen Kanesh and Sanjukta Roy.<\/p>\n

Improved Sublinear-time Moment Estimation using Weighted Sampling<\/span><\/strong>
Anup Bhattacharya and Pinki Pradhan.\u00a0<\/span><\/p>\n

\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”1_4,3_4″ use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.16″ custom_margin=”1px|auto|-5px|auto||” custom_padding=”7px||7px|||” global_colors_info=”{}”][et_pb_column type=”1_4″ _builder_version=”4.16″ background_color=”#e5e5e5″ global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ global_colors_info=”{}”]<\/p>\n

17:30<\/strong><\/span><\/p>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”4.16″ background_color=”#f7f7f7″ global_colors_info=”{}”][et_pb_text _builder_version=”4.21.0″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Conference closing<\/strong><\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>\n","protected":false},"excerpt":{"rendered":"

PROGRAM \u00a0 10 May 2021 \u00a0 11 May 2021 \u00a0 12 May 2021 10:30 \u2013 10:45 Virtual Gathering (on Zoom)\u00a0 \u00a0 11:00-11:45 Invited Talk Katharina Huber \u00a0 11:00-11:45 Invited Talk Seffi Naor 10:45 \u2013 11:00 WELCOME 11:00 \u2013 11:45 Invited Talk Henning Fernau 11:45 \u2013 12:00 Break 11:45 \u2013 12:00 Break 11:45 \u2013 12:00 Break […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_et_pb_use_builder":"on","_et_pb_old_content":"","_et_gb_content_width":"","footnotes":""},"class_list":["post-10","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages\/10"}],"collection":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/comments?post=10"}],"version-history":[{"count":91,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages\/10\/revisions"}],"predecessor-version":[{"id":243889,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages\/10\/revisions\/243889"}],"wp:attachment":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/media?parent=10"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}