scientific article; zbMATH DE number 7525501
From MaRDI portal
Publication:5075809
DOI10.4230/LIPICS.ESA.2019.64MaRDI QIDQ5075809FDOQ5075809
Authors: Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir 
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1907.01980
Title of this publication is not available (Why is that?)
Cites Work
- Powers of tensors and fast matrix multiplication
- Computational geometry. Algorithms and applications.
- Minimum Weight Cycles and Triangles: Equivalences and Algorithms
- Finding and counting given length cycles
- Adding range restriction capability to dynamic data structures
- Finding a Minimum Circuit in a Graph
- On minimal Eulerian graphs
- An improved combinatorial algorithm for Boolean matrix multiplication
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
- Delaunay triangulations in O (sort( n )) time and more
- Min-cuts and shortest cycles in planar graphs in \(O(n \log\log n)\) time
- Computing hereditary convex structures
- Subcubic equivalences between path, matrix, and triangle problems
- Geometric applications of a randomized optimization technique
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Computing the girth of a planar graph in linear time
- Title not available (Why is that?)
- A shortest cycle for each vertex of a graph
- Spanners for directed transmission graphs
- Spanners and Reachability Oracles for Directed Transmission Graphs
- Recognizing a DOG is hard, but not when it is thin and unit
Cited In (2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075809)
