| Publication | Date of Publication | Type |
|---|
| A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree | 2017-11-22 | Paper |
| An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph | 2016-06-16 | Paper |
| A linear time algorithm for optimal \(k\)-hop dominating set of a tree | 2015-12-01 | Paper |
| Random Generation of Combinatorial Structures using Context-Fee Grammars | 2007-05-29 | Paper |
| Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
| Conflating two polygonal lines | 2006-05-22 | Paper |
| The normal form of a granular fuzzy function | 2002-05-21 | Paper |
| A representation theorem for min-transitive fuzzy relations | 2000-06-26 | Paper |
| Similarity relations, fuzzy linear orders, and fuzzy partial orders | 2000-03-23 | Paper |
| The correct form of a recent result on level-subgroups of a fuzzy group | 2000-02-28 | Paper |
| Membership functions for a fuzzy group from similarity relations | 2000-02-28 | Paper |
| The min-max composition rule and its superiority over the usual max-min composition rule | 1999-12-13 | Paper |
| Fuzzy logic or Lukasiewicz logic: A clarification | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251087 | 1999-10-18 | Paper |
| Min-transitivity of fuzzy leftness relationship and its application to decision making | 1999-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341032 | 1997-08-14 | Paper |
| A new variant of the \(A^*\)-algorithm which closes a node at most once. | 1997-05-13 | Paper |
| An $O(n)$ Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4012247 | 1992-09-27 | Paper |
| Minimal strings in a regular language with respect to a partial order on the alphabet | 1991-01-01 | Paper |
| A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4749218 | 1981-01-01 | Paper |
| A Dijkstra-like shortest path algorithm for certain cases of negative arc lengths | 1980-01-01 | Paper |
| Reconstruction of a Pair of Graphs from their Concatenations | 1980-01-01 | Paper |
| An intermediate-value theorem for optimum tree valuation | 1979-01-01 | Paper |
| The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular | 1977-01-01 | Paper |
| Sorting tree, nestling tree and inverse permutation | 1977-01-01 | Paper |
| A Linear Tree Partitioning Algorithm | 1977-01-01 | Paper |
| A linear algorithm for the Hamiltonian completion number of a tree | 1976-01-01 | Paper |
| Reconstruction of a tree from its homomorphic images and other related transforms | 1976-01-01 | Paper |
| Existence of Graphs with Three Spanning Trees and Given Degree Sequence | 1975-01-01 | Paper |
| Disjoint Representation of Three Tree Realizable Sequences. I | 1975-01-01 | Paper |
| Bounds of the number of disjoint spanning trees | 1974-01-01 | Paper |
| Generalizations of the k-factor theorem | 1974-01-01 | Paper |
| A factorization theorem for a certain class of graphs | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3214389 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4050645 | 1974-01-01 | Paper |
| Disjoint Representation of Tree Realizable Sequences | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5684712 | 1974-01-01 | Paper |
| The k-factor conjecture is true | 1973-01-01 | Paper |
| A matroid generalization of a theorem of Mendelsohn and Dulmage | 1973-01-01 | Paper |
