{"id":339,"date":"2022-10-26T21:54:52","date_gmt":"2022-10-26T19:54:52","guid":{"rendered":"https:\/\/ics.science.upjs.sk\/sofsem2023\/?page_id=339"},"modified":"2022-10-27T07:17:46","modified_gmt":"2022-10-27T05:17:46","slug":"program","status":"publish","type":"page","link":"https:\/\/ics.science.upjs.sk\/sofsem2023\/program\/","title":{"rendered":"Program"},"content":{"rendered":"<h3><span style=\"color: #0000ff;\"><strong>Sunday, January 15, 2023<\/strong><\/span><\/h3>\n<p>18:00 Reception<\/p>\n<p><strong>\u00a0<\/strong><\/p>\n<h3><span style=\"color: #0000ff;\"><strong>Monday, January 16, 2023<\/strong><\/span><\/h3>\n<p>08:45 \u2013 09:00 <strong>Official Opening<\/strong><\/p>\n<p>09:00 \u2013 10:00 <strong>Invited Talk: V\u011bra K\u016frkov\u00e1<\/strong> (Some implications of high-dimensional geometry for classification by neural networks)<\/p>\n<p>10:00 \u2013 10:30 Coffee break<\/p>\n<p>10:30 \u2013 12:10<strong> Session 1 <\/strong>(4 x 25 min)<\/p>\n<ul>\n<li><strong>The Complexity of Finding Tangles<\/strong> (Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff and Johannes Zink)<\/li>\n<li><strong>A spectral algorithm for finding maximum cliques in dense random intersection graphs<\/strong> (Filippos Christodoulou, Sotiris Nikoletseas, Christoforos Raptopoulos and Paul Spirakis)<\/li>\n<li><strong>Solving Cut-Problems in Quadratic Time for Graphs With Bounded Treewidth<\/strong> (Hauke Brinkop and Klaus Jansen)<\/li>\n<li><strong>More Effort Towards Multiagent Knapsack<\/strong> (Sushmita Gupta, Pallavi Jain and Sanjay Seetharaman)<\/li>\n<\/ul>\n<p>12:30 \u2013 14:00 Lunch<\/p>\n<p>14:00 \u2013 15:40<strong> Session 2<\/strong> (4 x 25 min)<\/p>\n<ul>\n<li><strong>Dominance Drawings for DAGs with Bounded Modular Width<\/strong> (Giacomo Ortali and Ioannis Tollis)<\/li>\n<li><strong>Morphing Planar Graph Drawings Through 3D<\/strong> (Kevin Buchin, William Evans, Fabrizio Frati, Irina Kostitsyna, Maarten L\u00f6ffler, Tim Ophelders and Alexander Wolff)<\/li>\n<li><strong>Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees<\/strong> (Jonathan Klawitter, Felix Klesen, Moritz Niederer and Alexander Wolff)<\/li>\n<li><strong>Parameterized Approaches to Orthogonal Compaction<\/strong> (Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff and Meirav Zehavi)<\/li>\n<\/ul>\n<p>15:40 \u2013 16:15 Coffee break<\/p>\n<p>16:15 \u2013 17:30<strong> Session 3<\/strong> (3 x 25 min)<\/p>\n<ul>\n<li><strong>Hardness of bounding influence via graph modification <\/strong>(Robert Barish and Tetsuo Shibuya)<\/li>\n<li><strong>Heuristics for Opinion Diffusion via Local Elections <\/strong>(Rica Gonen, Martin Koutecky, Roei Menashof and Nimrod Talmon)<\/li>\n<li><strong>On the Parameterized Complexity of $s$-club Cluster Deletion Problems <\/strong>(Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli and Alessandra Tappini)<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<h3><span style=\"color: #0000ff;\"><strong>Tuesday, January 17, 2023<\/strong><\/span><\/h3>\n<p>08:30 \u2013 12:30 <a href=\"https:\/\/ics.science.upjs.sk\/sofsem2023\/about\/social-events\/\">Social events<\/a><\/p>\n<p>12:30 \u2013 14:00 Lunch<\/p>\n<p>14:00 \u2013 15:00 <strong>Invited talk: Gerth St\u00f8lting Brodal<\/strong> (Data Structure Design \u2013 Theory and Practice)<\/p>\n<p>15:00 \u2013 15:30 Coffee break<\/p>\n<p>15:30 \u2013 16:30 <strong>Best papers <\/strong>(2 x 30 min)<\/p>\n<ul>\n<li><strong>Balanced Substructures in Bicolored Graphs <\/strong>(P. S. Ardra, R. Krithika, Saket Saurabh and Roohani Sharma)<\/li>\n<li><strong>On the Complexity of Scheduling Problems With a Fixed Number of Parallel Identical Machines <\/strong>(Kai Kahler and Klaus Jansen)<\/li>\n<\/ul>\n<p>16:30 \u2013 17:30 <strong>Best student papers<\/strong> (2 x 30 min)<\/p>\n<ul>\n<li><strong>On the 2-Layer Window Width Minimization Problem <\/strong>(Michael Bekos, Henry F\u00f6rster, Michael Kaufmann, Stephen Kobourov, Myroslav Kryven, Axel Kuckuk and Lena Schlipf)<\/li>\n<li><strong>Sequentially Swapping Tokens: Further on Graph Classes <\/strong>(Hironori Kiya, Yuto Okada, Hirotaka Ono and Yota Otachi)<\/li>\n<\/ul>\n<p>18:00 <strong>Business meeting and conference banquet<\/strong><\/p>\n<p>&nbsp;<\/p>\n<h3><span style=\"color: #0000ff;\"><strong>Wednesday, January 18, 2023<\/strong><\/span><\/h3>\n<p>09:00 \u2013 10:00 <strong>Invited talk: S\u0142awomir Lasota <\/strong>(Ackermannian lower bound for the reachability problem of Petri nets)<\/p>\n<p>10:00 \u2013 10:30 Coffee break<\/p>\n<p>10:30 \u2013 12:10 <strong>Session 6 <\/strong>(4 x 25 min)<\/p>\n<ul>\n<li><strong>On the Preservation of Properties when Changing Communication Models<\/strong> (Olav Bunte, Louis van Gool and Tim Willemse)<\/li>\n<li><strong>Introduction to Routing Problems with Mandatory Transitions <\/strong>(Timoth\u00e9e Martinod and Christian Laforest)<\/li>\n<li><strong>Payment Scheduling in the Interval Debt Model<\/strong> (Tom Friedetzky, David Kutner, George Mertzios, Iain Stewart and Amitabh Trehan)<\/li>\n<li><strong>Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs <\/strong>(Emmanuel Arrighi, Niels Gr\u00fcttemeier, Nils Morawietz, Frank Sommer and Petra Wolf)<\/li>\n<\/ul>\n<p>12:30 \u2013 14:00 Lunch<\/p>\n<p>14:00 \u2013 15:40 <strong>Session 7<\/strong> (4 x 25 min)<\/p>\n<ul>\n<li><strong>Lower Bounds for Monotone $q$-Multilinear Boolean Circuits <\/strong>(Andrzej Lingas)<\/li>\n<li><strong>A faster algorithm for determining the linear feasibility of systems of BTVPI constraints <\/strong>(Piotr Wojciechowski and K. Subramani)<\/li>\n<li><strong>Quantum complexity for vector domination problem<\/strong> (Andris Ambainis and Ansis Zvirbulis)<\/li>\n<li><strong>Learning through Imitation by using Formal Verification<\/strong> (Avraham Raviv, Eliya Bronshtein, Or Reginiano, Michelle Aluf-Medina and Hillel Kugler)<\/li>\n<\/ul>\n<p>15:40 \u2013 16:15 Coffee break<\/p>\n<p>16:15 \u2013 17:30 <strong>Session 8<\/strong> (3 x 25 min)<\/p>\n<ul>\n<li><strong>Delivery to Safety with Two Cooperating Robots <\/strong>(Jared Coleman, Evangelos Kranakis, Danny Krizanc and Oscar Morales Ponce)<\/li>\n<li><strong>Space-Efficient STR-IC-LCS Computation <\/strong>(Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga and Hideo Bannai)<\/li>\n<li><strong>The k-center Problem for Classes of Cyclic Words <\/strong>(Duncan Adamson, Argyrios Deligkas, Vladimir Gusev and Igor Potapov)<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Sunday, January 15, 2023 18:00 Reception \u00a0 Monday, January 16, 2023 08:45 \u2013 09:00 Official Opening 09:00 \u2013 10:00 Invited Talk: V\u011bra K\u016frkov\u00e1 (Some implications of high-dimensional geometry for classification&hellip;<\/p>\n","protected":false},"author":12,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-339","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/ics.science.upjs.sk\/sofsem2023\/wp-json\/wp\/v2\/pages\/339","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/ics.science.upjs.sk\/sofsem2023\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/ics.science.upjs.sk\/sofsem2023\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/ics.science.upjs.sk\/sofsem2023\/wp-json\/wp\/v2\/users\/12"}],"replies":[{"embeddable":true,"href":"https:\/\/ics.science.upjs.sk\/sofsem2023\/wp-json\/wp\/v2\/comments?post=339"}],"version-history":[{"count":2,"href":"https:\/\/ics.science.upjs.sk\/sofsem2023\/wp-json\/wp\/v2\/pages\/339\/revisions"}],"predecessor-version":[{"id":343,"href":"https:\/\/ics.science.upjs.sk\/sofsem2023\/wp-json\/wp\/v2\/pages\/339\/revisions\/343"}],"wp:attachment":[{"href":"https:\/\/ics.science.upjs.sk\/sofsem2023\/wp-json\/wp\/v2\/media?parent=339"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}