The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dániel Marx: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dániel Marx
    A Parameterized View on Matroid Optimization Problems. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:158- [Conf]
  2. Dániel Marx
    Parameterized Complexity of Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:139-149 [Conf]
  3. Dániel Marx
    Efficient Approximation Schemes for Geometric Problems?. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:448-459 [Conf]
  4. Dániel Marx
    The Closest Substring problem with small distances. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:63-72 [Conf]
  5. Dániel Marx
    A Parameterized View on Matroid Optimization Problems. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:655-666 [Conf]
  6. Tibor Cinkler, Dániel Marx, Claus Popp Larsen, Dániel Fogaras
    Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:1000-1009 [Conf]
  7. Dániel Marx
    Parameterized Graph Separation Problems. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:71-82 [Conf]
  8. Dániel Marx
    Parameterized Coloring Problems on Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:83-95 [Conf]
  9. Dániel Marx
    Parameterized Complexity of Independence and Domination on Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:154-165 [Conf]
  10. Dániel Marx
    The Complexity of Tree Multicolorings. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:532-542 [Conf]
  11. Martin Grohe, Dániel Marx
    Constraint solving via fractional edge covers. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:289-298 [Conf]
  12. Dániel Marx
    Minimum Sum Multicoloring on the Edges of Trees: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:214-226 [Conf]
  13. Dániel Marx
    Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:9-22 [Conf]
  14. Dániel Marx
    Chordal Deletion Is Fixed-Parameter Tractable. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:37-48 [Conf]
  15. Dániel Marx
    Parameterized complexity of constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:2, pp:153-183 [Journal]
  16. Dániel Marx
    The complexity of chromatic strength and chromatic edge strength. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:14, n:4, pp:308-340 [Journal]
  17. Dániel Marx
    Eulerian disjoint paths problem in grid graphs is NP-complete. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:336-341 [Journal]
  18. Dániel Marx
    Precoloring extension on unit interval graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:6, pp:995-1002 [Journal]
  19. Dániel Marx
    List edge multicoloring in graphs with few cycles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:2, pp:85-90 [Journal]
  20. Dániel Marx
    A short proof of the NP-completeness of minimum sum interval coloring. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:4, pp:382-384 [Journal]
  21. Dániel Marx
    Parameterized graph separation problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:3, pp:394-406 [Journal]
  22. Dániel Marx
    Parameterized coloring problems on chordal graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:3, pp:407-424 [Journal]
  23. Dániel Marx
    Minimum sum multicoloring on the edges of trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:133-149 [Journal]
  24. Dániel Marx
    NP-completeness of list coloring and precoloring extension on the edges of planar graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:4, pp:313-324 [Journal]

  25. Completely Inapproximable Monotone and Antimonotone Parameterized Problems. [Citation Graph (, )][DBLP]


  26. Constraints of Difference and Equality: A Complete Taxonomic Characterisation. [Citation Graph (, )][DBLP]


  27. 07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. [Citation Graph (, )][DBLP]


  28. 07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. [Citation Graph (, )][DBLP]


  29. Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem. [Citation Graph (, )][DBLP]


  30. Minimizing Movement: Fixed-Parameter Tractability. [Citation Graph (, )][DBLP]


  31. Can you beat treewidth? [Citation Graph (, )][DBLP]


  32. On the Optimality of Planar and Geometric Approximation Schemes. [Citation Graph (, )][DBLP]


  33. Size Bounds and Query Plans for Relational Joins. [Citation Graph (, )][DBLP]


  34. On the Hardness of Losing Weight. [Citation Graph (, )][DBLP]


  35. Stable Assignment with Couples: Parameterized Complexity and Local Search. [Citation Graph (, )][DBLP]


  36. The Complexity of Global Cardinality Constraints. [Citation Graph (, )][DBLP]


  37. Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. [Citation Graph (, )][DBLP]


  38. Approximating fractional hypertree width. [Citation Graph (, )][DBLP]


  39. Treewidth Reduction for Constrained Separation and Bipartization Problems. [Citation Graph (, )][DBLP]


  40. Tractable Structures for Constraint Satisfaction with Truth Tables. [Citation Graph (, )][DBLP]


  41. Enumerating Homomorphisms. [Citation Graph (, )][DBLP]


  42. Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. [Citation Graph (, )][DBLP]


  43. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. [Citation Graph (, )][DBLP]


  44. Bin Packing with Fixed Number of Bins Revisited. [Citation Graph (, )][DBLP]


  45. Parameterized Graph Cleaning Problems. [Citation Graph (, )][DBLP]


  46. Obtaining a Planar Graph by Vertex Deletion. [Citation Graph (, )][DBLP]


  47. Parameterized Complexity and Approximation Algorithms. [Citation Graph (, )][DBLP]


  48. Obtaining a Planar Graph by Vertex Deletion [Citation Graph (, )][DBLP]


  49. Enumerating Homomorphisms [Citation Graph (, )][DBLP]


  50. Treewidth reduction for constrained separation and bipartization problems [Citation Graph (, )][DBLP]


  51. Tractable hypergraph properties for constraint satisfaction and conjunctive queries [Citation Graph (, )][DBLP]


  52. Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth [Citation Graph (, )][DBLP]


  53. Cleaning Interval Graphs [Citation Graph (, )][DBLP]


  54. Prize-collecting Network Design on Planar Graphs [Citation Graph (, )][DBLP]


  55. Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal [Citation Graph (, )][DBLP]


  56. The complexity of nonrepetitive coloring. [Citation Graph (, )][DBLP]


  57. Complexity results for minimum sum edge coloring. [Citation Graph (, )][DBLP]


  58. Parameterized graph cleaning problems. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002