{"id":227,"date":"2021-05-04T18:51:07","date_gmt":"2021-05-04T16:51:07","guid":{"rendered":"https:\/\/wg2021.mimuw.edu.pl\/?page_id=227"},"modified":"2021-06-11T02:03:11","modified_gmt":"2021-06-11T00:03:11","slug":"accepted-papers","status":"publish","type":"page","link":"https:\/\/wg2021.mimuw.edu.pl\/accepted-papers\/","title":{"rendered":"Accepted papers"},"content":{"rendered":"
\n
\n\n

Accepted papers<\/h2>\n\n\n\n
\n
\n
\n
Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation<\/div>\n
Hans L. Bodlaender<\/div>\n<\/div>\n\n\n
\n
Beyond Helly graphs: the diameter problem on absolute retracts<\/div>\n
Guillaume Ducoffe<\/div>\n<\/div>\n\n\n
\n
Complementation in T-perfect Graphs<\/div>\n
Yixin Cao and Shenghua Wang<\/div>\n<\/div>\n\n\n
\n
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set<\/div>\n
Huib Donkers and Bart M. P. Jansen<\/div>\n<\/div>\n\n\n
\n
The Complexity of Gerrymandering over Graphs: Paths and Trees<\/div>\n
Matthias Bentert, Tomohiro Koana and Rolf Niedermeier<\/div>\n<\/div>\n\n\n
\n
The Graphs of Stably Matchable Pairs<\/div>\n
David Eppstein<\/div>\n<\/div>\n\n\n
\n
Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs<\/div>\n
Fedor Fomin, Petr Golovach and Dimitrios Thilikos<\/div>\n<\/div>\n\n\n
\n
Linearizable special cases of the quadratic shortest path problem<\/div>\n
Eranda Cela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger and Lasse Wulf<\/div>\n<\/div>\n\n\n
\n
A linear-time parameterized algorithm for computing the width of a DAG<\/div>\n
Manuel C\u00e1ceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi and Alexandru I. Tomescu<\/div>\n<\/div>\n\n\n
\n
Block Elimination Distance<\/div>\n
\u00d6znur Ya\u015far Diner, Archontia Giannopoulou, Giannos Stamoulis and Dimitrios Thilikos<\/div>\n<\/div>\n\n\n
\n
On Morphing 1-Planar Drawings<\/div>\n
Patrizio Angelini, Michael Bekos, Fabrizio Montecchiani and Maximilian Pfister<\/div>\n<\/div>\n\n\n
\n
On Fair Covering and Hitting Problems<\/div>\n
Sayan Bandyapadhyay, Aritra Banik and Sujoy Bhore<\/div>\n<\/div>\n\n\n
\n
A heuristic approach to the treedepth decomposition problem for large graphs<\/div>\n
Sylwester Swat and Marta Kasprzak<\/div>\n<\/div>\n\n\n
\n
The Largest Connected Subgraph Game<\/div>\n
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney and Nicolas Nisse<\/div>\n<\/div>\n\n\n
\n
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem<\/div>\n
Isja Mannens, Jesper Nederlof, C\u00e9line Swennenhuis and Krisztina Szilagyi<\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
On 3-Coloring of (2P_4 ,C_5)-Free Graphs<\/div>\n
V\u00edt Jel\u00ednek, Tereza Klimo\u0161ov\u00e1, Tom\u00e1\u0161 Masa\u0159\u00edk, Jana Novotn\u00e1 and Aneta Pokorn\u00e1<\/div>\n<\/div>\n\n\n
\n
Feedback Vertex Set on Hamiltonian Graphs<\/div>\n
Dario Cavallaro and Till Fluschnik<\/div>\n<\/div>\n\n\n
\n
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality<\/div>\n
Maciej Rymar, Hendrik Molter, Andr\u00e9 Nichterlein and Rolf Niedermeier<\/div>\n<\/div>\n\n\n
\n
The Perfect Matching Cut Problem Revisited<\/div>\n
Van Bang Le and Jan Arne Telle<\/div>\n<\/div>\n\n\n
\n
Completion to chordal distance-hereditary graphs: a quartic vertex-kernel<\/div>\n
Christophe Crespelle, Benjamin Gras and Anthony Perez<\/div>\n<\/div>\n\n\n
\n
Bears with Hats and Independence Polynomials<\/div>\n
V\u00e1clav Bla\u017eej, Pavel Dvo\u0159\u00e1k and Michal Opler<\/div>\n<\/div>\n\n\n
\n
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More<\/div>\n
Bart M. P. Jansen and Jari J.H. de Kroon<\/div>\n<\/div>\n\n\n
\n
Labeling Schemes for Deterministic Radio Multi-Broadcast<\/div>\n
Colin Krisko and Avery Miller<\/div>\n<\/div>\n\n\n
\n
Interdicting Small (s,t)-Cuts by Protecting Edges<\/div>\n
Niels Gr\u00fcttemeier, Christian Komusiewicz, Nils Morawietz and Frank Sommer<\/div>\n<\/div>\n\n\n
\n
Sparse and Lightweight Spanners in Weighted Graphs with Local Additive Error<\/div>\n
Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen Kobourov and Richard Spence<\/div>\n<\/div>\n\n\n
\n
Acyclic, Star, and Injective Colouring: Bounding the Diameter<\/div>\n
Christoph Brause, Petr Golovach, Barnaby Martin, Daniel Paulusma and Siani Smith<\/div>\n<\/div>\n\n\n
\n
On subgraph complementation to H-free graphs<\/div>\n
Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R B Sandeep, Sagnik Sen and R Subashini<\/div>\n<\/div>\n\n\n
\n
The Dynamic Complexity of Acyclic Hypergraph Homomorphisms<\/div>\n
Nils Vortmeier and Ioannis Kokkinis<\/div>\n<\/div>\n\n\n
\n
Disjoint Stable Matchings in Linear Time<\/div>\n
Aadityan Ganesh, Vishwa Prakash Hv, Prajakta Nimbhorkar and Geevarghese Philip<\/div>\n<\/div>\n\n\n
\n
Odd Cycle Transversal in Mixed Graphs<\/div>\n
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil and Saket Saurabh<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n<\/div><\/div><\/div>","protected":false},"excerpt":{"rendered":"","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"_links":{"self":[{"href":"https:\/\/wg2021.mimuw.edu.pl\/wp-json\/wp\/v2\/pages\/227"}],"collection":[{"href":"https:\/\/wg2021.mimuw.edu.pl\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/wg2021.mimuw.edu.pl\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/wg2021.mimuw.edu.pl\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/wg2021.mimuw.edu.pl\/wp-json\/wp\/v2\/comments?post=227"}],"version-history":[{"count":5,"href":"https:\/\/wg2021.mimuw.edu.pl\/wp-json\/wp\/v2\/pages\/227\/revisions"}],"predecessor-version":[{"id":332,"href":"https:\/\/wg2021.mimuw.edu.pl\/wp-json\/wp\/v2\/pages\/227\/revisions\/332"}],"wp:attachment":[{"href":"https:\/\/wg2021.mimuw.edu.pl\/wp-json\/wp\/v2\/media?parent=227"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}