Representation learning for dynamic graphs: A survey SM Kazemi, R Goel, K Jain, I Kobyzev, A Sethi, P Forsyth, P Poupart Journal of Machine Learning Research 21 (70), 1-73, 2020 | 560 | 2020 |
Token swapping on trees A Biniaz, K Jain, A Lubiw, Z Masárová, T Miltzow, D Mondal, AM Naredla, ... Discrete Mathematics & Theoretical Computer Science 24 (Discrete Algorithms), 2023 | 20 | 2023 |
Reconfiguring undirected paths ED Demaine, D Eppstein, A Hesterberg, K Jain, A Lubiw, R Uehara, ... Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019 | 11 | 2019 |
Improved bounds for drawing trees on fixed points with L-shaped edges T Biedl, TM Chan, M Derka, K Jain, A Lubiw International Symposium on Graph Drawing and Network Visualization, 305-317, 2017 | 8 | 2017 |
Unsupervised multilingual alignment using Wasserstein barycenter X Lian, K Jain, J Truszkowski, P Poupart, Y Yu arXiv preprint arXiv:2002.00743, 2020 | 6 | 2020 |
Minimum shared‐power edge cut S Cabello, K Jain, A Lubiw, D Mondal Networks 75 (3), 321-333, 2020 | 5 | 2020 |
Compatible paths on labelled point sets E Arseneva, Y Bahoo, A Biniaz, P Cano, F Chanchary, J Iacono, K Jain, ... arXiv preprint arXiv:2004.07996, 2020 | 3 | 2020 |
Face flips in origami tessellations HA Akitaya, V Dujmovi, D Eppstein, TC Hull, K Jain, A Lubiw arXiv preprint arXiv:1910.05667, 2019 | 3 | 2019 |
Maximum Matchings and Minimum Blocking Sets in-Graphs T Biedl, A Biniaz, V Irvine, K Jain, P Kindermann, A Lubiw International Workshop on Graph-Theoretic Concepts in Computer Science, 258-270, 2019 | 2* | 2019 |
Minimum shared-power edge cut K Jain University of Waterloo, 2018 | 1 | 2018 |
Data Efficiency for Large Recommendation Models K Jain, J Xie, K Regan, C Chen, J Han, S Li, Z Li, T Phillips, M Sussman, ... arXiv preprint arXiv:2410.18111, 2024 | | 2024 |
Using Natural Language Processing for Automating the Identification of Climate Action Interlinkages within the Sustainable Development Goals X Zhou, K Jain, M Moinuddin, P McSharry | | 2022 |