scientific article; zbMATH DE number 7525501
From MaRDI portal
Publication:5075809
DOI10.4230/LIPIcs.ESA.2019.64MaRDI QIDQ5075809
Paul Seiferth, Katharina Klost, Wolfgang Mulzer, Haim Kaplan, Liam Roditty, Micha Sharir
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1907.01980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Computing hereditary convex structures
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Finding and counting given length cycles
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
- On minimal Eulerian graphs
- An improved combinatorial algorithm for Boolean matrix multiplication
- Geometric applications of a randomized optimization technique
- A shortest cycle for each vertex of a graph
- Delaunay triangulations in O (sort( n )) time and more
- Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
- Powers of tensors and fast matrix multiplication
- Adding range restriction capability to dynamic data structures
- Finding a Minimum Circuit in a Graph
- Spanners for Directed Transmission Graphs
- Subcubic Equivalences Between Path, Matrix, and Triangle Problems
- Recognizing a DOG is Hard but not when it is Thin and Unit
- Spanners and Reachability Oracles for Directed Transmission Graphs
- Minimum Weight Cycles and Triangles: Equivalences and Algorithms
- Computing the Girth of a Planar Graph in Linear Time
This page was built for publication:
