default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIrene Parada
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Oswin Aichholzer
, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber:
Perfect Matchings with Crossings. Algorithmica 86(3): 697-716 (2024)- [c26]Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, Bettina Speckmann:
Optimal In-Place Compaction of Sliding Cubes (Media Exposition). SoCG 2024: 89:1-89:4 - [c25]Ivor van der Hoog, Irene Parada, Eva Rotenberg:
Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs. ESA 2024: 70:1-70:18 - [c24]Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter:
On k-Plane Insertion into Plane Drawings. GD 2024: 35:1-35:11 - [c23]Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is ∃ ℝ-Complete. LATIN (1) 2024: 336-349 - [c22]Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, Bettina Speckmann:
Optimal In-Place Compaction of Sliding Cubes. SWAT 2024: 31:1-31:14 - [i25]Sarita de Berg, Tim Ophelders, Irene Parada, Frank Staals, Jules Wulms:
The Complexity of Geodesic Spanners using Steiner Points. CoRR abs/2402.12110 (2024) - [i24]Ivor van der Hoog, Fabian Klute, Irene Parada, Patrick Schnider:
Barking dogs: A Fréchet distance variant for detour detection. CoRR abs/2402.13159 (2024) - [i23]Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter:
On k-Plane Insertion into Plane Drawings. CoRR abs/2402.14552 (2024) - 2023
- [j11]Alan Arroyo, Fabian Klute, Irene Parada, Birgit Vogtenhuber, Raimund Seidel, Tilo Wiedera:
Inserting One Edge into a Simple Drawing is Hard. Discret. Comput. Geom. 69(3): 745-770 (2023) - [j10]Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber:
Graphs with large total angular resolution. Theor. Comput. Sci. 943: 73-88 (2023) - [i22]Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is ∃R-complete. CoRR abs/2312.05010 (2023) - [i21]Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, Bettina Speckmann:
Optimal In-Place Compaction of Sliding Cubes. CoRR abs/2312.15096 (2023) - 2022
- [j9]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Efficient segment folding is hard. Comput. Geom. 104: 101860 (2022) - [j8]Hugo A. Akitaya, Maarten Löffler, Irene Parada:
How to Fit a Tree in a Box. Graphs Comb. 38(5): 155 (2022) - [j7]Nathan van Beusekom, Irene Parada, Bettina Speckmann:
Crossing Numbers of Beyond-Planar Graphs Revisited. J. Graph Algorithms Appl. 26(1): 149-170 (2022) - [j6]Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber:
On Compatible Matchings. J. Graph Algorithms Appl. 26(2): 225-240 (2022) - [j5]Stefan Felsner, Michael Hoffmann, Kristin Knorr, Jan Kyncl, Irene Parada:
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. J. Graph Algorithms Appl. 26(3): 381-399 (2022) - [c21]Oswin Aichholzer, Alfredo García, Irene Parada, Birgit Vogtenhuber, Alexandra Weinberger:
Shooting Stars in Simple Drawings of Km, n. GD 2022: 49-57 - [c20]Oswin Aichholzer, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber:
Perfect Matchings with Crossings. IWOCA 2022: 46-59 - [c19]Hugo A. Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms:
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares. SWAT 2022: 4:1-4:19 - [i20]Oswin Aichholzer, Alfredo García, Irene Parada, Birgit Vogtenhuber, Alexandra Weinberger:
Shooting Stars in Simple Drawings of Km, n. CoRR abs/2209.01190 (2022) - [i19]Ivor van der Hoog, Irene Parada, Eva Rotenberg:
Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs. CoRR abs/2209.14094 (2022) - [i18]Oswin Aichholzer, Thomas Hackl, Maarten Löffler, Alexander Pilz, Irene Parada, Manfred Scheucher, Birgit Vogtenhuber:
Blocking Delaunay Triangulations from the Exterior. CoRR abs/2210.12015 (2022) - 2021
- [j4]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. Algorithmica 83(5): 1316-1351 (2021) - [j3]Irene Parada, Vera Sacristán, Rodrigo I. Silveira:
A new meta-module design for efficient reconfiguration of modular robots. Auton. Robots 45(4): 457-472 (2021) - [c18]Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán:
Characterizing Universal Reconfigurability of Modular Pivoting Robots. SoCG 2021: 10:1-10:20 - [c17]Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt:
Edge-Minimum Saturated k-Planar Drawings. GD 2021: 3-17 - [c16]Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber:
Crossing-Optimal Extension of Simple Drawings. ICALP 2021: 72:1-72:17 - [c15]Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber:
On Compatible Matchings. WALCOM 2021: 221-233 - [c14]Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr:
Upward Point Set Embeddings of Paths and Trees. WALCOM 2021: 234-246 - [i17]Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber:
On Compatible Matchings. CoRR abs/2101.03928 (2021) - [i16]Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Jules Wulms:
Compacting Squares. CoRR abs/2105.07997 (2021) - [i15]Nathan van Beusekom, Irene Parada, Bettina Speckmann:
Crossing Numbers of Beyond-Planar Graphs Revisited. CoRR abs/2105.12452 (2021) - 2020
- [j2]Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber:
A superlinear lower bound on the number of 5-holes. J. Comb. Theory A 173: 105236 (2020) - [j1]Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
Minimal Representations of Order Types by Geometric Graphs. J. Graph Algorithms Appl. 24(4): 551-572 (2020) - [c13]Man-Kwun Chiu, Erik D. Demaine, Yevhenii Diomidov, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy:
New Results in Sona Drawing: Hardness and TSP Separation. CCCG 2020: 63-72 - [c12]Tillmann Miltzow, Irene Parada, Willem Sonke, Bettina Speckmann, Jules Wulms:
Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition). SoCG 2020: 78:1-78:5 - [c11]Stefan Felsner, Michael Hoffmann, Kristin Knorr, Irene Parada:
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. GD 2020: 382-389 - [c10]Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera:
Inserting One Edge into a Simple Drawing Is Hard. WG 2020: 325-338 - [i14]Man-Kwun Chiu, Erik D. Demaine, Yevhenii Diomidov, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy:
New Results in Sona Drawing: Hardness and TSP Separation. CoRR abs/2007.15784 (2020) - [i13]Stefan Felsner, Michael Hoffmann, Kristin Knorr, Irene Parada:
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. CoRR abs/2008.11058 (2020) - [i12]Fabian Klute, Irene Parada:
Saturated k-Plane Drawings with Few Edges. CoRR abs/2012.02281 (2020) - [i11]Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber:
Crossing-Optimal Extension of Simple Drawings. CoRR abs/2012.07457 (2020) - [i10]Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán:
Characterizing Universal Reconfigurability of Modular Pivoting Robots. CoRR abs/2012.07556 (2020) - [i9]Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr:
Upward Point Set Embeddings of Paths and Trees. CoRR abs/2012.10525 (2020) - [i8]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Efficient Segment Folding is Hard. CoRR abs/2012.11062 (2020)
2010 – 2019
- 2019
- [c9]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Ecient Segment Folding is Hard. CCCG 2019: 177-183 - [c8]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. ESA 2019: 3:1-3:14 - [c7]Oswin Aichholzer, Ruy Fabila Monroy, Adrian Fuchs, Carlos Hidalgo-Toscano, Irene Parada, Birgit Vogtenhuber, Francisco Zaragoza:
On the 2-Colored Crossing Number. GD 2019: 87-100 - [c6]Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
Minimal Representations of Order Types by Geometric Graphs. GD 2019: 101-113 - [c5]Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber:
Graphs with Large Total Angular Resolution. GD 2019: 193-199 - [c4]Alan Arroyo, Martin Derka, Irene Parada:
Extending Simple Drawings. GD 2019: 230-243 - [i7]Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
Minimal Representations of Order Types by Geometric Graphs. CoRR abs/1908.05124 (2019) - [i6]Oswin Aichholzer, Ruy Fabila Monroy, Adrian Fuchs, Carlos Hidalgo-Toscano, Irene Parada, Birgit Vogtenhuber, Francisco Zaragoza:
On the 2-colored crossing number. CoRR abs/1908.06461 (2019) - [i5]Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber:
Graphs with large total angular resolution. CoRR abs/1908.06504 (2019) - [i4]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. CoRR abs/1908.07880 (2019) - [i3]Alan Arroyo, Martin Derka, Irene Parada:
Extending Simple Drawings. CoRR abs/1908.08129 (2019) - [i2]Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera:
Extending simple drawings with one edge is hard. CoRR abs/1909.07347 (2019) - 2018
- [c3]Hugo A. Akitaya, Maarten Löffler, Irene Parada:
How to Fit a Tree in a Box. GD 2018: 361-367 - [i1]Hugo A. Akitaya, Maarten Löffler, Irene Parada:
How to Fit a Tree in a Box. CoRR abs/1808.10572 (2018) - 2017
- [c2]Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber:
A Superlinear Lower Bound on the Number of 5-Holes. SoCG 2017: 8:1-8:16 - 2016
- [c1]Irene Parada, Vera Sacristán, Rodrigo I. Silveira:
A new meta-module for efficient reconfiguration of hinged-units modular robots. ICRA 2016: 5197-5202
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
