Utilitas Algorithmica (UA)
ISSN: xxxx-xxxx (print)
Utilitas Algorithmica (UA) is a premier, open-access international journal dedicated to advancing algorithmic research and its applications. Launched to drive innovation in computer science, UA publishes high-impact theoretical and experimental papers addressing real-world computational challenges. The journal underscores the vital role of efficient algorithm design in navigating the growing complexity of modern applications. Spanning domains such as parallel computing, computational geometry, artificial intelligence, and data structures, UA is a leading venue for groundbreaking algorithmic studies.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 023
- Pages: 21-31
- Published: 28/02/1997
Much of chordal graph theory and its applications is based on chordal graphs being the intersection graphs of subtrees of trees. This suggests also looking at intersection graphs of subgraphs of chordal graphs, and so on, with appropriate conditions imposed on the subgraphs.This paper investigates such a hierarchy of generalizations of “chordal-type” graphs, emphasizing the so-called “ekachordal graphs” — those next in line beyond chordal graphs. Parts of the theory of chordal graphs do carry over to chordal-type graphs, including a recursive, elimination characterization for ekachordal graphs.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 023
- Pages: 3-19
- Published: 28/02/1997
We present a new construction to obtain frames with block size four using certain skew Room frames. The existence results of Rees and Stinson for frames with block size four are improved, especially nfor hole sizes divisible by \(6\). As a by-product of the skew Room frames we construct, we are also able to show that a resolvable \((K_4 – e)\)-design with \(60t + 16\) points exists if \(t \geq 0\) and \(t \neq 8, 12\).
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 023
- Pages: 241-254
- Published: 28/02/1997
It has been proved that the smallest rectangular board on which a \( (p, q) \)-knight’s graph is connected has sides \( p+q \) by \( 2q \) when \( p < q \). It has also been proved that these minimal connected knight's graphs are of genus \( 0 \) or \( 1 \), and that they are of genus \( 0 \) when \( p \) and \( q \) are of the form \( Md+1 \) and \( (M+1)d+1 \), with \( M \) a non-negative integer and \( d \) a positive odd integer. It is proved in this paper that the minimal connected knight's graph is of genus \( 1 \) in all other cases.
- Research article
- Full Text
- Ars Combinatoria
- Volume 045
- Pages: 169-179
- Published: 30/04/1997
We define an almost-convex polygon as a non-convex polygon in which any two vertices see each other inside the polygon unless they are not adjacent and belong to a chain of consecutive concave vertices. Using inclusion-exclusion techniques, we find formulas for the number of triangulations of almost-convex polygons in terms of the number and position of the concave vertices. We translate these formulas into the language of generating functions and provide several simple asymptotic estimates. We also prove that certain balanced configurations yield the maximum number of triangulations.
- Research article
- Full Text
- Ars Combinatoria
- Volume 044
- Pages: 283-286
- Published: 31/12/1996
Let \(n,s\) be positive integers, and let \(r = 1 + \frac{1}{s}\). In this note we prove that if the sequence \(\{a_n(r)\}_{n=1}^{\infty}\) satisfies \(ra_n(r)= \sum_{k=1}^{n}\binom{n}{k}a_k(r), n> 1\), then \(a_n(r) = na_1(r)\left[(n -1)! / {(s+1)}(log r)^n+{{1/r(s+1)}} \right]\). Moreover, we obtain a related combinatorial identity.
- Research article
- Full Text
- Ars Combinatoria
- Volume 044
- Pages: 273-281
- Published: 31/12/1996
A Mendelsohn triple system, \(MTS(v) = (X, \mathcal{B})\), is called self-converse if it and its converse \((X, \mathcal{B}^{-1})\) are isomorphic, where \(\mathcal{B}^{-1 } = \{\langle z,y,x\rangle; \langle x,y,z\rangle \in \mathcal{B}\}\). In this paper, the existence spectrum of self-converse \(MTS(v)\) is given, which is \(v \equiv 0\) or \(1 \pmod{3}\) and \(v \neq 6\).
- Research article
- Full Text
- Ars Combinatoria
- Volume 044
- Pages: 263-271
- Published: 31/12/1996
In this paper, we discuss the automorphism groups of circulant digraphs. Our main purpose is to determine the full automorphism groups of circulant digraphs of degree \(3\).
- Research article
- Full Text
- Ars Combinatoria
- Volume 044
- Pages: 241-262
- Published: 31/12/1996
The spectrum for the decomposition of \(\lambda K_v\) into \(3\)-perfect \(9\)-cycles is found for all \(\lambda > 1\). (The case \(\lambda = 1\) was dealt with in an earlier paper by the authors and Lindner.) The necessary conditions for the existence of a suitable decomposition turn out to be sufficient.
- Research article
- Full Text
- Ars Combinatoria
- Volume 044
- Pages: 229-239
- Published: 31/12/1996
A directed triple system of order \(v\), denoted by \(DTS(v)\), is called \((f,k)\)-rotational if it has an automorphism consisting of \(f\) fixed points and \(k\) cycles each of length \((v-f)/k\). In this paper, we obtain a necessary and sufficient condition for the existence of \((f,k)\)-rotational \(DTS(v)\) for any arbitrary positive integer \(k\).




