Andrzej Lingas

Frantisek Galcík, Leszek Gasieniec, Andrzej Lingas: Efficient broadcasting in radio networks with long-range interference. Distributed Computing 26(1): 59-74 (2013)

Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu: Optimal cuts and partitions in tree metrics in polynomial time. Inf. Process. Lett. 113(12): 447-451 (2013)

Piotr Berman, Marek Karpinski, Andrzej Lingas: Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. Algorithmica 64(2): 295-310 (2012)

Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski: Linear-Time 3-Approximation Algorithm for the R-Star Covering Problem. Int. J. Comput. Geometry Appl. 22(2): 103-142 (2012)

Jesper Jansson, Richard S. Lemence, Andrzej Lingas: The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. SIAM J. Comput. 41(1): 272-291 (2012)

Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell: Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? COCOON 2012: 37-48

Jesper Jansson, Andrzej Lingas: Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles. CPM 2012: 385-398

Andrzej Lingas, Mia Persson: A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows. Euro-Par 2012: 688-699

Andrzej Lingas, Dzmitry Sledneu: A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs. SOFSEM 2012: 373-384

Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu: Optimal Cuts and Bisections on the Real Line in Polynomial Time. CoRR abs/1207.0933 (2012)

Andrzej Lingas, Mia Persson: A fast parallel algorithm for minimum-cost small integral flows. CoRR abs/1210.0340 (2012)

Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu: Optimal Cuts and Partitions in Tree Metrics in Polynomial Time. CoRR abs/1212.3471 (2012)

Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu: Optimal Cuts and Partitions in Tree Metrics in Polynomial Time. Electronic Colloquium on Computational Complexity (ECCC) 19: 176 (2012)

Andrzej Lingas: A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication. Algorithmica 61(1): 36-50 (2011)

Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski: Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Int. J. Found. Comput. Sci. 22(8): 1949-1969 (2011)

Peter Floderus, Andrzej Lingas, Mia Persson: Towards More Efficient Infection and Fire Fighting. CATS 2011: 69-74

Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk: Approximation Schemes for Capacitated Geometric Network Design. ICALP (1) 2011: 25-36

Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell: Unique Small Subgraphs Are Not Easier to Find. LATA 2011: 336-341

Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell: Counting and detecting small subgraphs via equations and matrix multiplication. SODA 2011: 1468-1476

Andrzej Lingas, Cui Di: Near Approximation of Maximum Weight Matching through Efficient Weight Reduction. TAMC 2011: 48-57

Ajit A. Diwan, Subir Kumar Ghosh, Partha P. Goswami, Andrzej Lingas: On joint triangulations of two sets of points in the plane. CoRR abs/1102.1235 (2011)

Andrzej Lingas, Dzmitry Sledneu: A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs. CoRR abs/1111.6519 (2011)

Anna Adamaszek, Artur Czumaj, Andrzej Lingas: Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k. Int. J. Found. Comput. Sci. 21(6): 893-904 (2010)

Piotr Berman, Marek Karpinski, Andrzej Lingas: Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. COCOON 2010: 226-234

Antonios Antoniadis, Andrzej Lingas: Approximability of Edge Matching Puzzles. SOFSEM 2010: 153-164

Jesper Jansson, Richard S. Lemence, Andrzej Lingas: The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. WABI 2010: 262-273

Cui Di, Andrzej Lingas: Near approximation of maximum weight matching through efficient weight reduction. CoRR abs/1012.5911 (2010)

Leszek Gasieniec, Miroslaw Kowaluk, Andrzej Lingas: Faster multi-witnesses for Boolean matrix multiplication. Inf. Process. Lett. 109(4): 242-247 (2009)

Andrzej Lingas, Eva-Marta Lundell: Efficient approximation algorithms for shortest cycles in undirected graphs. Inf. Process. Lett. 109(10): 493-498 (2009)

Andrzej Lingas, Martin Wahlen: An exact algorithm for subgraph homeomorphism. J. Discrete Algorithms 7(4): 464-468 (2009)

Artur Czumaj, Andrzej Lingas: Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication. SIAM J. Comput. 39(2): 431-444 (2009)

Andrzej Lingas: A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication. ESA 2009: 408-419

