Andrzej Lingas
106 – 120 of 132
- show: 15
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2005
-
Mark
A note on maximum independent set and related problems on box graphs
(
- Contribution to journal › Article
-
Mark
Approximate clustering of fingerprint vectors with missing values
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
(
- Contribution to journal › Article
- 2004
-
Mark
Subexponential-time framework for optimal embeddings of graphs in integer lattices
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A fast algorithm for approximating the detour of a polygonal chain
(
- Contribution to journal › Article
-
Mark
Approximation algorithms for Hamming clustering problems
(
- Contribution to journal › Article
-
Mark
Approximation algorithms for MAX-BISECTION on low degree regular graphs
(
- Contribution to journal › Article
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2003
-
Mark
Trade-offs between load and degree in virtual path layouts
(
- Contribution to journal › Article
-
Mark
Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Subexponential-time algorithms for maximum independent set and related problems on box graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A fast algorithm for optimal alignment between similar ordered trees
(
- Contribution to journal › Article
-
Mark
An improved bound on Boolean matrix multiplication for highly clustered data
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Fundamentals of computation theory
- Book/Report › Conference proceeding (editor)
- 2002
-
Mark
Adaptive algorithms for constructing convex hulls and triangulations of polygonal chains
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding