3-D Shape Recovery Using Distributed Aspect Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Illuminating Both Sides of Line Segments
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Theoretical Computer Science - Special issue: Tilings of the plane
Critical chromatic number and the complexity of perfect packings in graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An approximation algorithm for maximum P3-packing in subcubic graphs
Information Processing Letters
Weakly cooperative guards in grids
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Parallel processing subsystems with redundancy in a distributed environment
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Induced packing of odd cycles in planar graphs
Theoretical Computer Science
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition
Computer Science Review
TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY
Fundamenta Informaticae
| Hi-index | 0.00 |