Anna Adamaszek, Artur Czumaj, Andrzej Lingas: PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k. ISAAC 2009: 994-1003

Frantisek Galcík, Leszek Gasieniec, Andrzej Lingas: Efficient broadcasting in known topology radio networks with long-range interference. PODC 2009: 230-239

Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski: Approximation Algorithms for Buy-at-Bulk Geometric Network Design. WADS 2009: 168-180

Piotr Berman, Marek Karpinski, Andrzej Lingas: Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications. CoRR abs/0904.2310 (2009)

Anna Adamaszek, Artur Czumaj, Andrzej Lingas: PTAS for k-tour cover problem on the plane for moderately large values of k. CoRR abs/0904.2576 (2009)

Kazuo Iwama, Andrzej Lingas, Masaki Okita: Max-Stretch Reduction for Tree Spanners. Algorithmica 50(2): 223-235 (2008)

Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson: Approximate clustering of incomplete fingerprints. J. Discrete Algorithms 6(1): 103-108 (2008)

Andrzej Lingas, Eva-Marta Lundell: Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs. LATIN 2008: 736-746

Miroslaw Kowaluk, Andrzej Lingas, Johannes Nowak: A Path Cover Technique for LCAs in Dags. SWAT 2008: 222-233

Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski: Linear-Time 3-Approximation Algorithm for the r -Star Covering Problem. WALCOM 2008: 157-168

Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Lingas, Martin Wahlen: Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. DISC 2008: 274-288

Artur Czumaj, Andrzej Lingas: Minimum k-Connected Geometric Networks. Encyclopedia of Algorithms 2008

Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell: Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. Algorithmica 48(3): 233-248 (2007)

Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Marek Karpinski, Christian Knauer, Andrzej Lingas: Embedding Point Sets into Plane Graphs of Small Dilation. Int. J. Comput. Geometry Appl. 17(3): 201-230 (2007)

Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson: On the Approximability of Maximum and Minimum Edge Clique Partition Problems. Int. J. Found. Comput. Sci. 18(2): 217-226 (2007)

Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski: Note on covering monotone orthogonal polygons with star-shaped polygons. Inf. Process. Lett. 104(6): 220-227 (2007)

Noga Alon, Andrzej Lingas, Martin Wahlen: Approximating the maximum clique minor and some subgraph homeomorphism problems. Theor. Comput. Sci. 374(1-3): 149-158 (2007)

Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas: Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theor. Comput. Sci. 380(1-2): 37-46 (2007)

Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas: Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. AAIM 2007: 337-345

Miroslaw Kowaluk, Andrzej Lingas: Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication. ESA 2007: 265-274

Artur Czumaj, Andrzej Lingas: Finding a heaviest triangle is not harder than matrix multiplication. SODA 2007: 986-994

Andrzej Lingas, Martin Wahlen: On Exact Complexity of Subgraph Homeomorphism. TAMC 2007: 256-261

Rolf Klein, Christos Levcopoulos, Andrzej Lingas: A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation. Comput. Geom. 34(1): 28-34 (2006)

Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas: Performing work in broadcast networks. Distributed Computing 18(6): 435-451 (2006)

Andrzej Lingas, Leszek Gasieniec: Preface. Theor. Comput. Sci. 354(3): 319 (2006)

Andrzej Lingas, Mia Persson, Martin Wahlen: Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The alpha<=d Case). CAAN 2006: 112-124

Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson: On the Approximability of Maximum and Minimum Edge Clique Partition Problems. CATS 2006: 101-105

Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas: Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Electronic Colloquium on Computational Complexity (ECCC) 13(111) (2006)

Artur Czumaj, Andrzej Lingas: Finding a Heaviest Triangle is not Harder than Matrix Multiplication. Electronic Colloquium on Computational Complexity (ECCC) 13(115) (2006)

Andrzej Lingas, Martin Wahlen: A note on maximum independent set and related problems on box graphs. Inf. Process. Lett. 93(4): 169-171 (2005)

Artur Czumaj, Magnús M. Halldórsson, Andrzej Lingas, Johan Nilsson: Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. Inf. Process. Lett. 94(2): 49-53 (2005)

Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel: Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. SIAM J. Comput. 35(1): 110-119 (2005)

Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson: Approximate Clustering of Fingerprint Vectors with Missing Values. CATS 2005: 57-60

