Dániel Marx
Impact in
- Computational Theory and Mathematics top 0.1%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
-
- Limits and Structures in Graph Theory
Papers in
-
- Advanced Graph Theory Research 122
- Complexity and Algorithms in Graphs 81
- Graph Labeling and Dimension Problems 20
-
- Constraint Satisfaction and Optimization 25
- Optimization and Search Problems 23
- Co-authors
- Martin Grohe (10 shared papers)Daniel Lokshtanov (9 shared papers)Saket Saurabh (9 shared papers)Michał Pilipczuk (9 shared papers)Marek Cygan (6 shared papers)Marcin Pilipczuk (10 shared papers)Fedor V. Fomin (5 shared papers)Łukasz Kowalik (1 shared paper)
- Journals
- ACM Transactions on Algorithms (13 papers)SIAM Journal on Computing (11 papers)Algorithmica (10 papers)Theoretical Computer Science (6 papers)Discrete Applied Mathematics (5 papers)
- Partner nations
- HungaryGermanyUnited States
In The Last Decade
Dániel Marx
142 papers receiving 2.9k citations
Dániel Marx's Hit Papers
Peers
Comparison fields: 5 of 103
- Computational Theory and Mathematics 2.3k
- Discrete Mathematics and Combinatorics 371
- Computer Graphics and Computer-Aided Design 195
- Computer Networks and Communications 1.1k
- Signal Processing 288
Countries citing papers authored by Dániel Marx
This map shows the geographic impact of Dániel Marx'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 Dániel Marx with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dániel Marx more than expected).
Fields of papers citing papers by Dániel Marx
This network shows the impact of papers produced by Dániel Marx. 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 Dániel Marx. The network helps show where Dániel Marx may publish in the future.
Co-authors
The 25 scholars most cited alongside Dániel Marx, 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 153 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Parameterized Algorithms Hit paper breakdown → | 2015 | 773 |
| 2 | 2007 | 111 | |
| 3 | 2005 | 99 | |
| 4 | 2013 | 89 | |
| 5 | 2008 | 74 | |
| 6 | GRAPH COLOURING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING | 2004 | 71 |
| 7 | 2010 | 68 | |
| 8 | 2006 | 68 | |
| 9 | 2013 | 58 | |
| 10 | 2012 | 54 | |
| 11 | 2014 | 50 | |
| 12 | 2009 | 40 | |
| 13 | 2011 | 39 | |
| 14 | 2015 | 38 | |
| 15 | 2008 | 38 | |
| 16 | 2011 | 36 | |
| 17 | 2010 | 36 | |
| 18 | 2016 | 34 | |
| 19 | 2008 | 34 | |
| 20 | 2010 | 31 |
About Dániel Marx
Dániel Marx is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Artificial Intelligence and Computer Graphics and Computer-Aided Design, having authored 153 papers that have together received 3.0k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (122 papers), Complexity and Algorithms in Graphs (81 papers), Constraint Satisfaction and Optimization (25 papers), Optimization and Search Problems (23 papers), Graph Labeling and Dimension Problems (20 papers), Limits and Structures in Graph Theory (20 papers), Computational Geometry and Mesh Generation (15 papers) and Algorithms and Data Compression (11 papers). The work is most often cited by research in Computational Theory and Mathematics (2.3k citations), Discrete Mathematics and Combinatorics (371 citations), Computer Graphics and Computer-Aided Design (195 citations), Computer Networks and Communications (1.1k citations) and Signal Processing (288 citations). Dániel Marx has collaborated with scholars based in Hungary, Germany and United States. Frequent co-authors include Martin Grohe, Daniel Lokshtanov, Saket Saurabh, Michał Pilipczuk, Marek Cygan, Marcin Pilipczuk, Fedor V. Fomin, Łukasz Kowalik, Ildikó Schlotter and Albert Atserias. Their work appears in journals such as ACM Transactions on Algorithms, SIAM Journal on Computing, Algorithmica, Theoretical Computer Science and Discrete Applied Mathematics.
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.