{"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":"2023-06-15T11:09:34","modified_gmt":"2023-06-15T11:09:34","slug":"program","status":"publish","type":"page","link":"https:\/\/easyconferences.eu\/ciac2023\/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.20.2″ 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.16″ background_color=” #204861″ custom_padding=”10px|10px|10px|10px|false|false” global_colors_info=”{}”]<\/p>\n

Wednesday, 14 June 2023<\/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.20.2″ custom_margin=”1px||1px||true|” global_colors_info=”{}”]<\/p>\n

08:20 – 08:30<\/strong><\/span><\/p>\n

[\/et_pb_text][et_pb_text _builder_version=”4.16″ custom_margin=”1px||1px||true|” global_colors_info=”{}”][\/et_pb_text][et_pb_text _builder_version=”4.20.2″ custom_margin=”10px||10px||true|” global_colors_info=”{}”]<\/p>\n

08:30 – 09: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″ width=”100%” global_colors_info=”{}”]<\/p>\n

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

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

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

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

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

Invited Talk – <\/b><\/span>Paul Spirakis<\/span><\/p>\n

Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models<\/p>\n

PRESENTATION<\/a><\/p>\n

Chair: Marios Mavronicolas<\/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″ _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.20.2″ custom_margin=”||-8px|||” global_colors_info=”{}”]<\/p>\n

09:30- 10:00<\/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.20.2″ global_colors_info=”{}”]<\/p>\n

10:00 – 12: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.20.2″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Session 1 – Distributed Algorithms<\/strong><\/span><\/p>\n

Chair: Nader H. Bshouty<\/span><\/p>\n

Asynchronous Fully Decentralized SGD in the Cluster-Based Model<\/strong> (<\/span>10:00 – 10:30)
Hagit Attiya and Noa Schiller<\/p>\n

Dynamic Scheduling of Transactional Memory<\/strong> (10:30 – 11:00)\u00a0<\/span>
Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski and Pavan Poudel<\/span><\/p>\n

Improved Deterministic Leader Election in Diameter-Two Networks<\/strong> (11:00 – 11:30)\u00a0<\/span>
Manish Kumar, Anisur Rahaman Molla and Sumathi Sivasubramaniam<\/span><\/p>\n

Communication Efficient Distributed Graph Clustering and Sparsification under Duplication Models <\/strong>(11:30 – 12:00)
Chun Jiang Zhou<\/span><\/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.20.2″ global_colors_info=”{}”]<\/p>\n

12:00 – 14: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.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.20.2″ global_colors_info=”{}”]<\/p>\n

14:00 – 16: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.20.2″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Session 2 – Complexity and Approximation<\/strong><\/span><\/p>\n

Chair: Costas Busch<\/span><\/p>\n

BEST PAPER AWARD<\/span> – Approximating Power Node Deletion Problems<\/strong> (14:00 – 14:30)
Toshihiro Fujito, Kento Mukae and Junya Tsuzuki<\/span><\/p>\n

The Power of the Binary Value Principle<\/strong> (14:30 – 15:00)
Yaroslav Alekseev and Edward Hirsch\u00a0<\/span><\/p>\n

On the Parameterized Complexity of the Structure of Linear Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves<\/strong> (15:00 – 15:30)
Emmanuel Sam, Michael Fellows, Peter A. Golovach and Frances Rosamond<\/span><\/p>\n

Independent Set under a Change Constraint from an Initial Solution<\/strong> (15:30 – 16:00)
Yuichi Asahiro, Hiroshi Eto, Kana Korenaga Guohui Li, Eijkman Milano and Reo Nounoue<\/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.20.2″ global_colors_info=”{}”]<\/p>\n

16:00 – 16: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” 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.20.2″ global_colors_info=”{}”]<\/p>\n

16:30 – 18: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

Session 3 – Graph Algorithms 1<\/strong><\/span><\/p>\n

Chair: Paul G. Spirakis<\/span><\/p>\n

How Vulnerable is an Undirected Planar Graph with Respect to Max Flow\u00a0<\/strong> (16:30 – 17:00) <\/span>
Lorenzo Balzotti and Paolo G. Franciosa<\/span><\/p>\n

Dynamic Flows with Time-Dependent Capacities<\/strong> (17:00 – 17:30)
Thomas Blasius, Adrian Feilhauer and Jannik Westenfelder<\/span><\/span><\/p>\n

\u00a0PRESENTATION\u00a0<\/a> \u00a0 \u00a0|\u00a0 \u00a0 \u00a0FULL PAPER<\/a><\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Maxflows in Parametric Graph Templates<\/strong> (17:30 – 18:00)
Tai Ben-Nun, Lukas Gianinazzi, Torsten Hoefler and Yishai Oltchik\u00a0<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Broadcasting in Random Graphs<\/strong> (18:00 – 18:30)
Hovhannes Harutyunya and Narek Novhannisyan<\/span><\/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

Thursday, 15 June 2023<\/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.20.2″ custom_margin=”-7px||-7px||true|” custom_padding=”||18px|||” global_colors_info=”{}”]<\/p>\n

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

08:30 – 09: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.16″ width=”100%” min_height=”40px” global_colors_info=”{}”]<\/p>\n

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

Invited Talk – <\/b>Pino Persiano<\/span><\/p>\n

The Complexity of Secure RAMs<\/p>\n

PRESENTATION<\/a><\/p>\n

Chair: Marios Mavronicolas<\/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″ _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.20.2″ custom_margin=”||-8px|||” global_colors_info=”{}”]<\/p>\n

09:30 – 10:00<\/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.20.2″ global_colors_info=”{}”]<\/p>\n

