Get started
Author

Andrzej Lingas

Observed names: A Lingas, A. Lingas, ANDRZEJ LINGAS, Andrezej Lingas, Lingas Andrzej, Lingas, Andrzej
Institution: Lund University
Observed institutions: Linköping University, University of Bonn, University of Liverpool, University of Oregon, Lund University, University of Warsaw, Massachusetts Institute of Technology
ORCID: 0000-0003-4998-9844
Observed ORCID: 0000-0003-4998-9844
OpenAlex ID: A5016509031
The power of non-rectilinear holes
1982 · Andrzej Lingas · Lecture notes in computer science · 126
Approximation algorithms for time-dependent orienteering
2002 · Fedor V. Fomin, Andrzej Lingas · Information Processing Letters · 88
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
2007 · Artur Czumaj, Mirosław Kowaluk, et al. · Theoretical Computer Science · 65
Efficient approximation algorithms for the Hamming center problem
1999 · Leszek Gąsieniec, Jesper Jansson, et al. · 60
Subgraph isomorphism for biconnected outerplanar graphs in cubic time
1989 · Andrzej Lingas · Theoretical Computer Science · 56
PDF
On the Complexity of Constructing Evolutionary Trees
1999 · Leszek Gasieniec, Jesper Jansson, et al. · Journal of Combinatorial Optimization · 54
Gossiping with Bounded Size Messages in ad hoc Radio Networks
2002 · Malin Christersson, Leszek Gąsieniec, et al. · Lecture notes in computer science · 52
On approximability of the minimum-cost k-connected spanning subgraph problem
1999 · Artur Czumaj, Andrzej Lingas · 51
There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
1992 · Christos Levcopoulos, Andrzej Lingas · Algorithmica · 49
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
2005 · Klaus Jansen, Marek Karpinski, et al. · SIAM Journal on Computing · 47
On adaptive deterministic gossiping in ad hoc radio networks
2002 · Leszek Ga̧sieniec, Andrzej Lingas · Information Processing Letters · 44
On approximation behavior of the greedy triangulation for convex polygons
1987 · Christos Levcopoulos, Andrzej Lingas · Algorithmica · 42
Oblivious gossiping in ad-hoc radio networks
2001 · Bogdan S. Chlebus, Leszek Gąsieniec, et al. · 40
Counting and Detecting Small Subgraphs via Equations
2013 · Mirosław Kowaluk, Andrzej Lingas, et al. · SIAM Journal on Discrete Mathematics · 39
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees
2001 · Jesper Jansson, Andrzej Lingas · Lecture notes in computer science · 39
PDF
A linear-time construction of the relative neighborhood graph from the Delaunay triangulation
1994 · Andrzej Lingas · Computational Geometry · 36
A New Heuristic for Minimum Weight Triangulation
1987 · Andrzej Lingas · SIAM Journal on Algebraic and Discrete Methods · 34
A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
2010 · Andrzej Lingas · Algorithmica · 33
LCA Queries in Directed Acyclic Graphs
2005 · Miroslaw Kowaluk, Andrzej Lingas · Lecture notes in computer science · 33
The Greedy and Delauney triangulations are not bad in the average case
1986 · Andrzej Lingas · Information Processing Letters · 33
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)
2017 · Leszek Gąsieniec, Ralf Klasing, et al. · Lecture notes in computer science · 31
Approximation algorithms for Hamming clustering problems
2003 · Leszek Ga̧sieniec, Jesper Jansson, et al. · Journal of Discrete Algorithms · 31
PDF
A pspace complete problem related to a pebble game
1978 · Andrzej Lingas · Lecture notes in computer science · 31
A fast algorithm for approximating the detour of a polygonal chain
2003 · Annette Ebbers-Baumann, Rolf Klein, et al. · Computational Geometry · 30
PDF
AnO(n logn) algorithm for computing the link center of a simple polygon
1992 · Hristo N. Djidjev, Andrzej Lingas, et al. · Discrete & Computational Geometry · 30
PDF
Works count: 331
Citation count: 2,729
H-index: 28
I10-index: 86
Year
Topic
Type