Andrzej Lingas
101 – 131 of 131
- show: 100
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- « previous
- 1
- 2
- next »
- 2005
-
Mark
LCA queries in directed acyclic graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Embedding point sets into plane graphs of small dilation
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Max-stretch reduction for tree spanners
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Polynomial time approximation schemes for max-bisection on planar and geometric 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
A note on maximum independent set and related problems on box graphs
(
- Contribution to journal › Article
-
Mark
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
(
- Contribution to journal › Article
- 2004
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
- 2003
-
Mark
An improved bound on Boolean matrix multiplication for highly clustered data
(
- 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
Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Fundamentals of computation theory
- Book/Report › Conference proceeding (editor)
-
Mark
A fast algorithm for optimal alignment between similar ordered trees
(
- Contribution to journal › Article
-
Mark
Trade-offs between load and degree in virtual path layouts
(
- Contribution to journal › Article
- 2002
-
Mark
Polynomial-time approximation schemes for the Euclidean survivable network design problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Adaptive algorithms for constructing convex hulls and triangulations of polygonal chains
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A geometric approach to Boolean matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Gossiping with bounded size messages in ad hoc radio networks (Extended abstract)
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
On adaptive deterministic gossiping in ad hoc radio networks
(
- Contribution to journal › Article
-
Mark
Approximation algorithms for time-dependent orienteering
(
- Contribution to journal › Article
-
Mark
On adaptive deterministic gossiping in ad hoc radio networks
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2001
-
Mark
Fast Boolean matrix multiplication for highly clustered data
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A fast algorithm for optimal alignment between similar ordered trees
(
- 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
(
- 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
- « previous
- 1
- 2
- next »