Dániel Marx

Citirano

	Sve	Od 2018.
Citati	10316	5814
H-indeks	50	35
i10-indeks	126	94

1400

700

350

1050

200520062007200820092010201120122013201420152016201720182019202020212022202334 60 83 111 129 186 267 412 484 454 526 701 831 882 982 1179 1239 1347 180

Javni pristup

Prikaži sve

94 članka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Saket SaurabhProfessor at Institute of Mathematical SciencesPotvrđena adresa e-pošte na imsc.res.in
Michał PilipczukUniversity of WarsawPotvrđena adresa e-pošte na mimuw.edu.pl
Marek CyganUniversity of WarsawPotvrđena adresa e-pošte na mimuw.edu.pl
Fedor V. FominProfessor of Computer Science, University of BergenPotvrđena adresa e-pošte na uib.no
Daniel LokshtanovProfessor of Computer Science, UCSBPotvrđena adresa e-pošte na ucsb.edu
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiPotvrđena adresa e-pošte na mimuw.edu.pl
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkPotvrđena adresa e-pošte na cs.umd.edu
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityPotvrđena adresa e-pošte na informatik.rwth-aachen.de
Lukasz KowalikUniversity of WarsawPotvrđena adresa e-pošte na mimuw.edu.pl
Igor RazgonLecturer, Department of Computer Science and Information Systems, Birkbeck, University of LondonPotvrđena adresa e-pošte na dcs.bbk.ac.uk
Holger DellGoethe University FrankfurtPotvrđena adresa e-pošte na uni-frankfurt.de
Philip KleinProfessor of Computer Science, Brown UniversityPotvrđena adresa e-pošte na brown.edu
Magnus WahlströmRoyal Holloway, University of LondonPotvrđena adresa e-pošte na rhul.ac.uk
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyPotvrđena adresa e-pošte na mit.edu
Rajesh ChitnisUniversity of BirminghamPotvrđena adresa e-pošte na bham.ac.uk
Stefan KratschProfessor at Humboldt University BerlinPotvrđena adresa e-pošte na informatik.hu-berlin.de
Mohammad Hossein BateniResearch scientist, GooglePotvrđena adresa e-pošte na cs.princeton.edu
Andrei BulatovSimon Fraser UniversityPotvrđena adresa e-pošte na sfu.ca
Édouard BonnetENS Lyon, LIP, FrancePotvrđena adresa e-pošte na ens-lyon.fr
Radu CurticapeanIT University of Copenhagen, Basic Algorithms Research CopenhagenPotvrđena adresa e-pošte na itu.dk

Prati

Dániel Marx

CISPA Helmholtz Center for Information Security

Potvrđena adresa e-pošte na cispa.saarland - Početna stranica

theoretical computer science


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	2250	2015
Lower bounds based on the exponential time hypothesis D Lokshtanov, D Marx, S Saurabh Bulletin of EATCS 3 (105), 2013	352	2013
Graph colouring problems and their applications in scheduling D Marx Periodica Polytechnica, Electrical Engineering 48 (1-2), 11-16, 2004	288	2004
Size bounds and query plans for relational joins A Atserias, M Grohe, D Marx SIAM Journal on Computing 42 (4), 1737-1767, 2013	281*	2013
Parameterized graph separation problems D Marx Theoretical Computer Science 351 (3), 394-406, 2006	280	2006
Constraint solving via fractional edge covers M Grohe, D Marx ACM Transactions on Algorithms (TALG) 11 (1), 1-20, 2014	270	2014
Parameterized complexity and approximation algorithms D Marx The Computer Journal 51 (1), 60-78, 2008	266	2008
Can you beat treewidth? D Marx 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 169-179, 2007	226	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	216	2016
Tractable hypergraph properties for constraint satisfaction and conjunctive queries D Marx Journal of the ACM (JACM) 60 (6), 1-51, 2013	192	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	167	2011
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	161	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	146	2011
Chordal deletion is fixed-parameter tractable D Marx Algorithmica 57 (4), 747-768, 2010	143*	2010
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	140*	2018
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	127	2012
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	111	2011
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	108	2013
Kernelization of packing problems H Dell, D Marx Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	107	2012
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	106	2017

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori