{"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":"2021-01-11T19:39:49","modified_gmt":"2021-01-11T19:39:49","slug":"accepted-papers","status":"publish","type":"page","link":"https:\/\/easyconferences.eu\/ciac2021\/accepted-papers\/","title":{"rendered":"Accepted Papers"},"content":{"rendered":"

[et_pb_section fb_built=”1″ _builder_version=”4.3.3″ custom_padding=”||2px|||” top_divider_style=”wave2″ top_divider_color=”#e09900″][et_pb_row _builder_version=”4.3.3″][et_pb_column type=”4_4″ _builder_version=”4.3.3″][et_pb_text _builder_version=”4.3.3″ hover_enabled=”0″]<\/p>\n

Accepted Papers<\/h1>\n

[\/et_pb_text][et_pb_divider color=”#e09900″ _builder_version=”4.3.3″][\/et_pb_divider][\/et_pb_column][\/et_pb_row][et_pb_row _builder_version=”4.3.3″ hover_enabled=”0″ column_structure=”1_2,1_2″][et_pb_column type=”1_2″ _builder_version=”4.3.3″][et_pb_text _builder_version=”4.3.3″]<\/p>\n

\n

Online Two-Dimensional Vector Packing with Advice<\/span><\/strong>
Bengt J. Nilsson and Gordana Vujovic<\/span><\/span><\/p>\n

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

<\/span><\/strong><\/div>\n
<\/span><\/strong><\/div>\n
<\/span><\/strong><\/div>\n
\n

Amotz Bar-Noy<\/a>, Toni B\u00f6hnlein, David Peleg<\/a> and Dror Rawitz<\/a><\/span><\/span><\/span><\/strong><\/span><\/span><\/p>\n

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

Guilherme de Castro Mendes Gomes, Vinicius F. dos Santos<\/a>, Murilo Da Silva<\/a> and Jayme Szwarcfiter<\/span>.<\/span><\/div>\n
\u00a0<\/span><\/div>\n
\n

Temporal Matching on Geometric Graph Data<\/span><\/strong>
Timoth\u00e9 Picavet, Ngoc-Trung Nguyen and Binh-Minh Bui-Xuan<\/a><\/span>.<\/span><\/p>\n<\/div>\n

<\/span><\/span><\/div>\n
\n

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

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

<\/span><\/div>\n
\n


<\/span>Throughput Scheduling with Equal Additive Laxity<\/span><\/strong>
Martin B\u00f6hm, Nicole Megow and Jens Schl\u00f6ter<\/span><\/span><\/p>\n

Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation<\/span><\/strong>
Louis Dublois, Michael Lampis<\/a> and Vangelis Paschos<\/a><\/span><\/span><\/p>\n

On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering<\/span><\/strong>
Aleksander Figiel, Anne-Sophie Himmel, Andr\u00e9 Nichterlein<\/a> and Rolf Niedermeier
<\/a><\/span><\/span><\/p>\n<\/div>\n

\n


On the Role of $3$’s for the 1-2-3 Conjecture<\/span><\/strong>
Julien Bensmail, Foivos Fioravantes and Fionn Mc Inerney
<\/span><\/span>\u00a0<\/p>\n<\/div>\n

\n

Globally rigid augmentation of minimally rigid graphs in R^2<\/span><\/strong>
Csaba Kir\u00e1ly and Andr\u00e1s Mih\u00e1lyk\u00f3
<\/span><\/span><\/span>
Extending Partial Representations of Rectangular Duals with Given Contact Orientations
<\/span><\/strong><\/span><\/span>Jonathan Klawitter<\/a>, Steven Chaplick, Philipp Kindermann<\/a>, Ignaz Rutter<\/a> and Alexander Wolff
<\/a><\/span><\/span><\/span>
Can Local Optimality Be Used for Efficient Data Reduction?
<\/span><\/strong><\/span>Christian Komusiewicz<\/a> and Nils Morawietz<\/span>.<\/span><\/p>\n<\/div>\n

\u00a0<\/span><\/div>\n
\n

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

[\/et_pb_text][\/et_pb_column][et_pb_column _builder_version=”4.3.3″ type=”1_2″ hover_enabled=”0″][et_pb_text _builder_version=”4.3.3″ hover_enabled=”0″]<\/p>\n

\n

The Weisfeiler-Leman Algorithm and Recognition of Graph Properties<\/span><\/strong>
Frank Fuhlbr\u00fcck<\/a>, Johannes Koebler<\/a>, Ilia Ponomarenko<\/a> and Oleg Verbitsky<\/p>\n

<\/a><\/span><\/span>Reconfiguration of Connected Graph Partitions via Recombination<\/strong>
<\/span>Hugo Akitaya<\/a>, Matias Korman, Oliver Korten, Diane Souvaine<\/a> and Csaba Toth<\/a><\/span><\/span><\/span><\/p>\n<\/div>\n

\n

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

\n

Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity<\/span><\/strong>
Tatsuya Gima, Tesshu Hanaka<\/a>, Masashi Kiyomi, Yasuaki Kobayashi<\/a> and Yota Otachi<\/p>\n

<\/a><\/span><\/span><\/span><\/p>\n<\/div>\n

\n

Colouring Graphs of Bounded Diameter in the Absence of Small Cycles<\/span><\/strong>
Barnaby Martin<\/a>, Daniel Paulusma<\/a> and Siani Smith<\/span><\/span><\/span><\/p>\n<\/div>\n

\n


Circumventing Connectivity for Kernelization<\/span><\/strong>
Pallavi Jain<\/a>, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh<\/a> and Roohani Sharma<\/span><\/span><\/span><\/p>\n<\/div>\n

\n


The Parameterized Suffix Tray<\/span><\/strong>
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
<\/span><\/span><\/span>\u00a0<\/p>\n<\/div>\n

\n

Algorithms for Energy Conservation in Heterogeneous Data Centers<\/span><\/strong>
Susanne Albers and Jens Quedenfeld
<\/span><\/span><\/span>\u00a0<\/p>\n<\/div>\n

\n

Online and approximate network construction from bounded connectivity constraints<\/span><\/strong>
Jesper Jansson, Christos Levcopoulos and Andrzej Lingas
<\/span><\/span><\/span>\u00a0<\/p>\n<\/div>\n

\n

The Multi-Budget Maximum Weighted Coverage Problem<\/span><\/strong>
Francesco Cellinese, Gianlorenzo D’Angelo<\/a>, Gianpiero Monaco<\/a> and Yllka Velaj
<\/span><\/span><\/span>\u00a0<\/p>\n<\/div>\n

\n

Three problems on well-partitioned chordal graphs<\/span><\/strong>
Jungho Ahn<\/a>, Lars Jaffke<\/a>, O-Joung Kwon<\/a> and Paloma de Lima
<\/a><\/span><\/span><\/span>\u00a0<\/p>\n<\/div>\n

\n

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

\n

Distributed Distance-$r$ Covering Problems\\\\ on Sparse High-Girth Graphs<\/span><\/strong>
Saeed Akhoondian Amiri and Ben Wiederhake
<\/span><\/span><\/span>\u00a0<\/p>\n<\/div>\n

\n

Upper Tail Analysis of Bucket Sort and Random Tries<\/span><\/strong>
Ioana Bercea<\/a> and Guy Even
<\/a><\/span><\/span><\/span>\u00a0<\/p>\n<\/div>\n

Fragile Complexity of Adaptive Algorithms<\/span><\/strong>
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob<\/a> and Stefan Langerman<\/a><\/span><\/span><\/div>\n

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

Accepted Papers Online Two-Dimensional Vector Packing with AdviceBengt J. Nilsson and Gordana Vujovic On Vertex-Weighted Graph Realizations Amotz Bar-Noy, Toni B\u00f6hnlein, David Peleg and Dror Rawitz FPT and kernelization algorithms for the Induced Tree problem Guilherme de Castro Mendes Gomes, Vinicius F. dos Santos, Murilo Da Silva and Jayme Szwarcfiter. \u00a0 Temporal Matching on Geometric […]<\/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\/ciac2021\/wp-json\/wp\/v2\/pages\/361"}],"collection":[{"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/comments?post=361"}],"version-history":[{"count":6,"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/pages\/361\/revisions"}],"predecessor-version":[{"id":373,"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/pages\/361\/revisions\/373"}],"wp:attachment":[{"href":"https:\/\/easyconferences.eu\/ciac2021\/wp-json\/wp\/v2\/media?parent=361"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}