default search action
Javier Tejel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j32]Oswin Aichholzer
, Alfredo García
Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. Discret. Comput. Geom. 71(1): 40-66 (2024) - 2023
- [j31]Alfredo García, Javier Tejel, Birgit Vogtenhuber, Alexandra Weinberger:
Empty Triangles in Generalized Twisted Drawings of Kn. J. Graph Algorithms Appl. 27(8): 721-735 (2023) - 2022
- [c7]Oswin Aichholzer, Alfredo García, Javier Tejel
Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. SoCG 2022: 5:1-5:18 - [c6]Alfredo García
Empty Triangles in Generalized Twisted Drawings of Kn. GD 2022: 40-48 - [i12]Oswin Aichholzer
Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. CoRR abs/2203.06143 (2022) - [i11]Alfredo García, Javier Tejel
Empty Triangles in Generalized Twisted Drawings of Kn. CoRR abs/2208.05819 (2022) - [i10]Alfredo García, Alexander Pilz, Javier Tejel
On Plane Subgraphs of Complete Topological Drawings. CoRR abs/2209.03072 (2022) - 2021
- [j30]Alfredo García Olaverri, Javier Tejel Altarriba
On plane subgraphs of complete topological drawings. Ars Math. Contemp. 20(1): 69-87 (2021) - [j29]Mercè Claverol
Total domination in plane triangulations. Discret. Math. 344(1): 112179 (2021) - [j28]David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval
Rainbow polygons for colored point sets in the plane. Discret. Math. 344(7): 112406 (2021) - [j27]Hernán González-Aguilar, David Orden
Maximum Rectilinear Convex Subsets. SIAM J. Comput. 50(1): 145-170 (2021) - 2020
- [j26]Juan C. Catana-Salazar, Alfredo García Olaverri, Javier Tejel
Plane augmentation of plane graphs to meet parity constraints. Appl. Math. Comput. 386: 125513 (2020) - [i9]David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, Birgit Vogtenhuber:
Rainbow polygons for colored point sets in the plane. CoRR abs/2007.10139 (2020) - [i8]Juan C. Catana-Salazar, Alfredo García, Javier Tejel, Jorge Urrutia:
Plane augmentation of plane graphs to meet parity constraints. CoRR abs/2007.11863 (2020) - [i7]Mercè Claverol, Alfredo García, Carlos G. Hernández, Carmen Hernando, Montserrat Maureso, Mercè Mora, Javier Tejel:
Total domination in plane triangulations. CoRR abs/2011.04255 (2020)
2010 – 2019
- 2019
- [j25]Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel:
K1,3-covering red and blue points in the plane. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [c5]Hernán González-Aguilar, David Orden
Maximum Rectilinear Convex Subsets. FCT 2019: 274-291 - [i6]Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia:
Maximum rectilinear convex subsets. CoRR abs/1907.07441 (2019) - 2018
- [j24]Mercè Claverol
On Hamiltonian alternating cycles and paths. Comput. Geom. 68: 146-166 (2018) - [j23]Ruy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell
Colored ray configurations. Comput. Geom. 68: 292-308 (2018) - [i5]Ruy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Jorge Urrutia:
Colored ray configurations. CoRR abs/1802.03415 (2018) - 2017
- [j22]Alfredo García Olaverri, Javier Tejel
Polynomially solvable cases of the bipartite traveling salesman problem. Eur. J. Oper. Res. 257(2): 429-438 (2017) - [i4]Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Csaba D. Tóth:
Geometric Biplane Graphs I: Maximal Graphs. CoRR abs/1702.01275 (2017) - [i3]Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Csaba D. Tóth:
Geometric Biplane Graphs II: Graph Augmentation. CoRR abs/1702.01277 (2017) - [i2]Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel:
$K_{1, 3}$-covering red and blue points in the plane. CoRR abs/1707.06856 (2017) - 2016
- [j21]Alfredo García Olaverri, Ferran Hurtado, Javier Tejel
Configurations of Non-crossing Rays and Related Problems. Discret. Comput. Geom. 55(3): 522-549 (2016) - [i1]Mercè Claverol, Alfredo García Olaverri, Delia Garijo, Carlos Seara, Javier Tejel:
On Hamiltonian alternating cycles and paths. CoRR abs/1603.06764 (2016) - 2015
- [j20]Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell
Geometric Biplane Graphs I: Maximal Graphs. Graphs Comb. 31(2): 407-425 (2015) - [j19]Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell
Geometric Biplane Graphs II: Graph Augmentation. Graphs Comb. 31(2): 427-452 (2015) - [j18]Javier Cano, Alfredo García Olaverri, Ferran Hurtado, Toshinori Sakai, Javier Tejel
Blocking the k-Holes of Point Sets in the Plane. Graphs Comb. 31(5): 1271-1287 (2015) - 2014
- [j17]Alfredo García Olaverri, Clemens Huemer
Compatible spanning trees. Comput. Geom. 47(5): 563-584 (2014) - [c4]Ruy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Jorge Urrutia:
Colored Ray Configurations. CCCG 2014 - 2013
- [j16]Alfredo García Olaverri, Pedro Jodrá, Javier Tejel
Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon. Algorithmica 65(3): 481-497 (2013) - 2011
- [j15]Alfredo García Olaverri, Javier Tejel
Augmenting the Rigidity of a Graph in R2. Algorithmica 59(2): 145-168 (2011) - 2010
- [j14]Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel
Augmenting the Connectivity of Outerplanar Graphs. Algorithmica 56(2): 160-179 (2010)
2000 – 2009
- 2009
- [j13]Alfredo García Olaverri, Ferran Hurtado, Clemens Huemer
On triconnected and cubic plane graphs on given point sets. Comput. Geom. 42(9): 913-922 (2009) - 2008
- [j12]Manuel Abellanas, Prosenjit Bose
On local transformations in plane geometric graphs embedded on small grids. Comput. Geom. 39(2): 65-77 (2008) - [j11]Manuel Abellanas, Alfredo García Olaverri, Ferran Hurtado, Javier Tejel
Augmenting the connectivity of geometric graphs. Comput. Geom. 40(3): 220-230 (2008) - 2007
- [j10]Alfredo García Olaverri, Ferran Hurtado, Clemens Huemer
On embedding triconnected cubic graphs on point sets. Electron. Notes Discret. Math. 29: 531-538 (2007) - 2006
- [j9]Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel
Moving coins. Comput. Geom. 34(1): 35-48 (2006) - 2004
- [c3]Manuel Abellanas, Prosenjit Bose, Alfredo García Olaverri, Ferran Hurtado, Pedro A. Ramos, Eduardo Rivera-Campo, Javier Tejel:
On Local Transformations in Plane Geometric Graphs Embedded on Small Grids. ICCSA (3) 2004: 22-31 - 2002
- [j8]Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel
On the minimum size of visibility graphs. Inf. Process. Lett. 81(4): 223-230 (2002) - [j7]Alfredo García Olaverri, M. Carmen Hernando
Packing trees into planar graphs. J. Graph Theory 40(3): 172-181 (2002) - [j6]Alfredo García Olaverri, Pedro Jodrá, Javier Tejel
A note on the traveling repairman problem. Networks 40(1): 27-31 (2002) - 2000
- [j5]Alfredo García Olaverri, Marc Noy, Javier Tejel
Lower bounds on the number of crossing-free subgraphs of KN. Comput. Geom. 16(4): 211-221 (2000)
1990 – 1999
- 1998
- [j4]Alfredo García Olaverri, Javier Tejel:
A Lower Bound for the Number of Polygonizations of N Points in the Plane. Ars Comb. 49 (1998) - [j3]Alfredo García Olaverri, Pedro Jodrá, Javier Tejel:
An Efficient Algorithm for On-Line Searching of Minima in Monge Path-Decomposable Tridimensional Arrays. Inf. Process. Lett. 68(1): 3-9 (1998) - 1997
- [c2]Alfredo García Olaverri, M. Carmen Hernando
Packing Trees into Planar Graphs. GD 1997: 383-390 - 1996
- [j2]Alfredo García Olaverri, Javier Tejel
Using Total Monotonicity for Two Optimization Problems on the Plane. Inf. Process. Lett. 60(1): 13-17 (1996) - 1995
- [j1]Alfredo García Olaverri, Javier Tejel
The Order of Points on the Second Convex Hull of a Simple Polygon. Discret. Comput. Geom. 14(2): 185-205 (1995) - [c1]Alfredo García Olaverri, Marc Noy, Javier Tejel:
Lower bounds for the number noncrossing free subgraphs of Kn. CCCG 1995: 97-102
Coauthor Index
aka: Alfredo García Olaverri
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-07 21:19 CEST 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: