- Eitan Yaakobi, Jehoshua Bruck, 2012 IEEE International Symposium on Information Theory Proceedings, 2012, 106
- Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey, “Reconstructing trees from digitally convex sets”, Discrete Applied Mathematics, 216, 2017, 254
- Zuo Ye, Xin Liu, Xiande Zhang, Gennian Ge, “Reconstruction of Sequences Distorted by Two Insertions”, IEEE Trans. Inform. Theory, 69, № 8, 2023, 4977
- Alexandr V. Kostochka, Douglas B. West, “On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices”, IEEE Trans. Inform. Theory, 67, № 6, 2021, 3278
- Yonatan Yehezkeally, Moshe Schwartz, “Reconstruction Codes for DNA Sequences With Uniform Tandem-Duplication Errors”, IEEE Trans. Inform. Theory, 66, № 5, 2020, 2658
- Rongsheng Wu, Xiande Zhang, “Balanced reconstruction codes for single edits”, Des. Codes Cryptogr., 2024
- Ville Junnila, Tero Laihonen, Tuomo Lehtila, 2019 IEEE International Symposium on Information Theory (ISIT), 2019, 295
- Vladimir I. Levenshtein, “A conjecture on the reconstruction of graphs from metric balls of their vertices”, Discrete Mathematics, 308, № 5-6, 2008, 993
- Anna Adamaszek, MichaŁ Adamaszek, “Large-Girth Roots of Graphs”, SIAM J. Discrete Math., 24, № 4, 2010, 1501
- Michal Horovitz, Eitan Yaakobi, “Reconstruction of Sequences Over Non-Identical Channels”, IEEE Trans. Inform. Theory, 65, № 2, 2019, 1267