An FPT algorithm for splitting a necklace among two thieves

DOI10.1007/S00453-025-01346-4MaRDI QIDQ6894405zbMATH OpenFDO

Authors Michaela Borzechowski, Patrick Schnider, Simon Weber

Publication date 25 November 2025

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

fixed-parameter tractabilitynecklace splittingalpha-ham-sandwich problemwell-separation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Partitions of sets (05A18) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: An FPT algorithm for splitting a necklace among two thieves

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