research
∙
04/16/2020
Compatible Paths on Labelled Point Sets
Let P and Q be finite point sets of the same cardinality in ℝ^2, each la...
share
research
∙
01/28/2020
Unsupervised Multilingual Alignment using Wasserstein Barycenter
We study unsupervised multilingual alignment, the problem of finding wor...
research
∙
10/13/2019
Face flips in origami tessellations
Given a flat-foldable origami crease pattern G=(V,E) (a straight-line dr...
research
∙
05/27/2019
Relational Representation Learning for Dynamic (Knowledge) Graphs: A Survey
Graphs arise naturally in many real-world applications including social ...
research
∙
05/01/2019
Reconfiguring Undirected Paths
We consider problems in which a simple path of fixed length, in an undir...
research
∙
03/16/2019
Token Swapping on Trees
The input to the token swapping problem is a graph with vertices v_1, v_...
research
∙
01/06/2019
Maximum Matchings and Minimum Blocking Sets in Θ_6-Graphs
Θ_6-Graphs are important geometric graphs that have many applications es...
research
∙
06/12/2018
Minimum Shared-Power Edge Cut
We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC)....
research
∙
09/05/2017
