scientific article; zbMATH DE number 5605070
From MaRDI portal
Publication:3396567
zbMATH Open1169.68669MaRDI QIDQ3396567FDOQ3396567
Fedor V. Fomin, Dieter Kratsch, Fabrizio Grandoni
Publication date: 19 September 2009
Title of this publication is not available (Why is that?)
Cited In (23)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds
- Finding a dominating set on bipartite graphs
- Exact algorithms for dominating set
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability
- Efficient approximation of Min Set Cover by moderately exponential algorithms
- Computational study on a PTAS for planar dominating set problem
- Exact algorithms for exact satisfiability and number of perfect matchings
- Colorings with few colors: counting, enumeration and combinatorial bounds
- Treewidth computation and extremal combinatorics
- On two techniques of combining branching and treewidth
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Title not available (Why is that?)
- On comparing algorithms for the maximum clique problem
- An exact algorithm for the minimum dominating clique problem
- Exact Algorithms for Edge Domination
- Linear-programming design and analysis of fast algorithms for Max 2-CSP
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
- Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG
- Solving connected dominating set faster than \(2^n\)
- Breaking Anonymity by Learning a Unique Minimum Hitting Set
- Exact algorithms for edge domination
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
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 Q3396567)
