Add to ORKGWe consider several important problems for which no polynomially time bounded algorithm is known. These problems are shown to be related in that a polynomial algorithm for one implies a polynomial algorrithm for the others
AbstractStudying the precise nature of the complexity of games enables gamesters to attain a deeper ...
International audienceWe apply systematically a framework to settle the NP-hardness of some properti...
A recent seminal result of Räcke is that for any network there is an oblivious routing algorithm wit...
The most efficient algorithms for several network problems like minimum cost flow and the maximum w...
We introduce a general integer programming formulation for a class of combinatorial op-timization ga...
AbstractWe prove NP-hardness of six families of naturally defined, interesting board games. Some of ...
AbstractWe present a number of two-person games, based on simple combinatorial ideas, for which the ...
The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the...
Abstract: The fact that polynomial time algorithm is very unlikely to be devised for an optimal solv...
We study the impact of combinatorial structure in congestion games on the complexity of computing pu...
Network congestion games with player-specific delay functions do not possess pure Nash equilibria in...
AbstractThe time bounds of various algorithms for finding the maximal flow in networks are shown to ...
The word algorithm is the magical word in the field of computer science because the imagination of t...
A recent seminal result of Räcke is that for any network there is an oblivious routing algorithm wit...
The algebraic path problem is a generalization of the shortest path problem in graphs. Various insta...
AbstractStudying the precise nature of the complexity of games enables gamesters to attain a deeper ...
International audienceWe apply systematically a framework to settle the NP-hardness of some properti...
A recent seminal result of Räcke is that for any network there is an oblivious routing algorithm wit...
The most efficient algorithms for several network problems like minimum cost flow and the maximum w...
We introduce a general integer programming formulation for a class of combinatorial op-timization ga...
AbstractWe prove NP-hardness of six families of naturally defined, interesting board games. Some of ...
AbstractWe present a number of two-person games, based on simple combinatorial ideas, for which the ...
The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the...
Abstract: The fact that polynomial time algorithm is very unlikely to be devised for an optimal solv...
We study the impact of combinatorial structure in congestion games on the complexity of computing pu...
Network congestion games with player-specific delay functions do not possess pure Nash equilibria in...
AbstractThe time bounds of various algorithms for finding the maximal flow in networks are shown to ...
The word algorithm is the magical word in the field of computer science because the imagination of t...
A recent seminal result of Räcke is that for any network there is an oblivious routing algorithm wit...
The algebraic path problem is a generalization of the shortest path problem in graphs. Various insta...
AbstractStudying the precise nature of the complexity of games enables gamesters to attain a deeper ...
International audienceWe apply systematically a framework to settle the NP-hardness of some properti...
A recent seminal result of Räcke is that for any network there is an oblivious routing algorithm wit...