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 002
- Pages: 37-50
- Published: 31/10/1987
In this paper, we investigate the existence of skew frames with sets of skew transversals. We consider skew frames of type \(1^n\) and skew frames of type \((2^m)^q\) with sets of skew transversals. These frames are equivalent to three-dimensional frames which have complementary \(2\)-dimensional projections with special properties.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 002
- Pages: 29-36
- Published: 31/10/1987
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 002
- Pages: 13-28
- Published: 31/10/1987
All graphs meeting the basic necessary conditions to be the leave graph of a maximal partial triple system with at most thirteen elements are generated. A hill-climbing algorithm is developed to determine which of these candidates are in fact leave graphs. Improved necessary conditions for a graph to be a leave graph are developed.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 002
- Pages: 5-11
- Published: 31/10/1987
Some new lower bounds for higher Ramsey numbers are presented. Results concerning generalized hypergraph Ramsey numbers are also given.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 001
- Pages: 221-234
- Published: 30/04/1987
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 001
- Pages: 217-219
- Published: 30/04/1987
We enumerate the perfect one-factorizations of \(K_{50}\), which are generated by starters in \({Z}_{49}\), fixed by multiplication by \(18\) and \(30\). There are precisely \(67\) non-isomorphic examples.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 001
- Pages: 207-215
- Published: 30/04/1987
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 001
- Pages: 191-205
- Published: 30/04/1987
Let the vertices of a graph denote computer processes which communicate by passing messages along edges. It has been a standard Computer Science problem to provide algorithms that let the processes solve problems jointly (e.g. leader election, clock synchronization). What if some of the processes are maliciously faulty, i.e. send messages calculated to sabotage joint algorithms? Here we review a few “byzantine agreement” algorithms with interesting graph-theoretic features and raise questions about graph connectivity and diameter (with a few answers).
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 001
- Pages: 181-190
- Published: 30/04/1987
Let the vertices of a graph denote processes in a distributed or time-shared computer system; let two vertices be connected by an edge if the two processes cannot proceed at the same time (they mutually exclude one another). Managing mutual exclusion and related scheduling problems has given rise to substantial literature in computer science. Some methods of attack include covering or partitioning the graph with cliques or threshold graphs. Here I survey some recent graph-theoretic results and examples motivated by this approach.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 001
- Pages: 175-180
- Published: 30/04/1987




