Simple (invited talk)

DOI10.4230/LIPICS.ESA.2024.2MaRDI QIDQ7253052zbMATH OpenFDO

Authors Eva Rotenberg

Publication date 26 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2024.2

zbMATH Keywords

combinatoricscomputational geometrydata structuresgraph algorithmssimplicitydynamic graphsproof simplificationalgorithmic simplification

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Hamiltonian cycle in the square of a 2-connected graph in linear time
• A new proof of the theorem by Fleischner
• A short proof of Fleischner's theorem
• Dominating sets in planar graphs
• Improved dynamic colouring of sparse graphs
• Linear-time suffix sorting -- a new approach for suffix array construction
• Lyndon arrays in sublinear time
• Lyndon arrays simplified
• Online bipartite matching in offline time
• Online bipartite matching with amortized O(^2 n) replacements
• Online perfect matching and mobile computing
• Simple and robust dynamic two-dimensional convex hull
• Space efficient construction of Lyndon arrays in linear time
• The domination number of plane triangulations
• The square of every two-connected graph is Hamiltonian
• Triangulations admit dominating sets of size 2n/7.

This page was built for publication: Simple (invited talk)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253052)