More Like this

1. Graphs with polynomially many minimal separators

   https://doi.org/10.1016/j.jctb.2021.10.003  

   Abrishami, Tara; Chudnovsky, Maria; Dibek, Cemil; Thomassé, Stéphan; Trotignon, Nicolas; Vušković, Kristina (January 2022, Journal of Combinatorial Theory, Series B)
2. Non-Existence of Annular Separators in Geometric Graphs

   https://doi.org/10.1007/s00454-023-00519-8  

   Ebrahimnejad, Farzam; Lee, James R. (June 2023, Discrete & Computational Geometry)
3. Greedy Spanners in Euclidean Spaces Admit Sublinear Separators

   https://doi.org/10.1137/1.9781611977073.130  

   Le, Hung; Than, Cuong (January 2022, Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms)
4. Learning to Configure Separators in Branch-and-Cut

   Li, S; Ouyang, W; Paulus, M; Wu, C (December 2023, Advances in neural information processing systems)
5. Efficient Co-Training of Linear Separators under Weak Dependence

   Blum, Avrim; Mansour, Yishay (January 2017, Conference on Learning Theory (COLT))

   We develop the first polynomial-time algorithm for co-training of homogeneous linear separators under \em weak dependence, a relaxation of the condition of independence given the label. Our algorithm learns from purely unlabeled data, except for a single labeled example to break symmetry of the two classes, and works for any data distribution having an inverse-polynomial margin and with center of mass at the origin. 

   more » « less