| Publication | Date of Publication | Type |
|---|
| An output sensitive solution to the set union and intersection problem | 2024-06-21 | Paper |
ATM layouts with bounded hop count and congestion
Distributed Computing | 2020-12-03 | Paper |
Finding the detour-critical edge of a shortest path between two nodes
Information Processing Letters | 2016-06-09 | Paper |
On building the transitive reduction of a two-dimensional poset
Information Processing Letters | 2016-05-26 | Paper |
Computing a poset from its realizer
Information Processing Letters | 2016-05-26 | Paper |
Efficient unbalanced merge-sort
Information Sciences | 2006-05-16 | Paper |
Nearly linear time minimum spanning tree maintenance for transient node failures
Algorithmica | 2004-10-01 | Paper |
Algorithms for Moving Objects Databases
The Computer Journal | 2004-09-06 | Paper |
| scientific article; zbMATH DE number 2080920 (Why is no real title available?) | 2004-08-04 | Paper |
Finding the most vital node of a shortest path.
Theoretical Computer Science | 2003-08-17 | Paper |
Swapping a failing edge of a single source shortest paths tree is good and fast
Algorithmica | 2003-06-02 | Paper |
Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.
Journal of Parallel and Distributed Computing | 2003-05-14 | Paper |
An efficient spatial access method for spatial images containing multiple non-overlapping features
Information Systems | 2003-02-20 | Paper |
scientific article; zbMATH DE number 1869818 (Why is no real title available?)
Distributed and Parallel Databases | 2003-02-17 | Paper |
| scientific article; zbMATH DE number 1796972 (Why is no real title available?) | 2002-09-05 | Paper |
A faster computation of the most vital edge of a shortest path
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1755564 (Why is no real title available?) | 2002-06-16 | Paper |
Finding all the best swaps of a minimum diameter spanning tree under transient edge failures
Journal of Graph Algorithms and Applications | 2002-01-07 | Paper |
| scientific article; zbMATH DE number 1670672 (Why is no real title available?) | 2001-11-11 | Paper |
A generalized comparison of linear representations of thematic layers
Data & Knowledge Engineering | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1405681 (Why is no real title available?) | 2001-02-18 | Paper |
How to survive while visiting a graph
Discrete Applied Mathematics | 2000-07-13 | Paper |
| scientific article; zbMATH DE number 1305082 (Why is no real title available?) | 2000-03-13 | Paper |
Intersection reporting on two collections of disjoint sets
Information Sciences | 2000-01-05 | Paper |
| scientific article; zbMATH DE number 1455748 (Why is no real title available?) | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1302380 (Why is no real title available?) | 1999-06-16 | Paper |
Distributed searching of multi-dimensional data: A performance evaluation study
Journal of Parallel and Distributed Computing | 1998-11-05 | Paper |
A pointer-free data structure for merging heaps and min-max heaps
Theoretical Computer Science | 1992-06-26 | Paper |
Hierarchies and planarity theory
IEEE Transactions on Systems, Man, and Cybernetics | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4049078 (Why is no real title available?) | 1987-01-01 | Paper |