Miroslaw Kowaluk, Andrzej Lingas: LCA Queries in Directed Acyclic Graphs. ICALP 2005: 241-248

Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas: Embedding Point Sets into Plane Graphs of Small Dilation. ISAAC 2005: 5-16

Kazuo Iwama, Andrzej Lingas, Masaki Okita: Max-stretch Reduction for Tree Spanners. WADS 2005: 122-133

Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas: A fast algorithm for approximating the detour of a polygonal chain. Comput. Geom. 27(2): 123-134 (2004)

Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas: Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs. Fundam. Inform. 62(3-4): 369-375 (2004)

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas: Approximation algorithms for Hamming clustering problems. J. Discrete Algorithms 2(2): 289-301 (2004)

Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell: Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. CPM 2004: 220-229

Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell: Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices. SWAT 2004: 248-259

Andrzej Lingas, Martin Wahlen: On approximation of the maximum clique minor containment problem and some subgraph homeomorphism problems. Electronic Colloquium on Computational Complexity (ECCC)(039) (2004)

Jesper Jansson, Andrzej Lingas: A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. Fundam. Inform. 56(1-2): 105-120 (2003)

Anders Dessmark, Andrzej Lingas, Andrzej Pelc: Trade-Offs Between Load and Degree in Virtual Path Layouts. Parallel Processing Letters 13(3): 485-496 (2003)

Andrzej Lingas, Martin Wahlen: Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs. COCOON 2003: 50-56

Artur Czumaj, Andrzej Lingas, Johan Nilsson: Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. ISAAC 2003: 544-553

Leszek Gasieniec, Andrzej Lingas: An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data. WADS 2003: 329-339

Andrzej Lingas, Bengt J. Nilsson (Eds.): Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings. Lecture Notes in Computer Science 2751, Springer 2003, isbn 3-540-40543-7

Fedor V. Fomin, Andrzej Lingas: Approximation algorithms for time-dependent orienteering. Inf. Process. Lett. 83(2): 57-62 (2002)

Leszek Gasieniec, Andrzej Lingas: On adaptive deterministic gossiping in ad hoc radio networks. Inf. Process. Lett. 83(2): 89-93 (2002)

Malin Christersson, Leszek Gasieniec, Andrzej Lingas: Gossiping with Bounded Size Messages in ad hoc Radio Networks. ICALP 2002: 377-389

Artur Czumaj, Andrzej Lingas, Hairong Zhao: Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. ICALP 2002: 973-984

Andrzej Lingas: A Geometric Approach to Boolean Matrix Multiplication. ISAAC 2002: 501-510

Leszek Gasieniec, Andrzej Lingas: On adaptive deterministic gossiping in ad hoc radio networks. SODA 2002: 689-690

Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell: Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains. SWAT 2002: 80-89

Andrzej Lingas, Hans Olsson, Anna Östlin: Efficient Merging and Construction of Evolutionary Trees. J. Algorithms 41(1): 41-51 (2001)

Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe: Approximation algorithms for maximum two-dimensional pattern matching. Theor. Comput. Sci. 255(1-2): 51-62 (2001)

Jesper Jansson, Andrzej Lingas: A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. CPM 2001: 232-240

Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis: Oblivious gossiping in ad-hoc radio networks. DIAL-M 2001: 44-51

Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas: A Fast Algorithm for Approximating the Detour of a Polygonal Chain. ESA 2001: 321-332

Fedor V. Fomin, Andrzej Lingas: Approximation Algorithms for Time-Dependent Orienteering. FCT 2001: 508-515

Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas: The do-all problem in broadcast networks. PODC 2001: 117-127

Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel: Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. STACS 2001: 365-375

Andreas Björklund, Andrzej Lingas: Fast Boolean Matrix Multiplication for Highly Clustered Data. WADS 2001: 258-263

Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski: Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. Algorithmica 27(3): 337-347 (2000)

Tomas Kovacs, Andrzej Lingas: Maximum packing for biconnected outerplanar graphs. Discrete Applied Mathematics 100(1-2): 85-94 (2000)

Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski: Maximum packing for k-connected partial k-trees in polynomial time. Theor. Comput. Sci. 236(1-2): 179-191 (2000)

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas: Approximation Algorithms for Hamming Clustering Problems. CPM 2000: 108-118

