Flow network simplification can reduce the size of the flow network and hence the amount of
computation performed by flow algorithms. We present the first linear time algorithm for the …

Let $\mathcal{O} = \{O_1, \ldots, O_m\}$ be a set of m convex polygons in ℝ 2 with a total of
n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (…

Background. Running tourism began to develop along with a growing popularity of running
as a form of recreation. The aim of this study was to define the concept of running tourism …

In this paper, we present a theoretical study of several geometric shape approximation
problems, called shape rectangularization (SR), which arise in intensity-modulated radiation …

We present new algorithms for two problems on interval structures that arise in computer-aided
manufacturing and in other areas. We give an O ( K n ) time algorithm for the single-…

We present a theoretical study of a problem related to optimal free-form surface partitioning,
which arises in surface machining in manufacturing. In particular, we consider partitioning a …

Computing flows in a network is a fundamental graph theory problem with numerous
applications. In this paper, we present two algorithms for simplifying a flow network G=(V,E), ie, …

[b]Wstęp[/b]. W listopadzie 2007 r. kierownictwo Młodzieżowego Centrum Sportu we
Wrocławiu zwróciło się do dra Adama Haleczki i dra Ryszarda Jezierskiego, emerytowanych …

Introduction. This paper constitutes a continuation of research on score equalization in the
bench press, and of the studies on athletes with disabilities conducted several years ago. In …

[b]Cel.[/b] Mając na względzie skuteczność doboru dzieci do szkolenia sportowego za cel
pracy przyjęto poszukiwanie prób motorycznych łączących elementy sprawności umysłowej …