Daniel Marx - PDFSEARCH.IO - Document Search Engine

Daniel Marx
Results: 86

#	Item
1	Student Papers on Marx and Fitzgerald: English 496 Dr. Morillo April 2013 Daniel Choi Add to Reading List Source URL: www4.ncsu.edu Language: 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 Add to Reading List Source URL: www.cs.bme.hu Language: 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 Add to Reading List Source URL: www.cs.bme.hu Language: 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) Add to Reading List Source URL: www.cs.bme.hu Language: 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) Add to Reading List Source URL: www.cs.bme.hu Language: 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) Add to Reading List Source URL: www.cs.bme.hu Language: 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 Add to Reading List Source URL: www.cs.bme.hu Language: 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 Add to Reading List Source URL: www.cs.bme.hu Language: 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 Add to Reading List Source URL: www.cs.bme.hu Language: English - Date: 2011-01-27 08:28:24