Pages that link to "Item:Q5931443"

The following pages link to Faster exact algorithms for hard problems: A parameterized point of view (Q5931443):

Displayed 19 items.

• Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) ‎ (← links)
• A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) ‎ (← links)
• Moving policies in cyclic assembly line scheduling (Q820155) ‎ (← links)
• Optimal 2-constraint satisfaction via sum-product algorithms (Q844150) ‎ (← links)
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) ‎ (← links)
• An efficient fixed-parameter algorithm for 3-hitting set (Q876698) ‎ (← links)
• An efficient solver for weighted Max-SAT (Q933784) ‎ (← links)
• Identification of function distinguishable languages. (Q1401186) ‎ (← links)
• Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) ‎ (← links)
• Computing the maximum agreement of phylogenetic networks (Q1781993) ‎ (← links)
• A fixed-parameter algorithm for minimum quartet inconsistency (Q1877704) ‎ (← links)
• On the existence of subexponential parameterized algorithms (Q1877709) ‎ (← links)
• Graph separators: A parameterized view (Q1877710) ‎ (← links)
• Computing the similarity of two sequences with nested arc annotations (Q1884953) ‎ (← links)
• Exact Max-SAT solvers for over-constrained problems (Q2506236) ‎ (← links)
• A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) ‎ (← links)
• Parameterized Complexity (Q2841253) ‎ (← links)
• An Empirical Study of MAX-2-SAT Phase Transitions (Q3439118) ‎ (← links)
• Exact Algorithms for MAX-SAT (Q4916231) ‎ (← links)