7 citations · 8 across the 4 of their papers we have counts for
4 papers
Kernels for Feedback Arc Set In Tournaments
Stéphane Bessy, Fedor V. Fomin, Serge Gaspers +4
A tournament T=(V,A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, the Fe…
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
Serge Gaspers, Gregory B. Sorkin
In this paper we introduce "hybrid" Max 2-CSP formulas consisting of "simple clauses", namely conjunctions and disjunctions of pairs of variables, and general 2-variable clauses, w…
Exact Exponential Time Algorithms for Max Internal Spanning Tree
Henning Fernau, Serge Gaspers, Daniel Raible
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our…
Using Combinatorics to Prune Search Trees: Independent and Dominating Set
Fedor V. Fomin, Serge Gaspers, Saket Saurabh +1
This paper has been withdrawn by the author.