{"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-10-24T12:53:43","modified_gmt":"2023-10-24T12:53:43","slug":"program","status":"publish","type":"page","link":"https:\/\/cyprusconferences.org\/esocc2023\/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.23″ custom_margin=”||2px|||” global_colors_info=”{}”]<\/p>\n

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

[\/et_pb_text][et_pb_button button_url=”https:\/\/cyprusconferences.org\/esocc2023\/wp-content\/uploads\/2023\/10\/Booklet_esocc.pdf” url_new_window=”on” button_text=”Download Full Program Book” _builder_version=”4.23″ _module_preset=”default” custom_button=”on” button_use_icon=”off” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”https:\/\/cyprusconferences.org\/esocc2023\/wp-content\/uploads\/2023\/10\/Program-only_ESOCC-1.pdf” url_new_window=”on” button_text=”Download Program Only” _builder_version=”4.23″ _module_preset=”default” custom_button=”on” button_use_icon=”off” hover_enabled=”0″ global_colors_info=”{}” sticky_enabled=”0″][\/et_pb_button][et_pb_text _builder_version=”4.23″ _module_preset=”default” custom_margin=”||-36px|||” custom_padding=”39px|||||” global_colors_info=”{}”]<\/p>\n

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

Tuesday, October 24th<\/span><\/strong><\/p>\n<\/td>\n<\/tr>\n

\n

9.00<\/span><\/p>\n<\/td>\n

\n

9.20<\/span><\/p>\n<\/td>\n

\n

On-site registration<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

9.20<\/span><\/p>\n<\/td>\n

\n

9.30<\/span><\/p>\n<\/td>\n

\n

Opening – Room: Venus<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

09<\/span>.<\/span>30<\/span><\/p>\n<\/td>\n

\n

1<\/span>1<\/span>.<\/span>00<\/span><\/p>\n<\/td>\n

\n

Session 1: Microservices<\/span><\/p>\n

Room: Venus<\/span><\/p>\n

Chair: <\/span>A. Samir<\/span><\/p>\n<\/td>\n

\n

(long)<\/span><\/p>\n<\/td>\n

\n

\u03bcXL: Explainable Lead Generation with Microservices and Hypothetical Answers (L. Cruz-Filipe, S. Kostopoulou, F. Montesi, J. Vistrup)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

(long)<\/span><\/p>\n<\/td>\n

\n

One Microservice per Developer: Is This the Trend? (D. Amoroso d’Aragona, X. Li, T. Cerny, A. Janes, V. Lenarduzzi, D. Taibi)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

(long)<\/span><\/p>\n<\/td>\n

\n

End-to-End Test Coverage Metrics in Microservice Systems: An Automated Approach (A. Elsayed, T. Cerny, J. Y. Salazar, A. Lehman, J. Hunter, A. Bickham, D. Taibi)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

11<\/span>.<\/span>0<\/span>0<\/span><\/p>\n<\/td>\n

\n

1<\/span>1<\/span>.30<\/span><\/p>\n<\/td>\n

\n

Coffee break<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

1<\/span>1<\/span>.30<\/span><\/p>\n<\/td>\n

\n

1<\/span>3<\/span>.00<\/span><\/p>\n<\/td>\n

\n

Session 2: QoS <\/span><\/p>\n

Room: Venus<\/span><\/p>\n

Chair: <\/span>T. Cerny<\/span><\/p>\n<\/td>\n

\n

(long)<\/span><\/p>\n<\/td>\n

\n

Time-aware Web Service QoS Prediction in Collaborative Filtering Methods: A Literature Review (E. Jawabreh, A. Taweel) –ONLINE<\/span><\/span><\/p>\n<\/td>\n<\/tr>\n

\n

(long)<\/span><\/p>\n<\/td>\n

\n

Enhanced Time-Aware Collaborative Filtering Method for QoS Web Service Prediction (E. Jawabreh, A. Taweel) – ONLINE<\/span><\/span><\/p>\n<\/td>\n<\/tr>\n

\n

(long)<\/span><\/p>\n<\/td>\n

\n

Comparison of performance and costs of CaaS and RDBaaS services (P. Karwaczy\u0144ski, M. Wasielewski, J. Kwiatkowski)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

1<\/span>3<\/span>.00<\/span><\/p>\n<\/td>\n

\n

1<\/span>4<\/span>.<\/span>0<\/span>0<\/span><\/p>\n<\/td>\n

\n

Lunch Break<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

14.00<\/span><\/p>\n<\/td>\n

\n

15.00<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n

Keynote<\/span>: Data Stream Processing at the Edge (G. Pallis)<\/span><\/span><\/p>\n

Room: Venus<\/span><\/p>\n

Chair: George A. Papadopoulos<\/span><\/p>\n

\n<\/td>\n<\/tr>\n

\n

15.00<\/span><\/p>\n<\/td>\n

\n

15:30<\/span><\/p>\n<\/td>\n

\n

Coffee Break<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

15.30<\/span><\/p>\n<\/td>\n

\n

17.00<\/span><\/p>\n<\/td>\n

\n

Session 3: Short papers<\/span><\/p>\n

Room: Venus<\/span>\u00a0<\/span><\/p>\n

Chair:\u00a0 <\/span>X<\/span>. Li<\/span><\/p>\n<\/td>\n

\n

(short)<\/span><\/p>\n<\/td>\n

\n

A Taxonomy for Workload Deployment Orchestration in the Edge-Cloud Continuum (T. Albers, M. Fogli, E. Harmsma, E. Lazovik, H. Bastiaansen)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

(short)<\/span><\/p>\n<\/td>\n

\n

Intent-based AI-enhanced Service Orchestration for application deployment and execution in the Cloud Continuum (E. Chondrogiannis, E. Karanastasis, V. Andronikou, A. Sp\u0103taru, A. Nanos, A. Kretsis, P. Kokkinos)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

(short)<\/span><\/p>\n<\/td>\n

\n

Optimizing the Cost-Performance Ratio of FaaS Deployments (R. Patsch, K.M. G\u00f6schka)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

(short)<\/span><\/p>\n<\/td>\n

\n

The Microservice Dependency Matrix (A. Elsayed, T. Cerny)<\/span><\/p>\n

<\/span><\/p>\n<\/td>\n<\/tr>\n

17:15<\/td>\n23:00<\/td>\n\u00a0Tour & Conference Dinner<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
\n

Wednesday, October 25th<\/span><\/strong><\/p>\n<\/td>\n<\/tr>\n

\n

9.00<\/span><\/p>\n<\/td>\n

\n

9.30<\/span><\/p>\n<\/td>\n

\n

On-site registration<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

09<\/span>.<\/span>3<\/span>0<\/span><\/p>\n<\/td>\n

\n

10.30<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n

Keynote:\u00a0<\/span>Towards a Hybrid Cloud & Edge Orchestrator for Mining Exascale Distributed<\/span><\/p>\n

Streams (H. Herodotou)<\/span><\/p>\n

Room: Venus<\/span><\/span><\/p>\n

Chair<\/span>: Jacopo Soldani<\/span><\/p>\n

\n<\/td>\n<\/tr>\n

\n

1<\/span>0<\/span>.<\/span>3<\/span>0<\/span><\/p>\n<\/td>\n

\n

11.<\/span>0<\/span>0<\/span><\/p>\n<\/td>\n

\n

Coffee break<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

11<\/span>.<\/span>0<\/span>0<\/span><\/p>\n<\/td>\n

\n

1<\/span>2<\/span>.<\/span>3<\/span>0<\/span><\/p>\n<\/td>\n

\n

Session 4: Service orchestration<\/span><\/p>\n

Room: Venus<\/span><\/span><\/p>\n

Chair:\u00a0 <\/span>A. Makris<\/span><\/p>\n<\/td>\n

\n

(long)<\/span><\/p>\n<\/td>\n

\n

Horizontal Scaling of Transaction-Creating Machines for Blockchains (O. Delzer, I. Weber, R. Hobeck, S. Schulte)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

(long)<\/span><\/p>\n<\/td>\n

\n

Uncovering Effective Roles and Tasks for Fog Systems (M. Blume, S. Lins, A. Sunyaev)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

(long)<\/span><\/p>\n<\/td>\n

\n

Cooperative Virtual Machine Placement (J. Quenum, S. Aknine) ONLINE<\/span><\/span><\/p>\n<\/td>\n<\/tr>\n

\n

1<\/span>2<\/span>.<\/span>30<\/span><\/p>\n<\/td>\n

\n

13.30<\/span><\/p>\n<\/td>\n

\n

Lunch<\/span>\u00a0break<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

1<\/span>3<\/span>.30<\/span><\/p>\n<\/td>\n

\n

1<\/span>5<\/span>.00<\/span><\/p>\n<\/td>\n

\n

Session 5: Edge computing<\/span><\/p>\n

Room: Venus<\/span><\/span><\/p>\n

Chair:\u00a0 <\/span>S<\/span>. Schulte<\/span><\/p>\n<\/td>\n

\n

(long)<\/span><\/p>\n<\/td>\n

\n

A Multi-pronged Self-Adaptive Controller for Analyzing Misconfigurations for Kubernetes Clusters and IoT Edge Devices (A. Samir, A. Al-Wosabi, M. Khan, H. Dagenborg)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

(long)<\/span><\/p>\n<\/td>\n

\n

Adaptive Controller to Identify Misconfigurations and Optimize the Performance of Kubernetes Clusters and IoT Edge Devices (A. Samir, H. Dagenborg)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

(long)<\/span><\/p>\n<\/td>\n

\n

Streamlining XR Application Deployment with a Localized Docker Registry at the Edge (A. Makris, E. Psomakelis, I. Korontanis, T. Theodoropoulos, A. Protopsaltis, M. Pateraki, Z. Ledwo\u0144, C. Diou, D. Anagnostopoulos, K. Tserpes)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

1<\/span>5<\/span>.00<\/span><\/p>\n<\/td>\n

\n

1<\/span>5<\/span>.<\/span>30<\/span><\/p>\n<\/td>\n

\n

Coffee Break<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

15.30<\/span><\/p>\n<\/td>\n

\n

17.00<\/span><\/p>\n<\/td>\n

\n

Session 6: PhD Symposium & Industry Track<\/span><\/p>\n

Room: Venus<\/span><\/span><\/p>\n

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

W. Zimmermann <\/span><\/p>\n<\/td>\n

\n

(short)<\/span><\/p>\n<\/td>\n

\n

Towards Cloud Storage Tier Optimization with Rule-Based Classification (A. Quddus Khan, N. Nikolov, M. Matskin, R. Prodan, C. Bussler, D. Roman, A. Soylu)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

(short)<\/span><\/p>\n<\/td>\n

\n

Towards a Federated Learning based Compute Continuum Framework (M. Moussa, P. Glass, N. Abdennadher, G. Di Marzo Serugendo, R. Couturier)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

(short)<\/span><\/p>\n<\/td>\n

\n

Detecting Model Changes in Organisational Processes: A Cloud-Based Approach (J. Fabra, V. Gallego-Fontenla, J. C. Vidal, J. G. de Quiros, P. Alvarez, M. Lama Penin, A. Bugarin, A. Ramos-Soto) – ONLINE<\/span><\/span><\/p>\n<\/td>\n<\/tr>\n

\n

17.00<\/span><\/p>\n<\/td>\n

\n

17.10<\/span><\/p>\n<\/td>\n

\n

Closing (with award ceremony) Room: Venus<\/span><\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\n

[\/et_pb_text][\/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=”on|on|on” _builder_version=”4.18.0″ custom_padding=”0px|||||” disabled=”on” 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

All times are in Eastern European Summer Time (EEST)<\/strong><\/span><\/h3>\n

(UTC +3<\/strong>)<\/strong><\/span><\/h3>\n

[\/et_pb_text][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

Monday,\u00a010 May 2021<\/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.16″ custom_margin=”6px||6px||true|” global_colors_info=”{}”]<\/p>\n

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

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

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

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

11:00 – 11:45<\/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%” global_colors_info=”{}”]<\/p>\n

Virtual Gathering (Zoom)
<\/em><\/b><\/span><\/p>\n

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

[\/et_pb_text][et_pb_text _builder_version=”4.16″ width=”100%” global_colors_info=”{}”]<\/p>\n

Welcome \/ Opening\u00a0<\/b><\/span><\/p>\n

[\/et_pb_text][et_pb_text _builder_version=”4.16″ width=”100%” global_colors_info=”{}”]<\/p>\n

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

Invited Talk –\u00a0<\/b>Henning Fernau: <\/span><\/p>\n

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

Chair:\u00a0Tiziana\u00a0Calamoneri<\/span><\/p>\n

[\/et_pb_text][et_pb_button button_url=”https:\/\/youtu.be\/394XxKAPRi8″ url_new_window=”on” button_text=”Invited Talk 1″ _builder_version=”4.16″ custom_margin=”17px|||318px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][\/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.16″ custom_margin=”||-8px|||” global_colors_info=”{}”]<\/p>\n

11:45 – 12: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.16″ background_color=” #d68b1b” global_colors_info=”{}”]<\/p>\n

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

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

Session 1 –\u00a0Graph Theory & Discrete Optimization 1<\/strong><\/span><\/p>\n

Chair: Oleg Verbitsky<\/span><\/span><\/p>\n

Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity<\/strong><\/span><\/p>\n

Tatsuya Gima,\u00a0Tesshu Hanaka, Masashi Kiyomi,\u00a0Yasuaki Kobayashi\u00a0and\u00a0Yota Otachi<\/span><\/em><\/p>\n

Three problems on well-partitioned chordal graphs<\/strong><\/span><\/p>\n

Jungho Ahn,\u00a0Lars Jaffke,\u00a0O-Joung Kwon\u00a0and\u00a0Paloma de Lima<\/span><\/em><\/p>\n

On the Role of $3$’s for the 1-2-3 Conjecture<\/strong><\/span><\/p>\n

Julien Bensmail, Foivos Fioravantes and Fionn Mc Inerney<\/span><\/em><\/p>\n

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

[\/et_pb_text][et_pb_button button_url=”https:\/\/youtu.be\/n_a0nlOgEUs” url_new_window=”on” button_text=”Session 1 – Presentation 1 ” _builder_version=”4.16″ custom_margin=”17px|||260px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”https:\/\/youtu.be\/xtBadD8YQWE” url_new_window=”on” button_text=”Session 1 – Presentation 2″ _builder_version=”4.16″ custom_margin=”17px|||260px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”https:\/\/youtu.be\/Tmwtt0nyCAs” url_new_window=”on” button_text=”Session 1 – Presentation 3″ _builder_version=”4.16″ custom_margin=”17px|||260px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][\/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.16″ global_colors_info=”{}”]<\/p>\n

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

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

13:15 – 14:15<\/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

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

Chair: Oleg Verbitsky<\/span><\/p>\n

Online and approximate network construction from bounded connectivity constraints<\/strong><\/span><\/p>\n

Jesper Jansson, Christos Levcopoulos and Andrzej Lingas<\/span><\/em><\/p>\n

Algorithms for Energy Conservation in Heterogeneous Data Centers<\/strong><\/span><\/p>\n

Susanne Albers and Jens Quedenfeld<\/span><\/em><\/p>\n

Online Two-Dimensional Vector Packing with Advice<\/strong><\/span><\/p>\n

Bengt J. Nilsson and Gordana Vujovic<\/span><\/em><\/p>\n

[\/et_pb_text][et_pb_button button_url=”https:\/\/youtu.be\/BlZiWMf1gxc” url_new_window=”on” button_text=”Session 2 – Presentation 1″ _builder_version=”4.16″ custom_margin=”17px|||261px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”https:\/\/youtu.be\/Re_qY1WyNs8″ url_new_window=”on” button_text=”Session 2 – Presentation 2″ _builder_version=”4.16″ custom_margin=”17px|||260px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”https:\/\/youtu.be\/p3krYnXgth4″ url_new_window=”on” button_text=”Session 2 – Presentation 3″ _builder_version=”4.16″ custom_margin=”17px|||261px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][\/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.16″ global_colors_info=”{}”]<\/p>\n

14:15 – 15: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″ background_color=” #d68b1b” custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

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

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

Session 3 –\u00a0Exact and Parametrized Computation 1<\/strong><\/span><\/p>\n

Chair:\u00a0Bengt Nilsson<\/span><\/p>\n

FPT and kernelization algorithms for the Induced Tree problem<\/strong><\/span><\/p>\n

Guilherme de Castro Mendes Gomes,\u00a0Vinicius F. dos Santos,\u00a0Murilo Da Silva\u00a0and Jayme Szwarcfiter<\/em><\/span><\/p>\n

Circumventing Connectivity for Kernelization<\/strong><\/span><\/p>\n

Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy,\u00a0Saket Saurabh\u00a0and Roohani Sharma<\/em><\/span><\/p>\n

A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs<\/strong><\/span><\/p>\n

Rajesh Chitnis<\/em><\/span><\/p>\n

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

[\/et_pb_text][et_pb_button button_url=”https:\/\/youtu.be\/w7S4csozcjg” url_new_window=”on” button_text=”Session 3 – Presentation 1″ _builder_version=”4.16″ custom_margin=”17px|||261px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”https:\/\/youtu.be\/whc2nU8VKGs” url_new_window=”on” button_text=”Session 3 – Presentation 2″ _builder_version=”4.16″ custom_margin=”17px|||262px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][\/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.16″ global_colors_info=”{}”]<\/p>\n

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

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

16:45 – 17:25<\/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

Session 4 –\u00a0Analysis of Algorithms and Computational Complexity 1<\/strong><\/span><\/p>\n

Chair:\u00a0Bengt Nilsson<\/span><\/p>\n

Can Local Optimality Be Used for Efficient Data Reduction?<\/strong><\/span><\/p>\n

Christian Komusiewicz\u00a0and Nils Morawietz<\/span><\/em><\/p>\n

Fragile Complexity of Adaptive Algorithms<\/span><\/strong><\/p>\n

Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono,\u00a0Riko Jacob\u00a0and\u00a0Stefan Langerman<\/span><\/em><\/p>\n

[\/et_pb_text][et_pb_button button_url=”https:\/\/youtu.be\/t9yDh9I2RFc” url_new_window=”on” button_text=”Session 4 – Presentation 1″ _builder_version=”4.16″ custom_margin=”17px|||262px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”https:\/\/youtu.be\/DKOeewQQwJA” url_new_window=”on” button_text=”Session 4 – Presentation 2″ _builder_version=”4.16″ custom_margin=”17px|||260px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][\/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

Tuesday,\u00a011 May 2021<\/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.16″ custom_margin=”-7px||-7px||true|” custom_padding=”||18px|||” global_colors_info=”{}”]<\/p>\n

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

11:00 – 11:45<\/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>Katharina Huber:\u00a0<\/strong><\/span><\/p>\n

Phylogenetic Networks, A Way to Cope with Complex
Evolutionary Processes<\/strong><\/b><\/span><\/p>\n

Chair:\u00a0Philipp Kindermann<\/span><\/p>\n

[\/et_pb_text][et_pb_button button_url=”https:\/\/youtu.be\/Ukm3sQPgSPA” url_new_window=”on” button_text=”Invited Talk 2″ _builder_version=”4.16″ custom_margin=”17px|||293px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][\/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.16″ custom_margin=”||-8px|||” global_colors_info=”{}”]<\/p>\n

11:45 – 12: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.16″ background_color=” #d68b1b” global_colors_info=”{}”]<\/p>\n

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

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

Session 5 – Exact and Parametrized Computation 2<\/strong><\/span><\/p>\n

Chair:\u00a0Binh-Minh Bui-Xuan<\/span><\/p>\n

The Parameterized Suffix Tray<\/strong><\/span><\/p>\n

Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda<\/span><\/em><\/p>\n

On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering<\/strong><\/span><\/p>\n

Aleksander Figiel, Anne-Sophie Himmel,\u00a0Andr\u00e9 Nichterlein\u00a0and\u00a0Rolf Niedermeier<\/span><\/em><\/p>\n

A Multistage View on 2-Satisfiability<\/span><\/strong><\/p>\n

Till Fluschnik<\/span><\/em><\/p>\n

[\/et_pb_text][et_pb_button button_url=”https:\/\/youtu.be\/2764dCWihwU” url_new_window=”on” button_text=”Session 5 – Presentation 1″ _builder_version=”4.16″ custom_margin=”17px|||259px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”https:\/\/youtu.be\/o7tBX2naBN4″ url_new_window=”on” button_text=”Session 5 – Presentation 2″ _builder_version=”4.16″ custom_margin=”17px|||258px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][\/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.16″ custom_margin=”||-8px|||” global_colors_info=”{}”]<\/p>\n

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

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

13:15 – 13:55<\/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

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

Chair:\u00a0Binh-Minh Bui-Xuan<\/span><\/p>\n

The Multi-Budget Maximum Weighted Coverage Problem<\/strong><\/span><\/p>\n

Francesco Cellinese,\u00a0Gianlorenzo D’Angelo,\u00a0Gianpiero Monaco\u00a0and Yllka Velaj<\/span><\/em><\/p>\n

Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation<\/span><\/strong><\/p>\n

Louis Dublois,\u00a0Michael Lampis\u00a0and\u00a0Vangelis Paschos<\/span><\/em><\/p>\n

[\/et_pb_text][et_pb_button button_url=”https:\/\/youtu.be\/AqRLjGhvmiU” url_new_window=”on” button_text=”Session 6 – Presentation 1″ _builder_version=”4.16″ custom_margin=”17px|||253px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”https:\/\/youtu.be\/gN2yf-v0-mE” url_new_window=”on” button_text=”Session 6 – Presentation 2″ _builder_version=”4.16″ custom_margin=”17px|||251px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][\/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.16″ global_colors_info=”{}”]<\/p>\n

13:55 – 15: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″ background_color=” #d68b1b” custom_padding=”||0px|||” global_colors_info=”{}”]<\/p>\n

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

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

Session 7 – Analysis of Algorithms and Computational Complexity 2<\/strong><\/span><\/p>\n

Chair:\u00a0<\/strong><\/span>Vinicius Dos Santos<\/p>\n

Colouring Graphs of Bounded Diameter in the Absence of Small Cycles<\/strong><\/span><\/p>\n

Barnaby Martin,\u00a0Daniel Paulusma\u00a0and Siani Smith<\/span><\/em><\/p>\n

Distributed Distance-$r$ Covering Problems\\\\ on Sparse High-Girth Graphs<\/span><\/strong><\/p>\n

Saeed Akhoondian Amiri and Ben Wiederhake<\/span><\/em><\/p>\n

Upper Tail Analysis of Bucket Sort and Random Tries<\/span><\/strong><\/p>\n

Ioana Bercea\u00a0and\u00a0Guy Even<\/span><\/em><\/p>\n

[\/et_pb_text][et_pb_button button_url=”https:\/\/youtu.be\/Jgr3s2uFRPk” url_new_window=”on” button_text=”Session 7 – Presentation 1″ _builder_version=”4.16″ custom_margin=”17px|||262px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”https:\/\/youtu.be\/QqoVhgny1ng” url_new_window=”on” button_text=”Session 7 – Presentation 2″ _builder_version=”4.16″ custom_margin=”17px|||262px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”https:\/\/youtu.be\/vN6X6BC0Anc” url_new_window=”on” button_text=”Session 7 – Presentation 3″ _builder_version=”4.16″ custom_margin=”17px|||260px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][\/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.16″ custom_margin=”||-8px|||” global_colors_info=”{}”]<\/p>\n

16:30 – 16:45<\/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.16″ background_color=” #d68b1b” global_colors_info=”{}”]<\/p>\n

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

16:45 – 17:45<\/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

Session 8 – Graph Theory & Discrete Optimization 2<\/strong><\/span><\/p>\n

Chair:\u00a0Vinicius Dos Santos<\/span><\/p>\n

Globally rigid augmentation of minimally rigid graphs in R^2<\/strong><\/span><\/p>\n

Csaba Kir\u00e1ly and Andr\u00e1s Mih\u00e1lyk\u00f3<\/span><\/em><\/p>\n

The Weisfeiler-Leman Algorithm and Recognition of Graph Properties<\/strong><\/span><\/p>\n

Frank Fuhlbr\u00fcck,\u00a0Johannes Koebler,\u00a0Ilia Ponomarenko\u00a0and\u00a0Oleg Verbitsky<\/span><\/em><\/p>\n

Reconfiguration of Connected Graph Partitions via Recombination<\/strong><\/span><\/p>\n

Hugo Akitaya, Matias Korman, Oliver Korten,\u00a0Diane Souvaine\u00a0and\u00a0Csaba Toth<\/span><\/em><\/p>\n

[\/et_pb_text][et_pb_button button_url=”https:\/\/youtu.be\/sfHvUKlY4TI” url_new_window=”on” button_text=”Session 8 – Presentation 1″ _builder_version=”4.16″ custom_margin=”17px|||258px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”https:\/\/youtu.be\/_jFKo0YGXG4″ url_new_window=”on” button_text=”Session 8 – Presentation 2″ _builder_version=”4.16″ custom_margin=”17px|||259px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”https:\/\/youtu.be\/FfOMqwb346o” url_new_window=”on” button_text=”Session 8 – Presentation 3″ _builder_version=”4.16″ custom_margin=”17px|||259px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][\/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

Wednesday,\u00a012 May 2021<\/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.16″ custom_margin=”-7px||-7px||true|” custom_padding=”||18px|||” global_colors_info=”{}”]<\/p>\n

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

11:00 – 11:45<\/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>Joseph (Seffi) Naor:<\/span><\/p>\n

Recent Advances in Competitive Analysis of Online
Algorithms<\/strong><\/b><\/span><\/p>\n

Chair:\u00a0Guy Even<\/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.16″ custom_margin=”||-8px|||” global_colors_info=”{}”]<\/p>\n

11:45 – 12: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.16″ background_color=” #d68b1b” global_colors_info=”{}”]<\/p>\n

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

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

Session 9 – Graph Algorithms (Computational Geometry and Graph Drawing)<\/strong><\/span><\/p>\n

Chair:\u00a0Chryssis Georgiou<\/span><\/p>\n

Covering a set of line segments with a few squares<\/strong><\/span><\/p>\n

Joachim Gudmundsson, Mees van de Kerkhof, Andr\u00e9 van Renssen, Frank Staals, Lionov Wiratma and Sampson Wong<\/span><\/em><\/p>\n

Extending Partial Representations of Rectangular Duals with Given Contact Orientations<\/strong><\/span><\/p>\n

Jonathan Klawitter, Steven Chaplick,\u00a0Philipp Kindermann,\u00a0Ignaz Rutter\u00a0and\u00a0Alexander Wolff<\/span><\/em><\/p>\n

On Vertex-Weighted Graph Realizations<\/strong><\/span><\/p>\n

Amotz Bar-Noy, Toni B\u00f6hnlein,\u00a0David Peleg\u00a0and\u00a0Dror Rawitz<\/em><\/span><\/p>\n

[\/et_pb_text][et_pb_button button_url=”https:\/\/youtu.be\/7m6Lr-RBMAY” url_new_window=”on” button_text=”Session 9 – Presentation 2″ _builder_version=”4.16″ custom_margin=”17px|||253px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][\/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.16″ custom_margin=”||-8px|||” global_colors_info=”{}”]<\/p>\n

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

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

