Skip to content
Helena Bergold, Winfried Hochstättler and Uwe Mayer. The Neighborhood Polynomial of Chordal Graphs Jim Apple. HalftimeHash: modern hashing without 64-bit multipliers or finite fields Shelby Kimmel and R. Teal Witter . A Query-Efficient Quantum Algorithm for Maximum Matching on General GraphsLogan Pedersen and Haitao Wang . Algorithms for the Line-Constrained Disk Coverage and Related Problems Giulia Bernardini , Paola Bonizzoni and Pawel Gawrychowski . Incomplete Directed Perfect Phylogeny in Linear TimeAntonios Antoniadis , Margarita Capretto, Parinya Chalermsook , Christoph Damerius, Peter Kling , Lukas Nölke, Nidia Obscura Acosta and Joachim Spoerhase . On Minimum Generalized Manhattan ConnectionsFeodor Dragan, Guillaume Ducoffe and Heather Guarnera. Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs Leah Epstein and Loay Mualem. Online bin packing of squares and cubesIoana Bercea and Guy Even . Dynamic Dictionaries for Multisets and Counting Filters with Constant Time OperationsJakob Keller, Christian Rieck , Christian Scheffer and Arne Schmidt . Particle-Based Assembly Using Precise Global Control Haitao Wang and Yiming Zhao. Reverse Shortest Path Problem for Unit-Disk GraphsDavid Eppstein . A Stronger Lower Bound on Parametric Minimum Spanning TreesSusanne Albers and Alexander Eckl. Scheduling with Testing on Multiple Identical Parallel MachinesZachary Friggstad and Ramin Mousavi. Fair Correlation Clustering with Global and Local Guarantees Ahmad Biniaz , Anil Maheshwari and Michiel Smid . Euclidean maximum matchings in the plane—local to globalHugo Akitaya , Ahmad Biniaz , Prosenjit Bose , Jean-Lou De Carufel , Anil Maheshwari , Luís Fernando Schultz Xavier Da Silveira and Michiel Smid . The Minimum Moving Spanning Tree ProblemMonika Henzinger and Xiaowei Wu . Upper and Lower Bounds for Fully Retroactive Graph ProblemsArne Leitert . Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic TimeStav Ashur and Matthew Katz . A 4-Approximation of the $\frac{2\pi}{3}$-MST Fedor Fomin , Petr Golovach and Nidhi Purohit. Parameterized Complexity of Categorical Clustering with Size ConstraintsAnne Driemel and Ioannis Psarros. ANN for time series under the Fr\’echet distanceSusanne Albers and Maximilian Janke . Online Makespan Minimization With Budgeted UncertaintyShinwoo An and Eunjin Oh. Reachability Problems for Transmission Graphs Ivor van der Hoog, Mees van de Kerkhof , Marc Van Kreveld, Maarten Löffler , Frank Staals , Jérôme Urhausen and Jordi L. Vermeulen. Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance Steven Chaplick, Giordano Da Lozzo , Emilio Di Giacomo , Giuseppe Liotta and Fabrizio Montecchiani . Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees Zachary Friggstad and Maryam Mahboub. Graph Pricing With Limited Supply Nick Brettell , Matthew Johnson and Daniel Paulusma . Computing Weighted Subset Transversals in H-Free GraphsHugo Akitaya , Ahmad Biniaz and Prosenjit Bose . On the Spanning and Routing Ratios of the Directed $\Theta_6$-GraphMichael Goodrich , Siddharth Gupta, Hadi Khodabandeh and Pedro Matias. How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking PathsChangyong Hu and Vijay Garg . Characterization of Super-stable Matchings Ilan Doron-Arad and Hadas Shachnai . An APTAS for Bin Packing with Clique-graph Conflicts Marc van Kreveld , Bettina Speckmann and Jérôme Urhausen. Diverse Partitions of Colored PointsThomas Erlebach and Jakob T. Spooner . Exploration of k-Edge-Deficient Temporal GraphsÍvar Arnþórsson, Steven Chaplick, Jökull Gylfason, Magnús M. Halldórsson , Jökull Reynisson and Tigran Tonoyan . Generalized Disk Graphs Corentin Allair and Antoine Vigneron. Pattern Matching in Doubling Spaces Prosenjit Bose , Aurélien Ooms and Hill Darryl. Improved Bounds on the Spanning Ratio of the Theta-5 GraphTyler Tuttle and Prosenjit Bose . Routing on Heavy-Path WSPD-Spanners Kevin Buchin , Maarten Löffler , Tim Ophelders, Aleksandr Popov , Jérôme Urhausen and Kevin Verbeek. Computing the Fréchet Distance Between Uncertain Curves in One DimensionTsvi Kopelowitz , Samuel McCauley and Ely Porat . Support Optimality and Adaptive Cuckoo FiltersBartlomiej Dudek , Pawel Gawrychowski and Karol Pokorski. Strictly In-Place Algorithms for Permuting and Inverting PermutationsFlavia Bonomo-Braberman, Nick Brettell , Andrea Munaro and Daniel Paulusma . Solving Problems on Generalized Convex Graphs via Mim-Width Paweł Gawrychowski and Przemysław Uznański . Better distance labeling for unweighted planar graphsJoe Sawada and Aaron Williams. A universal cycle for strings with fixed-content Jeannette Janssen and Zhiyuan Zhang. Uniform Embeddings for Robinson Similarity MatricesJoachim Gudmundsson and Yuan Sha. Algorithms for Radius-Optimally Augmenting Trees in a Metric Space Zhenyu Mao. Counting Boolean Constraint Satisfaction Problems with relation Implies on regular instances Sergio Cabello , Arun Kumar Das, Sandip Das and Joydeep Mukherjee. Finding a Largest-Area Triangle in a Terrain in Near-Linear TimeYash Khanna, Anand Louis and Rameesh Paul . Independent Sets in Semi-random Hypergraphs
Post navigation
Scroll to Top