For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
This paper deals with the problem of finding upper bounds on the number of periodic solutions of a class of one-dimensional non-autonomous differential equations: those with the r...
This paper studies the security against differential/linear cryptanalysis and the pseudorandomness for a class of generalized Feistel scheme with SP round function called GFSP. We ...
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...