Darren Strash
Darren Strash publishes mostly in Computational Theory and Mathematics, Computer Vision and Pattern Recognition and Computer Networks and Communications, on topics such as Complexity and Algorithms in Graphs, Advanced Graph Theory Research and Graph Theory and Algorithms.
- World rank
- #2,186,611 of 7,710,434 ranked researchers
- Rank in United States
- #656,593 of 1,627,098
- Works
- 77
- Citations
- 1.3k
- Citations per work
- 16.6
What does Darren Strash research?
Darren Strash's work is mostly in Computer Science (82%).
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 Sciences6382.1%
- Computer Science6382.1%
- Everything else1417.9%
- 1Computational Theory and Mathematics32% of their works
- 2Computer Vision and Pattern Recognition14% of their works
- 3Computer Networks and Communications12% of their works
- 4Artificial Intelligence9% of their works
- 5Computer Graphics and Computer-Aided Design8% of their works
- 6Signal Processing6% of their works
Research topics
Which keywords describe Darren Strash's research?
The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Combinatorial Optimization, Complexity Theory, Graph Theory, Parameterized Complexity, Graph Matching and Graph Processing.
- Suffix Arrays
- Online Algorithms
- Network Dynamics
- Trajectory Data Mining
- Mesh Generation
- Graph Processing
- Parameterized Complexity
- Complexity Theory
- Algorithmic Applications
- Approximation Algorithms
- Combinatorial Optimization
- Graph Theory
- Graph Matching
- Delaunay Triangulations
- GPS Trajectories
- Community Structure
- Mobile Robots
- Compression
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 18 words, with their numbers
- Approximation Algorithms833 topics
- Algorithmic Applications662 topics
- Combinatorial Optimization341 topic
- Complexity Theory341 topic
- Graph Theory321 topic
- Parameterized Complexity321 topic
- Graph Matching231 topic
- Graph Processing231 topic
- Delaunay Triangulations171 topic
- Mesh Generation171 topic
- GPS Trajectories141 topic
- Trajectory Data Mining141 topic
- Community Structure101 topic
- Network Dynamics101 topic
- Mobile Robots71 topic
- Online Algorithms71 topic
- Compression61 topic
- Suffix Arrays61 topic
Where does Darren Strash work?
Darren Strash's main affiliation in the publication record is Hamilton College, United States.
How many publications and citations does Darren Strash have?
OpenAlex counts 77 works and 1,279 citations for Darren Strash, an h-index of 15, ranking #2,186,611 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 Darren Strash. 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.