| Publication | Date of Publication | Type |
|---|
Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work
Engineering Optimization | 2022-12-23 | Paper |
The exact multiple pattern matching problem solved by a reference tree approach
Theoretical Computer Science | 2021-08-11 | Paper |
Parallel graph algorithms based upon broadcast communications
IEEE Transactions on Computers | 2018-09-14 | Paper |
Minimum spanning trees of moving points in the plane
IEEE Transactions on Computers | 2018-09-14 | Paper |
A parallel algorithm for solving sparse triangular systems
IEEE Transactions on Computers | 2018-09-14 | Paper |
The NPO-completeness of the longest Hamiltonian cycle problem
Information Processing Letters | 2016-06-09 | Paper |
An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs
Information Processing Letters | 2016-06-01 | Paper |
A new filtration method and a hybrid strategy for approximate string matching
Theoretical Computer Science | 2013-11-29 | Paper |
Edit distance for a run-length-encoded string and an uncompressed string
Information Processing Letters | 2010-03-24 | Paper |
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
Journal of Complexity | 2008-04-28 | Paper |
The approximability of the weighted Hamiltonian path completion problem on a tree
Theoretical Computer Science | 2005-09-22 | Paper |
The minimal spanning tree preservation approaches for DNA multiple sequence alignment and evolutionary tree construction
Journal of Combinatorial Optimization | 2005-05-13 | Paper |
The full Steiner tree problem
Theoretical Computer Science | 2005-01-18 | Paper |
scientific article; zbMATH DE number 2089965 (Why is no real title available?)
| 2004-08-12 | Paper |
An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
Discrete Applied Mathematics | 2002-07-30 | Paper |
An optimal embedding of cycles into incomplete hypercubes
Information Processing Letters | 2002-07-25 | Paper |
UML and C++: A practical guide to object-oriented development.
| 2001-05-29 | Paper |
scientific article; zbMATH DE number 1222845 (Why is no real title available?)
| 1998-11-11 | Paper |
The weighted perfect domination problem and its variants
Discrete Applied Mathematics | 1996-10-06 | Paper |
Single step searching in weighted block graphs
Information Sciences | 1995-08-10 | Paper |
An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons
Information Processing Letters | 1994-12-08 | Paper |
Optimal MMI file systems for orthogonal range retrieval
Information Systems | 1994-01-31 | Paper |
scientific article; zbMATH DE number 278832 (Why is no real title available?)
| 1994-01-06 | Paper |
A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
European Journal of Operational Research | 1994-01-01 | Paper |
scientific article; zbMATH DE number 403946 (Why is no real title available?)
| 1993-09-06 | Paper |
The searching over separators strategy to solve some NP-hard problems in subexponential time
Algorithmica | 1993-06-29 | Paper |
The slab dividing approach to solve the Euclidean \(P\)-center problem
Algorithmica | 1993-04-01 | Paper |
Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
BIT | 1993-01-26 | Paper |
Special subgraphs of weighted visibility graphs
Information Processing Letters | 1993-01-17 | Paper |
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
Discrete Applied Mathematics | 1993-01-16 | Paper |
PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
International Journal of Computational Geometry & Applications | 1993-01-16 | Paper |
Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
Algorithmica | 1992-09-27 | Paper |
20‐relative neighborhood graphs are hamiltonian
Journal of Graph Theory | 1992-06-27 | Paper |
COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME
International Journal of Computational Geometry & Applications | 1992-06-27 | Paper |
VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
International Journal of Computational Geometry & Applications | 1991-01-01 | Paper |
On weighted rectilinear 2-center and 3-center problems
Information Sciences | 1991-01-01 | Paper |
The weighted perfect domination problem
Information Processing Letters | 1990-01-01 | Paper |
Solving the set cover problem on a supercomputer
Parallel Computing | 1990-01-01 | Paper |
On the continuous working problem
Discrete Applied Mathematics | 1990-01-01 | Paper |
The vectorization of the partition problem
Parallel Computing | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4213492 (Why is no real title available?)
| 1990-01-01 | Paper |
Counting clique trees and computing perfect elimination schemes in parallel
Information Processing Letters | 1989-01-01 | Paper |
A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
Computers & Operations Research | 1989-01-01 | Paper |
Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
Information Processing Letters | 1988-01-01 | Paper |
On a scheduling problem where a job can be executed only by a limited number of processors
Computers & Operations Research | 1988-01-01 | Paper |
An O(N log N) minimal spanning tree algorithm for N points in the plane
BIT | 1986-01-01 | Paper |
The mapping of two-dimensional array processors to one-dimensional processors
Parallel Computing | 1986-01-01 | Paper |
A Letter-oriented Minimal Perfect Hashing Scheme
The Computer Journal | 1986-01-01 | Paper |
A parallel sorting scheme whose basic operation sortsN elements
International Journal of Computer & Information Sciences | 1985-01-01 | Paper |
On the average length of Delaunay triangulations
BIT | 1984-01-01 | Paper |
Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
Information Sciences | 1984-01-01 | Paper |
A new parallel sorting algorithm based upon min-mid-max operations
BIT | 1984-01-01 | Paper |
A parallel algorithm to solve the stable marriage problem
BIT | 1984-01-01 | Paper |
The average performance analysis of a closest‐pair algorithm
International Journal of Computer Mathematics | 1984-01-01 | Paper |
The hierarchical ordering in multiattribute files
Information Sciences | 1983-01-01 | Paper |
Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries
IEEE Transactions on Software Engineering | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3837197 (Why is no real title available?)
| 1981-01-01 | Paper |
Symbolic Gray Code as a Multikey Hashing Function
IEEE Transactions on Pattern Analysis and Machine Intelligence | 1980-01-01 | Paper |
Towards Automatic Auditing of Records
IEEE Transactions on Software Engineering | 1978-01-01 | Paper |
Storage Reduction Through Minimal Spanning Trees and Spanning Forests
IEEE Transactions on Computers | 1977-01-01 | Paper |
scientific article; zbMATH DE number 3564373 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3551896 (Why is no real title available?)
| 1975-01-01 | Paper |
Fuzzy Logic and the Resolution Principle
Journal of the ACM | 1972-01-01 | Paper |
Some properties of fuzzy logic
Information and Control | 1972-01-01 | Paper |
An algorithm to generate prime implicants and its application to the selection problem
Information Sciences | 1972-01-01 | Paper |
On the Optimal Solutions to AND/OR Series-Parallel Graphs
Journal of the ACM | 1971-01-01 | Paper |
Application of game tree searching techniques to sequential pattern recognition
Communications of the ACM | 1971-01-01 | Paper |
