Dániel Marx 个人学术档案 - 学术资源搜索

引用次数

	总计	2019 年至今
引用	12012	6560
h 指数	51	37
i10 指数	134	100

1400

700

350

1050

2005200620072008200920102011201220132014201520162017201820192020202120222023202430 62 82 109 124 186 270 404 461 458 536 696 849 905 1026 1149 1157 1211 1349 657

开放获取的出版物数量

查看全部

98 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Saket SaurabhProfessor at Institute of Mathematical Sciences在 imsc.res.in 的电子邮件经过验证
Michał PilipczukUniversity of Warsaw在 mimuw.edu.pl 的电子邮件经过验证
Marek CyganUniversity of Warsaw在 mimuw.edu.pl 的电子邮件经过验证
Fedor V. FominProfessor of Computer Science, University of Bergen在 uib.no 的电子邮件经过验证
Marcin PilipczukInstytut Informatyki, Uniwersytet Warszawski在 mimuw.edu.pl 的电子邮件经过验证
Daniel LokshtanovProfessor of Computer Science, UCSB在 ucsb.edu 的电子邮件经过验证
Martin GroheProfessor of Computer Science, RWTH Aachen University在 informatik.rwth-aachen.de 的电子邮件经过验证
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College Park在 cs.umd.edu 的电子邮件经过验证
Stefan KratschProfessor at Humboldt University Berlin在 informatik.hu-berlin.de 的电子邮件经过验证
Lukasz KowalikUniversity of Warsaw在 mimuw.edu.pl 的电子邮件经过验证
Magnus WahlströmRoyal Holloway, University of London在 rhul.ac.uk 的电子邮件经过验证
Igor RazgonLecturer, Department of Computer Science and Information Systems, Birkbeck, University of London在 dcs.bbk.ac.uk 的电子邮件经过验证
Holger DellGoethe University Frankfurt在 uni-frankfurt.de 的电子邮件经过验证
Rajesh ChitnisUniversity of Birmingham在 bham.ac.uk 的电子邮件经过验证
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology在 mit.edu 的电子邮件经过验证
Philip KleinProfessor of Computer Science, Brown University在 brown.edu 的电子邮件经过验证
Mohammad Hossein BateniResearch scientist, Google在 cs.princeton.edu 的电子邮件经过验证
Radu CurticapeanIT University of Copenhagen在 itu.dk 的电子邮件经过验证
Édouard BonnetENS Lyon, LIP, France在 ens-lyon.fr 的电子邮件经过验证
Andrei BulatovSimon Fraser University在 sfu.ca 的电子邮件经过验证

关注

Dániel Marx

CISPA Helmholtz Center for Information Security

在 cispa.saarland 的电子邮件经过验证 - 首页

theoretical computer science


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	2839	2015
Lower bounds based on the exponential-time hypothesis M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Parameterized Algorithms, 467-521, 2015	396	2015
Size bounds and query plans for relational joins A Atserias, M Grohe, D Marx SIAM Journal on Computing 42 (4), 1737-1767, 2013	360	2013
Graph colouring problems and their applications in scheduling D Marx Periodica Polytechnica, Electrical Engineering 48 (1-2), 11-16, 2004	331	2004
Parameterized graph separation problems D Marx Theoretical Computer Science 351 (3), 394-406, 2006	315	2006
Parameterized complexity and approximation algorithms D Marx The Computer Journal 51 (1), 60-78, 2008	301	2008
Constraint solving via fractional edge covers M Grohe, D Marx ACM Transactions on Algorithms (TALG) 11 (1), 1-20, 2014	299	2014
Can you beat treewidth? D Marx 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 169-179, 2007	259	2007
On problems as hard as CNF-SAT M Cygan, H Dell, D Lokshtanov, D Marx, J Nederlof, Y Okamoto, R Paturi, ... ACM Transactions on Algorithms (TALG) 12 (3), 1-24, 2016	247	2016
Tractable hypergraph properties for constraint satisfaction and conjunctive queries D Marx Journal of the ACM (JACM) 60 (6), 1-51, 2013	223	2013
Fixed-parameter tractability of multicut parameterized by the size of the cutset D Marx, I Razgon Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	177	2011
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	167*	2018
Known algorithms on graphs of bounded treewidth are probably optimal D Lokshtanov, D Marx, S Saurabh Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011	166	2011
Finding topological subgraphs is fixed-parameter tractable M Grohe, K Kawarabayashi, D Marx, P Wollan Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	157	2011
Chordal deletion is fixed-parameter tractable D Marx Algorithmica 57 (4), 747-768, 2010	154*	2010
Homomorphisms are a good basis for counting small subgraphs R Curticapean, H Dell, D Marx Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017	139	2017
Structure theorem and isomorphism test for graphs with excluded topological subgraphs M Grohe, D Marx Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012	135	2012
Bin packing with fixed number of bins revisited K Jansen, S Kratsch, D Marx, I Schlotter Journal of Computer and System Sciences 79 (1), 39-49, 2013	130	2013
Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth MH Bateni, MT Hajiaghayi, D Marx Journal of the ACM (JACM) 58 (5), 1-37, 2011	125	2011
Exponential time complexity of the permanent and the Tutte polynomial H Dell, T Husfeldt, D Marx, N Taslaman, M Wahlen ACM Transactions on Algorithms (TALG) 10 (4), 1-32, 2014	119	2014

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用