Expected computation time for Hamiltonian path problem
SIAM Journal on Computing
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Improved upper bounds for 3-SAT
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
The method of extremal structure on the k-maximum cut problem
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Measure and conquer: a simple O(20.288n) independent set algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
A new algorithm for optimal 2-constraint satisfaction and its implications
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Parameterized algorithms for feedback set problems and their duals in tournaments
Theoretical Computer Science - Parameterized and exact computation
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
Theory of Computing Systems
Improved exact exponential algorithms for vertex bipartization and other problems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Bounding the number of minimal dominating sets: a measure and conquer approach
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Exact algorithms for exact satisfiability and number of perfect matchings
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Algorithms based on the treewidth of sparse graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Enumerating maximal independent sets with applications to graph colouring
Operations Research Letters
Parameterized Complexity
Fixed-Parameter Algorithms for Kemeny Scores
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Fixed-parameter algorithms for Kemeny rankings
Theoretical Computer Science
Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.89 |
We give improved parameterized algorithms for two ''edge'' problems MAXCUT and MAXDAG, where the solution sought is a subset of edges. MAXCUT of a graph is a maximum set of edges forming a bipartite subgraph of the given graph. On the other hand, MAXDAG of a directed graph is a set of arcs of maximum size such that the graph induced on these arcs is acyclic. Our algorithms are obtained through new kernelization and efficient exact algorithms for the optimization versions of the problems. More precisely our results include:(i)a kernel with at most @ak vertices and @bk edges for MAXCUT. Here 0