Daniel Marx

Computational Theory and Mathematics · 2008–2011

A researcher in the Science corpus: 4 papers; trusts 8 researchers and is trusted by 2 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 21 citations into it; #8,694 of 12,182 by trust here, #9,804 by citations
• Computer Networks and Communications — 7 citations into it; #6,809 of 9,886 by trust here, #8,191 by citations
• Algorithms & Complexity — 5 citations into it

Whom Daniel Marx trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Sanjeev Arora
2. Leslie G. Valiant
3. Teofilo F. Gonzalez
4. Paul D. Seymour
5. Chandra Chekuri
6. Sang-il Oum
7. Uriel Feige
8. Bruce A. Reed
9. Martin Grohe
10. Josep Díaz

Who trusts Daniel Marx overall

1. Jiong Guo
2. Rolf Niedermeier

Papers from Daniel Marx's perspective

Ordered by how strongly the researchers Daniel Marx trusts endorse each paper. Same corpus, a different order for every researcher.

1. The Probabilistic Method
2. The Complexity of Computing the Permanent
3. Approximation Algorithms
4. Clustering to Minimize the Maximum Intercluster Distance
5. I Computational Complexity
6. A PTAS for the multiple knapsack problem (ACM-SIAM Symposium on Discrete Algorithms)
7. Database System Implementation
8. Improved approximation algorithms for minimum-weight vertex separators (Symposium on the Theory of Computing)
9. Introduction to the theory of computation
10. Finding odd cycle transversals (Operations Research Letters)

Their papers

• Lower bounds based on the Exponential Time Hypothesis (2011) — 390 citations
• Parameterized Complexity and Approximation Algorithms (2008) — 314 citations
• Parameterized Algorithms (2010) — 2,259 citations
• Size Bounds and Query Plans for Relational Joins (2008) — 382 citations