Dániel Marx

Navedeno

	Vse	Od leta 2018
Navedbe	10684	6172
indeks h	50	35
indeks i10	129	100

1400

700

350

1050

200520062007200820092010201120122013201420152016201720182019202020212022202334 60 82 112 130 189 270 415 486 452 524 700 833 881 987 1166 1196 1307 630

Javni dostop

Prikaži vse

94 člankov

1 članek

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
Daniel LokshtanovProfessor of Computer Science, UCSBPreverjeni e-poštni naslov na ucsb.edu
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiPreverjeni e-poštni naslov na mimuw.edu.pl
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
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
Philip KleinProfessor of Computer Science, Brown UniversityPreverjeni e-poštni naslov na brown.edu
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
Rajesh ChitnisUniversity of BirminghamPreverjeni e-poštni naslov na bham.ac.uk
Stefan KratschProfessor at Humboldt University BerlinPreverjeni e-poštni naslov na informatik.hu-berlin.de
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
Andrei BulatovSimon Fraser UniversityPreverjeni e-poštni naslov na sfu.ca
Radu CurticapeanIT University of CopenhagenPreverjeni e-poštni naslov na itu.dk

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	2376	2015
Lower bounds based on the exponential time hypothesis D Lokshtanov, D Marx, S Saurabh Bulletin of EATCS 3 (105), 2013	363	2013
Size bounds and query plans for relational joins A Atserias, M Grohe, D Marx SIAM Journal on Computing 42 (4), 1737-1767, 2013	304*	2013
Graph colouring problems and their applications in scheduling D Marx Periodica Polytechnica, Electrical Engineering 48 (1-2), 11-16, 2004	298	2004
Parameterized graph separation problems D Marx Theoretical Computer Science 351 (3), 394-406, 2006	287	2006
Constraint solving via fractional edge covers M Grohe, D Marx ACM Transactions on Algorithms (TALG) 11 (1), 1-20, 2014	279	2014
Parameterized complexity and approximation algorithms D Marx The Computer Journal 51 (1), 60-78, 2008	273	2008
Can you beat treewidth? D Marx 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 169-179, 2007	233	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	219	2016
Tractable hypergraph properties for constraint satisfaction and conjunctive queries D Marx Journal of the ACM (JACM) 60 (6), 1-51, 2013	198	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	171	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	151	2011
Chordal deletion is fixed-parameter tractable D Marx Algorithmica 57 (4), 747-768, 2010	144*	2010
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	142*	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	113	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	112	2017
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	111	2013
Kernelization of packing problems H Dell, D Marx Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	107	2012

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