1. Johnson's algorithm: A key to solve optimally or approximately flow shop scheduling problems with unavailability periods
2. Uri Alon and Eran Yahav. 2021. On the Bottleneck of Graph Neural Networks and its Practical Implications. In 9th International Conference on Learning Representations, ICLR 2021, Virtual Event, Austria, May 3--7, 2021. OpenReview.net. https://openreview.net/forum?id=i80OPhOCVH2
3. Muhammet Balcilar, Pierre Hé roux, Benoit Gaü zè re, Pascal Vasseur, Sé bastien Adam, and Paul Honeine. 2021. Breaking the Limits of Message Passing Graph Neural Networks. In Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18--24 July 2021, Virtual Event (Proceedings of Machine Learning Research, Vol. 139), Marina Meila and Tong Zhang (Eds.). PMLR, 599--608. http://proceedings.mlr.press/v139/balcilar21a.html
4. Rianne van den Berg, Thomas N Kipf, and Max Welling. 2017. Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263 (2017).
5. Chen Cai and Yusu Wang. 2020. A Note on Over-Smoothing for Graph Neural Networks. CoRR , Vol. abs/2006.13318 (2020). showeprint[arXiv]2006.13318 https://arxiv.org/abs/2006.13318