◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

I. Parada

21 papers hereh-index 7191 citations37 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author17
  • last author4

Across the 21 of 21 papers where every author was matched, so the position is known.

fields
  • cs.CG18
  • math.CO2
  • cs.DS1

identity via Semantic Scholar / OpenAlex

activity
20172022
most citedA superlinear lower bound on the number of 5-holes

10 citations · 18 across the 12 of their papers we have counts for

collaborators
Showing 2021Show all

3 papers · 1 filter

cs.CG2021

Crossing Numbers of Beyond-Planar Graphs Revisited

Nathan van Beusekom, Irene Parada, Bettina Speckmann

Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs which are characterized by certain forbidden edge configurations. A natural criterio…

cs.CG2021

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares

Hugo A. Akitaya, Erik D. Demaine, Matias Korman +6

A well-established theoretical model for modular robots in two dimensions are edge-connected configurations of square modules, which can reconfigure through so-called sliding moves…

cs.CG2021

On Compatible Matchings

Oswin Aichholzer, Alan Arroyo, Zuzana Masárová +5

A matching is compatible to two or more labeled point sets of size n with labels {1,…,n} if its straight-line drawing on each of these point sets is crossing-free. We stu…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.