Andrzej Lingas
131 – 138 of 138
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2002
-
Mark
Adaptive algorithms for constructing convex hulls and triangulations of polygonal chains
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Polynomial-time approximation schemes for the Euclidean survivable network design problem
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2001
-
Mark
A fast algorithm for optimal alignment between similar ordered trees
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Fast Boolean matrix multiplication for highly clustered data
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2000
-
Mark
Fast approximation schemes for Euclidean multi-connectivity problems
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 1981
-
Mark
Certain algorithms for subgraph isomorphism problems
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 1979
-
Mark
The complexity of distributive computations
(1979) Conference on Algebraic, Arthmetic, and Categorial Methods in Computation Theory 2. p.262-268
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 1978
-
Mark
A PSPACE complete problem related to a pebble game
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
