\textsc{Minimum Surgical Probing} with convexity constraints

DOI10.1016/J.TCS.2026.115922MaRDI QIDQ7229646zbMATH OpenFDO

Authors Toni Böhnlein, Niccolò Di Marco, Andrea Frosini

Publication date 16 April 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.115922

zbMATH Keywords

\(K_h\)-free graphsdiscrete tomographygraph convexitypath convexityreconstruction problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Binary matrices under the microscope: A tomographical problem
• Further steps on the reconstruction of convex polyominoes from orthogonal projections
• Geodesic Convexity in Graphs
• Properties of SAT formulas characterizing convex sets with given projections
• Reconstructing convex polyominoes from horizontal and vertical projections
• Regular switching components
• The generalized microscopic image reconstruction problem
• The generalized microscopic image reconstruction problem for hypergraphs
• Uniqueness in discrete tomography: Three remarks and a corollary
• Weighted microscopic image reconstruction

This page was built for publication: \textsc{Minimum Surgical Probing} with convexity constraints

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