Artur Czumaj, Andrzej Lingas: Fast Approximation Schemes for Euclidean Multi-connectivity Problems. ICALP 2000: 856-868

Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas: Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs. Electronic Colloquium on Computational Complexity (ECCC) 7(51) (2000)

Klaus Jansen, Marek Karpinski, Andrzej Lingas: A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs. Electronic Colloquium on Computational Complexity (ECCC) 7(64) (2000)

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin: On the Complexity of Constructing Evolutionary Trees. J. Comb. Optim. 3(2-3): 183-197 (1999)

Krzysztof Diks, Andrzej Lingas, Andrzej Pelc: An Optimal Algorithm for Broadcasting Multiple Messages in Trees. J. Parallel Distrib. Comput. 59(3): 465-474 (1999)

Andrzej Lingas, Hans Olsson, Anna Östlin: Efficient Merging, Construction, and Maintenance of Evolutionary Trees. ICALP 1999: 544-553

Artur Czumaj, Andrzej Lingas: On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem. SODA 1999: 281-290

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas: Efficient Approximation Algorithms for the Hamming Center Problem. SODA 1999: 905-906

Ming-Yang Kao, Andrzej Lingas, Anna Östlin: Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions. STACS 1999: 184-196

Anders Dessmark, Oscar Garrido, Andrzej Lingas: A Note on Parallel Complexity of Maximum f-Matching. Inf. Process. Lett. 65(2): 107-109 (1998)

Anders Dessmark, Andrzej Lingas: Improved Bounds for Integer Sorting in the EREW PRAM Model. J. Parallel Distrib. Comput. 48(1): 64-70 (1998)

Andrzej Lingas, V. Soltan: Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. Theory Comput. Syst. 31(5): 507-538 (1998)

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin: Inferring Ordered Trees from Local Constraints. CATS 1998: 67-76

Andrzej Lingas: Subexponential-time algorithms for minimum weight triangulations and related problems. CCCG 1998

Artur Czumaj, Andrzej Lingas: A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. ICALP 1998: 682-694

Anders Dessmark, Carsten Dorgerloh, Andrzej Lingas, Juergen Wirtgen: Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs. IPPS/SPDP Workshops 1998: 392-399

Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto: Optimal Broadcasting in Almost Trees and Partial k-trees. STACS 1998: 432-443

Andrzej Lingas, Anil Maheshwari: A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. Parallel Processing Letters 7(1): 3-11 (1997)

Piotr Berman, Andrzej Lingas: A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. Theor. Comput. Sci. 174(1-2): 193-202 (1997)

Andrzej Lingas: Maximum Tree-Packing in Time O(n^5/2). Theor. Comput. Sci. 181(2): 307-316 (1997)

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin: On the Complexity of Computing Evolutionary Trees. COCOON 1997: 134-145

Krzysztof Diks, Andrzej Lingas, Andrzej Pelc: An Optimal Algorithm for Broadcasting Multiple Messages in Trees. SIROCCO 1997: 69-80

Tomas Kovacs, Andrzej Lingas: Maximum Packing for Biconnected Outerplanar Graphs. TAPSOFT 1997: 393-404

Rolf Klein, Andrzej Lingas: A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. Int. J. Comput. Geometry Appl. 6(3): 263-278 (1996)

Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter: A Simple Randomized Parallel Algorithm for Maximal f-Matchings. Inf. Process. Lett. 57(2): 83-87 (1996)

Bengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind: On 2-QBF Truth Testing in Parallel. Inf. Process. Lett. 57(2): 89-93 (1996)

Oscar Garrido, Pierre Kelsen, Andrzej Lingas: A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity. Inf. Process. Lett. 58(2): 55-58 (1996)

Rolf G. Karlsson, Andrzej Lingas: Guest Editor's Foreword. Nord. J. Comput. 3(4): 293-294 (1996)

Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe: Approximation Algorithms for Maximum Two-Dimensional Pattern Matching. CPM 1996: 348-360

Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski: Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. ESA 1996: 501-513

Andrzej Lingas, V. Soltan: Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. ISAAC 1996: 315-325

Anders Dessmark, Andrzej Lingas: On the Power of Nonconservative PRAM. MFCS 1996: 303-311

Rolf G. Karlsson, Andrzej Lingas (Eds.): Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings. Lecture Notes in Computer Science 1097, Springer 1996, isbn 3-540-61422-2

Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack: Optimal Parallel Algorithms for Rectilinear Link-Distance Problems. Algorithmica 14(3): 261-289 (1995)

Rolf Klein, Andrzej Lingas: Manhattonian proximity in a simple polygon. Int. J. Comput. Geometry Appl. 5: 53-74 (1995)

Hristo Djidjev, Andrzej Lingas: On computing Voronoi diagrams for sorted point sets. Int. J. Comput. Geometry Appl. 5(3): 327-337 (1995)

Anders Dessmark, Andrzej Lingas, Anil Maheshwari: Multilist Layering: Complexity and Applications. Theor. Comput. Sci. 141(1&2): 337-350 (1995)

Andrzej Lingas: Maximum Tree-Packing in Time O(n^5/2). COCOON 1995: 121-130

Rolf Klein, Andrzej Lingas: Fast Skeleton Construction. ESA 1995: 582-595

Christos Levcopoulos, Andrzej Lingas, Cao Wang: On Parallel Complexity of Planar Triangulations. FSTTCS 1995: 413-427

Andrzej Lingas, Asish Mukhopadhyay: A Linear-time Construction of the Relative Neighborhood Graph within a Histogram. WADS 1995: 228-238

Andrzej Lingas: A Linear-time Construction of the Relative Neighborhood Graph From the Delaunay Triangulation. Comput. Geom. 4: 199-208 (1994)

Andrzej Lingas: Editor's Foreword. Nord. J. Comput. 1(3): 273 (1994)

Rolf Klein, Andrzej Lingas: Hamiltonian Abstract Voronoi Diagrams in Linear Time. ISAAC 1994: 11-19

Anders Dessmark, Andrzej Lingas, Oscar Garrido: On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. MFCS 1994: 316-325

Anil Maheshwari, Andrzej Lingas: A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. STACS 1994: 487-495

Piotr Berman, Andrzej Lingas: A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. SWAT 1994: 73-82

Krzysztof Diks, Oscar Garrido, Andrzej Lingas: Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. Int. J. Found. Comput. Sci. 4(2): 179-192 (1993)

Rolf Klein, Andrzej Lingas: A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon. CCCG 1993: 370-374

Rolf Klein, Andrzej Lingas: A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. Symposium on Computational Geometry 1993: 124-132

Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack: Parallel Algorithms for Rectilinear Link Distance Problems. IPPS 1993: 65-72

Anders Dessmark, Klaus Jansen, Andrzej Lingas: The Maximum k-Dependent and f-Dependent Set Problem. ISAAC 1993: 88-98

Anders Dessmark, Andrzej Lingas, Anil Maheshwari: Multi-List Ranking: Complexity and Applications. STACS 1993: 306-316

Andrzej Lingas, Rolf G. Karlsson, Svante Carlsson (Eds.): Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings. Lecture Notes in Computer Science 700, Springer 1993, isbn 3-540-56939-1

Christos Levcopoulos, Andrzej Lingas: There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees. Algorithmica 8(3): 251-256 (1992)

Christos Levcopoulos, Andrzej Lingas: Fast Algorithms for Greedy Triangulation. BIT 32(2): 280-296 (1992)

Hristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack: An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon. Discrete & Computational Geometry 8: 131-152 (1992)

Rolf Klein, Andrzej Lingas: Manhattonian Proximity in a Simple Polygon. Symposium on Computational Geometry 1992: 312-319

Christos Levcopoulos, Andrzej Lingas: C-sensitive Triangulations Approximate the MinMax Length Triangulation. FSTTCS 1992: 104-115

Esther Jennings, Andrzej Lingas: On the Relationship among Constrained Geometric Structures. ISAAC 1992: 289-298

Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter: A Simple Randomized Parallel Algorithm for Maximal f-Matching. LATIN 1992: 165-176

Andrzej Lingas: An Unfeasible Matching Problem. BIT 31(4): 591-597 (1991)

Andrzej Lingas: Bit Complexity of Matrix Products. Inf. Process. Lett. 38(5): 237-242 (1991)

Christos Levcopoulos, Andrzej Lingas: Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case. ICCI 1991: 139-148

