{"total":13,"rows":[{"id":"2401.02086","title":"View-based Explanations for Graph Neural Networks","created":"2024-01-04","cited_by_count":8,"area":null},{"id":"2201.13128","title":"Deletion Robust Submodular Maximization over Matroids","created":"2022-01-31","cited_by_count":7,"area":null},{"id":"2305.19918","title":"Fully Dynamic Submodular Maximization over Matroids","created":"2023-05-31","cited_by_count":7,"area":null},{"id":"2305.15118","title":"Fairness in Streaming Submodular Maximization over a Matroid Constraint","created":"2023-05-24","cited_by_count":3,"area":null},{"id":"2102.06486","title":"Adaptive Sampling for Fast Constrained Maximization of Submodular Function","created":"2021-02-12","cited_by_count":2,"area":null},{"id":"2104.02772","title":"The Power of Subsampling in Submodular Maximization","created":"2021-04-06","cited_by_count":2,"area":null},{"id":"2208.07582","title":"Deletion Robust Non-Monotone Submodular Maximization over Matroids","created":"2022-08-16","cited_by_count":2,"area":null},{"id":"2405.19977","title":"Consistent Submodular Maximization","created":"2024-05-30","cited_by_count":2,"area":null},{"id":"2412.02492","title":"The Cost of Consistency: Submodular Maximization with Constant Recourse","created":"2024-12-03","cited_by_count":2,"area":null},{"id":"2502.11262","title":"Generating Skyline Datasets for Data Science Models","created":"2025-02-16","cited_by_count":1,"area":null},{"id":"2606.04946","title":"A General Framework for Dynamic Consistent Submodular Maximization","created":"2026-06-03","cited_by_count":1,"area":null},{"id":"2407.10003","title":"A Dynamic Algorithm for Weighted Submodular Cover Problem","created":"2024-07-13","cited_by_count":0,"area":null},{"id":"2502.08326","title":"Model-Free Counterfactual Subset Selection at Scale","created":"2025-02-12","cited_by_count":0,"area":null}],"next_cursor":null}