Javier Tejel

415 total citations
32 papers, 200 citations indexed

About

Javier Tejel is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Javier Tejel has authored 32 papers receiving a total of 200 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computer Graphics and Computer-Aided Design, 20 papers in Computational Theory and Mathematics and 7 papers in Computer Vision and Pattern Recognition. Recurrent topics in Javier Tejel's work include Computational Geometry and Mesh Generation (23 papers), Advanced Graph Theory Research (19 papers) and Digital Image Processing Techniques (6 papers). Javier Tejel is often cited by papers focused on Computational Geometry and Mesh Generation (23 papers), Advanced Graph Theory Research (19 papers) and Digital Image Processing Techniques (6 papers). Javier Tejel collaborates with scholars based in Spain, Mexico and United States. Javier Tejel's co-authors include Marc Noy, P. Jodrá, F. Hurtado, Manuel Abellanas, Jorge Urrutia, Ferrán Hurtado, Sergey Bereg, Clemens Huemer, David Rappaport and Carmen Hernando and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and SIAM Journal on Computing.

In The Last Decade

Javier Tejel

29 papers receiving 192 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Javier Tejel Spain	7	123	92	53	43	36	32	200
Paz Carmi Israel	9	128 1.0×	76 0.8×	38 0.7×	106 2.5×	44 1.2×	66	271
Sébastien Collette Belgium	8	95 0.8×	46 0.5×	18 0.3×	81 1.9×	45 1.3×	34	237
Stephen Wismath Canada	9	223 1.8×	100 1.1×	6 0.1×	38 0.9×	116 3.2×	32	252
Matias Korman Japan	8	121 1.0×	42 0.5×	11 0.2×	29 0.7×	85 2.4×	68	214
Jean‐François Dufourd France	8	83 0.7×	33 0.4×	52 1.0×	17 0.4×	53 1.5×	23	183
Jayaram Bhasker United States	7	70 0.6×	54 0.6×	33 0.6×	54 1.3×	40 1.1×	8	239
Heiko Schilling Germany	4	10 0.1×	28 0.3×	31 0.6×	39 0.9×	23 0.6×	6	137
W. M. vanCleemput United States	9	16 0.1×	33 0.4×	59 1.1×	57 1.3×	12 0.3×	23	282
Dennis Schieferdecker Germany	5	7 0.1×	15 0.2×	16 0.3×	64 1.5×	33 0.9×	11	178
Stéphane Ubéda France	10	8 0.1×	20 0.2×	3 0.1×	171 4.0×	51 1.4×	31	255

Countries citing papers authored by Javier Tejel

Since Specialization

Citations

This map shows the geographic impact of Javier Tejel's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Javier Tejel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Javier Tejel more than expected).

Fields of papers citing papers by Javier Tejel

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Javier Tejel. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Javier Tejel. The network helps show where Javier Tejel may publish in the future.

Co-authorship network of co-authors of Javier Tejel

This figure shows the co-authorship network connecting the top 25 collaborators of Javier Tejel. A scholar is included among the top collaborators of Javier Tejel based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Javier Tejel. Javier Tejel is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Aichholzer, Oswin, et al.. (2024). Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. Discrete & Computational Geometry. 71(1). 40–66. 1 indexed citations

Kanō, Mikio, David Orden, Javier Tejel, et al.. (2021). Rainbow polygons for colored point sets in the plane. Zaguan (University of Zaragoza Repository). 1 indexed citations

Orden, David, Pablo Pérez-Lantero, David Rappaport, et al.. (2021). Maximum Rectilinear Convex Subsets. SIAM Journal on Computing. 50(1). 145–170. 1 indexed citations

Ábrego, Bernardo M., Silvia Fernández‐Merchant, Mikio Kanō, et al.. (2019). K1,3-covering red and blue points in the plane. SHILAP Revista de lepidopterología. 2 indexed citations

Tejel, Javier, et al.. (2019). Metric dimension of maximal outerplanar graphs. LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas). 7 indexed citations

Aichholzer, Oswin, et al.. (2019). Hamiltonian meander paths and cycles on bichromatic point sets.. 1 indexed citations

Seara, Carlos, et al.. (2018). On Hamiltonian alternating cycles and paths. QRU Quaderns de Recerca en Urbanisme. 5 indexed citations

Hurtado, Ferrán, et al.. (2015). Geometric Biplane Graphs I: Maximal Graphs. Graphs and Combinatorics. 31(2). 407–425. 2 indexed citations

Huemer, Clemens, et al.. (2014). Compatible spanning trees. Computational Geometry. 47(5). 563–584. 3 indexed citations

10.

Jodrá, P., et al.. (2011). Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon. Algorithmica. 65(3). 481–497. 1 indexed citations

11.

Hurtado, Ferrán, et al.. (2009). On triconnected and cubic plane graphs on given point sets. Computational Geometry. 42(9). 913–922. 5 indexed citations

12.

Tejel, Javier, et al.. (2009). Augmenting the Rigidity of a Graph in R 2. Algorithmica. 59(2). 145–168. 5 indexed citations

13.

Abellanas, Manuel, et al.. (2007). On local transformations in plane geometric graphs embedded on small grids. Computational Geometry. 39(2). 65–77. 1 indexed citations

14.

Abellanas, Manuel, et al.. (2007). Augmenting the connectivity of geometric graphs. Computational Geometry. 40(3). 220–230. 22 indexed citations

15.

Abellanas, Manuel, et al.. (2005). Moving coins. Computational Geometry. 34(1). 35–48. 10 indexed citations

16.

Alcayde, Alfredo, et al.. (2001). A note on the travelling repairman problem.. Hispana. 1–16. 1 indexed citations

17.

Noy, Marc, et al.. (2000). Lower bounds on the number of crossing-free subgraphs of KN. Computational Geometry. 16(4). 211–221. 53 indexed citations

18.

Tejel, Javier, et al.. (1998). A Lower Bound for the Number of Polygonizations of N Points in the Plane.. Ars Combinatoria. 49. 4 indexed citations

19.

Jodrá, P., et al.. (1998). An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays. Information Processing Letters. 68(1). 3–9. 3 indexed citations

20.

Noy, Marc, et al.. (1995). Lower bounds for the number noncrossing free subgraphs of K n .. Canadian Conference on Computational Geometry. 97–102. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact