Dániel Marx

Sitert av

	Alle	Siden 2016
Sitater	8843	5759
h-indeks	47	37
i10-indeks	121	93

1300

650

325

975

20042005200620072008200920102011201220132014201520162017201820192020202129 30 65 80 113 142 191 283 423 495 480 555 709 837 914 1036 1292 962

Offentlig tilgang

Vis alle

97 artikler

0 artikler

tilgjengelige

ikke tilgjengelige

Basert på finansieringsmandater

Medforfattere

Saket SaurabhProfessor at Institute of Mathematical SciencesVerifisert e-postadresse på imsc.res.in
Michał PilipczukUniversity of WarsawVerifisert e-postadresse på mimuw.edu.pl
Marek CyganUniversity of WarsawVerifisert e-postadresse på mimuw.edu.pl
Fedor V. FominProfessor of Computer Science, University of BergenVerifisert e-postadresse på uib.no
Daniel LokshtanovAssociate Professor in Computer Science, UCSBVerifisert e-postadresse på ucsb.edu
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerifisert e-postadresse på mimuw.edu.pl
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkVerifisert e-postadresse på cs.umd.edu
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityVerifisert e-postadresse på informatik.rwth-aachen.de
Igor RazgonLecturer, Department of Computer Science and Information Systems, Birkbeck, University of LondonVerifisert e-postadresse på dcs.bbk.ac.uk
Lukasz KowalikUniversity of WarsawVerifisert e-postadresse på mimuw.edu.pl
Holger DellGoethe University FrankfurtVerifisert e-postadresse på uni-frankfurt.de
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerifisert e-postadresse på mit.edu
Magnus WahlströmRoyal Holloway, University of LondonVerifisert e-postadresse på rhul.ac.uk
Philip KleinProfessor of Computer Science, Brown UniversityVerifisert e-postadresse på brown.edu
Stefan KratschProfessor at Humboldt University BerlinVerifisert e-postadresse på informatik.hu-berlin.de
Rajesh ChitnisUniversity of BirminghamVerifisert e-postadresse på bham.ac.uk
Mohammad Hossein BateniResearch scientist, GoogleVerifisert e-postadresse på cs.princeton.edu
Andrei BulatovSimon Fraser UniversityVerifisert e-postadresse på sfu.ca
Paul WollanProfessor of Computer Science, University of Rome La SapienzaVerifisert e-postadresse på di.uniroma1.it
Radu CurticapeanIT University of Copenhagen, Basic Algorithms Research CopenhagenVerifisert e-postadresse på itu.dk

Dániel Marx

CISPA Helmholtz Center for Information Security

Verifisert e-postadresse på cispa.saarland - Startside

theoretical computer science


Tittel Sortér etter sitater Sortér etter år Sortér etter tittel	Sitert av Sitert av	År
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	1708	2015
Lower bounds based on the exponential time hypothesis D Lokshtanov, D Marx, S Saurabh Bulletin of EATCS 3 (105), 2013	313	2013
Parameterized complexity and approximation algorithms D Marx The Computer Journal 51 (1), 60-78, 2008	258	2008
Constraint solving via fractional edge covers M Grohe, D Marx ACM Transactions on Algorithms (TALG) 11 (1), 1-20, 2014	249	2014
Graph colouring problems and their applications in scheduling D Marx Periodica Polytechnica, Electrical Engineering 48 (1-2), 11-16, 2004	245	2004
Parameterized graph separation problems D Marx Theoretical Computer Science 351 (3), 394-406, 2006	244	2006
Size bounds and query plans for relational joins A Atserias, M Grohe, D Marx SIAM Journal on Computing 42 (4), 1737-1767, 2013	216*	2013
Can you beat treewidth? D Marx 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 169-179, 2007	196	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	188	2016
Tractable hypergraph properties for constraint satisfaction and conjunctive queries D Marx Journal of the ACM (JACM) 60 (6), 1-51, 2013	164	2013
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	150	2011
Fixed-parameter tractability of multicut parameterized by the size of the cutset D Marx, I Razgon SIAM Journal on Computing 43 (2), 355-388, 2014	147	2014
Chordal deletion is fixed-parameter tractable D Marx Algorithmica 57 (4), 747-768, 2010	133*	2010
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	130	2011
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	121*	2018
Structure theorem and isomorphism test for graphs with excluded topological subgraphs M Grohe, D Marx SIAM Journal on Computing 44 (1), 114-159, 2015	120	2015
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	103	2011
Kernelization of packing problems H Dell, D Marx Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	95	2012
A parameterized view on matroid optimization problems D Marx Theoretical Computer Science 410 (44), 4471-4479, 2009	95	2009
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	92	2013

Systemet kan ikke utføre handlingen. Prøv igjen senere.

Artikler 1–20

Sitater per år

Duplikatsitater

Sammenslåtte sitater

Legg til medforfattereMedforfattere

Følg denne forfatteren

Sitert av

Medforfattere