| 2025 | FAW | Multiplication of 0-1 Matrices via Clustering. | Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas, Mia Persson |
| 2024 | COCOON | The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. | Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Quan Xue |
| 2024 | EuroPar | Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique. | Andrzej Lingas |
| 2023 | COCOON | $(\min ,+)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences. | Andrzej Lingas, Mia Persson |
| 2023 | IWOCA | Finding Small Complete Subgraphs Efficiently. | Adrian Dumitrescu, Andrzej Lingas |
| 2023 | SOFSEM | Lower Bounds for Monotone q-Multilinear Boolean Circuits. | Andrzej Lingas |
| 2021 | CIAC | Online and Approximate Network Construction from Bounded Connectivity Constraints. | Jesper Jansson, Christos Levcopoulos, Andrzej Lingas |
| 2021 | LAGOS | Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism. | Andrzej Lingas |
| 2021 | OPODIS | Efficient Assignment of Identities in Anonymous Populations. | Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas |
| 2019 | FAW | Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. | Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson |
| 2019 | FCT | Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. | Miroslaw Kowaluk, Andrzej Lingas |
| 2019 | STACS | Lower Bounds for DeMorgan Circuits of Bounded Negation Width. | Stasys Jukna, Andrzej Lingas |
| 2017 | FCT | The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents). | Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbanska, Pawel Zylinski |
| 2017 | RECOMB | Determining the Consistency of Resolved Triplets and Fan Triplets. | Jesper Jansson, Andrzej Lingas, Ramesh Rajaby, Wing-Kin Sung |
| 2017 | SOFSEM | Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). | Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik |
| 2017 | TAMC | Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution. | Andrzej Lingas |
| 2017 | TAMC | Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model. | Andrzej Lingas, Mia Persson, Dzmitry Sledneu |
| 2017 | WALCOM | A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques. | Miroslaw Kowaluk, Andrzej Lingas |
| 2015 | COCOA | Extreme Witnesses and Their Applications. | Andrzej Lingas, Mia Persson |
| 2015 | CPM | The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. | Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell |
| 2015 | ICALP | A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set. | Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu |
| 2014 | FUN | Clearing Connections by Few Agents. | Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski |
| 2014 | ISAAC | 3D Rectangulations and Geometric Matrix Multiplication. | Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu |
| 2014 | ISAAC | Efficiently Correcting Matrix Products. | Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas |
| 2014 | LATIN | Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. | Rolf Klein, Christos Levcopoulos, Andrzej Lingas |
| 2013 | ISAAC | Detecting and Counting Small Pattern Graphs. | Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell |
| 2012 | COCOON | Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? | Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell |
| 2012 | CPM | Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles. | Jesper Jansson, Andrzej Lingas |
| 2012 | EuroPar | A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows. | Andrzej Lingas, Mia Persson |
| 2012 | SOFSEM | A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs. | Andrzej Lingas, Dzmitry Sledneu |
| 2011 | ICALP | Approximation Schemes for Capacitated Geometric Network Design. | Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk |
| 2011 | LATA | Unique Small Subgraphs Are Not Easier to Find. | Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell |
| 2011 | SODA | Counting and detecting small subgraphs via equations and matrix multiplication. | Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell |
| 2011 | TAMC | Near Approximation of Maximum Weight Matching through Efficient Weight Reduction. | Andrzej Lingas, Cui Di |
| 2010 | COCOON | Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. | Piotr Berman, Marek Karpinski, Andrzej Lingas |
| 2010 | SOFSEM | Approximability of Edge Matching Puzzles. | Antonios Antoniadis, Andrzej Lingas |
| 2010 | WABI | The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. | Jesper Jansson, Richard S. Lemence, Andrzej Lingas |
| 2009 | ESA | A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication. | Andrzej Lingas |
| 2009 | ISAAC | PTAS for | Anna Adamaszek, Artur Czumaj, Andrzej Lingas |
| 2009 | PODC | Efficient broadcasting in known topology radio networks with long-range interference. | Frantisek Galck, Leszek Gasieniec, Andrzej Lingas |
| 2009 | WADS | Approximation Algorithms for Buy-at-Bulk Geometric Network Design. | Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski |
| 2008 | LATIN | Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs. | Andrzej Lingas, Eva-Marta Lundell |
| 2008 | WALCOM | Linear-Time 3-Approximation Algorithm for the | Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski |
| 2007 | AAIM | Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. | Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas |
| 2007 | ESA | Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication. | Miroslaw Kowaluk, Andrzej Lingas |
| 2007 | SODA | Finding a heaviest triangle is not harder than matrix multiplication. | Artur Czumaj, Andrzej Lingas |
| 2007 | TAMC | On Exact Complexity of Subgraph Homeomorphism. | Andrzej Lingas, Martin Wahlen |
| 2005 | ICALP | LCA Queries in Directed Acyclic Graphs. | Miroslaw Kowaluk, Andrzej Lingas |
| 2005 | ISAAC | Embedding Point Sets into Plane Graphs of Small Dilation. | Annette Ebbers-Baumann, Ansgar Grne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas |
| 2005 | WADS | Max-stretch Reduction for Tree Spanners. | Kazuo Iwama, Andrzej Lingas, Masaki Okita |
| 2004 | CPM | Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. | Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell |
| 2003 | COCOON | Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs. | Andrzej Lingas, Martin Wahlen |
| 2003 | ISAAC | Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. | Artur Czumaj, Andrzej Lingas, Johan Nilsson |
| 2003 | WADS | An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data. | Leszek Gasieniec, Andrzej Lingas |
| 2002 | ICALP | Gossiping with Bounded Size Messages in ad hoc Radio Networks. | Malin Christersson, Leszek Gasieniec, Andrzej Lingas |
| 2002 | ICALP | Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. | Artur Czumaj, Andrzej Lingas, Hairong Zhao |
| 2002 | ISAAC | A Geometric Approach to Boolean Matrix Multiplication. | Andrzej Lingas |
| 2002 | SODA | On adaptive deterministic gossiping in ad hoc radio networks. | Leszek Gasieniec, Andrzej Lingas |
| 2001 | CPM | A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. | Jesper Jansson, Andrzej Lingas |
| 2001 | ESA | A Fast Algorithm for Approximating the Detour of a Polygonal Chain. | Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas |
| 2001 | FCT | Approximation Algorithms for Time-Dependent Orienteering. | Fedor V. Fomin, Andrzej Lingas |
| 2001 | PODC | The do-all problem in broadcast networks. | Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas |
| 2001 | STACS | Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. | Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel |
| 2001 | WADS | Fast Boolean Matrix Multiplication for Highly Clustered Data. | Andreas Bjrklund, Andrzej Lingas |
| 2000 | CPM | Approximation Algorithms for Hamming Clustering Problems. | Leszek Gasieniec, Jesper Jansson, Andrzej Lingas |
| 2000 | ICALP | Fast Approximation Schemes for Euclidean Multi-connectivity Problems. | Artur Czumaj, Andrzej Lingas |
| 1999 | ICALP | Efficient Merging, Construction, and Maintenance of Evolutionary Trees. | Andrzej Lingas, Hans Olsson, Anna stlin |
| 1999 | SODA | On Approximability of the Minimum-Cost | Artur Czumaj, Andrzej Lingas |
| 1999 | SODA | Efficient Approximation Algorithms for the Hamming Center Problem. | Leszek Gasieniec, Jesper Jansson, Andrzej Lingas |
| 1999 | STACS | Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions. | Ming-Yang Kao, Andrzej Lingas, Anna stlin |
| 1998 | ICALP | A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. | Artur Czumaj, Andrzej Lingas |
| 1998 | STACS | Optimal Broadcasting in Almost Trees and Partial k-trees. | Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto |
| 1997 | COCOON | On the Complexity of Computing Evolutionary Trees. | Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna stlin |
| 1997 | SIROCCO | An Optimal Algorithm for Broadcasting Multiple Messages in Trees. | Krzysztof Diks, Andrzej Lingas, Andrzej Pelc |
| 1996 | CPM | Approximation Algorithms for Maximum Two-Dimensional Pattern Matching. | Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe |
| 1996 | ESA | Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. | Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski |
| 1996 | ISAAC | Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. | Andrzej Lingas, Valeriu Soltan |
| 1996 | MFCS | On the Power of Nonconservative PRAM. | Anders Dessmark, Andrzej Lingas |
| 1995 | COCOON | Maximum Tree-Packing in Time O(n | Andrzej Lingas |
| 1995 | ESA | Fast Skeleton Construction. | Rolf Klein, Andrzej Lingas |
| 1995 | WADS | A Linear-time Construction of the Relative Neighborhood Graph within a Histogram. | Andrzej Lingas, Asish Mukhopadhyay |
| 1994 | ISAAC | Hamiltonian Abstract Voronoi Diagrams in Linear Time. | Rolf Klein, Andrzej Lingas |
| 1994 | MFCS | On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. | Anders Dessmark, Andrzej Lingas, Oscar Garrido |
| 1994 | STACS | A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. | Anil Maheshwari, Andrzej Lingas |
| 1993 | ISAAC | The Maximum k-Dependent and f-Dependent Set Problem. | Anders Dessmark, Klaus Jansen, Andrzej Lingas |
| 1993 | STACS | Multi-List Ranking: Complexity and Applications. | Anders Dessmark, Andrzej Lingas, Anil Maheshwari |
| 1992 | ISAAC | On the Relationship among Constrained Geometric Structures. | Esther Jennings, Andrzej Lingas |
| 1992 | LATIN | A Simple Randomized Parallel Algorithm for Maximal | Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter |
| 1991 | ICCI | Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case. | Christos Levcopoulos, Andrzej Lingas |
| 1991 | ICPP | Dynamic Detection of Forest of Tree-Connected Meshes. | Esther Jennings, Andrzej Lingas, Lenka Motyckova |
| 1991 | WADS | On Computing the Voronoi Diagram for Restricted Planar Figures. | Hristo N. Djidjev, Andrzej Lingas |
| 1989 | STACS | An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. | Hristo N. Djidjev, Andrzej Lingas, Jrg-Rdiger Sack |
| 1988 | ICALP | A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs. | Andrzej Lingas, Maciej M. Syslo |
| 1988 | WG | Greedy Triangulation acn be Efficiently Implemented in the Average Case (Extended Abstract). | Andrzej Lingas |
| 1987 | ICALP | Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract). | Christos Levcopoulos, Andrzej Lingas, Jrg-Rdiger Sack |
| 1986 | STACS | Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time. | Andrzej Lingas |
| 1984 | STACS | Covering Polygons with Minimum Number of Rectangles. | Christos Levcopoulos, Andrzej Lingas |
| 1983 | FCT | The Greedy and Delauney Triangulations are not Bad in the Average Case and Minimum Weight Geometric Triangulation of Multi-Connected Polygons is NP-Complete. | Andrzej Lingas |
| 1983 | ICLP | A Note on Computational Complexity of Logic Programs. | Andrzej Lingas |
| 1982 | ICALP | The Power of Non-Rectilinear Holes. | Andrzej Lingas |
| 1979 | FCT | The complexity of distributive computations. | Andrzej Lingas |
| 1978 | ICALP | A PSPACE Complete Problem Related to a Pebble Game. | Andrzej Lingas |