Random approximations in multiobjective programming with an application to portfolio optimization with shortfall constraints. - In: Control and cybernetics, ISSN 0324-8569, Bd. 28 (1999), 4, S. 703-724
On dominating sets and independent sets of graphs. - In: Combinatorics, probability & computing, ISSN 1469-2163, Bd. 8 (1999), 6, S. 547-553
https://doi.org/10.1017/S0963548399004034
A constructive approach to steady nonlinear kinetic equations. - In: Journal of computational and applied mathematics, ISSN 1879-1778, Bd. 89 (1998), 2, S. 199-211
https://doi.org/10.1016/S0377-0427(97)00226-4
An algorithm for counting spanning trees in labeled molecular graphs homeomorphic to cata-condensed systems. - In: Journal of chemical information and modeling, ISSN 1549-960X, Bd. 38 (1998), 2, S. 108-112
Abstract published in Advance ACS Abstracts, December 15, 1997
https://doi.org/10.1021/ci970425d
Kekulé count in toroidal hexagonal carbon cages. - In: Croatica chemica acta, ISSN 0011-1643, Bd. 71 (1998), 3, S. 435-447
Mathematical modelling of a first order sigma-delta modulator. - In: Journal of difference equations and applications, ISSN 1563-5120, Bd. 4 (1998), 6, S. 533-550
In this paper an exact model for a basic, first order sigma-delta-modulator is derived by means of a difference equation with discontinuous nonlinearity. An explicit solution is given in terms of the greatest integer function under certain boundedness and initial conditions of the input signal. Assumptions are made under which the explicit formula remains a solution of the difference equation although the suppositions of the main theorem are violated.
http://dx.doi.org/10.1080/10236199808808161
On uniquely partitionable planar graphs. - In: Discrete mathematics, Bd. 191 (1998), 1/3, S. 149-158
http://dx.doi.org/10.1016/S0012-365X(98)00102-2
Complexity of choosing subsets from color sets. - In: Discrete mathematics, Bd. 191 (1998), 1/3, S. 139-148
http://dx.doi.org/10.1016/S0012-365X(98)00101-0
Colour-critical graphs with few edges. - In: Discrete mathematics, Bd. 191 (1998), 1/3, S. 125-137
http://dx.doi.org/10.1016/S0012-365X(98)00100-9
Subgraphs with restricted degrees of their vertices in planar graphs. - In: Discrete mathematics, Bd. 191 (1998), 1/3, S. 83-90
https://doi.org/10.1016/S0012-365X(98)00095-8