Dániel Marx

Citat de

	Toate	Din 2020
Referințe bibliografice	12804	6284
h-index	53	37
i10-index	138	97

1400

700

350

1050

2006200720082009201020112012201320142015201620172018201920202021202220232024202566 81 109 126 183 279 404 459 458 532 699 855 923 1037 1141 1142 1184 1281 1372 155

Acces public

Afișați-le pe toate

98 de articole

0 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Saket SaurabhProfessor at Institute of Mathematical SciencesAdresă de e-mail confirmată pe imsc.res.in
Michał PilipczukUniversity of WarsawAdresă de e-mail confirmată pe mimuw.edu.pl
Marek CyganUniversity of WarsawAdresă de e-mail confirmată pe mimuw.edu.pl
Fedor V. FominProfessor of Computer Science, University of BergenAdresă de e-mail confirmată pe uib.no
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiAdresă de e-mail confirmată pe mimuw.edu.pl
Daniel LokshtanovProfessor of Computer Science, UCSBAdresă de e-mail confirmată pe ucsb.edu
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkAdresă de e-mail confirmată pe cs.umd.edu
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityAdresă de e-mail confirmată pe informatik.rwth-aachen.de
Stefan KratschProfessor at Humboldt University BerlinAdresă de e-mail confirmată pe informatik.hu-berlin.de
Lukasz KowalikUniversity of WarsawAdresă de e-mail confirmată pe mimuw.edu.pl
Magnus WahlströmRoyal Holloway, University of LondonAdresă de e-mail confirmată pe rhul.ac.uk
Igor RazgonLecturer, Department of Computer Science and Information Systems, Birkbeck, University of LondonAdresă de e-mail confirmată pe dcs.bbk.ac.uk
Holger DellGoethe University FrankfurtAdresă de e-mail confirmată pe uni-frankfurt.de
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyAdresă de e-mail confirmată pe mit.edu
Rajesh ChitnisUniversity of BirminghamAdresă de e-mail confirmată pe bham.ac.uk
Philip KleinProfessor of Computer Science, Brown UniversityAdresă de e-mail confirmată pe brown.edu
Mohammad Hossein BateniResearch scientist, GoogleAdresă de e-mail confirmată pe cs.princeton.edu
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information ScienceAdresă de e-mail confirmată pe mini.pw.edu.pl
Radu CurticapeanIT University of CopenhagenAdresă de e-mail confirmată pe itu.dk
Édouard BonnetENS Lyon, LIP, FranceAdresă de e-mail confirmată pe ens-lyon.fr

Urmăriți

Dániel Marx

CISPA Helmholtz Center for Information Security

Adresă de e-mail confirmată pe cispa.saarland - Pagina de pornire

theoretical computer science


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	3086	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	409	2015
Size bounds and query plans for relational joins A Atserias, M Grohe, D Marx SIAM Journal on Computing 42 (4), 1737-1767, 2013	390	2013
Graph colouring problems and their applications in scheduling D Marx Periodica Polytechnica, Electrical Engineering 48 (1-2), 11-16, 2004	344	2004
Parameterized graph separation problems D Marx Theoretical Computer Science 351 (3), 394-406, 2006	324	2006
Constraint solving via fractional edge covers M Grohe, D Marx ACM Transactions on Algorithms (TALG) 11 (1), 1-20, 2014	319	2014
Parameterized complexity and approximation algorithms D Marx The Computer Journal 51 (1), 60-78, 2008	308	2008
Can you beat treewidth? D Marx 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 169-179, 2007	266	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	258	2016
Tractable hypergraph properties for constraint satisfaction and conjunctive queries D Marx Journal of the ACM (JACM) 60 (6), 1-51, 2013	232	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	185	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	169	2011
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	168*	2018
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	162	2011
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	159	2017
Chordal deletion is fixed-parameter tractable D Marx Algorithmica 57 (4), 747-768, 2010	157*	2010
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	150	2013
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	144	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	133	2011
A parameterized view on matroid optimization problems D Marx Theoretical Computer Science 410 (44), 4471-4479, 2009	129	2009

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori