Dániel Marx
Dániel Marx publishes mostly in Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence, on topics such as Advanced Graph Theory Research, Complexity and Algorithms in Graphs and Optimization and Search Problems.
- World rank
- #235,455 of 7,710,434 ranked researchers
- Rank in Hungary
- #202 of 25,218
- Works
- 400
- Citations
- 9.5k
- Citations per work
- 23.8
What does Dániel Marx research?
Dániel Marx's work is mostly in Computer Science (68%), Engineering (7%), Mathematics (4%).
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 Sciences31879.4%
- Computer Science27468.4%
- Engineering286.9%
- Mathematics164.1%
- Everything else8220.6%
- 1Computational Theory and Mathematics51% of their works
- 2Computer Networks and Communications12% of their works
- 3Artificial Intelligence5% of their works
- 4Discrete Mathematics and Combinatorics4% of their works
- 5Industrial and Manufacturing Engineering4% of their works
- 6Electrical and Electronic Engineering3% of their works
Research topics
Which keywords describe Dániel Marx's research?
The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Graph Theory, Parameterized Complexity, Combinatorial Optimization, Complexity Theory, Mobile Robots and Online Algorithms.
- Suffix Arrays
- Mesh Generation
- Szemerédi's Theorem
- Metric Dimension
- Distributed Algorithms
- Online Algorithms
- Complexity Theory
- Parameterized Complexity
- Algorithmic Applications
- Approximation Algorithms
- Graph Theory
- Combinatorial Optimization
- Mobile Robots
- Constraint Optimization
- Graph Labeling
- Graph Limits
- Delaunay Triangulations
- 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.
All 18 words, with their numbers
- Approximation Algorithms5083 topics
- Algorithmic Applications4732 topics
- Graph Theory2791 topic
- Parameterized Complexity2791 topic
- Combinatorial Optimization1941 topic
- Complexity Theory1941 topic
- Mobile Robots581 topic
- Online Algorithms581 topic
- Constraint Optimization461 topic
- Distributed Algorithms461 topic
- Graph Labeling441 topic
- Metric Dimension441 topic
- Graph Limits411 topic
- Szemerédi's Theorem411 topic
- Delaunay Triangulations351 topic
- Mesh Generation351 topic
- Compression271 topic
- Suffix Arrays271 topic
Where does Dániel Marx work?
Dániel Marx's main affiliation in the publication record is Hungarian Academy of Sciences, Hungary.
How many publications and citations does Dániel Marx have?
OpenAlex counts 400 works and 9,523 citations for Dániel Marx, an h-index of 47, ranking #235,455 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised 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.
Other researchers named Dániel Marx
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 Dániel Marx. Posts are plain text and can be reported.