A polynomial algorithm for the 2-path problem for semicomplete digraphs
SIAM Journal on Discrete Mathematics
NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
Rank aggregation methods for the Web
Proceedings of the 10th international conference on World Wide Web
On Feedback Problems in Diagraphs
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
A Min-Max Theorem on Feedback Vertex Sets
Mathematics of Operations Research
Aggregating inconsistent information: ranking and clustering
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SIAM Journal on Discrete Mathematics
Parameterized algorithms for feedback set problems and their duals in tournaments
Theoretical Computer Science - Parameterized and exact computation
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
Combinatorics, Probability and Computing
Feedback arc set in bipartite tournaments is NP-complete
Information Processing Letters
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Deterministic pivoting algorithms for constrained ranking and clustering problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Feedback arc set problem in bipartite tournaments
Information Processing Letters
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
A more effective linear kernelization for cluster editing
Theoretical Computer Science
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Incompressibility through Colors and IDs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On problems without polynomial kernels
Journal of Computer and System Sciences
Fixed-parameter tractability results for feedback set problems in tournaments
Journal of Discrete Algorithms
A 4k2 kernel for feedback vertex set
ACM Transactions on Algorithms (TALG)
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing
A kernelization algorithm for d-Hitting Set
Journal of Computer and System Sciences
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Identifying and eliminating inconsistencies in mappings across hierarchical ontologies
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments
Theoretical Computer Science
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
Theory of Computing Systems
| Hi-index | 0.00 |
In the k-Feedback Arc/Vertex Set problem we are given a directed graph D and a positive integer k and the objective is to check whether it is possible to delete at most k arcs/vertices from D to make it acyclic. Dom et al.[CIAC, 2006] initiated a study of the Feedback Arc Set problem on bipartite tournaments (k-FASBT) in the realm of parameterized complexity. They showed that k-FASBT can be solved in time O(3.373kn6) on bipartite tournaments having n vertices. However, until now there was no known polynomial sized problem kernel for k-FASBT. In this paper we obtain a cubic vertex kernel for k-FASBT. This completes the kernelization picture for the Feedback Arc/Vertex Set problem on tournaments and bipartite tournaments, as for all other problems polynomial kernels were known before. We obtain our kernel using a non-trivial application of "independent modules" which could be of independent interest.