K
Kshitij Jain
Researcher at University of Waterloo
Publications - 19
Citations - 310
Kshitij Jain is an academic researcher from University of Waterloo. The author has contributed to research in topics: Time complexity & Feature learning. The author has an hindex of 4, co-authored 18 publications receiving 152 citations. Previous affiliations of Kshitij Jain include Western New England University.
Papers
More filters
Journal Article
Representation Learning for Dynamic Graphs: A Survey
Seyed Mehran Kazemi,Rishab Goel,Kshitij Jain,Ivan Kobyzev,Akshay Sethi,Peter Forsyth,Pascal Poupart +6 more
TL;DR: This survey describes existing models from an encoder-decoder perspective, categorize these encoders and decoders based on the techniques they employ, and analyzes the approaches in each category.
Posted Content
Relational Representation Learning for Dynamic (Knowledge) Graphs: A Survey.
Seyed Mehran Kazemi,Rishab Goel,Kshitij Jain,Ivan Kobyzev,Akshay Sethi,Peter Forsyth,Pascal Poupart +6 more
TL;DR: This survey describes existing models for representation learning for dynamic graphs from an encoder-decoder perspective, categorize these encoders and decoders based on the techniques they employ, and analyze the approaches in each category.
Posted Content
Representation Learning for Dynamic Graphs: A Survey
Seyed Mehran Kazemi,Rishab Goel,Kshitij Jain,Ivan Kobyzev,Akshay Sethi,Peter Forsyth,Pascal Poupart +6 more
TL;DR: A survey of representation learning for dynamic knowledge graphs can be found in this article, where the authors describe existing models from an encoder-decoder perspective, categorize these encoders and decoders based on the techniques they employ, and analyze the approaches in each category.
Posted Content
Token Swapping on Trees
Ahmad Biniaz,Kshitij Jain,Anna Lubiw,Zuzana Masárová,Tillmann Miltzow,Debajyoti Mondal,Anurag Murty Naredla,Josef Tkadlec,Alexi Turcotte +8 more
TL;DR: A generalized problem---weighted coloured token swapping---is NP-complete on trees, but solvable in polynomial time on paths and stars, and the goal is to get every token to a vertex of the same colour, andThe cost of a swap is the sum of the weights of the two tokens involved.
Book ChapterDOI
Reconfiguring Undirected Paths
Erik D. Demaine,David Eppstein,Adam Hesterberg,Kshitij Jain,Anna Lubiw,Ryuhei Uehara,Yushi Uno +6 more
TL;DR: This work considers problems in which a simple path of fixed length, in an undirected graph, is to be shifted from a start position to a goal position by moves that add an edge to either end of the path and remove an edge from the other end.