Mathematical Foundations of Computer Science 2004
From MaRDI portal
Publication:5311126
DOI10.1007/b99679zbMath1096.68068OpenAlexW2488008928MaRDI QIDQ5311126
Publication date: 22 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99679
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization, Exact algorithms and applications for tree-like Weighted Set Cover, Integer programming in parameterized complexity: five miniatures, The parameterized complexity of guarding almost convex polygons, Combinatorial \(n\)-fold integer programming and applications, Integer Programming in Parameterized Complexity: Three Miniatures., Exact algorithms for the Hamiltonian cycle problem in planar graphs, Fixed-parameter tractability and data reduction for multicut in trees, The complexity ecology of parameters: An illustration using bounded max leaf number, Domino sequencing: scheduling with state-based sequence-dependent setup times, Unnamed Item, A fixed-parameter tractability result for multicommodity demand flow in trees
