Javier Tejel
Impact in
-
- Computational Geometry and Mesh Generation
-
- Advanced Graph Theory Research
Papers in
-
- Computational Geometry and Mesh Generation 23
-
- Advanced Graph Theory Research 19
- Graph Labeling and Dimension Problems 5
- Complexity and Algorithms in Graphs 3
- Co-authors
- Marc Noy (4 shared papers)P. Jodrá (3 shared papers)F. Hurtado (3 shared papers)Manuel Abellanas (3 shared papers)Ferrán Hurtado (9 shared papers)Jorge Urrutia (5 shared papers)Sergey Bereg (1 shared paper)David Rappaport (2 shared papers)
- Journals
- Computational Geometry (6 papers)Algorithmica (3 papers)Discrete & Computational Geometry (3 papers)Graphs and Combinatorics (3 papers)Networks (1 paper)
- Partner nations
- SpainMexicoUnited States
In The Last Decade
Javier Tejel
29 papers receiving 191 citations
Peers
Comparison fields: 5 of 32
- Computer Graphics and Computer-Aided Design 123
- Computational Theory and Mathematics 91
- Discrete Mathematics and Combinatorics 17
- Industrial and Manufacturing Engineering 53
- Signal Processing 25
Countries citing papers authored by Javier Tejel
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
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-authors
The 25 scholars most cited alongside Javier Tejel, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 32 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2000 | 53 | |
| 2 | 2002 | 36 | |
| 3 | 2007 | 21 | |
| 4 | 2005 | 10 | |
| 5 | 2016 | 9 | |
| 6 | 2019 | 7 | |
| 7 | Dividiendo una nube de puntos en regiones convexas | 1995 | 6 |
| 8 | 2018 | 5 | |
| 9 | 2002 | 5 | |
| 10 | 2009 | 5 | |
| 11 | 2009 | 5 | |
| 12 | A Lower Bound for the Number of Polygonizations of N Points in the Plane. | 1998 | 4 |
| 13 | 1996 | 4 | |
| 14 | 2008 | 3 | |
| 15 | 1998 | 3 | |
| 16 | 2014 | 3 | |
| 17 | 1995 | 3 | |
| 18 | Lower bounds for the number noncrossing free subgraphs of K n . | 1995 | 2 |
| 19 | 2015 | 2 | |
| 20 | 2019 | 2 |
About Javier Tejel
Javier Tejel is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Electrical and Electronic Engineering and Industrial and Manufacturing Engineering, having authored 32 papers that have together received 199 indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (23 papers), Advanced Graph Theory Research (19 papers), Digital Image Processing Techniques (6 papers), Graph Labeling and Dimension Problems (5 papers), Optimization and Packing Problems (5 papers), graph theory and CDMA systems (4 papers), Complexity and Algorithms in Graphs (3 papers) and Mathematics and Applications (3 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (123 citations), Computational Theory and Mathematics (91 citations), Discrete Mathematics and Combinatorics (17 citations), Industrial and Manufacturing Engineering (53 citations) and Signal Processing (25 citations). Javier Tejel has collaborated with scholars based in Spain, Mexico and United States. Frequent co-authors include Marc Noy, P. Jodrá, F. Hurtado, Manuel Abellanas, Ferrán Hurtado, Jorge Urrutia, Sergey Bereg, David Rappaport, Clemens Huemer and Csaba D. Tóth. Their work appears in journals such as Computational Geometry, Algorithmica, Discrete & Computational Geometry, Graphs and Combinatorics and Networks.
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.