Dániel Marx

Navedeno

	Vse	Od leta 2020
Navedbe	12965	6412
indeks h	52	37
indeks i10	139	97

1400

700

350

1050

2006200720082009201020112012201320142015201620172018201920202021202220232024202568 81 108 125 184 281 407 465 463 536 706 841 925 1043 1138 1122 1173 1252 1359 353

Javni dostop

Prikaži vse

98 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Saket SaurabhProfessor at Institute of Mathematical SciencesPreverjeni e-poštni naslov na imsc.res.in
Michał PilipczukUniversity of WarsawPreverjeni e-poštni naslov na mimuw.edu.pl
Marek CyganUniversity of WarsawPreverjeni e-poštni naslov na mimuw.edu.pl
Fedor V. FominProfessor of Computer Science, University of BergenPreverjeni e-poštni naslov na uib.no
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiPreverjeni e-poštni naslov na mimuw.edu.pl
Daniel LokshtanovProfessor of Computer Science, UCSBPreverjeni e-poštni naslov na ucsb.edu
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkPreverjeni e-poštni naslov na cs.umd.edu
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityPreverjeni e-poštni naslov na informatik.rwth-aachen.de
Lukasz KowalikUniversity of WarsawPreverjeni e-poštni naslov na mimuw.edu.pl
Stefan KratschProfessor at Humboldt University BerlinPreverjeni e-poštni naslov na informatik.hu-berlin.de
Igor RazgonLecturer, Department of Computer Science and Information Systems, Birkbeck, University of LondonPreverjeni e-poštni naslov na dcs.bbk.ac.uk
Holger DellGoethe University FrankfurtPreverjeni e-poštni naslov na uni-frankfurt.de
Magnus WahlströmRoyal Holloway, University of LondonPreverjeni e-poštni naslov na rhul.ac.uk
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyPreverjeni e-poštni naslov na mit.edu
Radu CurticapeanIT University of CopenhagenPreverjeni e-poštni naslov na itu.dk
Rajesh ChitnisUniversity of BirminghamPreverjeni e-poštni naslov na bham.ac.uk
Philip KleinProfessor of Computer Science, Brown UniversityPreverjeni e-poštni naslov na brown.edu
Mohammad Hossein BateniResearch scientist, GooglePreverjeni e-poštni naslov na cs.princeton.edu
Édouard BonnetENS Lyon, LIP, FrancePreverjeni e-poštni naslov na ens-lyon.fr
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information SciencePreverjeni e-poštni naslov na mini.pw.edu.pl

Spremljaj

Dániel Marx

CISPA Helmholtz Center for Information Security

Preverjeni e-poštni naslov na cispa.saarland - Domača stran

theoretical computer science


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	3151	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	417	2015
Size bounds and query plans for relational joins A Atserias, M Grohe, D Marx SIAM Journal on Computing 42 (4), 1737-1767, 2013	398	2013
Graph colouring problems and their applications in scheduling D Marx Periodica Polytechnica, Electrical Engineering 48 (1-2), 11-16, 2004	341	2004
Constraint solving via fractional edge covers M Grohe, D Marx ACM Transactions on Algorithms (TALG) 11 (1), 1-20, 2014	325	2014
Parameterized graph separation problems D Marx Theoretical Computer Science 351 (3), 394-406, 2006	322	2006
Parameterized complexity and approximation algorithms D Marx The Computer Journal 51 (1), 60-78, 2008	309	2008
Can you beat treewidth? D Marx 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 169-179, 2007	271	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	263	2016
Tractable hypergraph properties for constraint satisfaction and conjunctive queries D Marx Journal of the ACM (JACM) 60 (6), 1-51, 2013	231	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	186	2011
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	172	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	171	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	166	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	162	2017
Chordal deletion is fixed-parameter tractable D Marx Algorithmica 57 (4), 747-768, 2010	156*	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	152	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	140	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	135	2011
A parameterized view on matroid optimization problems D Marx Theoretical Computer Science 410 (44), 4471-4479, 2009	130	2009

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji