Irene Parada | DeepAI

AI Chat

Featured Co-authors

Erik D. Demaine
75 publications
David Eppstein
67 publications
Jayson Lynch
42 publications
Maarten Löffler
42 publications
Robert Ganian
39 publications
Wolfgang Mulzer
32 publications
Matias Korman
29 publications
Birgit Vogtenhuber
28 publications
Irina Kostitsyna
28 publications
Vida Dujmovic
25 publications
Oswin Aichholzer
25 publications

∙ 10/21/2022

Blocking Delaunay Triangulations from the Exterior

Given two distinct point sets P and Q in the plane, we say that Q blocks...

0 Oswin Aichholzer, et al. ∙

∙ 09/28/2022

Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs

A directed graph G is upward planar if it admits a planar embedding such...

0 Ivor van der Hoog, et al. ∙

∙ 09/02/2022

Shooting Stars in Simple Drawings of K_m,n

Simple drawings are drawings of graphs in which two edges have at most o...

0 Oswin Aichholzer, et al. ∙

∙ 05/26/2021

Crossing Numbers of Beyond-Planar Graphs Revisited

Graph drawing beyond planarity focuses on drawings of high visual qualit...

0 Nathan van Beusekom, et al. ∙

∙ 05/17/2021

Compacting Squares

Edge-connected configurations of squares are a common model for modular ...

0 Irina Kostitsyna, et al. ∙

∙ 01/11/2021

On Compatible Matchings

A matching is compatible to two or more labeled point sets of size n wit...

0 Oswin Aichholzer, et al. ∙

∙ 12/21/2020

Efficient Segment Folding is Hard

We introduce a computational origami problem which we call the segment f...

0 Takashi Horiyama, et al. ∙

∙ 12/18/2020

Upward Point Set Embeddings of Paths and Trees

We study upward planar straight-line embeddings (UPSE) of directed trees...

0 Elena Arseneva, et al. ∙

∙ 12/14/2020

Characterizing Universal Reconfigurability of Modular Pivoting Robots

We give both efficient algorithms and hardness results for reconfiguring...

0 Hugo A. Akitaya, et al. ∙

∙ 12/14/2020

Crossing-Optimal Extension of Simple Drawings

In extension problems of partial graph drawings one is given an incomple...

0 Robert Ganian, et al. ∙

∙ 12/03/2020

Saturated k-Plane Drawings with Few Edges

A drawing of a graph is k-plane if no edge is crossed more than k times....

0 Fabian Klute, et al. ∙

∙ 08/25/2020

On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens

A star-simple drawing of a graph is a drawing in which adjacent edges do...

0 Stefan Felsner, et al. ∙

∙ 07/31/2020

New Results in Sona Drawing: Hardness and TSP Separation

Given a set of point sites, a sona drawing is a single closed curve, dis...

0 Man-Kwun Chiu, et al. ∙

∙ 09/16/2019

Extending simple drawings with one edge is hard

A simple drawing D(G) of a graph G = (V,E) is a drawing in which two edg...

0 Alan Arroyo, et al. ∙

∙ 08/21/2019

Extending Simple Drawings

Simple drawings of graphs are those in which each pair of edges share at...

0 Alan Arroyo, et al. ∙

∙ 08/21/2019

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers

We present the first universal reconfiguration algorithm for transformin...

0 Hugo A. Akitaya, et al. ∙

∙ 08/18/2019

Graphs with large total angular resolution

The total angular resolution of a straight-line drawing is the minimum a...

0 Oswin Aichholzer, et al. ∙

∙ 08/18/2019

On the 2-colored crossing number

Let D be a straight-line drawing of a graph. The rectilinear 2-colored c...

0 Oswin Aichholzer, et al. ∙

∙ 08/14/2019

Minimal Representations of Order Types by Geometric Graphs

In order to have a compact visualization of the order type of a given po...

0 Oswin Aichholzer, et al. ∙

∙ 08/31/2018

How to Fit a Tree in a Box

We study compact straight-line embeddings of trees. We show that perfect...

0 Hugo A. Akitaya, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world