Author:
Hunt Harry B,Marathe Madhav V,Radhakrishnan Venkatesh,Ravi S.S,Rosenkrantz Daniel J,Stearns Richard E
Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference49 articles.
1. S. R. Arikati, A. Dessmark, A. Lingas, M. V. Marathe, Approximation algorithms for maximum two-dimensional pattern matching, in, Proc. 7th Annual Symposium on Combinatorial Pattern Matching (CPM), Laguna Beach, CA, June 1996, Lecture Notes in Computer Science, 1075, 348, 360, Springer-Verlag, Berlin/New York
2. Easy problems for tree-decomposable graphs;Arnborg;J. Algorithms,1991
3. Linear-time algorithms for NP-hard problems on graphs embedded ink;Arnborg;Discrete Appl. Math.,1989
4. Approximation algorithms for NP-complete problems on planar graphs;Baker;J. Assoc. Comput. Mach.,1994
5. H. Breu, D. Kirkpatrick, Unit Disk Graph Recognition is NP-hard, 93-27, Department of Computer Science, University of British Columbia, August, 1993
Cited by
184 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献