Esther Jennings, Andrzej Lingas, Lenka Motyckova: Dynamic Detection of Forest of Tree-Connected Meshes. ICPP (3) 1991: 300-301

Krzysztof Diks, Oscar Garrido, Andrzej Lingas: Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. ISA 1991: 385-395

Hristo Djidjev, Andrzej Lingas: On Computing the Voronoi Diagram for Restricted Planar Figures. WADS 1991: 54-64

Andrzej Lingas: A Note on a Parallel Heuristic for Minimum. Bulletin of the EATCS 42: 174-177 (1990)

Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter: Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. FSTTCS 1990: 204-214

Andrzej Lingas: Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs. SIGAL International Symposium on Algorithms 1990: 447-457

Christos Levcopoulos, Andrzej Lingas: Fast Algorithms for Greedy Triangulation. SWAT 1990: 238-250

Andrzej Lingas, Marek Karpinski: Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching. Inf. Process. Lett. 30(1): 27-32 (1989)

Andrzej Lingas: Voronoi Diagrams with Barriers and the Shortest Diagonal Problem. Inf. Process. Lett. 32(4): 191-198 (1989)

Andrzej Lingas: Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time. Theor. Comput. Sci. 63(3): 295-302 (1989)

Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack: Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems. Theor. Comput. Sci. 66(2): 181-203 (1989)

Andrzej Lingas, Andrzej Proskurowski: On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs. Theor. Comput. Sci. 68(2): 155-173 (1989)

Christos Levcopoulos, Andrzej Lingas: Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees. Optimal Algorithms 1989: 9-13

Hristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack: An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. STACS 1989: 96-107

James A. Dean, Andrzej Lingas, Jörg-Rüdiger Sack: Recognizing polygons, or how to spy. The Visual Computer 3(6): 344-355 (1988)

Andrzej Lingas, Maciej M. Syslo: A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs. ICALP 1988: 394-409

Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas: An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. SWAT 1988: 190-198

Andrzej Lingas: Greedy Triangulation acn be Efficiently Implemented in the Average Case (Extended Abstract). WG 1988: 253-261

Rolf G. Karlsson, Andrzej Lingas (Eds.): SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings. Lecture Notes in Computer Science 318, Springer 1988, isbn 3-540-19487-8

Christos Levcopoulos, Andrzej Lingas: On Approximation Behavior of the Greedy Triangulation for Convex Polygons. Algorithmica 2: 15-193 (1987)

Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack: Algorithms for Minimum Length Partitions of Polygons. BIT 27(4): 474-479 (1987)

Andrzej Lingas, Andrzej Proskurowski: Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs. FSTTCS 1987: 79-94

Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack: Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract). ICALP 1987: 376-385

Andrzej Lingas: On Approximation Behavior and Implementation of the Greedy Triangulation for Convex Planar Point Sets. Symposium on Computational Geometry 1986: 72-79

Andrzej Lingas: Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time. STACS 1986: 98-103

Andrzej Lingas: On partitioning polygons. Symposium on Computational Geometry 1985: 288-295

Christos Levcopoulos, Andrzej Lingas: Bounds on the Length of Convex Partitions of Polygons. FSTTCS 1984: 279-295

Christos Levcopoulos, Andrzej Lingas: Covering Polygons with Minimum Number of Rectangles. STACS 1984: 63-72

Andrzej Lingas: An Application of Maximum Bipartite C-Matching to Subtree Isomorphism. CAAP 1983: 284-299

Andrzej Lingas: The Greedy and Delauney Triangulations are not Bad in the Average Case and Minimum Weight Geometric Triangulation of Multi-Connected Polygons is NP-Complete. FCT 1983: 270-284

Andrzej Lingas: Heuristics for minimum edge length rectangular partitions of rectilinear figures. Theoretical Computer Science 1983: 199-210

Andrzej Lingas: The Power of Non-Rectilinear Holes. ICALP 1982: 369-383

Andrzej Lingas: Certain Algorithms for Subgraph Isomorphism Problems. CAAP 1981: 290-307

Andrzej Lingas: The complexity of distributive computations. FCT 1979: 262-268

Andrzej Lingas: A PSPACE Complete Problem Related to a Pebble Game. ICALP 1978: 300-321