1 citations · 1 across the 4 of their papers we have counts for
8 papers
Compatible Paths on Labelled Point Sets
Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz +8
Let and be finite point sets of the same cardinality in , each labelled from to . Two noncrossing geometric graphs and spanning and …
Unsupervised Multilingual Alignment using Wasserstein Barycenter
Xin Lian, Kshitij Jain, Jakub Truszkowski +2
We study unsupervised multilingual alignment, the problem of finding word-to-word translations between multiple languages without using any parallel data. One popular strategy is t…
Face flips in origami tessellations
Hugo A. Akitaya, Vida Dujmovi, David Eppstein +3
Given a flat-foldable origami crease pattern (a straight-line drawing of a planar graph on a region of the plane) with a mountain-valley (MV) assignment …
Representation Learning for Dynamic Graphs: A Survey
Seyed Mehran Kazemi, Rishab Goel, Kshitij Jain +4
Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learni…
Reconfiguring Undirected Paths
Erik D. Demaine, David Eppstein, Adam Hesterberg +4
We consider 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 e…
Maximum Matchings and Minimum Blocking Sets in -Graphs
Therese Biedl, Ahmad Biniaz, Veronika Irvine +3
-Graphs graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilatera…