Travis Dillon
Travis Dillon publishes mostly in Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics, on topics such as Computational Geometry and Mesh Generation, Point processes and geometric inequalities and Limits and Structures in Graph Theory.
- World rank
- #5,807,015 of 7,710,434 ranked researchers
- Rank in United States
- #1,433,967 of 1,627,098
- Works
- 22
- Citations
- 6
- Citations per work
- 0.3
What does Travis Dillon research?
Travis Dillon's work is mostly in Computer Science (36%), Mathematics (20%), Engineering (5%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences1360.8%
- Computer Science835.8%
- Mathematics419.6%
- Engineering15.4%
- Everything else939.2%
- 1Computer Graphics and Computer-Aided Design18% of their works
- 2Computational Theory and Mathematics12% of their works
- 3Discrete Mathematics and Combinatorics11% of their works
- 4Applied Mathematics9% of their works
- 5Computer Vision and Pattern Recognition5% of their works
- 6Electrical and Electronic Engineering5% of their works
Research topics
Which keywords describe Travis Dillon's research?
The keywords of their largest research topics: Approximation Algorithms, Delaunay Triangulations, Mesh Generation, Point Processes, Spatstat, Graph Limits, Szemerédi's Theorem and Fiber Bragg Grating.
- Parameterized Complexity
- Graph Theory
- Combinatorics
- Spectral Amplitude Coding
- Fiber Bragg Grating
- Graph Limits
- Point Processes
- Delaunay Triangulations
- Approximation Algorithms
- Mesh Generation
- Spatstat
- Szemerédi's Theorem
- Persistent Homology
- Topological Methods
- Geometry
- Hyperbolic
- Permutations
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 17 words, with their numbers
- Approximation Algorithms122 topics
- Delaunay Triangulations101 topic
- Mesh Generation101 topic
- Point Processes51 topic
- Spatstat51 topic
- Graph Limits41 topic
- Szemerédi's Theorem41 topic
- Fiber Bragg Grating31 topic
- Persistent Homology31 topic
- Spectral Amplitude Coding31 topic
- Topological Methods31 topic
- Combinatorics21 topic
- Geometry21 topic
- Graph Theory21 topic
- Hyperbolic21 topic
- Parameterized Complexity21 topic
- Permutations21 topic
Where does Travis Dillon work?
Travis Dillon's main affiliation in the publication record is Lawrence University, United States.
How many publications and citations does Travis Dillon have?
OpenAlex counts 22 works and 6 citations for Travis Dillon, an h-index of 2, ranking #5,807,015 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Travis Dillon. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.