13:15 – 13:55<\/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

Session 10 – Approximation Algorithms 2<\/strong><\/span><\/p>\n

Chair:\u00a0Chryssis Georgiou<\/span><\/p>\n

Throughput Scheduling with Equal Additive Laxity<\/strong><\/span><\/p>\n

Martin B\u00f6hm, Nicole Megow and Jens Schl\u00f6ter<\/span><\/em><\/p>\n

Temporal Matching on Geometric Graph Data<\/span><\/strong><\/p>\n

Timoth\u00e9 Picavet, Ngoc-Trung Nguyen and\u00a0Binh-Minh Bui-Xuan<\/span><\/em><\/p>\n

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

[\/et_pb_text][et_pb_button button_url=”https:\/\/youtu.be\/DKqz-aq4RK0″ url_new_window=”on” button_text=”Session 10 – Presentation 1″ _builder_version=”4.16″ custom_margin=”17px|||257px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”https:\/\/youtu.be\/TtWZtDoOoH8″ url_new_window=”on” button_text=”Session 10 – Presentation 2″ _builder_version=”4.16″ custom_margin=”17px|||258px||” custom_padding=”0px|||||” global_colors_info=”{}”][\/et_pb_button][\/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.16″ global_colors_info=”{}”]<\/p>\n

13:55 – 14:05<\/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_section]<\/p>\n","protected":false},"excerpt":{"rendered":"

