\textsc{Minimum Surgical Probing} with convexity constraints

DOI10.1007/978-3-031-34347-6_12OpenAlexW4379134819MaRDI QIDQ6182899

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

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-34347-6_12

zbMATH Keywords

reconstruction problemdiscrete tomographygraph convexitypath convexity\(K_h\)-free graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Reconstructing convex polyominoes from horizontal and vertical projections
• Weighted microscopic image reconstruction
• Binary matrices under the microscope: A tomographical problem
• On local convexity in graphs
• Discrete tomography. Foundations, algorithms, and applications
• On the convexity number of graphs
• Further steps on the reconstruction of convex polyominoes from orthogonal projections
• The generalized microscopic image reconstruction problem
• Regular switching components
• Geodesic Convexity in Graphs
• Uniqueness in Discrete Tomography: Three Remarks and a Corollary
• The generalized microscopic image reconstruction problem for hypergraphs
• Properties of SAT formulas characterizing convex sets with given projections

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