| Publication | Date of Publication | Type |
|---|
| Supporting Women in Mathematics and computer science | 2022-11-18 | Paper |
| On the Ramsey numbers of odd-linked double stars | 2022-06-14 | Paper |
| Double-interval societies | 2015-01-22 | Paper |
| Upper and Lower Bounds on Constructing Alphabetic Binary Trees | 1996-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140420 | 1994-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138928 | 1994-09-20 | Paper |
| Shallow grates | 1994-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201938 | 1993-09-06 | Paper |
| A Tight Lower Bound on the Size of Planar Permutation Networks | 1993-04-01 | Paper |
| Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures | 1992-09-26 | Paper |
| Superlinear bounds for matrix searching problems | 1992-06-28 | Paper |
| Multilayer grid embeddings for VLSI | 1991-01-01 | Paper |
| A lower bound on the area of permutation layouts | 1991-01-01 | Paper |
| Applications of generalized matrix searching to geometric algorithms | 1990-01-01 | Paper |
| An Almost Linear Time Algorithm for Generalized Matrix Searching | 1990-01-01 | Paper |
| Geometric applications of a matrix-searching algorithm | 1987-01-01 | Paper |
| Bounds on the convex label number of trees | 1987-01-01 | Paper |
| Improved lower bounds for the cycle detection problem | 1985-01-01 | Paper |
| Bounded-depth, polynomial-size circuits for symmetric functions | 1985-01-01 | Paper |
| Alphabetic Minimax Trees | 1985-01-01 | Paper |
| Some Graph-Colouring Theorems with Applications to Generalized Connection Networks | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3722545 | 1985-01-01 | Paper |
| A tight bound for black and white pebbles on the pyramid | 1985-01-01 | Paper |
| Bounding Fan-out in Logical Networks | 1984-01-01 | Paper |
| Limitations on Explicit Constructions of Expanding Graphs | 1984-01-01 | Paper |
| On pseudosimilarity in trees | 1983-01-01 | Paper |
| Traditional Galleries Require Fewer Watchmen | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3664859 | 1982-01-01 | Paper |
| An O(n log n) unidirectional distributed algorithm for extrema finding in a circle | 1982-01-01 | Paper |
| Isomorphism Testing in Hookup Classes | 1982-01-01 | Paper |
| Dimensions of the sets of invariant means of semigroups | 1980-01-01 | Paper |
| Residually-Complete Graphs | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3910555 | 1980-01-01 | Paper |
| Generalized Ramsey theory for graphs, X: Double stars | 1979-01-01 | Paper |
| Optimal strategies for a fair betting game | 1979-01-01 | Paper |
| Semidirect product of semigroups in relation to amenability, cancellation properties, and strong Folner conditions | 1977-01-01 | Paper |
| On the Dimension of Left Invariant Means and Left Thick Subsets | 1977-01-01 | Paper |
