| Publication | Date of Publication | Type |
|---|
A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree
Information Processing Letters | 2017-11-22 | Paper |
An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph
Information Processing Letters | 2016-06-16 | Paper |
A linear time algorithm for optimal \(k\)-hop dominating set of a tree
Information Processing Letters | 2015-12-01 | Paper |
Random Generation of Combinatorial Structures using Context-Fee Grammars
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Distributed Computing – IWDC 2005
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Conflating two polygonal lines
Pattern Recognition | 2006-05-22 | Paper |
The normal form of a granular fuzzy function
Fuzzy Sets and Systems | 2002-05-21 | Paper |
A representation theorem for min-transitive fuzzy relations
Fuzzy Sets and Systems | 2000-06-26 | Paper |
Similarity relations, fuzzy linear orders, and fuzzy partial orders
Fuzzy Sets and Systems | 2000-03-23 | Paper |
Membership functions for a fuzzy group from similarity relations
Fuzzy Sets and Systems | 2000-02-28 | Paper |
The correct form of a recent result on level-subgroups of a fuzzy group
Fuzzy Sets and Systems | 2000-02-28 | Paper |
The min-max composition rule and its superiority over the usual max-min composition rule
Fuzzy Sets and Systems | 1999-12-13 | Paper |
Fuzzy logic or Lukasiewicz logic: A clarification
Fuzzy Sets and Systems | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1304355 (Why is no real title available?) | 1999-10-18 | Paper |
Min-transitivity of fuzzy leftness relationship and its application to decision making
Fuzzy Sets and Systems | 1999-10-05 | Paper |
| scientific article; zbMATH DE number 1023024 (Why is no real title available?) | 1997-08-14 | Paper |
A new variant of the \(A^*\)-algorithm which closes a node at most once.
Annals of Mathematics and Artificial Intelligence | 1997-05-13 | Paper |
An $O(n)$ Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection
SIAM Journal on Computing | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 67506 (Why is no real title available?) | 1992-09-27 | Paper |
Minimal strings in a regular language with respect to a partial order on the alphabet
Theoretical Computer Science | 1991-01-01 | Paper |
A new O(n \,n) algorithm for computing the intersection of convex polygons
Pattern Recognition | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3806950 (Why is no real title available?) | 1981-01-01 | Paper |
A Dijkstra-like shortest path algorithm for certain cases of negative arc lengths
BIT | 1980-01-01 | Paper |
Reconstruction of a Pair of Graphs from their Concatenations
SIAM Journal on Algebraic Discrete Methods | 1980-01-01 | Paper |
An intermediate-value theorem for optimum tree valuation
Information Processing Letters | 1979-01-01 | Paper |
A Linear Tree Partitioning Algorithm
SIAM Journal on Computing | 1977-01-01 | Paper |
Sorting tree, nestling tree and inverse permutation
Information Processing Letters | 1977-01-01 | Paper |
The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular
Journal of Combinatorial Theory. Series B | 1977-01-01 | Paper |
Reconstruction of a tree from its homomorphic images and other related transforms
Journal of Combinatorial Theory. Series B | 1976-01-01 | Paper |
A linear algorithm for the Hamiltonian completion number of a tree
Information Processing Letters | 1976-01-01 | Paper |
Disjoint Representation of Three Tree Realizable Sequences. I
SIAM Journal on Applied Mathematics | 1975-01-01 | Paper |
Existence of Graphs with Three Spanning Trees and Given Degree Sequence
SIAM Journal on Computing | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3426866 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3465359 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3422424 (Why is no real title available?) | 1974-01-01 | Paper |
Bounds of the number of disjoint spanning trees
Journal of Combinatorial Theory. Series B | 1974-01-01 | Paper |
Generalizations of the k-factor theorem
Discrete Mathematics | 1974-01-01 | Paper |
Disjoint Representation of Tree Realizable Sequences
SIAM Journal on Applied Mathematics | 1974-01-01 | Paper |
A factorization theorem for a certain class of graphs
Discrete Mathematics | 1974-01-01 | Paper |
The k-factor conjecture is true
Discrete Mathematics | 1973-01-01 | Paper |
A matroid generalization of a theorem of Mendelsohn and Dulmage
Discrete Mathematics | 1973-01-01 | Paper |
