scientific article; zbMATH DE number 5725105

zbMATH Open1230.68035MaRDI QIDQ3570028FDOQ3570028

Authors:

Publication date: 23 June 2010

Title of this publication is not available (Why is that?)

Recommendations

• Special issue: Selected papers from the 1st algorithms and complexity in Durham workshop (ACiD 2005), Durham, UK, July 8--10, 2005.
• Algorithms and complexity in Durham 2007. Proceedings of the third ACiD workshop, Durham, UK, September 17--19, 2007
• Algorithms and complexity in Durham 2006. Proceedings of the second ACiD workshop, Durham, UK, September 18--20, 2006.
• Special issue: Selected papers from the 2nd algorithms and complexity in Durham workshop (ACiD 2006), Durham, UK, September 18--20, 2006.
• Part special issue: Selected papers from the 3rd algorithms and complexity Durham Workshop, ACiD 2007, Durham, UK, September 17--19, 2007.
• Part special issue: Selected papers based on the presentations at the 4th workshop ``Algorithms and complexity in Durham (ACID'10), Durham, UK, September 20--22, 2010.
• Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28--30, 2003. Proceedings
• Algorithms and complexity. 7th international conference, CIAC 2010, Rome, Italy, May 26--28, 2010. Proceedings
• scientific article; zbMATH DE number 5719137
• scientific article; zbMATH DE number 5729452

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) General topics in the theory of algorithms (68W01)

Cited In (11)

• Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs
• Kernelization: new upper and lower bound techniques
• A generalization of Nemhauser and Trotter's local optimization theorem
• Algorithms and complexity in Durham 2006. Proceedings of the second ACiD workshop, Durham, UK, September 18--20, 2006.
• Algorithms and complexity in Durham 2007. Proceedings of the third ACiD workshop, Durham, UK, September 17--19, 2007
• Data reductions and combinatorial bounds for improved approximation algorithms
• A Parameterized Perspective on Packing Paths of Length Two
• The minimum spanning strong subdigraph problem is fixed parameter tractable
• The parameterised complexity of computing the maximum modularity of a graph
• Title not available (Why is that?)
• Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3570028)