Dániel Marx focuses on Combinatorics, Discrete mathematics, Parameterized complexity, Exponential time hypothesis and Treewidth. While working on this project, Dániel Marx studies both Combinatorics and Constraint satisfaction problem. His research on Discrete mathematics often connects related topics like Bounded function.
His research in Parameterized complexity intersects with topics in Disjoint sets, Function and Graph. His Exponential time hypothesis research includes elements of Linear programming, Homomorphism, Hamiltonian path and Dominating set. He has included themes like Partial k-tree and Tree-depth in his Treewidth study.
His primary scientific interests are in Combinatorics, Discrete mathematics, Parameterized complexity, Treewidth and Exponential time hypothesis. His research investigates the connection with Combinatorics and areas like Bounded function which intersect with concerns in Function. Dániel Marx integrates Discrete mathematics with Constraint satisfaction problem in his study.
The concepts of his Parameterized complexity study are interwoven with issues in Independent set, Approximation algorithm, Directed graph and Open problem. His Treewidth study which covers Partial k-tree that intersects with Clique-sum and Tree-depth. His Exponential time hypothesis study combines topics in areas such as Computable function, Dimension, Exponent and Dominating set.
The scientist’s investigation covers issues in Combinatorics, Parameterized complexity, Exponential time hypothesis, Upper and lower bounds and Treewidth. In Combinatorics, Dániel Marx works on issues like Bounded function, which are connected to Time complexity. His biological study spans a wide range of topics, including Feedback vertex set, Discrete mathematics, Open problem and Approximation algorithm.
His Discrete mathematics study combines topics from a wide range of disciplines, such as Lattice problem and Generator matrix. His Exponential time hypothesis research is multidisciplinary, incorporating elements of Surface and Genus. The various areas that Dániel Marx examines in his Treewidth study include Function, Theoretical computer science and Tree decomposition.
His main research concerns Combinatorics, Parameterized complexity, Exponential time hypothesis, Treewidth and Vertex. The Combinatorics study combines topics in areas such as Current and Upper and lower bounds. His research in Parameterized complexity intersects with topics in Time complexity, Discrete mathematics, Lattice problem and Approximation algorithm.
His Approximation algorithm research is multidisciplinary, incorporating perspectives in Travelling salesman problem and Planar graph. His Exponential time hypothesis research incorporates themes from Bounded function and Independent set. His Vertex research is multidisciplinary, relying on both Tree decomposition, Homomorphism, Computable function, Exponent and Interval graph.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Marek Cygan;Fedor V. Fomin;Lukasz Kowalik;Daniel Lokshtanov.
Lower bounds based on the Exponential Time Hypothesis
Daniel Lokshtanov;Dániel Marx;Saket Saurabh.
Bulletin of The European Association for Theoretical Computer Science (2015)
Parameterized graph separation problems
Theoretical Computer Science (2006)
Parameterized Complexity and Approximation Algorithms
The Computer Journal (2008)
GRAPH COLOURING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING
Periodica Polytechnica Electrical Engineering (2004)
Can You Beat Treewidth
Theory of Computing (2010)
On the Optimality of Planar and Geometric Approximation Schemes
foundations of computer science (2007)
On Problems as Hard as CNF-SAT
Marek Cygan;Holger Dell;Daniel Lokshtanov;Dániel Marx.
ACM Transactions on Algorithms (2016)
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (2013)
Constraint solving via fractional edge covers
Martin Grohe;Dániel Marx.
symposium on discrete algorithms (2006)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: