Andrzej Lingas

2.6k total citations
122 papers, 827 citations indexed

About

Andrzej Lingas is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications. According to data from OpenAlex, Andrzej Lingas has authored 122 papers receiving a total of 827 indexed citations (citations by other indexed papers that have themselves been cited), including 66 papers in Computational Theory and Mathematics, 50 papers in Computer Graphics and Computer-Aided Design and 30 papers in Computer Networks and Communications. Recurrent topics in Andrzej Lingas's work include Computational Geometry and Mesh Generation (50 papers), Advanced Graph Theory Research (50 papers) and Complexity and Algorithms in Graphs (42 papers). Andrzej Lingas is often cited by papers focused on Computational Geometry and Mesh Generation (50 papers), Advanced Graph Theory Research (50 papers) and Complexity and Algorithms in Graphs (42 papers). Andrzej Lingas collaborates with scholars based in Sweden, Poland and Germany. Andrzej Lingas's co-authors include Leszek Gąsieniec, Christos Levcopoulos, Jesper Jansson, Fedor V. Fomin, Artur Czumaj, Rolf Klein, Mirosław Kowaluk, Marek Karpiński, Jörg-Rüdiger Sack and Hristo Djidjev and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Andrzej Lingas

106 papers receiving 762 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Andrzej Lingas Sweden 17 347 266 227 162 162 122 827
Christos Levcopoulos Sweden 16 235 0.7× 341 1.3× 150 0.7× 168 1.0× 129 0.8× 63 678
Henk Meijer Canada 16 254 0.7× 267 1.0× 341 1.5× 204 1.3× 174 1.1× 100 826
Daniel Greene United States 9 168 0.5× 177 0.7× 155 0.7× 172 1.1× 243 1.5× 18 720
Matthew J. Katz Israel 16 229 0.7× 592 2.2× 201 0.9× 317 2.0× 74 0.5× 101 979
Jyrki Katajainen Denmark 14 204 0.6× 145 0.5× 181 0.8× 154 1.0× 284 1.8× 60 678
Ge Xia United States 13 518 1.5× 123 0.5× 261 1.1× 78 0.5× 149 0.9× 61 851
Elias Dahlhaus Germany 13 618 1.8× 85 0.3× 287 1.3× 89 0.5× 157 1.0× 45 937
David R. White United Kingdom 18 116 0.3× 237 0.9× 208 0.9× 89 0.5× 546 3.4× 53 1.3k
Satish Rao United States 14 607 1.7× 199 0.7× 466 2.1× 65 0.4× 122 0.8× 30 956
Yijie Han United States 16 291 0.8× 159 0.6× 341 1.5× 84 0.5× 183 1.1× 63 741

Countries citing papers authored by Andrzej Lingas

Since Specialization
Citations

This map shows the geographic impact of Andrzej Lingas's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Andrzej Lingas with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrzej Lingas more than expected).

Fields of papers citing papers by Andrzej Lingas

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Andrzej Lingas. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Andrzej Lingas. The network helps show where Andrzej Lingas may publish in the future.

Co-authorship network of co-authors of Andrzej Lingas

This figure shows the co-authorship network connecting the top 25 collaborators of Andrzej Lingas. A scholar is included among the top collaborators of Andrzej Lingas based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Andrzej Lingas. Andrzej Lingas is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Gąsieniec, Leszek, Tomasz Jurdziński, Ralf Klasing, et al.. (2023). Perpetual maintenance of machines with different urgency requirements. Journal of Computer and System Sciences. 139. 103476–103476.
2.
Kowaluk, Mirosław, et al.. (2015). Induced subgraph isomorphism: Are some patterns substantially easier than others?. Theoretical Computer Science. 605. 119–128. 6 indexed citations
3.
Jansson, Jesper & Andrzej Lingas. (2013). Computing the rooted triplet distance between galled trees by counting triangles. Journal of Discrete Algorithms. 25. 66–78. 5 indexed citations
4.
Kowaluk, Mirosław, et al.. (2011). Counting and detecting small subgraphs via equations and matrix multiplication. Symposium on Discrete Algorithms. 1468–1476. 11 indexed citations
5.
Czumaj, Artur & Andrzej Lingas. (2007). Finding a heaviest triangle is not harder than matrix multiplication. Symposium on Discrete Algorithms. 986–994. 15 indexed citations
6.
Jiang, Tao, et al.. (2005). Approximate clustering of fingerprint vectors with missing values. Lund University Publications (Lund University). 57–60. 2 indexed citations
7.
Klein, Rolf, Christos Levcopoulos, & Andrzej Lingas. (2005). A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation. Computational Geometry. 34(1). 28–34. 2 indexed citations
8.
Lingas, Andrzej, et al.. (2004). On approximation of the maximum clique minor containment problem and some subgraph homeomorphism problems. Electronic colloquium on computational complexity. 1 indexed citations
9.
Klein, Rolf, et al.. (2003). A fast algorithm for approximating the detour of a polygonal chain. Computational Geometry. 27(2). 123–134. 13 indexed citations
10.
Gąsieniec, Leszek & Andrzej Lingas. (2002). On adaptive deterministic gossiping in ad hoc radio networks. Symposium on Discrete Algorithms. 83(2). 689–690. 3 indexed citations
11.
Karpiński, Marek, Mirosław Kowaluk, & Andrzej Lingas. (2000). Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs. Electronic colloquium on computational complexity. 7. 3 indexed citations
12.
Czumaj, Artur & Andrzej Lingas. (2000). Fast Approximation Schemes for Euclidean Multi-Connectivity Problems (Extended Abstract). 1 indexed citations
13.
Czumaj, Artur & Andrzej Lingas. (1999). On approximability of the minimum-cost k-connected spanning subgraph problem. Symposium on Discrete Algorithms. 281–290. 19 indexed citations
14.
Lingas, Andrzej, et al.. (1999). Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions. 1 indexed citations
15.
Gąsieniec, Leszek, et al.. (1998). Inferring ordered trees from local constraints. 67–76. 8 indexed citations
16.
Berman, Piotr & Andrzej Lingas. (1997). A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon. Theoretical Computer Science. 174(1-2). 193–202. 3 indexed citations
17.
Lingas, Andrzej, Rickard Karlsson, & Svante Carlsson. (1993). Automata, Languages and Programming 20th International Colloquium, Icalp 93, Lund, Sweden, July 5-9, 1993 : Proceedings. Springer eBooks. 1 indexed citations
18.
Klein, Rolf & Andrzej Lingas. (1993). A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon.. Canadian Conference on Computational Geometry. 91(10). 370–374. 5 indexed citations
19.
Lingas, Andrzej. (1990). A Note on a Parallel Heuristic for Minimum.. Bulletin of the European Association for Theoretical Computer Science. 42. 174–177.
20.
Lingas, Andrzej. (1989). Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theoretical Computer Science. 63(3). 295–302. 26 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Christos Levcopoulos Breakdown of academic impact, for papers by Henk Meijer Breakdown of academic impact, for papers by Daniel Greene Breakdown of academic impact, for papers by Matthew J. Katz Breakdown of academic impact, for papers by Jyrki Katajainen Breakdown of academic impact, for papers by Ge Xia Breakdown of academic impact, for papers by Elias Dahlhaus Breakdown of academic impact, for papers by David R. White Breakdown of academic impact, for papers by Satish Rao Breakdown of academic impact, for papers by Yijie Han
Rankless by CCL
2026