{"total":16,"rows":[{"id":"2206.13254","title":"Sample compression schemes for balls in graphs","created":"2022-06-27","cited_by_count":9,"area":null},{"id":"2110.15168","title":"Labeled sample compression schemes for complexes of oriented matroids","created":"2021-10-28","cited_by_count":7,"area":null},{"id":"2309.02876","title":"Non-Clashing Teaching Maps for Balls in Graphs","created":"2023-09-06","cited_by_count":6,"area":null},{"id":"2210.05455","title":"Unlabelled Sample Compression Schemes for Intersection-Closed Classes and Extremal Classes","created":"2022-10-11","cited_by_count":5,"area":null},{"id":"2405.17120","title":"Dual VC Dimension Obstructs Sample Compression by Embeddings","created":"2024-05-27","cited_by_count":5,"area":null},{"id":"2503.10240","title":"Spherical dimension","created":"2025-03-13","cited_by_count":4,"area":null},{"id":"2604.12952","title":"An Optimal Sauer Lemma Over $k$-ary Alphabets","created":"2026-04-14","cited_by_count":4,"area":null},{"id":"2405.00853","title":"Efficient Algorithms for Learning Monophonic Halfspaces in Graphs","created":"2024-05-01","cited_by_count":3,"area":null},{"id":"2503.07665","title":"The Computational Complexity of Positive Non-Clashing Teaching in Graphs","created":"2025-03-08","cited_by_count":3,"area":null},{"id":"2510.17451","title":"The Parameterized Complexity of Computing the VC-Dimension","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2511.11819","title":"Simplicial covering dimension of extremal concept classes","created":"2025-11-14","cited_by_count":2,"area":null},{"id":"2105.06251","title":"Learning Weakly Convex Sets in Metric Spaces","created":"2021-05-10","cited_by_count":1,"area":null},{"id":"2506.23186","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","created":"2025-06-29","cited_by_count":1,"area":null},{"id":"2602.00657","title":"Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds","created":"2026-01-31","cited_by_count":1,"area":null},{"id":"2606.18236","title":"Sign-Rank, Index, and List Replicability: Connections and Separations","created":"2026-06-16","cited_by_count":1,"area":null},{"id":"2212.12631","title":"A Labelled Sample Compression Scheme of Size at Most Quadratic in the VC Dimension","created":"2022-12-24","cited_by_count":0,"area":null}],"next_cursor":null}