{"id":361,"date":"2021-01-11T19:22:58","date_gmt":"2021-01-11T19:22:58","guid":{"rendered":"http:\/\/easyconferences.eu\/ciac2021\/?page_id=361"},"modified":"2023-02-22T09:17:14","modified_gmt":"2023-02-22T09:17:14","slug":"accepted-papers","status":"publish","type":"page","link":"https:\/\/easyconferences.eu\/ciac2023\/accepted-papers\/","title":{"rendered":"Accepted Papers"},"content":{"rendered":"

[et_pb_section fb_built=”1″ _builder_version=”4.20.0″ custom_padding=”||2px|||” top_divider_style=”wave2″ top_divider_color=”#5390c1″ global_colors_info=”{}”][et_pb_row _builder_version=”4.16″ 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

Accepted Papers<\/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_row _builder_version=”4.20.0″ _module_preset=”default” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.20.0″ _module_preset=”default” global_colors_info=”{}”][et_pb_text _builder_version=”4.20.0″ _module_preset=”default” global_colors_info=”{}”]<\/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

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Yaroslav Alekseev and Edward A. Hirsch. The power of the Binary Value Principle<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Nader Bshouty. On One-Sided Testing Affine Subspaces<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano and Reo Nonoue. Independent Set under a Change Constraint from an Initial Solution<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Victor Pan, Soo Go, Qi Luan and Liang Zhao. Fast Subdivision Root-finding for a Black Box Polynomial: Cauchy Sum Algorithms<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Hovhannes Harutyunyan and Narek Hovhannisyan. Broadcasting in Split Graphs<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Muhammad Nur Yanhaona, Asswad Sarker Nomaan and Md. Saidur Rahman. Efficiently Enumerating All Spanning Trees of a Plane 3-Tree<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Manish Kumar, Anisur Rahaman Molla and Sumathi Sivasubramaniam. Improved Deterministic Leader Election in Diameter-Two Networks<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh and Shaily Verma. Partitioning Subclasses of Chordal Graphs with Few Deletions<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Lorenzo Balzotti and Paolo G. Franciosa. Non-Crossing Shortest Paths Lengths in Planar Graphs in Linear Time<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski and Pavan Poudel. Stable Scheduling in Transactional Memory<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Chun Jiang Zhu. Communication-Efficient Distributed Graph Clustering and Sparsification under Duplication Models<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Eric Fusy and Gregory.<\/u> Kucherov. Phase transition in count approximation by Count-Min sketch with conservative updates<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Hag<\/u>i<\/u>t Attiya<\/u> and Noa Schiller. Asynchronous Fully-Decentralized SGD in the Cluster-Based Model<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Tai Ben-Nun, Lukas Gianinazzi, Torsten Hoefler and Yishai Oltchik. Maxflows in Parametric Graph Templates<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Pascal Koiran and Subhayan Saha. Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision<\/p>\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya and Rajath Rao. Parameterizing Path Partitions<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Simon D. Fink and Ignaz Rutter. Maintaining Triconnected Components under Node Expansion<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Sriram Bhyravarapu, Swati Kumari and Vinod Reddy. Dynamic Coloring on Restricted Graph Classes<\/p>\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Ivan Bliznets, Danil Sagunov and Eugene Tagin. Enumeration of Minimal Tropical Connected Sets<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Kerem Geva, Matthew Katz, Jose<\/u>p<\/u>h<\/u> Mitchell and Eli Packer. Minimum-link $C$-Oriented Paths Visiting a Sequence of Regions in the Plane<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Emmanuel Sam, Michael Fellows, Petr A. Golovach and Frances Rosamond. On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Lorenzo Balzotti and Paolo G. Franciosa. How Vulnerable is an Undirected Planar Graph with respect to Max Flow<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Toshihiro Fujito, Kento Mukae and Junya Tsuzuki. Approximating Power Node-Deletion Problems<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Thomas Blasius, Adrian Feilhauer and Jannik Westenfelder. Dynamic Flows with Time-Dependent Capacities<\/p>\n<\/td>\n<\/tr>\n

\n

\u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Tesshu Hanaka, Hirotaka Ono, Yota Otachi and Saeki Uda. Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

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

Accepted Papers \u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Yaroslav Alekseev and Edward A. Hirsch. The power of the Binary Value Principle \u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Nader Bshouty. On One-Sided Testing Affine Subspaces \u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano and Reo Nonoue. Independent Set under a Change Constraint from an Initial Solution \u00b7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Victor Pan, Soo Go, Qi Luan […]<\/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\/361"}],"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=361"}],"version-history":[{"count":9,"href":"https:\/\/easyconferences.eu\/ciac2023\/wp-json\/wp\/v2\/pages\/361\/revisions"}],"predecessor-version":[{"id":243651,"href":"https:\/\/easyconferences.eu\/ciac2023\/wp-json\/wp\/v2\/pages\/361\/revisions\/243651"}],"wp:attachment":[{"href":"https:\/\/easyconferences.eu\/ciac2023\/wp-json\/wp\/v2\/media?parent=361"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}