Searching for authors named "Andrzej Lingas" – sorted by Relevance.
38 documents found, showing 1 through 10.
Next 10 →
-
A Fast Algorithm for Optimal Alignment Between Similar Ordered Trees
- …A Fast Algorithm for Optimal Alignment Between Similar Ordered Trees Jesper Jansson and Andrzej…
- Cited by 9 (3 self) – Add To MetaCart
-
On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem
- … Andrzej Lingas y Abstract We present the first truly polynomial-time approximation scheme (PTAS…
- Cited by 16 (5 self) – Add To MetaCart
-
Fast Approximation Schemes for Euclidean Multi-Connectivity Problems (Extended Abstract)
- … Czumaj 1?? and Andrzej Lingas 2 1 Department of Computer and Information Science, New Jersey…
- Cited by 9 (5 self) – Add To MetaCart
-
A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity
- … and Andrzej Lingas 2 1 Heinz Nixdorf Institute and Department of Mathematics & Computer Science University…
- Cited by 8 (3 self) – Add To MetaCart
-
Fast Approximation Schemes for Euclidean Minimum-Cost Multi-Connectivity (Extended Abstract)
- … of Paderborn, D-33095 Paderborn, Germany artur@(email omitted); Andrzej Lingas Department of Computer…
- Cited by 1 (1 self) – Add To MetaCart
-
A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree
- …A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree Andrzej Lingas Department…
- Cited by 1 (1 self) – Add To MetaCart
-
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs
- …-mail: czumaj@(email omitted); 1.1 Multi-connectivity problems Andrzej Lingas Department of Computer Science Lund…
- Cited by 1 (0 self) – Add To MetaCart
-
There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
- … Levcopoulos 1 and Andrzej Lingas 1 Abstract. Let S be a set of n points in the plane. For an arbitrary…
- Cited by 26 (0 self) – Add To MetaCart
-
Inferring Ordered Trees from Local Constraints
- …Inferring Ordered Trees from Local Constraints Leszek Gasieniec 1 , Jesper Jansson 2 , Andrzej…
- Add To MetaCart
-
A Simple Randomized Parallel Algorithm for Maximal f-Matchings
- … Jarominek 2 , Andrzej Lingas 1 and Wojciech Rytter 2 1 Department of Computer Science. Lund University…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
