Dániel Marx - ODT Personal data sheet


	Login Forum Organisation officers member institutions resolutions (in Hung.) by-laws (in Hung.) regulations Doctoral program doctoral schools by institution by research field by number ceased working academic staff member by name by research topic archives thesis topic proposals by doctoral school by research field by research topic supervision of PhD students search students Theses defended by institution by research field by name by date by doctoral school Naturalized degrees by institution by research field by name by date Habilitation presentations by institution by branch of science by name Documents (all in Hung.) public documents news legal backgrounds guidelines Contacts contact details partners

Personal data sheet

Print preview

VALIDITY EXPIRED
personal data approved: 2014. III. 25.

Personal data

name	Dániel Marx
name of institution	Budapest University of Technology and Economics
doctoral school	BME Doctoral School of Mathematics and Computer Sciences (Academic staff member Az oktató a doktori iskola doktoranduszai számára oktat tantárgyat, és/vagy a doktori iskola megszavazta, hogy doktoranduszok számára kutatási témát írjon ki. )
the share of work in the different doctoral schools.	BME Doctoral School of Mathematics and Computer Sciences 100%

Contact details
E-mail address	dmarxcs.bme.hu
phone number	+36 1 291-6167
	own web page

Academic title
scientific degree, title	Ph.D.
year degree was obtained	2005
discipline to which degree belongs	computer sciences
institution granting the degree	Budapesti Műszaki és Gazdaságtudományi Egyetem (to be translated)

Employment
2012 -	MTA Számítástechnikai és Automatizálási Kutatóintézet (research institute, not university) other (not specified) (tudományos főmunkatárs)

Thesis topic supervisor

number of doctoral students supervised until now

number of students who fulfilled course requirements

students who obtained their degrees:

Ildikó Schlotter

PhD

2010

DSI-BME

Thesis topic proposals

Research
research area	Theory of algorithms and computational complexity. Graph algorithms. Constraint Satisfaction Problems (CSP). Parameterized complexity.
research field in which current research is conducted	mathematics and computing

Publications

2013

Atserias A, Grohe M, Marx D: Size bounds and query plans for relational joins, SIAM JOURNAL ON COMPUTING 42: (4) pp. 1737-1767.
type of document: Journal paper/Article
impact factor: 0.803*
language: English
DOI

2013

Chitnis R, Hajiaghayi M, Marx D: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset, SIAM JOURNAL ON COMPUTING 42: (4) pp. 1674-1696.
type of document: Journal paper/Article
impact factor: 0.803*
language: English
DOI

2013

Marx D: Tractable hypergraph properties for constraint satisfaction and conjunctive queries, JOURNAL OF THE ACM 60: (6) pp. 1-51. Paper 42.
type of document: Journal paper/Article
impact factor: 2.370*
language: English
DOI

2013

Cygan M, Marx D, Pilipczuk M, Pilipczuk M: The planar directed k -Vertex-Disjoint Paths problem is fixed-parameter tractable, In: Reingold O (szerk.) 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS). Los Alamitos: IEEE, 2013. pp. 197-206.
type of document: Part of book/Proceedings Paper
language: English
DOI

2012

Grohe M, Marx D: Structure theorem and isomorphism test for graphs with excluded topological subgraphs, In: Karloff Howard J, Pitassi Toniann (szerk.) 44th Annual ACM Symposium on Theory of Computing, STOC '12. New York: ACM Press, 2012. pp. 173-192.
type of document: Part of book/Proceedings Paper
language: English
DOI

2011

Grohe M, Kawarabayashi K-I, Marx D, Wollan P: Finding topological subgraphs is fixed-parameter tractable, In: Vadhan S (szerk.) 43rd ACM Symposium on Theory of Computing, STOC'11. New York: ACM Press, 2011. pp. 479-488.
type of document: Part of book/Proceedings Paper
language: English
DOI

2011

Marx D, Razgon I: Fixed-parameter tractability of multicut parameterized by the size of the cutset, In: Vadhan S (szerk.) 43rd ACM Symposium on Theory of Computing, STOC'11. New York: ACM Press, 2011. pp. 469-478.
type of document: Part of book/Proceedings Paper
language: English
DOI

2011

Bateni M, Hajiaghayi M, Marx D: Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth, JOURNAL OF THE ACM 58: (5) 37 p. Paper 21.
type of document: Journal paper/Article
impact factor: 2.353
language: English
DOI

2010

Bulatov AA, Marx D: Constraint satisfaction problems and global cardinality constraints, COMMUNICATIONS OF THE ACM 53: (9) pp. 99-106.
type of document: Journal paper/Article
impact factor: 2.353
language: English
DOI

2008

Marx D: Closest substring problems with small distances, SIAM JOURNAL ON COMPUTING 38: (4) pp. 1382-1410.
type of document: Journal paper/Article
impact factor: 1.459
language: English
DOI

Number of independent citations to these publications:

Scientometric data

list of publications and citations

number of scientific publications that meet accreditation criteria:

120

number of scientific publications:

121

monographs and professional books:

monographs/books in which chapters/sections were contributed:

number of independent citations to scientific publications and creative works:

697

2024. IV. 17.
ODT ülés
Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).