1![Student Papers on Marx and Fitzgerald: English 496 Dr. Morillo April 2013 Daniel Choi Student Papers on Marx and Fitzgerald: English 496 Dr. Morillo April 2013 Daniel Choi](https://www.pdfsearch.io/img/9b86011e2f28715fdb0568c898d32aa3.jpg) | Add to Reading ListSource URL: www4.ncsu.eduLanguage: English - Date: 2013-04-22 12:21:12
|
---|
2![Some open problems in parameterized complexity Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary Some open problems in parameterized complexity Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary](https://www.pdfsearch.io/img/f2e9e8af1e9e7c62a46e3a3d84537c95.jpg) | Add to Reading ListSource URL: www.cs.bme.huLanguage: English - Date: 2017-01-23 13:47:57
|
---|
3![The Optimality Program in Parameterized Algorithms Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary The Optimality Program in Parameterized Algorithms Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary](https://www.pdfsearch.io/img/d8e16758c67f65fb81538f275d0d5b0f.jpg) | Add to Reading ListSource URL: www.cs.bme.huLanguage: English - Date: 2016-10-19 09:24:37
|
---|
4![The Square Root Phenomenon in Planar Graphs Survey and New Results Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) The Square Root Phenomenon in Planar Graphs Survey and New Results Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)](https://www.pdfsearch.io/img/b31849366f1936ebbb22865e146218b7.jpg) | Add to Reading ListSource URL: www.cs.bme.huLanguage: English - Date: 2016-06-02 14:02:15
|
---|
5![Subexponential parameterized algorithms on planar graphs via low-treewidth pattern covering Dániel Marx (joint work with Fedor Fomin, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh) Subexponential parameterized algorithms on planar graphs via low-treewidth pattern covering Dániel Marx (joint work with Fedor Fomin, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh)](https://www.pdfsearch.io/img/acef95240e1f162fac8ae323ddc9b26f.jpg) | Add to Reading ListSource URL: www.cs.bme.huLanguage: English - Date: 2017-01-26 07:17:03
|
---|
6![The Square Root Phenomenon in Planar Graphs Survey and New Results Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) The Square Root Phenomenon in Planar Graphs Survey and New Results Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)](https://www.pdfsearch.io/img/9980b17acbd5f8a8e202589cf09df69e.jpg) | Add to Reading ListSource URL: www.cs.bme.huLanguage: English - Date: 2015-11-06 12:09:41
|
---|
7![Rooted grid minors Daniel Marx Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI) Paul Seymour1 Princeton University, Princeton, NJ 08544 Rooted grid minors Daniel Marx Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI) Paul Seymour1 Princeton University, Princeton, NJ 08544](https://www.pdfsearch.io/img/3f247468c2f9704dcd092d2f68c41468.jpg) | Add to Reading ListSource URL: www.cs.bme.huLanguage: English - Date: 2017-03-08 07:44:53
|
---|
8![The Optimality Program in Parameterized Algorithms Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary The Optimality Program in Parameterized Algorithms Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary](https://www.pdfsearch.io/img/d5ec9b510fd658a9f7886e1b7a91305a.jpg) | Add to Reading ListSource URL: www.cs.bme.huLanguage: English - Date: 2016-06-05 14:51:00
|
---|
9![Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal Dániel Marx Humboldt-Universität zu Berlin Joint work with Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal Dániel Marx Humboldt-Universität zu Berlin Joint work with](https://www.pdfsearch.io/img/296ed3d69d2754fea44ccef4fad78150.jpg) | Add to Reading ListSource URL: www.cs.bme.huLanguage: English - Date: 2011-01-27 08:28:24
|
---|