{"id":356,"date":"2023-04-28T13:27:56","date_gmt":"2023-04-28T11:27:56","guid":{"rendered":"https:\/\/events.unifr.ch\/wg2023\/?page_id=356"},"modified":"2023-05-30T09:35:53","modified_gmt":"2023-05-30T07:35:53","slug":"accepted-papers","status":"publish","type":"page","link":"https:\/\/events.unifr.ch\/wg2023\/?page_id=356","title":{"rendered":"Accepted Papers"},"content":{"rendered":"\n
\n
\n

Below you find the list of accepted papers. The abstracts of the accepted papers are available here<\/a>.<\/p>\n\n\n\n

    \n\t
  1. Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar and Kirill Simonov<\/span>. <\/span>Proportionally Fair Matching with Multiple Groups<\/span><\/div><\/li>\n\t
  2. Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc van Kreveld, Isja Mannens and Jordi Vermeulen<\/span>.
    <\/span>Reconstructing Graphs from Connected Triples<\/span><\/div><\/li>\n\t
  3. Jakob Baumann, Matthias Pfretzschner and Ignaz Rutter<\/span>. <\/span>Parameterized Complexity of Vertex Splitting to Pathwidth at most 1<\/span><\/div><\/li>\n\t
  4. R\u00e9my Belmonte, Ararat Harutyunyan, Noleen K\u00f6hler and Nikolaos Melissinos<\/span>. <\/span>Odd Chromatic Number of Graph Classes<\/span><\/div><\/li>\n\t
  5. Julien Bensmail, Victor Campos, Ana Karolinna Maia, Nicolas Nisse and Ana Silva<\/span>. <\/span>Deciding the Erdo\u030bs-P\u00f3sa property in 3-connected digraphs<\/span><\/div><\/li>\n\t
  6. Benjamin Bergougnoux, Tuukka Korhonen and Igor Razgon<\/span>. <\/span>New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth<\/span><\/div><\/li>\n\t
  7. Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin and Alessandra Tappini<\/span>.
    <\/span>Nonplanar Graph Drawings with k Vertices per Face<\/span><\/div><\/li>\n\t
  8. Jan Bok, Jiri Fiala, Nikola Jedlickova, Jan Kratochvil and Michaela Seifrtova<\/span>.
    <\/span>Computational Complexity of Covering Colored Mixed Multigraphs with Small Equivalence Classes in Degree Partition<\/span><\/div><\/li>\n\t
  9. \u00c9douard Bonnet, Dibyayan Chakraborty and Julien Duron<\/span>. <\/span>Cutting Barnette graphs perfectly is hard<\/span><\/div><\/li>\n\t
  10. Nicolas Bousquet, Quentin Deschamps and Aline Parreau<\/span>. <\/span>Metric dimension parameterized by treewidth in chordal graphs<\/span><\/div><\/li>\n\t
  11. Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits and Ziena Zeif<\/span>.
    <\/span>Efficient Constructions for the Gyori-Lovasz Theorem on Almost Chordal Graphs<\/span><\/div><\/li>\n\t
  12. Radovan \u010cerven\u00fd and Ond\u0159ej Such\u00fd<\/span>. <\/span>Generating faster algorithms for d-Path Vertex Cover<\/span><\/div><\/li>\n\t
  13. Yeonsu Chang, O-Joung Kwon and Myounghwan Lee<\/span>. <\/span>A new width parameter of graphs based on edge cuts: \u03b1-edge-crossing width<\/span><\/div><\/li>\n\t
  14. Steven Chaplick, Steven Kelk, Ruben Meuwese, Matus Mihalak and Georgios Stamoulis<\/span>. <\/span>Snakes and Ladders: a Treewidth Story<\/span><\/div><\/li>\n\t
  15. Juhi Chaudhary and Meirav Zehavi<\/span>. <\/span>Parameterized Results on Acyclic Matchings with Implications for Related Problems<\/span><\/div><\/li>\n\t
  16. Juhi Chaudhary and Meirav Zehavi<\/span>. <\/span>P-matchings Parameterized by Treewidth<\/span><\/div><\/li>\n\t
  17. Antoine Dailly, Florent Foucaud and Anni Hakanen<\/span>. <\/span>Algorithms and hardness for Metric Dimension on digraphs<\/span><\/div><\/li>\n\t
  18. Tom Davot, Lucas Isenmann, Sanjukta Roy and Jocelyn Thiebaut<\/span>. <\/span>Degreewidth: a New Parameter for Solving Problems on Tournaments<\/span><\/div>\t<\/li>\n\t
  19. Ilan Doron-Arad and Hadas Shachnai<\/span>. <\/span>Approximating Bin Packing with Conflict Graphs via Maximization Techniques<\/span><\/div><\/li>\n\t
  20. Feodor Dragan and Guillaume Ducoffe<\/span>. <\/span>\u03b1i<\/sub>-Metric Graphs: Radius, Diameter and all Eccentricities<\/span><\/div><\/li>\n\t
  21. Pavel Dvo\u0159\u00e1k, Luk\u00e1\u0161 Folwarczn\u00fd, Michal Opler, Pavel Pudl\u00e1k, Robert \u0160\u00e1mal and Tung Anh Vu<\/span>.
    <\/span>Bounds on Functionality and Symmetric Difference \u2013 Two Intriguing Graph Parameters<\/span><\/div><\/li>\n\t
  22. Zdenek Dvorak and Abhiruk Lahiri<\/span>. <\/span>Maximum edge colouring problem on graphs that exclude a fixed minor<\/span><\/div><\/li>\n\t
  23. Jessica Enright, Kitty Meeks, William Pettersson and John Sylvester<\/span>. <\/span>Cops and Robbers on Multi-layer Graphs<\/span><\/div><\/li>\n\t
  24. Fedor Fomin, Pierre Fraigniaud and Petr Golovach<\/span>. <\/span>Parameterized Complexity of Broadcasting in Graphs<\/span><\/div><\/li>\n\t
  25. Fedor Fomin, Petr Golovach, Danil Sagunov and Kirill Simonov<\/span>. <\/span>Turan’s Theorem Through Algorithmic Lens<\/span><\/div><\/li>\n\t
  26. Jan Goedgebeur, Edita M\u00e1\u010dajov\u00e1 and Jarne Renders<\/span>. <\/span>On the Frank number and nowhere-zero flows on graphs<\/span><\/div><\/li>\n\t
  27. Fr\u00e9d\u00e9ric Havet, Lucas Picasarri-Arrieta and Cl\u00e9ment Rambaud<\/span>. <\/span>On the minimum number of arcs in 4-dicritical oriented graphs<\/span><\/div><\/li>\n\t
  28. Falko Hegerfeld and Stefan Kratsch<\/span>. <\/span>Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth [Best Student Paper]<\/b><\/span><\/div><\/li>\n\t
  29. Paul Jungeblut, Samuel Schneider and Torsten Ueckerdt<\/span>. <\/span>Cops and Robber – When Capturing is not Surrounding [Best Paper]<\/b><\/span><\/div><\/li>\n\t
  30. Hoang-Oanh Le and Van Bang Le<\/span>. <\/span>Complexity results for matching cut problems in graphs without long induced paths<\/span><\/div><\/li>\n\t
  31. Martin Milani\u010d and Yushi Uno<\/span>. <\/span>Upper Clique Transversals in Graphs<\/span><\/div><\/li>\n\t
  32. Meghana Nasre, Prajakta Nimbhorkar and Keshav Ranjan<\/span>. <\/span>Critical Relaxed Stable Matchings with Two-Sided Ties<\/span><\/div><\/li>\n\t
  33. Robert Scheffler. <\/span>Graph Search Trees and Their Leaves<\/span><\/span><\/div><\/li>\n<\/ol>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

    Below you find the list of accepted papers. The abstracts of the accepted papers are available here. Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar and Kirill Simonov. Proportionally Fair Matching with Multiple Groups Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc van Kreveld, Isja Mannens and Jordi Vermeulen. Reconstructing Graphs from Connected Triples Jakob … Continue reading Accepted Papers<\/span> →<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_uag_custom_page_level_css":""},"uagb_featured_image_src":{"full":false,"thumbnail":false,"medium":false,"medium_large":false,"large":false,"1536x1536":false,"2048x2048":false,"post-thumbnail":false},"uagb_author_info":{"display_name":"Felicia Lucke","author_link":"https:\/\/events.unifr.ch\/wg2023\/?author=2"},"uagb_comment_info":0,"uagb_excerpt":"Below you find the list of accepted papers. The abstracts of the accepted papers are available here. Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar and Kirill Simonov. Proportionally Fair Matching with Multiple Groups Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc van Kreveld, Isja Mannens and Jordi Vermeulen. Reconstructing Graphs from Connected Triples Jakob…","_links":{"self":[{"href":"https:\/\/events.unifr.ch\/wg2023\/index.php?rest_route=\/wp\/v2\/pages\/356"}],"collection":[{"href":"https:\/\/events.unifr.ch\/wg2023\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/events.unifr.ch\/wg2023\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/events.unifr.ch\/wg2023\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/events.unifr.ch\/wg2023\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=356"}],"version-history":[{"count":12,"href":"https:\/\/events.unifr.ch\/wg2023\/index.php?rest_route=\/wp\/v2\/pages\/356\/revisions"}],"predecessor-version":[{"id":461,"href":"https:\/\/events.unifr.ch\/wg2023\/index.php?rest_route=\/wp\/v2\/pages\/356\/revisions\/461"}],"wp:attachment":[{"href":"https:\/\/events.unifr.ch\/wg2023\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=356"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}