PROGRAM  Tuesday, October 24th 9.00 9.20 On-site registration 9.20 9.30 Opening – Room: Venus 09.30 11.00 Session 1: Microservices Room: Venus Chair: A. Samir (long) \u03bcXL: Explainable Lead Generation with Microservices and Hypothetical Answers (L. Cruz-Filipe, S. Kostopoulou, F. Montesi, J. Vistrup) (long) One Microservice per Developer: Is This the Trend? (D. Amoroso d’Aragona, X. […]<\/p>\n","protected":false},"author":3,"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":""},"_links":{"self":[{"href":"https:\/\/cyprusconferences.org\/esocc2023\/wp-json\/wp\/v2\/pages\/10"}],"collection":[{"href":"https:\/\/cyprusconferences.org\/esocc2023\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/cyprusconferences.org\/esocc2023\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/cyprusconferences.org\/esocc2023\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/cyprusconferences.org\/esocc2023\/wp-json\/wp\/v2\/comments?post=10"}],"version-history":[{"count":71,"href":"https:\/\/cyprusconferences.org\/esocc2023\/wp-json\/wp\/v2\/pages\/10\/revisions"}],"predecessor-version":[{"id":243878,"href":"https:\/\/cyprusconferences.org\/esocc2023\/wp-json\/wp\/v2\/pages\/10\/revisions\/243878"}],"wp:attachment":[{"href":"https:\/\/cyprusconferences.org\/esocc2023\/wp-json\/wp\/v2\/media?parent=10"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}