10:00 – 12: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.21.0″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

Session 4 – Graph Algorithms 2<\/strong><\/span><\/p>\n

Chair: <\/span>Vicky G. Papadopoulou<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 Partitioning Subclasses of Chordal Graphs with Few Deletions<\/strong> (10:00 – 10:30)
Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh and Shaily Verma \u00a0<\/span>\u00a0<\/span><\/p>\n

Maintaining Triconnected Components under Node Expansion<\/strong> (<\/span>10:30 – 11:00)
Simon D. Fink and Ignaz Rutter<\/p>\n

Dynamic Coloring on Restricted Graph Classes<\/strong> (11:00 – 11:30)
Sriram Bhyravarapu, Swati Kumari and Vinod Reddy<\/span><\/p>\n

Enumeration of Minimal Tropical Connected Sets<\/strong> (11:30 – 12:00)
Ivan Bliznets, Danil Sagunov and Eugene Tagin\u00a0<\/span><\/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″ _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.20.2″ custom_margin=”||-8px|||” global_colors_info=”{}”]<\/p>\n

12:00 – 14:00<\/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.20.2″ global_colors_info=”{}”]<\/p>\n

14:00 – 16: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.21.0″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

\u00a0Session 5 – Graph Algorithms 3<\/strong><\/span><\/p>\n

Chair: Giuseppe Persiano<\/strong><\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond<\/strong> (14:00 – 14:30)
Tesshu Hanaka, Hirotaka Ono, Yota Otachi and Saeki Uda\u00a0<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Non-Crossing Shortest Path Lengths in Planar Graphs in Linear Time<\/strong> (14:30 – 15:00)
Lorenzo Balzotti and Paolo G. Franciosa<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0Parameterizing Path Partitions<\/strong> (15:00 – 15:30)
Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya and Rajath Rao. \u00a0<\/span>\u00a0<\/span>\u00a0<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0Efficiently Enumerating All Spanning Trees of a Plane 3-Tree<\/strong> (15:30 – 16:00)
Muhammad Nur Yanhaona, Asswad Sarker Nomaan and Md. Saidur Rahman<\/span><\/p>\n

PRESENTATION\u00a0<\/a> \u00a0|\u00a0 \u00a0<\/strong>FULL PAPER<\/a><\/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.20.2″ global_colors_info=”{}”]<\/p>\n

16:00 – 23: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.20.2″ background_color=” #d68b1b” custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

TOUR & CONFERENCE 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

Friday, 16 June 2023<\/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.20.2″ custom_margin=”-7px||-7px||true|” custom_padding=”||18px|||” global_colors_info=”{}”]<\/p>\n

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

08:30 – 09: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.16″ width=”100%” min_height=”40px” global_colors_info=”{}”]<\/p>\n

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

Invited Talk –\u00a0 <\/b><\/span><\/b>Friedhelm Meyer auf der Heide<\/span><\/p>\n

Unifying Gathering Protocols for Swarms of Mobile Robots<\/p>\n

Chair: Marios Mavronicolas\u00a0<\/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″ _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.20.2″ custom_margin=”||-8px|||” global_colors_info=”{}”]<\/p>\n

09:30 – 10:00<\/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.20.2″ global_colors_info=”{}”]<\/p>\n

10:00 – 12: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

Session 6 – Potpuri<\/strong><\/span><\/p>\n

Chair: Friedhelm Meyer auf der Heide\u00a0<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 BEST PAPER AWARD<\/strong><\/span> – On one-sided testing affine subspaces<\/strong> (10:00 – 10:30)
Nader H. Bshouty\u00a0<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues<\/strong> (10:30 – 11:00)
Victor Pan, Soo Go, Qi Luan and Liang Zhao\u00a0<\/span><\/p>\n

\u00a0PRESENTATION<\/a>\u00a0 \u00a0 \u00a0|\u00a0 \u00a0 \u00a0FULL PAPER<\/a><\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Phase transition in count approximation by Count-Min sketch with conservative updates<\/strong> (11:00 – 11:30)
Eric Fusy and <\/span>Gregory.<\/u>\u00a0Kucherov<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Precision<\/strong> (11:30 – 12:00)
Pascal Koiran and Subhayan Saha<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0Minimum-link $C$-Oriented Paths Visiting a Sequence of Regions in the Plane<\/strong> (12:00 – 12:30)
Kerem Geva, Matthew Katz, Joseph<\/u>\u00a0Mitchell and Eli Packer<\/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.20.2″ global_colors_info=”{}”]<\/p>\n

12:30 – 12: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.16″ custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

CLOSING<\/b><\/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″ _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.20.2″ custom_margin=”||-8px|||” global_colors_info=”{}”]<\/p>\n

12:40 – 14:40<\/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_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":1,"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":""},"_links":{"self":[{"href":"https:\/\/easyconferences.eu\/ciac2023\/wp-json\/wp\/v2\/pages\/10"}],"collection":[{"href":"https:\/\/easyconferences.eu\/ciac2023\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/easyconferences.eu\/ciac2023\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ciac2023\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ciac2023\/wp-json\/wp\/v2\/comments?post=10"}],"version-history":[{"count":73,"href":"https:\/\/easyconferences.eu\/ciac2023\/wp-json\/wp\/v2\/pages\/10\/revisions"}],"predecessor-version":[{"id":243741,"href":"https:\/\/easyconferences.eu\/ciac2023\/wp-json\/wp\/v2\/pages\/10\/revisions\/243741"}],"wp:attachment":[{"href":"https:\/\/easyconferences.eu\/ciac2023\/wp-json\/wp\/v2\/media?parent=10"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}