Lingas, Andrzej.
Andrzej Lingas Ph.D. Linköpings Universitet 1983
VIAF ID: 27705410 (Personal)
Permalink: http://viaf.org/viaf/27705410
Preferred Forms
- 100 0 _ ‡a Andrzej Lingas ‡c Ph.D. Linköpings Universitet 1983
-
-
- 100 1 _ ‡a Lingas, Andrzej
- 100 1 _ ‡a Lingas, Andrzej
-
-
- 100 1 _ ‡a Lingas, Andrzej
-
- 100 1 _ ‡a Lingas, Andrzej
- 100 1 _ ‡a Lingas, Andrzej
-
4xx's: Alternate Name Forms (4)
Works
Title | Sources |
---|---|
Algorithm theory - SWAT '96 : 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996 : proceedings | |
Automata, languages and programming : 20th international colloquium, ICALP 93, Lund, Sweden, July 5-9, 1993 : proceedings | |
Covering polygons with minimum number of rectangles | |
An efficient parallel algorithm for palnar directed reachability | |
FCT 2003 | |
Fundamentals of computation theory : 14th international symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003 : proceedings | |
The Greedy and Delauney triangulations are not bad in the average case and minimum weight geometric triangulation of multi-connected polygons is NP-compelete [i.e. complete] | |
Hamiltonian Abstract Voronoi Diagrams in Linear Time | |
Heuristics for minimum edge length rectangular partitions of rectilinear figures | |
ICALP 93 | |
A known max-flow algorithm yields a new upper time bound for maximum bipartite C-matcing | |
Manhattonian Proximity in a Simple Polygon | |
Nearly optimal heuristics for binary search trees with geometric generalizations | |
A note on computational complexity of logic programs | |
A novel heuristic for minimum weight triangulation | |
An O(n log n) algorithm for computing a link center in a simple polygon | |
On complexity of regular languages in terms of finite automata, 1977: | |
On parallel complexity of the subgraph isomorphism problem | |
On partitioning polygons | |
On recognizing polygons, or How to eavesdro[p] | |
An optimal expected-time parallel algorithm for Voronoi diagrams | |
A parallel algorithm for maximum matching in planar graphs | |
Selected papers | |
Subgraph isomorphism for easily separable graphs of bounded valence | |
Subtree isomorphism and bipartite perfect matching are mutually NC reducible | |
SWAT 88, c1988: | |
SWAT '96 | |
Voronoi diagrams with barriers and the shortest diagonal problem |