The SCEAS System
| |||||||

## Search the dblp DataBase
Dániel Marx:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Dániel Marx
**A Parameterized View on Matroid Optimization Problems.**[Citation Graph (0, 0)][DBLP] ACiD, 2006, pp:158- [Conf] - Dániel Marx
**Parameterized Complexity of Constraint Satisfaction Problems.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:139-149 [Conf] - Dániel Marx
**Efficient Approximation Schemes for Geometric Problems?.**[Citation Graph (0, 0)][DBLP] ESA, 2005, pp:448-459 [Conf] - Dániel Marx
**The Closest Substring problem with small distances.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:63-72 [Conf] - Dániel Marx
**A Parameterized View on Matroid Optimization Problems.**[Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:655-666 [Conf] - 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] - Dániel Marx
**Parameterized Graph Separation Problems.**[Citation Graph (0, 0)][DBLP] IWPEC, 2004, pp:71-82 [Conf] - Dániel Marx
**Parameterized Coloring Problems on Chordal Graphs.**[Citation Graph (0, 0)][DBLP] IWPEC, 2004, pp:83-95 [Conf] - Dániel Marx
**Parameterized Complexity of Independence and Domination on Geometric Graphs.**[Citation Graph (0, 0)][DBLP] IWPEC, 2006, pp:154-165 [Conf] - Dániel Marx
**The Complexity of Tree Multicolorings.**[Citation Graph (0, 0)][DBLP] MFCS, 2002, pp:532-542 [Conf] - Martin Grohe, Dániel Marx
**Constraint solving via fractional edge covers.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:289-298 [Conf] - Dániel Marx
**Minimum Sum Multicoloring on the Edges of Trees: (Extended Abstract).**[Citation Graph (0, 0)][DBLP] WAOA, 2003, pp:214-226 [Conf] - 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] - Dániel Marx
**Chordal Deletion Is Fixed-Parameter Tractable.**[Citation Graph (0, 0)][DBLP] WG, 2006, pp:37-48 [Conf] - 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] - 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] - 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] - 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] - 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] - 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] - Dániel Marx
**Parameterized graph separation problems.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:351, n:3, pp:394-406 [Journal] - 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] - 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] - 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] **Completely Inapproximable Monotone and Antimonotone Parameterized Problems.**[Citation Graph (, )][DBLP]**Constraints of Difference and Equality: A Complete Taxonomic Characterisation.**[Citation Graph (, )][DBLP]**07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs.**[Citation Graph (, )][DBLP]**07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs.**[Citation Graph (, )][DBLP]**Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem.**[Citation Graph (, )][DBLP]**Minimizing Movement: Fixed-Parameter Tractability.**[Citation Graph (, )][DBLP]**Can you beat treewidth?**[Citation Graph (, )][DBLP]**On the Optimality of Planar and Geometric Approximation Schemes.**[Citation Graph (, )][DBLP]**Size Bounds and Query Plans for Relational Joins.**[Citation Graph (, )][DBLP]**On the Hardness of Losing Weight.**[Citation Graph (, )][DBLP]**Stable Assignment with Couples: Parameterized Complexity and Local Search.**[Citation Graph (, )][DBLP]**The Complexity of Global Cardinality Constraints.**[Citation Graph (, )][DBLP]**Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems.**[Citation Graph (, )][DBLP]**Approximating fractional hypertree width.**[Citation Graph (, )][DBLP]**Treewidth Reduction for Constrained Separation and Bipartization Problems.**[Citation Graph (, )][DBLP]**Tractable Structures for Constraint Satisfaction with Truth Tables.**[Citation Graph (, )][DBLP]**Enumerating Homomorphisms.**[Citation Graph (, )][DBLP]**Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth.**[Citation Graph (, )][DBLP]**Tractable hypergraph properties for constraint satisfaction and conjunctive queries.**[Citation Graph (, )][DBLP]**Bin Packing with Fixed Number of Bins Revisited.**[Citation Graph (, )][DBLP]**Parameterized Graph Cleaning Problems.**[Citation Graph (, )][DBLP]**Obtaining a Planar Graph by Vertex Deletion.**[Citation Graph (, )][DBLP]**Parameterized Complexity and Approximation Algorithms.**[Citation Graph (, )][DBLP]**Obtaining a Planar Graph by Vertex Deletion**[Citation Graph (, )][DBLP]**Enumerating Homomorphisms**[Citation Graph (, )][DBLP]**Treewidth reduction for constrained separation and bipartization problems**[Citation Graph (, )][DBLP]**Tractable hypergraph properties for constraint satisfaction and conjunctive queries**[Citation Graph (, )][DBLP]**Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth**[Citation Graph (, )][DBLP]**Cleaning Interval Graphs**[Citation Graph (, )][DBLP]**Prize-collecting Network Design on Planar Graphs**[Citation Graph (, )][DBLP]**Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal**[Citation Graph (, )][DBLP]**The complexity of nonrepetitive coloring.**[Citation Graph (, )][DBLP]**Complexity results for minimum sum edge coloring.**[Citation Graph (, )][DBLP]**Parameterized graph cleaning problems.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.007secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |