Andrzej Lingas

305 papers A* 18A 16B 45C 12Misc 7Journal 155Unranked 46

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	Approximate All-Pairs Hamming Distances and 0-1 Matrix Multiplication. ICAA Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2026	J	`jnl`	Fast Approximate ℓ-Center Clustering in High-Dimensional Spaces. Algorithms Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2026	J	`jnl`	Two algorithms for shortest-paths problems in edge-weighted directed graphs. Theor. Comput. Sci. Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2025	J	`jnl`	(min⁡,+) matrix and vector products for inputs decomposable into few monotone subsequences. Theor. Comput. Sci. Andrzej Lingas, Mia Persson
2025	J	`jnl`	A Note on Solving Problems of Substantially Super-linear Complexity in No(1) Rounds of the Congested Clique. Parallel Process. Lett. Andrzej Lingas
2025	J	`jnl`	Approximate all-pairs Hamming distances and 0-1 matrix multiplication. CoRR Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2025	J	`jnl`	Deterministic protocols for Voronoi diagrams and triangulations of planar point sets on the congested clique. Theor. Comput. Sci. Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Valentin Polishchuk, Quan Xue
2025	J	`jnl`	Efficient assignment of identities in anonymous populations. Inf. Comput. Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2025	J	`jnl`	Fast approximate ℓ-center clustering in high dimensional spaces. CoRR Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2025	—	`conf`	Multiplication of 0-1 Matrices via Clustering. IJTCS-FAW Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2025	J	`jnl`	Multiplication of 0-1 matrices via clustering. CoRR Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
2024	J	`jnl`	A Note on Solving Problems of Substantially Super-linear Complexity in N CoRR Andrzej Lingas
2024	—	`conf`	Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique. Euro-Par (3) Andrzej Lingas
2024	J	`jnl`	Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique. CoRR Andrzej Lingas
2024	J	`jnl`	Perpetual maintenance of machines with different urgency requirements. J. Comput. Syst. Sci. Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
2024	J	`jnl`	Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products. Int. J. Found. Comput. Sci. Miroslaw Kowaluk, Andrzej Lingas
2024	—	`conf`	The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. COCOON (2) Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Quan Xue
2024	J	`jnl`	The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. CoRR Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2023	—	`conf`	$(\min ,+)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences. COCOON (2) Andrzej Lingas, Mia Persson
2023	J	`jnl`	(min, +) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences. CoRR Andrzej Lingas, Mia Persson
2023	—	`conf`	Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CCCG Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2023	J	`jnl`	Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CoRR Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2023	C	`conf`	Finding Small Complete Subgraphs Efficiently. IWOCA Adrian Dumitrescu, Andrzej Lingas
2023	J	`jnl`	Finding Small Complete Subgraphs Efficiently. CoRR Adrian Dumitrescu, Andrzej Lingas
2023	J	`jnl`	Improved Lower Bounds for Monotone q-Multilinear Boolean Circuits. CoRR Andrzej Lingas, Mia Persson
2023	B	`conf`	Lower Bounds for Monotone q-Multilinear Boolean Circuits. SOFSEM Andrzej Lingas
2023	J	`jnl`	On parallel time in population protocols. Inf. Process. Lett. Artur Czumaj, Andrzej Lingas
2023	J	`jnl`	Online and Approximate Network Construction from Bounded Connectivity Constraints. Int. J. Found. Comput. Sci. Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2023	J	`jnl`	Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. Algorithmica Miroslaw Kowaluk, Andrzej Lingas
2022	J	`jnl`	A Multi-Dimensional Matrix Product - A Natural Tool for Parameterized Graph Algorithms. Algorithms Miroslaw Kowaluk, Andrzej Lingas
2022	J	`jnl`	A Note on Lower Bounds for Monotone Multilinear Boolean Circuits. Electron. Colloquium Comput. Complex. Andrzej Lingas
2022	—	`conf`	An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs. CALDAM Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2022	J	`jnl`	Lower bounds for Boolean circuits of bounded negation width. J. Comput. Syst. Sci. Stasys Jukna, Andrzej Lingas
2022	J	`jnl`	Perpetual maintenance of machines with different urgency requirements. CoRR Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
2021	J	`jnl`	An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs. CoRR Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2021	J	`jnl`	Breaking the hegemony of the triangle method in clique detection. CoRR Miroslaw Kowaluk, Andrzej Lingas
2021	C	`conf`	Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism. LAGOS Andrzej Lingas
2021	B	`conf`	Efficient Assignment of Identities in Anonymous Populations. OPODIS Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2021	J	`jnl`	Efficient Assignment of Identities in Anonymous Populations. CoRR Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2021	J	`jnl`	On Truly Parallel Time in Population Protocols. CoRR Artur Czumaj, Andrzej Lingas
2021	C	`conf`	Online and Approximate Network Construction from Bounded Connectivity Constraints. CIAC Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2021	J	`jnl`	Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases. J. Comput. Syst. Sci. Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson
2021	—	`conf`	Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products. CALDAM Miroslaw Kowaluk, Andrzej Lingas
2020	J	`jnl`	A simple approach to nondecreasing paths. Inf. Process. Lett. Miroslaw Kowaluk, Andrzej Lingas
2020	J	`jnl`	Computing the Boolean Product of Two Int. J. Unconv. Comput. Andrzej Lingas, Mia Persson
2020	J	`jnl`	Computing the Boolean product of two n\times n Boolean matrices using O(n^2) mechanical operation. CoRR Andrzej Lingas, Mia Persson
2020	J	`jnl`	Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism. CoRR Andrzej Lingas
2020	J	`jnl`	Graphs with equal domination and covering numbers. J. Comb. Optim. Andrzej Lingas, Mateusz Miotk, Jerzy Topp, Pawel Zylinski
2020	J	`jnl`	Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. CoRR Miroslaw Kowaluk, Andrzej Lingas
2020	J	`jnl`	Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth. Theor. Comput. Sci. Andrzej Lingas
2020	—	`conf`	Solving Hard Problems by Protein Folding? TPNC Andrzej Lingas
2019	J	`jnl`	A fast deterministic detection of small pattern graphs in graphs without large cliques. Theor. Comput. Sci. Miroslaw Kowaluk, Andrzej Lingas
2019	J	`jnl`	Clearing directed subgraphs by mobile agents: Variations on covering with paths. J. Comput. Syst. Sci. Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski
2019	A	`conf`	Lower Bounds for DeMorgan Circuits of Bounded Negation Width. STACS Stasys Jukna, Andrzej Lingas
2019	J	`jnl`	On a Fire Fighter's Problem. Int. J. Found. Comput. Sci. Rolf Klein, Elmar Langetepe, Barbara Schwarzwald, Christos Levcopoulos, Andrzej Lingas
2019	Misc	`conf`	Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. FAW Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson
2019	B	`conf`	Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. FCT Miroslaw Kowaluk, Andrzej Lingas
2019	J	`jnl`	The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets. Discret. Appl. Math. Katharina Dannenberg, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
2018	J	`jnl`	3D Rectangulations and Geometric Matrix Multiplication. Algorithmica Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu
2018	J	`jnl`	A QPTAS for the base of the number of crossing-free structures on a planar point set. Theor. Comput. Sci. Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2018	J	`jnl`	Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. Algorithms Rolf Klein, Christos Levcopoulos, Andrzej Lingas
2018	J	`jnl`	Approximation Schemes for Capacitated Geometric Network Design. SIAM J. Discret. Math. Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk
2018	—	`ch.`	Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. Handbook of Approximation Algorithms and Metaheuristics (2) Artur Czumaj, Andrzej Lingas
2018	J	`jnl`	Are unique subgraphs not easier to find? Inf. Process. Lett. Miroslaw Kowaluk, Andrzej Lingas
2018	J	`jnl`	Determining the Consistency of Resolved Triplets and Fan Triplets. J. Comput. Biol. Jesper Jansson, Andrzej Lingas, Ramesh Rajaby, Wing-Kin Sung
2018	J	`jnl`	Extreme Witnesses and Their Applications. Algorithmica Andrzej Lingas, Mia Persson
2018	J	`jnl`	Forest-like abstract Voronoi diagrams in linear time. Comput. Geom. Cecilia Bohler, Rolf Klein, Andrzej Lingas, Chih-Hung Liu
2018	J	`jnl`	Lower Bounds for Circuits of Bounded Negation Width. Electron. Colloquium Comput. Complex. Stasys Jukna, Andrzej Lingas
2018	A	`conf`	Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depth. CCC Andrzej Lingas
2018	J	`jnl`	Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depth. Electron. Colloquium Comput. Complex. Andrzej Lingas
2017	B	`conf`	A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques. WALCOM Miroslaw Kowaluk, Andrzej Lingas
2017	B	`conf`	Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). SOFSEM Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
2017	C	`conf`	Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model. TAMC Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2017	B	`conf`	Determining the Consistency of Resolved Triplets and Fan Triplets. RECOMB Jesper Jansson, Andrzej Lingas, Ramesh Rajaby, Wing-Kin Sung
2017	J	`jnl`	Efficiently Correcting Matrix Products. Algorithmica Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama
2017	J	`jnl`	The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents). CoRR Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski
2017	B	`conf`	The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents). FCT Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbanska, Pawel Zylinski
2017	C	`conf`	Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution. TAMC Andrzej Lingas
2016	J	`jnl`	Efficiently Correcting Matrix Products. CoRR Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama
2016	—	`ch.`	Minimum Encyclopedia of Algorithms Artur Czumaj, Andrzej Lingas
2015	J	`jnl`	A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows. Algorithmica Andrzej Lingas, Mia Persson
2015	—	`conf`	A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set. ICALP (1) Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2015	J	`jnl`	Detecting and Counting Small Pattern Graphs. SIAM J. Discret. Math. Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2015	J	`jnl`	Detecting monomials with k distinct variables. Inf. Process. Lett. Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2015	C	`conf`	Extreme Witnesses and Their Applications. COCOA Andrzej Lingas, Mia Persson
2015	J	`jnl`	Induced subgraph isomorphism: Are some patterns substantially easier than others? Theor. Comput. Sci. Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2015	B	`conf`	The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. CPM Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
2014	B	`conf`	3D Rectangulations and Geometric Matrix Multiplication. ISAAC Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu
2014	J	`jnl`	A QPTAS for the Base of the Number of Triangulations of a Planar Point Set. CoRR Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2014	J	`jnl`	A note on a QPTAS for maximum weight triangulation of planar point sets. Inf. Process. Lett. Christos Levcopoulos, Andrzej Lingas
2014	B	`conf`	Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. LATIN Rolf Klein, Christos Levcopoulos, Andrzej Lingas
2014	Misc	`conf`	Clearing Connections by Few Agents. FUN Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski
2014	J	`jnl`	Computing the rooted triplet distance between galled trees by counting triangles. J. Discrete Algorithms Jesper Jansson, Andrzej Lingas
2014	J	`jnl`	Corrigendum to "Note on covering monotone orthogonal polygons" [Inf. Process. Lett. 104(6) (2007) 220-227]. Inf. Process. Lett. Andrzej Lingas, Leonidas Palios, Agnieszka Wasylewicz, Pawel Zylinski
2014	J	`jnl`	Efficient Algorithms for Subgraph Listing. Algorithms Niklas Zechner, Andrzej Lingas
2014	B	`conf`	Efficiently Correcting Matrix Products. ISAAC Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas
2014	J	`jnl`	Iterative merging heuristics for correlation clustering. Int. J. Metaheuristics Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2014	J	`jnl`	Vector convolution in O(n) steps and matrix multiplication in O(n^2) steps : -). Electron. Colloquium Comput. Complex. Andrzej Lingas
2013	J	`jnl`	Counting and Detecting Small Subgraphs via Equations. SIAM J. Discret. Math. Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2013	J	`jnl`	Detecting Monomials with k Distinct Variables. Electron. Colloquium Comput. Complex. Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2013	B	`conf`	Detecting and Counting Small Pattern Graphs. ISAAC Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2013	J	`jnl`	Efficient broadcasting in radio networks with long-range interference. Distributed Comput. Frantisek Galcík, Leszek Gasieniec, Andrzej Lingas
2013	J	`jnl`	Optimal cuts and partitions in tree metrics in polynomial time. Inf. Process. Lett. Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2013	—	`conf`	Simple Iterative Heuristics for Correlation Clustering. LSSC Andrzej Lingas, Mia Persson
2013	J	`jnl`	Towards More Efficient Infection and Fire Fighting. Int. J. Found. Comput. Sci. Peter Floderus, Andrzej Lingas, Mia Persson
2013	J	`jnl`	Unique subgraphs are not easier to find. Int. J. Comput. Math. Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2012	B	`conf`	A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs. SOFSEM Andrzej Lingas, Dzmitry Sledneu
2012	—	`conf`	A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows. Euro-Par Andrzej Lingas, Mia Persson
2012	J	`jnl`	A fast parallel algorithm for minimum-cost small integral flows CoRR Andrzej Lingas, Mia Persson
2012	B	`conf`	Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles. CPM Jesper Jansson, Andrzej Lingas
2012	J	`jnl`	Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. Algorithmica Piotr Berman, Marek Karpinski, Andrzej Lingas
2012	Misc	`conf`	Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? COCOON Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2012	J	`jnl`	Linear-Time 3-Approximation Algorithm for the R-Star Covering Problem. Int. J. Comput. Geom. Appl. Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski
2012	J	`jnl`	Optimal Cuts and Bisections on the Real Line in Polynomial Time CoRR Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2012	J	`jnl`	Optimal Cuts and Partitions in Tree Metrics in Polynomial Time CoRR Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2012	J	`jnl`	Optimal Cuts and Partitions in Tree Metrics in Polynomial Time. Electron. Colloquium Comput. Complex. Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2012	J	`jnl`	The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. SIAM J. Comput. Jesper Jansson, Richard S. Lemence, Andrzej Lingas
2011	J	`jnl`	A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs CoRR Andrzej Lingas, Dzmitry Sledneu
2011	J	`jnl`	A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication. Algorithmica Andrzej Lingas
2011	J	`jnl`	Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Int. J. Found. Comput. Sci. Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski
2011	—	`conf`	Approximation Schemes for Capacitated Geometric Network Design. ICALP (1) Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk
2011	A*	`conf`	Counting and detecting small subgraphs via equations and matrix multiplication. SODA Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2011	C	`conf`	Near Approximation of Maximum Weight Matching through Efficient Weight Reduction. TAMC Andrzej Lingas, Cui Di
2011	J	`jnl`	On joint triangulations of two sets of points in the plane CoRR Ajit A. Diwan, Subir Kumar Ghosh, Partha P. Goswami, Andrzej Lingas
2011	—	`conf`	Towards More Efficient Infection and Fire Fighting. CATS Peter Floderus, Andrzej Lingas, Mia Persson
2011	C	`conf`	Unique Small Subgraphs Are Not Easier to Find. LATA Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2010	B	`conf`	Approximability of Edge Matching Puzzles. SOFSEM Antonios Antoniadis, Andrzej Lingas
2010	Misc	`conf`	Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. COCOON Piotr Berman, Marek Karpinski, Andrzej Lingas
2010	J	`jnl`	Near approximation of maximum weight matching through efficient weight reduction CoRR Cui Di, Andrzej Lingas
2010	J	`jnl`	Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k. Int. J. Found. Comput. Sci. Anna Adamaszek, Artur Czumaj, Andrzej Lingas
2010	C	`conf`	The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. WABI Jesper Jansson, Richard S. Lemence, Andrzej Lingas
2009	A	`conf`	A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication. ESA Andrzej Lingas
2009	J	`jnl`	An exact algorithm for subgraph homeomorphism. J. Discrete Algorithms Andrzej Lingas, Martin Wahlen
2009	B	`conf`	Approximation Algorithms for Buy-at-Bulk Geometric Network Design. WADS Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski
2009	J	`jnl`	Efficient approximation algorithms for shortest cycles in undirected graphs. Inf. Process. Lett. Andrzej Lingas, Eva-Marta Lundell
2009	A*	`conf`	Efficient broadcasting in known topology radio networks with long-range interference. PODC Frantisek Galcík, Leszek Gasieniec, Andrzej Lingas
2009	J	`jnl`	Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications CoRR Piotr Berman, Marek Karpinski, Andrzej Lingas
2009	J	`jnl`	Faster multi-witnesses for Boolean matrix multiplication. Inf. Process. Lett. Leszek Gasieniec, Miroslaw Kowaluk, Andrzej Lingas
2009	J	`jnl`	Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication. SIAM J. Comput. Artur Czumaj, Andrzej Lingas
2009	B	`conf`	PTAS for ISAAC Anna Adamaszek, Artur Czumaj, Andrzej Lingas
2009	J	`jnl`	PTAS for k-tour cover problem on the plane for moderately large values of k CoRR Anna Adamaszek, Artur Czumaj, Andrzej Lingas
2008	—	`conf`	A Path Cover Technique for LCAs in Dags. SWAT Miroslaw Kowaluk, Andrzej Lingas, Johannes Nowak
2008	J	`jnl`	Approximate clustering of incomplete fingerprints. J. Discrete Algorithms Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson
2008	B	`conf`	Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs. LATIN Andrzej Lingas, Eva-Marta Lundell
2008	A	`conf`	Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. DISC Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Lingas, Martin Wahlen
2008	B	`conf`	Linear-Time 3-Approximation Algorithm for the WALCOM Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski
2008	J	`jnl`	Max-Stretch Reduction for Tree Spanners. Algorithmica Kazuo Iwama, Andrzej Lingas, Masaki Okita
2008	—	`ch.`	Minimum k-Connected Geometric Networks. Encyclopedia of Algorithms Artur Czumaj, Andrzej Lingas
2007	C	`conf`	Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. AAIM Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas
2007	J	`jnl`	Approximating the maximum clique minor and some subgraph homeomorphism problems. Theor. Comput. Sci. Noga Alon, Andrzej Lingas, Martin Wahlen
2007	—	`ch.`	Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. Handbook of Approximation Algorithms and Metaheuristics Artur Czumaj, Andrzej Lingas
2007	J	`jnl`	Embedding Point Sets into Plane Graphs of Small Dilation. Int. J. Comput. Geom. Appl. Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Marek Karpinski, Christian Knauer, Andrzej Lingas
2007	J	`jnl`	Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theor. Comput. Sci. Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas
2007	A*	`conf`	Finding a heaviest triangle is not harder than matrix multiplication. SODA Artur Czumaj, Andrzej Lingas
2007	J	`jnl`	Note on covering monotone orthogonal polygons with star-shaped polygons. Inf. Process. Lett. Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski
2007	C	`conf`	On Exact Complexity of Subgraph Homeomorphism. TAMC Andrzej Lingas, Martin Wahlen
2007	J	`jnl`	On the Approximability of Maximum and Minimum Edge Clique Partition Problems. Int. J. Found. Comput. Sci. Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson
2007	J	`jnl`	Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. Algorithmica Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
2007	A	`conf`	Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication. ESA Miroslaw Kowaluk, Andrzej Lingas
2006	J	`jnl`	A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation. Comput. Geom. Rolf Klein, Christos Levcopoulos, Andrzej Lingas
2006	J	`jnl`	Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Electron. Colloquium Comput. Complex. Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas
2006	J	`jnl`	Finding a Heaviest Triangle is not Harder than Matrix Multiplication. Electron. Colloquium Comput. Complex. Artur Czumaj, Andrzej Lingas
2006	—	`conf`	Minimum-Energy Broadcasting in Wireless Networks in the CAAN Andrzej Lingas, Mia Persson, Martin Wahlen
2006	—	`conf`	On the Approximability of Maximum and Minimum Edge Clique Partition Problems. CATS Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson
2006	J	`jnl`	Performing work in broadcast networks. Distributed Comput. Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas
2006	J	`jnl`	Preface. Theor. Comput. Sci. Andrzej Lingas, Leszek Gasieniec
2005	J	`jnl`	A note on maximum independent set and related problems on box graphs. Inf. Process. Lett. Andrzej Lingas, Martin Wahlen
2005	—	`conf`	Approximate Clustering of Fingerprint Vectors with Missing Values. CATS Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson
2005	J	`jnl`	Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. Inf. Process. Lett. Artur Czumaj, Magnús M. Halldórsson, Andrzej Lingas, Johan Nilsson
2005	B	`conf`	Embedding Point Sets into Plane Graphs of Small Dilation. ISAAC Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas
2005	A*	`conf`	LCA Queries in Directed Acyclic Graphs. ICALP Miroslaw Kowaluk, Andrzej Lingas
2005	B	`conf`	Max-stretch Reduction for Tree Spanners. WADS Kazuo Iwama, Andrzej Lingas, Masaki Okita
2005	J	`jnl`	Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. SIAM J. Comput. Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel
2004	J	`jnl`	A fast algorithm for approximating the detour of a polygonal chain. Comput. Geom. Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas
2004	J	`jnl`	Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs. Fundam. Informaticae Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas
2004	J	`jnl`	Approximation algorithms for Hamming clustering problems. J. Discrete Algorithms Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
2004	J	`jnl`	On approximation of the maximum clique minor containment problem and some subgraph homeomorphism problems Electron. Colloquium Comput. Complex. Andrzej Lingas, Martin Wahlen
2004	B	`conf`	Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. CPM Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
2004	—	`conf`	Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices. SWAT Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell
2003	J	`jnl`	A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. Fundam. Informaticae Jesper Jansson, Andrzej Lingas
2003	B	`conf`	An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data. WADS Leszek Gasieniec, Andrzej Lingas
2003	B	`ed.`	Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings FCT Andrzej Lingas, Bengt J. Nilsson
2003	B	`conf`	Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. ISAAC Artur Czumaj, Andrzej Lingas, Johan Nilsson
2003	Misc	`conf`	Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs. COCOON Andrzej Lingas, Martin Wahlen
2003	J	`jnl`	Trade-Offs Between Load and Degree in Virtual Path Layouts. Parallel Process. Lett. Anders Dessmark, Andrzej Lingas, Andrzej Pelc
2002	B	`conf`	A Geometric Approach to Boolean Matrix Multiplication. ISAAC Andrzej Lingas
2002	—	`conf`	Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains. SWAT Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell
2002	J	`jnl`	Approximation algorithms for time-dependent orienteering. Inf. Process. Lett. Fedor V. Fomin, Andrzej Lingas
2002	A*	`conf`	Gossiping with Bounded Size Messages in ad hoc Radio Networks. ICALP Malin Christersson, Leszek Gasieniec, Andrzej Lingas
2002	A*	`conf`	On adaptive deterministic gossiping in ad hoc radio networks. SODA Leszek Gasieniec, Andrzej Lingas
2002	J	`jnl`	On adaptive deterministic gossiping in ad hoc radio networks. Inf. Process. Lett. Leszek Gasieniec, Andrzej Lingas
2002	A*	`conf`	Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. ICALP Artur Czumaj, Andrzej Lingas, Hairong Zhao
2001	A	`conf`	A Fast Algorithm for Approximating the Detour of a Polygonal Chain. ESA Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas
2001	B	`conf`	A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. CPM Jesper Jansson, Andrzej Lingas
2001	B	`conf`	Approximation Algorithms for Time-Dependent Orienteering. FCT Fedor V. Fomin, Andrzej Lingas
2001	J	`jnl`	Approximation algorithms for maximum two-dimensional pattern matching. Theor. Comput. Sci. Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe
2001	J	`jnl`	Efficient Merging and Construction of Evolutionary Trees. J. Algorithms Andrzej Lingas, Hans Olsson, Anna Östlin
2001	B	`conf`	Fast Boolean Matrix Multiplication for Highly Clustered Data. WADS Andreas Björklund, Andrzej Lingas
2001	—	`conf`	Oblivious gossiping in ad-hoc radio networks. DIAL-M Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis
2001	A	`conf`	Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. STACS Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel
2001	A*	`conf`	The do-all problem in broadcast networks. PODC Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas
2000	J	`jnl`	A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs Electron. Colloquium Comput. Complex. Klaus Jansen, Marek Karpinski, Andrzej Lingas
2000	B	`conf`	Approximation Algorithms for Hamming Clustering Problems. CPM Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
2000	J	`jnl`	Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs Electron. Colloquium Comput. Complex. Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas
2000	A*	`conf`	Fast Approximation Schemes for Euclidean Multi-connectivity Problems. ICALP Artur Czumaj, Andrzej Lingas
2000	J	`jnl`	Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. Algorithmica Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski
2000	J	`jnl`	Maximum packing for biconnected outerplanar graphs. Discret. Appl. Math. Tomas Kovacs, Andrzej Lingas
2000	J	`jnl`	Maximum packing for k-connected partial k-trees in polynomial time. Theor. Comput. Sci. Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski
1999	J	`jnl`	An Optimal Algorithm for Broadcasting Multiple Messages in Trees. J. Parallel Distributed Comput. Krzysztof Diks, Andrzej Lingas, Andrzej Pelc
1999	A	`conf`	Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions. STACS Ming-Yang Kao, Andrzej Lingas, Anna Östlin
1999	A*	`conf`	Efficient Approximation Algorithms for the Hamming Center Problem. SODA Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
1999	A*	`conf`	Efficient Merging, Construction, and Maintenance of Evolutionary Trees. ICALP Andrzej Lingas, Hans Olsson, Anna Östlin
1999	A*	`conf`	On Approximability of the Minimum-Cost SODA Artur Czumaj, Andrzej Lingas
1999	J	`jnl`	On the Complexity of Constructing Evolutionary Trees. J. Comb. Optim. Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin
1998	J	`jnl`	A Note on Parallel Complexity of Maximum Inf. Process. Lett. Anders Dessmark, Oscar Garrido, Andrzej Lingas
1998	A*	`conf`	A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. ICALP Artur Czumaj, Andrzej Lingas
1998	J	`jnl`	Improved Bounds for Integer Sorting in the EREW PRAM Model. J. Parallel Distributed Comput. Anders Dessmark, Andrzej Lingas
1998	—	`conf`	Inferring Ordered Trees from Local Constraints. CATS Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin
1998	J	`jnl`	Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. Theory Comput. Syst. Andrzej Lingas, Valeriu Soltan
1998	A	`conf`	Optimal Broadcasting in Almost Trees and Partial k-trees. STACS Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto
1998	—	`conf`	Subexponential-time algorithms for minimum weight triangulations and related problems. CCCG Andrzej Lingas
1998	—	`conf`	Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs. IPPS/SPDP Workshops Anders Dessmark, Carsten Dorgerloh, Andrzej Lingas, Juergen Wirtgen
1997	J	`jnl`	A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. Theor. Comput. Sci. Piotr Berman, Andrzej Lingas
1997	J	`jnl`	A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. Parallel Process. Lett. Andrzej Lingas, Anil Maheshwari
1997	B	`conf`	An Optimal Algorithm for Broadcasting Multiple Messages in Trees. SIROCCO Krzysztof Diks, Andrzej Lingas, Andrzej Pelc
1997	—	`conf`	Maximum Packing for Biconnected Outerplanar Graphs. TAPSOFT Tomas Kovacs, Andrzej Lingas
1997	J	`jnl`	Maximum Tree-Packing in Time O(n Theor. Comput. Sci. Andrzej Lingas
1997	Misc	`conf`	On the Complexity of Computing Evolutionary Trees. COCOON Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin
1996	J	`jnl`	A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. Int. J. Comput. Geom. Appl. Rolf Klein, Andrzej Lingas
1996	J	`jnl`	A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity. Inf. Process. Lett. Oscar Garrido, Pierre Kelsen, Andrzej Lingas
1996	J	`jnl`	A Simple Randomized Parallel Algorithm for Maximal f-Matchings. Inf. Process. Lett. Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter
1996	—	`ed.`	Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings SWAT Rolf G. Karlsson, Andrzej Lingas
1996	B	`conf`	Approximation Algorithms for Maximum Two-Dimensional Pattern Matching. CPM Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe
1996	A	`conf`	Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. ESA Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski
1996	J	`jnl`	Guest Editor's Foreword. Nord. J. Comput. Rolf G. Karlsson, Andrzej Lingas
1996	B	`conf`	Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. ISAAC Andrzej Lingas, Valeriu Soltan
1996	J	`jnl`	On 2-QBF Truth Testing in Parallel. Inf. Process. Lett. Bengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind
1996	B	`conf`	On the Power of Nonconservative PRAM. MFCS Anders Dessmark, Andrzej Lingas
1995	B	`conf`	A Linear-time Construction of the Relative Neighborhood Graph within a Histogram. WADS Andrzej Lingas, Asish Mukhopadhyay
1995	A	`conf`	Fast Skeleton Construction. ESA Rolf Klein, Andrzej Lingas
1995	J	`jnl`	Manhattonian proximity in a simple polygon. Int. J. Comput. Geom. Appl. Rolf Klein, Andrzej Lingas
1995	Misc	`conf`	Maximum Tree-Packing in Time O(n COCOON Andrzej Lingas
1995	J	`jnl`	Multilist Layering: Complexity and Applications. Theor. Comput. Sci. Anders Dessmark, Andrzej Lingas, Anil Maheshwari
1995	—	`conf`	On Parallel Complexity of Planar Triangulations. FSTTCS Christos Levcopoulos, Andrzej Lingas, Cao Wang
1995	J	`jnl`	On computing Voronoi diagrams for sorted point sets. Int. J. Comput. Geom. Appl. Hristo N. Djidjev, Andrzej Lingas
1995	J	`jnl`	Optimal Parallel Algorithms for Rectilinear Link-Distance Problems. Algorithmica Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack
1994	J	`jnl`	A Linear-time Construction of the Relative Neighborhood Graph From the Delaunay Triangulation. Comput. Geom. Andrzej Lingas
1994	—	`conf`	A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. SWAT Piotr Berman, Andrzej Lingas
1994	A	`conf`	A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. STACS Anil Maheshwari, Andrzej Lingas
1994	J	`jnl`	Editor's Foreword. Nord. J. Comput. Andrzej Lingas
1994	B	`conf`	Hamiltonian Abstract Voronoi Diagrams in Linear Time. ISAAC Rolf Klein, Andrzej Lingas
1994	B	`conf`	On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. MFCS Anders Dessmark, Andrzej Lingas, Oscar Garrido
1993	—	`conf`	A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. SCG Rolf Klein, Andrzej Lingas
1993	—	`conf`	A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon. CCCG Rolf Klein, Andrzej Lingas
1993	A*	`ed.`	Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings ICALP Andrzej Lingas, Rolf G. Karlsson, Svante Carlsson
1993	A	`conf`	Multi-List Ranking: Complexity and Applications. STACS Anders Dessmark, Andrzej Lingas, Anil Maheshwari
1993	J	`jnl`	Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. Int. J. Found. Comput. Sci. Krzysztof Diks, Oscar Garrido, Andrzej Lingas
1993	—	`conf`	Parallel Algorithms for Rectilinear Link Distance Problems. IPPS Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack
1993	B	`conf`	The Maximum k-Dependent and f-Dependent Set Problem. ISAAC Anders Dessmark, Klaus Jansen, Andrzej Lingas
1992	B	`conf`	A Simple Randomized Parallel Algorithm for Maximal LATIN Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter
1992	J	`jnl`	An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack
1992	—	`conf`	C-sensitive Triangulations Approximate the MinMax Length Triangulation. FSTTCS Christos Levcopoulos, Andrzej Lingas
1992	J	`jnl`	Fast Algorithms for Greedy Triangulation. BIT Christos Levcopoulos, Andrzej Lingas
1992	—	`conf`	Manhattonian Proximity in a Simple Polygon. SCG Rolf Klein, Andrzej Lingas
1992	B	`conf`	On the Relationship among Constrained Geometric Structures. ISAAC Esther Jennings, Andrzej Lingas
1992	J	`jnl`	There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees. Algorithmica Christos Levcopoulos, Andrzej Lingas
1991	J	`jnl`	An Unfeasible Matching Problem. BIT Andrzej Lingas
1991	J	`jnl`	Bit Complexity of Matrix Products. Inf. Process. Lett. Andrzej Lingas
1991	—	`conf`	Dynamic Detection of Forest of Tree-Connected Meshes. ICPP (3) Esther Jennings, Andrzej Lingas, Lenka Motyckova
1991	C	`conf`	Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case. ICCI Christos Levcopoulos, Andrzej Lingas
1991	B	`conf`	On Computing the Voronoi Diagram for Restricted Planar Figures. WADS Hristo N. Djidjev, Andrzej Lingas
1991	—	`conf`	Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. ISA Krzysztof Diks, Oscar Garrido, Andrzej Lingas
1990	J	`jnl`	A Note on a Parallel Heuristic for Minimum. Bull. EATCS Andrzej Lingas
1990	—	`conf`	Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs. SIGAL International Symposium on Algorithms Andrzej Lingas
1990	—	`conf`	Fast Algorithms for Greedy Triangulation. SWAT Christos Levcopoulos, Andrzej Lingas
1990	—	`conf`	Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. FSTTCS Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter
1989	A	`conf`	An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. STACS Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack
1989	J	`jnl`	Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems. Theor. Comput. Sci. Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack
1989	J	`jnl`	On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs. Theor. Comput. Sci. Andrzej Lingas, Andrzej Proskurowski
1989	J	`jnl`	Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time. Theor. Comput. Sci. Andrzej Lingas
1989	J	`jnl`	Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching. Inf. Process. Lett. Andrzej Lingas, Marek Karpinski
1989	—	`conf`	Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees. Optimal Algorithms Christos Levcopoulos, Andrzej Lingas
1989	J	`jnl`	Voronoi Diagrams with Barriers and the Shortest Diagonal Problem. Inf. Process. Lett. Andrzej Lingas
1988	A*	`conf`	A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs. ICALP Andrzej Lingas, Maciej M. Syslo
1988	—	`conf`	An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. SWAT Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas
1988	B	`conf`	Greedy Triangulation acn be Efficiently Implemented in the Average Case (Extended Abstract). WG Andrzej Lingas
1988	J	`jnl`	Recognizing polygons, or how to spy. Vis. Comput. James A. Dean, Andrzej Lingas, Jörg-Rüdiger Sack
1988	—	`ed.`	SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings SWAT Rolf G. Karlsson, Andrzej Lingas
1987	J	`jnl`	Algorithms for Minimum Length Partitions of Polygons. BIT Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack
1987	—	`conf`	Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs. FSTTCS Andrzej Lingas, Andrzej Proskurowski
1987	A*	`conf`	Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract). ICALP Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack
1987	J	`jnl`	On Approximation Behavior of the Greedy Triangulation for Convex Polygons. Algorithmica Christos Levcopoulos, Andrzej Lingas
1986	—	`conf`	On Approximation Behavior and Implementation of the Greedy Triangulation for Convex Planar Point Sets. SCG Andrzej Lingas
1986	A	`conf`	Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time. STACS Andrzej Lingas
1985	—	`conf`	On partitioning polygons. SCG Andrzej Lingas
1984	—	`conf`	Bounds on the Length of Convex Partitions of Polygons. FSTTCS Christos Levcopoulos, Andrzej Lingas
1984	A	`conf`	Covering Polygons with Minimum Number of Rectangles. STACS Christos Levcopoulos, Andrzej Lingas
1983	B	`conf`	A Note on Computational Complexity of Logic Programs. Logic Programming Workshop Andrzej Lingas
1983	—	`conf`	An Application of Maximum Bipartite C-Matching to Subtree Isomorphism. CAAP Andrzej Lingas
1983	—	`conf`	Heuristics for minimum edge length rectangular partitions of rectilinear figures. Theoretical Computer Science Andrzej Lingas
1983	B	`conf`	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 Andrzej Lingas
1982	A*	`conf`	The Power of Non-Rectilinear Holes. ICALP Andrzej Lingas
1981	—	`conf`	Certain Algorithms for Subgraph Isomorphism Problems. CAAP Andrzej Lingas
1979	B	`conf`	The complexity of distributive computations. FCT Andrzej Lingas
1978	A*	`conf`	A PSPACE Complete Problem Related to a Pebble Game. ICALP Andrzej Lingas