research
∙
07/20/2023
Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs
We study methods to manipulate weights in stress-graph embeddings to imp...
share
research
∙
07/17/2023
Quantum Tutte Embeddings
Using the framework of Tutte embeddings, we begin an exploration of quan...
research
∙
07/14/2023
Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
We define simple variants of zip trees, called zip-zip trees, which prov...
research
∙
09/20/2022
Modeling the Small-World Phenomenon with Road Networks
Dating back to two famous experiments by the social-psychologist, Stanle...
research
∙
08/11/2022
Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching
Motivated by blockchain technology for supply-chain tracing of ethically...
research
∙
08/08/2022
Exact Learning of Multitrees and Almost-Trees Using Path Queries
Given a directed graph, G=(V,E), a path query, path(u,v), returns whethe...
research
∙
04/26/2021
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths
Given an undirected graph, G, and vertices, s and t in G, the tracking p...
research
∙
07/17/2020
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction
We study the query complexity of exactly reconstructing a string from ad...
research
∙
06/27/2020
Reconstructing Biological and Digital Phylogenetic Trees in Parallel
In this paper, we study the parallel query complexity of reconstructing ...
research
∙
12/07/2019
On the Optical Accuracy of the Salvator Mundi
A debate in the scientific literature has arisen regarding whether the o...
research
∙
10/04/2019
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
For a clustered graph, i.e, a graph whose vertex set is recursively part...
research
∙
08/15/2019
Tracking Paths in Planar Graphs
We consider the NP-complete problem of tracking paths in a graph, first ...
research
∙
07/02/2019
Computing k-Modal Embeddings of Planar Digraphs
Given a planar digraph G and a positive even integer k, an embedding of ...
research
∙
08/09/2018
Low Ply Drawings of Trees and 2-Trees
Ply number is a recently developed graph drawing metric inspired by stud...
research
∙
08/09/2018
Low Ply Drawings of Tree and 2-Trees
Ply number is a recently developed graph drawing metric inspired by stud...
research
∙
08/01/2018
Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching
Motivated by the problem of fingerprint matching, we present geometric a...
research
∙
05/09/2018
Optimally Sorting Evolving Data
We give optimal sorting algorithms in the evolving data framework, where...
research
∙
04/25/2018
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms
We study algorithms and combinatorial complexity bounds for stable-match...
research
∙
03/14/2018
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity
The C-Planarity problem asks for a drawing of a clustered graph, i.e., a...
research
∙
03/12/2018
Reactive Proximity Data Structures for Graphs
We consider data structures for graphs where we maintain a subset of the...
research
∙
08/17/2015
Knuthian Drawings of Series-Parallel Flowcharts
Inspired by a classic paper by Knuth, we revisit the problem of drawing ...
research
∙
12/04/2008
