Add to ORKGGiven a tournament with an acyclic tournament as a feedback arc set we give necessary and sufficient conditions for this feedback arc set to have minimum size
AbstractA minimum reversing set of a diagraph is a smallest sized set of arcs which when reversed ma...
This thesis fulfills the need for a system of optimal ranking of sports teams. The current ranking ...
A bipartite tournament is a directed graph T:=(A cup B, E) such that every pair of vertices (a,b), a...
Given a tournament with an acyclic tournament as a feedback arc set we give necessary and sufficient...
Given an acyclic digraph D, we seek a smallest sized tournament T that has D as a minimum feedback a...
In this series of two papers we examine the classical problem of ranking a set of players on the bas...
International audienceAnswering a question of Bang-Jensen and Thomassen, we prove that the minimum f...
AbstractA tournament T=(V,A) is a directed graph in which there is exactly one arc between every pai...
A tournament T = (V,A) is a directed graph in which there is exactly one arc between every pair of d...
A tournament T = (V,A) is a directed graph in which there is exactly one arc between every pair of d...
In the paper, we define a new parameter for tournaments called degreewidth which can be seen as a me...
A tournament is a directed graph in which there is a single arc between every pair of distinct verti...
AbstractIn this paper, we deal with the following problem: given a weighted tournament T, determine ...
AbstractThe parameterized feedback vertex (arc) set problem is to find whether there are k vertices ...
A tournament is a directed graph in which there is a single arc between every pair of distinct verti...
AbstractA minimum reversing set of a diagraph is a smallest sized set of arcs which when reversed ma...
This thesis fulfills the need for a system of optimal ranking of sports teams. The current ranking ...
A bipartite tournament is a directed graph T:=(A cup B, E) such that every pair of vertices (a,b), a...
Given a tournament with an acyclic tournament as a feedback arc set we give necessary and sufficient...
Given an acyclic digraph D, we seek a smallest sized tournament T that has D as a minimum feedback a...
In this series of two papers we examine the classical problem of ranking a set of players on the bas...
International audienceAnswering a question of Bang-Jensen and Thomassen, we prove that the minimum f...
AbstractA tournament T=(V,A) is a directed graph in which there is exactly one arc between every pai...
A tournament T = (V,A) is a directed graph in which there is exactly one arc between every pair of d...
A tournament T = (V,A) is a directed graph in which there is exactly one arc between every pair of d...
In the paper, we define a new parameter for tournaments called degreewidth which can be seen as a me...
A tournament is a directed graph in which there is a single arc between every pair of distinct verti...
AbstractIn this paper, we deal with the following problem: given a weighted tournament T, determine ...
AbstractThe parameterized feedback vertex (arc) set problem is to find whether there are k vertices ...
A tournament is a directed graph in which there is a single arc between every pair of distinct verti...
AbstractA minimum reversing set of a diagraph is a smallest sized set of arcs which when reversed ma...
This thesis fulfills the need for a system of optimal ranking of sports teams. The current ranking ...
A bipartite tournament is a directed graph T:=(A cup B, E) such that every pair of vertices (a,b), a...