{"id":267,"date":"2021-04-13T19:34:16","date_gmt":"2021-04-13T22:34:16","guid":{"rendered":"https:\/\/projects.cs.dal.ca\/wads2021\/?p=267"},"modified":"2021-04-13T19:34:16","modified_gmt":"2021-04-13T22:34:16","slug":"wads-2021-accepted-papers","status":"publish","type":"post","link":"https:\/\/projects.cs.dal.ca\/wads2021\/wads-2021-accepted-papers\/","title":{"rendered":"WADS 2021 Accepted Papers"},"content":{"rendered":"\n<ul class=\"wp-block-list\"><li>Helena Bergold, Winfried Hochst\u00e4ttler and Uwe Mayer.&nbsp;The Neighborhood Polynomial of Chordal Graphs<\/li><li>Jim Apple.&nbsp;HalftimeHash: modern hashing without 64-bit multipliers or finite fields<\/li><li><a href=\"http:\/\/shelbykimmel.com\">Shelby Kimmel<\/a>&nbsp;and&nbsp;<a href=\"http:\/\/www.rtealwitter.com\">R. Teal Witter<\/a>.&nbsp;A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs<\/li><li>Logan Pedersen and&nbsp;<a href=\"http:\/\/cs.usu.edu\/people\/haitaowang\/\">Haitao Wang<\/a>.&nbsp;Algorithms for the Line-Constrained Disk Coverage and Related Problems<\/li><li><a href=\"https:\/\/sites.google.com\/view\/giulia-bernardini\">Giulia Bernardini<\/a>, Paola Bonizzoni and&nbsp;<a href=\"https:\/\/sites.google.com\/a\/cs.uni.wroc.pl\/gawry\">Pawel Gawrychowski<\/a>.&nbsp;Incomplete Directed Perfect Phylogeny in Linear Time<\/li><li><a href=\"http:\/\/antoniosatnoniadis.net\">Antonios Antoniadis<\/a>, Margarita Capretto,&nbsp;<a href=\"https:\/\/sites.google.com\/site\/parinyachalermsook\/\">Parinya Chalermsook<\/a>, Christoph Damerius,&nbsp;<a href=\"https:\/\/academic.pkling.de\">Peter Kling<\/a>, Lukas N\u00f6lke, Nidia Obscura Acosta and&nbsp;<a href=\"http:\/\/www1.informatik.uni-wuerzburg.de\/en\/staff\/spoerhase_joachim\/\">Joachim Spoerhase<\/a>.&nbsp;On Minimum Generalized Manhattan Connections<\/li><li>Feodor Dragan, Guillaume Ducoffe and Heather Guarnera.&nbsp;Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs<\/li><li><a href=\"http:\/\/math.haifa.ac.il\/lea\/\">Leah Epstein<\/a>&nbsp;and Loay Mualem.&nbsp;Online bin packing of squares and cubes<\/li><li><a href=\"http:\/\/www.cs.umd.edu\/~ioana\/\">Ioana Bercea<\/a>&nbsp;and&nbsp;<a href=\"http:\/\/www.eng.tau.ac.il\/~guy\">Guy Even<\/a>.&nbsp;Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations<\/li><li>Jakob Keller,&nbsp;<a href=\"http:\/\/www.ibr.cs.tu-bs.de\/users\/rieck\">Christian Rieck<\/a>, Christian Scheffer and&nbsp;<a href=\"https:\/\/www.ibr.cs.tu-bs.de\/users\/aschmidt\/\">Arne Schmidt<\/a>.&nbsp;Particle-Based Assembly Using Precise Global Control<\/li><li><a href=\"https:\/\/cs.usu.edu\/people\/haitaowang\/\">Haitao Wang<\/a>&nbsp;and Yiming Zhao.&nbsp;Reverse Shortest Path Problem for Unit-Disk Graphs<\/li><li><a href=\"http:\/\/www.ics.uci.edu\/~eppstein\/\">David Eppstein<\/a>.&nbsp;A Stronger Lower Bound on Parametric Minimum Spanning Trees<\/li><li><a href=\"http:\/\/www14.in.tum.de\/personen\/albers\/\">Susanne Albers<\/a>&nbsp;and Alexander Eckl.&nbsp;Scheduling with Testing on Multiple Identical Parallel Machines<\/li><li>Zachary Friggstad and Ramin Mousavi.&nbsp;Fair Correlation Clustering with Global and Local Guarantees<\/li><li><a href=\"http:\/\/cglab.ca\/~biniaz\/\">Ahmad Biniaz<\/a>,&nbsp;<a href=\"http:\/\/www.scs.carleton.ca\/~maheshwa\">Anil Maheshwari<\/a>&nbsp;and&nbsp;<a href=\"http:\/\/www.scs.carleton.ca\/~michiel\/\">Michiel Smid<\/a>.&nbsp;Euclidean maximum matchings in the plane&#8212;local to global<\/li><li><a href=\"https:\/\/www.eecs.tufts.edu\/~halves01\/\">Hugo Akitaya<\/a>,&nbsp;<a href=\"http:\/\/cglab.ca\/~biniaz\/\">Ahmad Biniaz<\/a>,&nbsp;<a href=\"http:\/\/cg.scs.carleton.ca\/~jit\">Prosenjit Bose<\/a>,&nbsp;<a href=\"http:\/\/www.jean-lou.com\">Jean-Lou De Carufel<\/a>,&nbsp;<a href=\"http:\/\/www.scs.carleton.ca\/~maheshwa\">Anil Maheshwari<\/a>, Lu\u00eds Fernando Schultz Xavier Da Silveira and&nbsp;<a href=\"http:\/\/www.scs.carleton.ca\/~michiel\/\">Michiel Smid<\/a>.&nbsp;The Minimum Moving Spanning Tree Problem<\/li><li><a href=\"http:\/\/cs.univie.ac.at\/taa-team\/infpers\/monika_henzinger\/\">Monika Henzinger<\/a>&nbsp;and&nbsp;<a href=\"https:\/\/sites.google.com\/site\/wxw0711\/\">Xiaowei Wu<\/a>.&nbsp;Upper and Lower Bounds for Fully Retroactive Graph Problems<\/li><li><a href=\"http:\/\/www.cs.kent.edu\/~aleitert\/\">Arne Leitert<\/a>.&nbsp;Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time<\/li><li>Stav Ashur and&nbsp;<a href=\"http:\/\/www.cs.bgu.ac.il\/~matya\">Matthew Katz<\/a>.&nbsp;A 4-Approximation of the $\\frac{2\\pi}{3}$-MST<\/li><li><a href=\"http:\/\/www.ii.uib.no\/~fomin\/\">Fedor Fomin<\/a>, Petr Golovach and Nidhi Purohit.&nbsp;Parameterized Complexity of Categorical Clustering with Size Constraints<\/li><li><a href=\"http:\/\/anne.driemel.net\">Anne Driemel<\/a>&nbsp;and Ioannis Psarros.&nbsp;ANN for time series under the Fr\\&#8217;echet distance<\/li><li><a href=\"http:\/\/www14.in.tum.de\/personen\/albers\/\">Susanne Albers<\/a>&nbsp;and&nbsp;<a href=\"http:\/\/www14.in.tum.de\/personen\/janke\/\">Maximilian Janke<\/a>.&nbsp;Online Makespan Minimization With Budgeted Uncertainty<\/li><li>Shinwoo An and Eunjin Oh.&nbsp;Reachability Problems for Transmission Graphs<\/li><li>Ivor van der Hoog,&nbsp;<a href=\"https:\/\/www.uu.nl\/staff\/MAvandeKerkhof\">Mees van de Kerkhof<\/a>, Marc Van Kreveld,&nbsp;<a href=\"http:\/\/www.staff.science.uu.nl\/~loffl001\">Maarten L\u00f6ffler<\/a>,&nbsp;<a href=\"https:\/\/fstaals.net\">Frank Staals<\/a>, J\u00e9r\u00f4me Urhausen and Jordi L. Vermeulen.&nbsp;Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance<\/li><li>Steven Chaplick,&nbsp;<a href=\"http:\/\/www.dia.uniroma3.it\/~dalozzo\">Giordano Da Lozzo<\/a>,&nbsp;<a href=\"http:\/\/www.diei.unipg.it\/~digiacomo\">Emilio Di Giacomo<\/a>,&nbsp;<a href=\"http:\/\/www.diei.unipg.it\/~liotta\">Giuseppe Liotta<\/a>&nbsp;and&nbsp;<a href=\"http:\/\/mozart.diei.unipg.it\/montecchiani\/\">Fabrizio Montecchiani<\/a>.&nbsp;Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees<\/li><li>Zachary Friggstad and Maryam Mahboub.&nbsp;Graph Pricing With Limited Supply<\/li><li><a href=\"http:\/\/nickbrettell.com\">Nick Brettell<\/a>,&nbsp;<a href=\"http:\/\/www.dur.ac.uk\/matthew.johnson2\">Matthew Johnson<\/a>&nbsp;and&nbsp;<a href=\"http:\/\/community.dur.ac.uk\/daniel.paulusma\/\">Daniel Paulusma<\/a>.&nbsp;Computing Weighted Subset Transversals in H-Free Graphs<\/li><li><a href=\"https:\/\/www.eecs.tufts.edu\/~halves01\/\">Hugo Akitaya<\/a>,&nbsp;<a href=\"http:\/\/cglab.ca\/~biniaz\/\">Ahmad Biniaz<\/a>&nbsp;and&nbsp;<a href=\"http:\/\/cg.scs.carleton.ca\/~jit\">Prosenjit Bose<\/a>.&nbsp;On the Spanning and Routing Ratios of the Directed $\\Theta_6$-Graph<\/li><li><a href=\"http:\/\/www.ics.uci.edu\/~goodrich\/\">Michael Goodrich<\/a>, Siddharth Gupta, Hadi Khodabandeh and Pedro Matias.&nbsp;How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths<\/li><li>Changyong Hu and&nbsp;<a href=\"http:\/\/www.ece.utexas.edu\/~garg\/\">Vijay Garg<\/a>.&nbsp;Characterization of Super-stable Matchings<\/li><li>Ilan Doron-Arad and&nbsp;<a href=\"http:\/\/www.cs.technion.ac.il\/~hadas\/\">Hadas Shachnai<\/a>.&nbsp;An APTAS for Bin Packing with Clique-graph Conflicts<\/li><li><a href=\"https:\/\/www.uu.nl\/staff\/MJvanKreveld\">Marc van Kreveld<\/a>,&nbsp;<a href=\"http:\/\/www.win.tue.nl\/~speckman\/\">Bettina Speckmann<\/a>&nbsp;and J\u00e9r\u00f4me Urhausen.&nbsp;Diverse Partitions of Colored Points<\/li><li><a href=\"http:\/\/www.cs.le.ac.uk\/people\/te17\/\">Thomas Erlebach<\/a>&nbsp;and&nbsp;<a href=\"https:\/\/www2.le.ac.uk\/departments\/informatics\/people\/jakob-spooner\">Jakob T. Spooner<\/a>.&nbsp;Exploration of k-Edge-Deficient Temporal Graphs<\/li><li>\u00cdvar Arn\u00fe\u00f3rsson, Steven Chaplick, J\u00f6kull Gylfason,&nbsp;<a href=\"http:\/\/www.ru.is\/faculty\/mmh\">Magn\u00fas M. Halld\u00f3rsson<\/a>, J\u00f6kull Reynisson and&nbsp;<a href=\"https:\/\/sites.google.com\/site\/ytigrani\">Tigran Tonoyan<\/a>.&nbsp;Generalized Disk Graphs<\/li><li>Corentin Allair and Antoine Vigneron.&nbsp;Pattern Matching in Doubling Spaces<\/li><li><a href=\"http:\/\/cg.scs.carleton.ca\/~jit\">Prosenjit Bose<\/a>,&nbsp;<a href=\"https:\/\/research.aurelienooms.be\">Aur\u00e9lien Ooms<\/a>&nbsp;and Hill Darryl.&nbsp;Improved Bounds on the Spanning Ratio of the Theta-5 Graph<\/li><li>Tyler Tuttle and&nbsp;<a href=\"http:\/\/cg.scs.carleton.ca\/~jit\">Prosenjit Bose<\/a>.&nbsp;Routing on Heavy-Path WSPD-Spanners<\/li><li><a href=\"https:\/\/www.win.tue.nl\/~kbuchin\/\">Kevin Buchin<\/a>,&nbsp;<a href=\"https:\/\/www.staff.science.uu.nl\/~loffl001\">Maarten L\u00f6ffler<\/a>, Tim Ophelders,&nbsp;<a href=\"https:\/\/www.win.tue.nl\/~apopov\/\">Aleksandr Popov<\/a>, J\u00e9r\u00f4me Urhausen and Kevin Verbeek.&nbsp;Computing the Fr\u00e9chet Distance Between Uncertain Curves in One Dimension<\/li><li><a href=\"https:\/\/sites.google.com\/site\/kopelot\/\">Tsvi Kopelowitz<\/a>, Samuel McCauley and&nbsp;<a href=\"http:\/\/www.cs.biu.ac.il\/~porately\/\">Ely Porat<\/a>.&nbsp;Support Optimality and Adaptive Cuckoo Filters<\/li><li><a href=\"http:\/\/www.ii.uni.wroc.pl\/~dudek\/\">Bartlomiej Dudek<\/a>,&nbsp;<a href=\"https:\/\/sites.google.com\/a\/cs.uni.wroc.pl\/gawry\">Pawel Gawrychowski<\/a>&nbsp;and Karol Pokorski.&nbsp;Strictly In-Place Algorithms for Permuting and Inverting Permutations<\/li><li>Flavia Bonomo-Braberman,&nbsp;<a href=\"http:\/\/nickbrettell.com\">Nick Brettell<\/a>, Andrea Munaro and&nbsp;<a href=\"http:\/\/community.dur.ac.uk\/daniel.paulusma\/\">Daniel Paulusma<\/a>.&nbsp;Solving Problems on Generalized Convex Graphs via Mim-Width<\/li><li><a href=\"https:\/\/sites.google.com\/a\/cs.uni.wroc.pl\/gawry\">Pawe\u0142 Gawrychowski<\/a>&nbsp;and&nbsp;<a href=\"https:\/\/sites.google.com\/site\/pkuznanski\/\">Przemys\u0142aw Uzna\u0144ski<\/a>.&nbsp;Better distance labeling for unweighted planar graphs<\/li><li>Joe Sawada and Aaron Williams.&nbsp;A universal cycle for strings with fixed-content<\/li><li><a href=\"https:\/\/www.mathstat.dal.ca\/~janssen\/\">Jeannette Janssen<\/a>&nbsp;and Zhiyuan Zhang.&nbsp;Uniform Embeddings for Robinson Similarity Matrices<\/li><li>Joachim Gudmundsson and Yuan Sha.&nbsp;Algorithms for Radius-Optimally Augmenting Trees in a Metric Space<\/li><li>Zhenyu Mao.&nbsp;Counting Boolean Constraint Satisfaction Problems with relation Implies on regular instances<\/li><li><a href=\"https:\/\/www.fmf.uni-lj.si\/~cabello\/\">Sergio Cabello<\/a>, Arun Kumar Das,&nbsp;<a href=\"http:\/\/www.isical.ac.in\/~sandipdas\">Sandip Das<\/a>&nbsp;and Joydeep Mukherjee.&nbsp;Finding a Largest-Area Triangle in a Terrain in Near-Linear Time<\/li><li>Yash Khanna,&nbsp;<a href=\"https:\/\/www.csa.iisc.ac.in\/~anandl\/\">Anand Louis<\/a>&nbsp;and&nbsp;<a href=\"https:\/\/rameeshpaul.github.io\/\">Rameesh Paul<\/a>.&nbsp;Independent Sets in Semi-random Hypergraphs<\/li><\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Helena Bergold, Winfried Hochst\u00e4ttler and Uwe Mayer.&nbsp;The Neighborhood Polynomial of Chordal Graphs Jim Apple.&nbsp;HalftimeHash: modern hashing without 64-bit multipliers or finite fields Shelby Kimmel&nbsp;and&nbsp;R. Teal Witter.&nbsp;A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs Logan Pedersen and&nbsp;Haitao Wang.&nbsp;Algorithms for the Line-Constrained Disk Coverage and Related Problems Giulia Bernardini, Paola Bonizzoni and&nbsp;Pawel Gawrychowski.&nbsp;Incomplete Directed Perfect [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"default","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"default","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"footnotes":""},"categories":[5],"tags":[],"class_list":["post-267","post","type-post","status-publish","format-standard","hentry","category-news"],"_links":{"self":[{"href":"https:\/\/projects.cs.dal.ca\/wads2021\/wp-json\/wp\/v2\/posts\/267","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/projects.cs.dal.ca\/wads2021\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/projects.cs.dal.ca\/wads2021\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/projects.cs.dal.ca\/wads2021\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/projects.cs.dal.ca\/wads2021\/wp-json\/wp\/v2\/comments?post=267"}],"version-history":[{"count":2,"href":"https:\/\/projects.cs.dal.ca\/wads2021\/wp-json\/wp\/v2\/posts\/267\/revisions"}],"predecessor-version":[{"id":269,"href":"https:\/\/projects.cs.dal.ca\/wads2021\/wp-json\/wp\/v2\/posts\/267\/revisions\/269"}],"wp:attachment":[{"href":"https:\/\/projects.cs.dal.ca\/wads2021\/wp-json\/wp\/v2\/media?parent=267"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/projects.cs.dal.ca\/wads2021\/wp-json\/wp\/v2\/categories?post=267"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/projects.cs.dal.ca\/wads2021\/wp-json\/wp\/v2\/tags?post=267"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}