| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Dániel Marx, Ildikó Schlotter |
Obtaining a Planar Graph by Vertex Deletion.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Krokhin, Dániel Marx |
On the hardness of losing weight. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx |
Enumerating homomorphisms. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Dell, Dániel Marx |
Kernelization of packing problems. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx |
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Dániel Marx, Peter Rossmanith (eds.) |
Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers |
IPEC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Naonori Kakimura, Ken-ichi Kawarabayashi, Dániel Marx |
Packing cycles through prescribed vertices. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Ildikó Schlotter |
Stable assignment with couples: Parameterized complexity and local search. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Complexity of clique coloring and related problems. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote |
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Dániel Marx |
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth. |
J. ACM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx |
Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Dániel Marx, Barry O'Sullivan, Igor Razgon |
Finding small separators in linear time via treewidth reduction |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, Dániel Marx |
Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström |
On Problems as Hard as CNFSAT |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx, Saket Saurabh |
Lower bounds based on the Exponential Time Hypothesis. |
Bulletin of the EATCS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Dániel Marx |
Sparse Balanced Partitions and the Complexity of Subgraph Problems. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon |
Soft Constraints of Difference and Equality. |
J. Artif. Intell. Res. (JAIR) |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Tractable Structures for Constraint Satisfaction with Truth Tables. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Important Separators and Parameterized Algorithms. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter |
Parameterized Complexity of Eulerian Deletion Problems. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx, Saket Saurabh |
Slightly Superexponential Parameterized Problems. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx |
Prize-collecting Steiner Problems on Planar Graphs. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx, Saket Saurabh |
Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Dániel Marx |
Constraint Satisfaction Parameterized by Solution Size. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx |
Clustering with Local Restrictions. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Steffen Kunz, Benjamin Fabian, Daniel Marx, Sebastian Müller |
Engineering Policies for Secure Interorganizational Information Flow. |
EDOCW |
2011 |
DBLP DOI BibTeX RDF |
Interorganizational Processes, RBAC, Access Control Policies |
| 1 | Dániel Marx, Igor Razgon |
Fixed-parameter tractability of multicut parameterized by the size of the cutset. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan |
Finding topological subgraphs is fixed-parameter tractable. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Cohen, Martin C. Cooper, Martin J. Green, Dániel Marx |
On Guaranteeing Polynomially Bounded Search Tree Size. |
CP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Ildikó Schlotter |
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Chordal Deletion is Fixed-Parameter Tractable. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Can You Beat Treewidth? |
Theory of Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Approximating fractional hypertree width. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Dániel Marx |
Constraint satisfaction problems and global cardinality constraints. |
Commun. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx, Saket Saurabh |
Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Dániel Marx, Igor Razgon |
Fixed-parameter tractability of multicut parameterized by the size of the cutset |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Dániel Marx |
The complexity of global cardinality constraints |
Logical Methods in Computer Science |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan |
Finding topological subgraphs is fixed-parameter tractable |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Dániel Marx, Ildikó Schlotter |
Cleaning Interval Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx |
Prize-collecting Network Design on Planar Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx |
Computing Geometric Minimum-Dilation Graphs is NP-Hard. |
Int. J. Comput. Geometry Appl. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Ildikó Schlotter |
Parameterized Complexity of the Arc-Preserving Subsequence Problem. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kratsch, Dániel Marx, Magnus Wahlström |
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Barry O'Sullivan, Igor Razgon |
Treewidth Reduction for Constrained Separation and Bipartization Problems. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter |
Bin Packing with Fixed Number of Bins Revisited. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Completely Inapproximable Monotone and Antimonotone Parameterized Problems. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
parameterized comlexity, approximation, fixed-parameter tractability, inapproximability |
| 1 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx |
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
Steiner forest, bounded-genus graphs, bounded-treewidth graphs, planar graphs, PTAS, series-parallel graphs |
| 1 | Dániel Marx |
Tractable hypergraph properties for constraint satisfaction and conjunctive queries. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
submodular width, constraint satisfaction, conjunctive queries, fixed-parameter tractability |
| 1 | Martin Grohe, Dániel Marx |
On tree width, bramble size, and expansion. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Igor Razgon |
Constant ratio fixed-parameter approximation of the edge multicut problem. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
A parameterized view on matroid optimization problems. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Tractable hypergraph properties for constraint satisfaction and conjunctive queries |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx |
Enumerating Homomorphisms |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx |
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Dániel Marx, Barry O'Sullivan, Igor Razgon |
Treewidth reduction for constrained separation and bipartization problems |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Dániel Marx, Marcus Schaefer |
The complexity of nonrepetitive coloring. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Complexity results for minimum sum edge coloring. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Ildikó Schlotter |
Parameterized graph cleaning problems. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Igor Razgon |
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx |
Minimizing Movement: Fixed-Parameter Tractability. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Approximating fractional hypertree width. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramzi Rizk, Daniel Marx, Matthias Schrepfer, Janina Zimmerman, Oliver Günther |
Media Coverage of Online Social Network Privacy Issues in Germany: A Thematic Analysis. |
AMCIS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Dániel Marx, Ildikó Schlotter |
Stable Assignment with Couples: Parameterized Complexity and Local Search. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Tractable Structures for Constraint Satisfaction with Truth Tables. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx |
Enumerating Homomorphisms. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Dániel Marx |
The Complexity of Global Cardinality Constraints. |
LICS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon |
Constraints of Difference and Equality: A Complete Taxonomic Characterisation. |
CP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Searching the k-change neighborhood for TSP is W[1]-hard. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Complexity of unique list colorability. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Parameterized Complexity and Approximation Algorithms. |
Comput. J. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Ildikó Schlotter |
Obtaining a Planar Graph by Vertex Deletion |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Dániel Marx |
Closest Substring Problems with Small Distances. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Ildikó Schlotter |
Parameterized Graph Cleaning Problems. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Krokhin, Dániel Marx |
On the Hardness of Losing Weight. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Martin Grohe, Dániel Marx |
Size Bounds and Query Plans for Relational Joins. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Ildikó Schlotter |
Obtaining a Planar Graph by Vertex Deletion. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Gregory Gutin, Dániel Marx, Ulrike Stege |
07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs |
2007 |
DBLP BibTeX RDF |
|
| 1 | Erik D. Demaine, Gregory Gutin, Dániel Marx, Ulrike Stege (eds.) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007 |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs |
2007 |
DBLP BibTeX RDF |
|
| 1 | Erik D. Demaine, Gregory Gutin, Dániel Marx, Ulrike Stege |
07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs |
2007 |
DBLP BibTeX RDF |
|
| 1 | Dániel Marx |
Can you beat treewidth? |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
On the Optimality of Planar and Geometric Approximation Schemes. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Parameterized graph separation problems. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Parameterized coloring problems on chordal graphs. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Minimum sum multicoloring on the edges of trees. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
The complexity of chromatic strength and chromatic edge strength. |
Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
| 1 | Dániel Marx |
Precoloring extension on unit interval graphs. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Chordal Deletion Is Fixed-Parameter Tractable. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Dániel Marx |
Constraint solving via fractional edge covers. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
A Parameterized View on Matroid Optimization Problems. |
ACiD |
2006 |
DBLP BibTeX RDF |
|
| 1 | Dániel Marx |
A Parameterized View on Matroid Optimization Problems. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Parameterized Complexity of Independence and Domination on Geometric Graphs. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
A short proof of the NP-completeness of minimum sum interval coloring. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Parameterized complexity of constraint satisfaction problems. |
Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q25, 68Q17 |
| 1 | Dániel Marx |
NP-completeness of list coloring and precoloring extension on the edges of planar graphs. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Efficient Approximation Schemes for Geometric Problems?. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
The Closest Substring problem with small distances. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
List edge multicoloring in graphs with few cycles. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Eulerian disjoint paths problem in grid graphs is NP-complete. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Parameterized Coloring Problems on Chordal Graphs. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")