Cited By
View all- Eckles DEsfandiari HMossel ERahimian M(2022)Seeding with Costly Network InformationOperations Research10.1287/opre.2022.229070:4(2318-2348)Online publication date: 1-Jul-2022
- Fiat NRon DMarx D(2021)On efficient distance approximation for graph propertiesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458162(1618-1637)Online publication date: 10-Jan-2021
- Adler IKöhler NPeng PMarx D(2021)On testability of first-order properties in bounded-degree graphsProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458160(1578-1597)Online publication date: 10-Jan-2021
- Show More Cited By