×

zbMATH — the first resource for mathematics

Lingas, Andrzej

Compute Distance To:
Author ID: lingas.andrzej Recent zbMATH articles by "Lingas, Andrzej"
Published as: Lingas, A.; Lingas, Andrzej
Homepage: http://fileadmin.cs.lth.se/cs/Personal/Andrzej_Lingas/
External Links: MGP · Wikidata · ORCID · dblp · GND
Documents Indexed: 197 Publications since 1977, including 8 Books
all top 5

Co-Authors

27 single-authored
25 Levcopoulos, Christos
22 Jansson, Jesper
21 Gąsieniec, Leszek Antoni
19 Kowaluk, Mirosław
16 Lundell, Eva-Marta
15 Czumaj, Artur
14 Dessmark, Anders
13 Klein, Rolf-Dieter
13 Persson, Mia
11 Karpinski, Marek
9 Żyliński, Paweł
8 Floderus, Peter
8 Sledneu, Dzmitry
7 Wahlen, Martin
5 Ostlin, Anna
5 Proskurowski, Andrzej
5 Sack, Jörg-Rüdiger
4 Adamaszek, Anna
4 Berman, Piotr
4 Ebbers-Baumann, Annette
4 Garrido, Oscar
4 Karlsson, Rolf G.
4 Maheshwari, Anil
4 Wasylewicz, Agnieszka
3 Djidjev, Hristo Nicolov
3 Iwama, Kazuo
3 Jansen, Klaus
3 Kowalski, Dariusz R.
3 Langetepe, Elmar
2 Chlebus, Bogdan Stanislaw
2 Czyzowicz, Jurek
2 Dereniowski, Dariusz
2 Diks, Krzysztof
2 Fomin, Fedor V.
2 Galčík, František
2 Grune, Ansgar
2 Knauer, Christian
2 Nilsson, Johan
2 Okita, Masaki
2 Rytter, Wojciech
2 Seidel, Eike
2 Wojtaszczyk, Jakub Onufry
1 Alon, Noga M.
1 Antoniadis, Antonios Foivos
1 Arikati, Srinivasa R.
1 Aspvall, Bengt
1 Björklund, Andreas
1 Bohler, Cecilia
1 Carlsson, Svante
1 Christersson, Malin
1 Dannenberg, Katharina
1 Dean, James A.
1 Di, Cui
1 Dorgerloh, Carsten F.
1 Figueroa, Ana Paulina
1 Goldstein, Allen A.
1 Halldórsson, Magnús Mar
1 Han, Xin
1 Jarominek, Stefan
1 Jennings, Esther
1 Jiang, Tao
1 Kao, Ming-Yang
1 Katajainen, Jyrki
1 Kelsen, Pierre
1 Klasing, Ralf
1 Kovacs, Tomas
1 Kurowski, Maciej
1 Lemence, Richard Santiago
1 Liu, Chih-Hung
1 Marathe, Madhav V.
1 Min, Jie
1 Miotk, Mateusz
1 Mitchell, Joseph S. B.
1 Nilsson, Bengt J.
1 Nowak, Johannes
1 Olsson, Hans
1 Osula, Dorota
1 Pagh, Rasmus
1 Palios, Leonidas
1 Pelc, Andrzej
1 Petersson, Ola
1 Radzik, Tomasz
1 Rajaby, Ramesh
1 Schwarzwald, Barbara
1 Soltan, Valeriu
1 Storlind, Robert
1 Sung, Wing-Kin
1 Syslo, Maciej M.
1 Tokuyama, Takeshi
1 Topp, Jerzy
1 Urbańska, Dorota
1 Wang, Cao
1 Wirtgen, Jürgen
1 Zechner, Niklas
1 Zhao, Hairong

Publications by Year

Citations contained in zbMATH

124 Publications have been cited 499 times in 376 Documents Cited by Year
On complexity of regular languages in terms of finite automata. Zbl 0364.68057
Berman, Piotr; Lingas, Andrzej
19
1977
Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Zbl 0681.68090
Lingas, Andrzej
16
1989
The power of non-rectilinear holes. Zbl 0487.68033
Lingas, Andrzej
14
1982
A fast algorithm for approximating the detour of a polygonal chain. Zbl 1045.65017
Ebbers-Baumann, Annette; Klein, Rolf; Langetepe, Elmar; Lingas, Andrzej
13
2004
On the complexity of constructing evolutionary trees. Zbl 0957.90111
Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej; Östlin, Anna
13
1999
Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Zbl 1118.68102
Czumaj, Artur; Kowaluk, Mirosław; Lingas, Andrzej
12
2007
Approximation algorithms for time-dependent orienteering. Zbl 1043.90076
Fomin, Fedor V.; Lingas, Andrzej
12
2002
An \(O(n\log n)\) algorithm for computing the link center of a simple polygon. Zbl 0776.68108
Djidjev, Hristo N.; Lingas, Andrzej; Sack, Jörg-Rüdiger
12
1992
There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Zbl 0764.05021
Levcopoulos, Christos; Lingas, Andrzej
12
1992
Polynomial time approximation schemes for MAX-BISECTION on planar and geometric graphs. Zbl 1087.90063
Jansen, Klaus; Karpinski, Marek; Lingas, Andrzej; Seidel, Eike
11
2005
Gossiping with bounded size messages in ad hoc radio networks (extended abstract). Zbl 1056.68502
Christersson, Malin; Gasieniec, Leszek; Lingas, Andrzej
11
2002
On approximation behavior of the greedy triangulation for convex polygons. Zbl 0636.68046
Levcopoulos, Christos; Lingas, Andrzej
11
1987
Subtree isomorphism is NC reducible to bipartite perfect matching. Zbl 0664.68072
Lingas, Andrzej; Karpinski, Marek
10
1989
A new heuristic for minimum weight triangulation. Zbl 0654.68050
Lingas, Andrzej
10
1987
The greedy and Delaunay triangulations are not bad in the average case. Zbl 0584.68080
Lingas, Andrzej
10
1986
Efficient approximation algorithms for the Hamming center problem. Zbl 0929.68086
Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej
9
1999
On approximability of the minimum-cost \(k\)-connected spanning subgraph problem. Zbl 0974.68156
Czumaj, Artur; Lingas, Andrzej
9
1999
Faster multi-witnesses for Boolean matrix multiplication. Zbl 1190.65073
Gąsieniec, Leszek; Kowaluk, Mirosław; Lingas, Andrzej
7
2009
On the approximability of maximum and minimum edge clique partition problems. Zbl 1112.68136
Dessmark, Anders; Jansson, Jesper; Lingas, Andrzej; Lundell, Eva-Marta; Persson, Mia
7
2007
On adaptive deterministic gossiping in ad hoc radio networks. Zbl 1051.68077
Gąsieniec, Leszek; Lingas, Andrzej
7
2002
Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees. Zbl 0960.05098
Dessmark, A.; Lingas, A.; Proskurowski, A.
7
2000
Voronoi diagrams with barriers and the shortest diagonal problem. Zbl 0677.68047
Lingas, Andrzej
7
1989
Computing the rooted triplet distance between galled trees by counting triangles. Zbl 1284.05293
Jansson, Jesper; Lingas, Andrzej
6
2014
Unique lowest common ancestors in dags are almost as easy as matrix multiplication. Zbl 1151.68429
Kowaluk, Mirosław; Lingas, Andrzej
6
2007
Performing work in broadcast networks. Zbl 1266.68207
Chlebus, Bogdan S.; Kowalski, Dariusz R.; Lingas, Andrzej
6
2006
Optimal parallel algorithms for rectilinear link-distance problems. Zbl 0831.68108
Lingas, A.; Maheshwari, A.; Sack, J.-R.
6
1995
Induced subgraph isomorphism: are some patterns substantially easier than others? Zbl 1331.05154
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
5
2015
Counting and detecting small subgraphs via equations. Zbl 1275.68161
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
5
2013
A fast output-sensitive algorithm for Boolean matrix multiplication. Zbl 1218.68195
Lingas, Andrzej
5
2011
Finding a heaviest triangle is not harder than matrix multiplication. Zbl 1302.68123
Czumaj, Artur; Lingas, Andrzej
5
2007
LCA queries in directed acyclic graphs. Zbl 1082.68593
Kowaluk, Miroslaw; Lingas, Andrzej
5
2005
Polynomial time approximation schemes for MAX-BISECTION on planar and geometric graphs. Zbl 0976.68523
Jansen, Klaus; Karpinski, Marek; Lingas, Andrzej; Seidel, Eike
5
2001
A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon. Zbl 0859.68113
Klein, Rolf; Lingas, Andrzej
5
1996
On computing Voronoi diagrams for sorted point sets. Zbl 0835.68121
Djidjev, Hristo N.; Lingas, Andrzej
5
1995
Hamiltonian abstract Voronoi diagrams in linear time. Zbl 0953.68604
Klein, Rolf; Lingas, Andrzej
5
1994
The maximum \(k\)-dependent and \(f\)-dependent set problem. Zbl 0925.05062
Dessmark, Anders; Jansen, Klaus; Lingas, Andrzej
5
1993
Fast algorithms for greedy triangulation. Zbl 0761.68099
Levcopoulos, Christos; Lingas, Andrzej
5
1992
There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees. Zbl 0704.68088
Levcopoulos, Ch.; Lingas, A.
5
1989
Recognizing polygons, or how to spy. Zbl 0646.68055
Dean, James A.; Lingas, Andrzej; Sack, Jörg-Rüdiger
5
1988
The greedy and Delaunay triangulations are not bad in the average case and minimum weight geometric triangulation of multi-connected polygons is NP-complete. Zbl 0529.68021
Lingas, Andrzej
5
1983
Heuristics for minimum edge length rectangular partitions of rectilinear figures. Zbl 0497.68040
Lingas, Andrzej
5
1982
Approximation algorithms for the geometric firefighter and budget fence problems. Zbl 1405.68426
Klein, Rolf; Levcopoulos, Christos; Lingas, Andrzej
4
2014
Towards more efficient infection and fire fighting. Zbl 1269.68068
Floderus, Peter; Lingas, Andrzej; Persson, Mia
4
2013
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication. Zbl 1200.68123
Czumaj, Artur; Lingas, Andrzej
4
2009
PTAS for \(k\)-tour cover problem on the plane for moderately large values of \(k\). Zbl 1273.68404
Adamaszek, Anna; Czumaj, Artur; Lingas, Andrzej
4
2009
Approximation algorithms for Hamming clustering problems. Zbl 1118.68762
Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej
4
2004
A fast algorithm for optimal alignment between similar ordered trees. Zbl 0990.68638
Jansson, Jesper; Lingas, Andrzej
4
2001
Inferring ordered trees from local constraints. Zbl 0952.68109
Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej; Östlin, Anna
4
1998
A linear-time construction of the relative neighborhood graph from the Delaunay triangulation. Zbl 0813.68161
Lingas, Andrzej
4
1994
Heuristics for optimum binary search trees and minimum weight triangulation problems. Zbl 0688.68063
Levcopoulos, Christos; Lingas, Andrzej; Sack, Jörg R.
4
1989
Bounds on the length of convex partitions of polygons. Zbl 0554.68029
Levcopoulos, Christos; Lingas, Andrzej
4
1984
Detecting and counting small pattern graphs. Zbl 1327.68332
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
3
2015
Approximability of edge matching puzzles. Zbl 1274.68135
Antoniadis, Antonios; Lingas, Andrzej
3
2010
Efficient approximation algorithms for shortest cycles in undirected graphs. Zbl 1214.68466
Lingas, Andrzej; Lundell, Eva-Marta
3
2009
Approximating the maximum clique minor and some subgraph homeomorphism problems. Zbl 1162.05342
Alon, Noga; Lingas, Andrzej; Wahlen, Martin
3
2007
Approximation algorithms for max-bisection on low degree regular graphs. Zbl 1102.68095
Karpinski, Marek; Kowaluk, Miroslaw; Lingas, Andrzej
3
2004
A fast algorithm for optimal alignment between similar ordered trees. Zbl 1030.68080
Jansson, Jesper; Lingas, Andrzej
3
2003
A geometric approach to Boolean matrix multiplication. Zbl 1019.68131
Lingas, Andrzej
3
2002
The do-all problem in broadcast networks. Zbl 1333.68051
Chlebus, Bogdan S.; Kowalski, Dariusz R.; Lingas, Andrzej
3
2001
A polynomial time approximation scheme for Euclidean minimum cost \(k\)-connectivity. Zbl 0913.05069
Czumaj, Artur; Lingas, Andrzej
3
1998
Minimum convex partition of a polygon with holes by cuts in given directions. Zbl 0910.68221
Lingas, A.; Soltan, V.
3
1998
Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees. Zbl 1379.68255
Dessmark, Anders; Lingas, Andrzej; Proskurowski, Andrzej
3
1996
Parallel algorithms for finding maximal \(k\)-dependent sets and maximal \(f\)-matchings. Zbl 0802.68092
Diks, Krzysztof; Garrido, Oscar; Lingas, Andrzej
3
1993
A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs. Zbl 0656.68046
Lingas, Andrzej; Sysło, Maciej M.
3
1988
A P-space complete problem related to a pebble game. Zbl 0407.68049
Lingas, Andrzej
3
1978
Induced subgraph isomorphism: are some patterns substantially easier than others? Zbl 1364.68228
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
2
2012
Counting and detecting small subgraphs via equations and matrix multiplication. Zbl 1376.05151
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
2
2011
Efficient broadcasting in known geometric radio networks with non-uniform ranges. Zbl 1161.90325
Gąsieniec, Leszek; Kowalski, Dariusz R.; Lingas, Andrzej; Wahlen, Martin
2
2008
A path cover technique for LCAs in dags. Zbl 1155.68476
Kowaluk, Mirosław; Lingas, Andrzej; Nowak, Johannes
2
2008
Note on covering monotone orthogonal polygons with star-shaped polygons. Zbl 1187.68644
Lingas, Andrzej; Wasylewicz, Agnieszka; Żyliński, Paweł
2
2007
Embedding point sets into plane graphs of small dilation. Zbl 1185.68775
Ebbers-Baumann, Annette; Grüne, Ansgar; Klein, Rolf; Karpinski, Marek; Knauer, Christian; Lingas, Andrzej
2
2007
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. Zbl 1182.68361
Czumaj, Artur; Halldórsson, Magnús M.; Lingas, Andrzej; Nilsson, Johan
2
2005
Polynomial-time algorithms for the ordered maximum agreement subtree problem. Zbl 1103.68967
Dessmark, Anders; Jansson, Jesper; Lingas, Andrzej; Lundell, Eva-Marta
2
2004
An improved bound on Boolean matrix multiplication for highly clustered data. Zbl 1278.68108
Gąsieniec, Leszek; Lingas, Andrzej
2
2003
Fast Boolean matrix multiplication for highly clustered data. Zbl 0997.68753
Björklund, Andreas; Lingas, Andrzej
2
2001
Balanced randomized tree splitting with applications to evolutionary tree constructions. Zbl 0930.05090
Kao, Ming-Yang; Lingas, Andrzej; Östlin, Anna
2
1999
Maximum tree-packing in time \(O(n^{5/2})\). Zbl 0901.68150
Lingas, Andrzej
2
1997
On the complexity of computing evolutionary trees. Zbl 0889.92021
Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej; Östlin, Anna
2
1997
A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity. Zbl 0900.68237
Garrido, Oscar; Kelsen, Pierre; Lingas, Andrzej
2
1996
Manhattonian proximity in a simple polygon. Zbl 0818.68142
Klein, Rolf; Lingas, Andrzej
2
1995
A simple optimal parallel algorithm for reporting paths in a tree. Zbl 0941.68824
Maheshwari, Anil; Lingas, Andrzej
2
1994
On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs. Zbl 0686.68041
Lingas, Andrzej; Proskurowski, Andrzej
2
1989
Algorithms for minimum length partitions of polygons. Zbl 0643.68047
Lingas, Andrzej; Levcopoulos, Christos; Sack, Jörg
2
1987
Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Zbl 0597.68037
Lingas, Andrzej
2
1986
An application of maximum bipartite C-matching to subtree isomorphism. Zbl 0529.05018
Lingas, Andrzej
2
1983
Graphs with equal domination and covering numbers. Zbl 1434.05112
Lingas, Andrzej; Miotk, Mateusz; Topp, Jerzy; Żyliński, Paweł
1
2020
On a fire fighter’s problem. Zbl 1415.68255
Klein, Rolf; Langetepe, Elmar; Schwarzwald, Barbara; Levcopoulos, Christos; Lingas, Andrzej
1
2019
Forest-like abstract Voronoi diagrams in linear time. Zbl 1396.65034
Bohler, Cecilia; Klein, Rolf; Lingas, Andrzej; Liu, Chih-Hung
1
2018
Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution. Zbl 06721533
Lingas, Andrzej
1
2017
Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors). Zbl 1444.90053
Gąsieniec, Leszek; Klasing, Ralf; Levcopoulos, Christos; Lingas, Andrzej; Min, Jie; Radzik, Tomasz
1
2017
A fast parallel algorithm for minimum-cost small integral flows. Zbl 1318.90017
Lingas, Andrzej; Persson, Mia
1
2015
Detecting and counting small pattern graphs. Zbl 1406.68128
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
1
2013
Unique subgraphs are not easier to find. Zbl 1310.68113
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
1
2013
Linear-time 3-approximation algorithm for the \(r\)-star covering problem. Zbl 1251.68288
Lingas, Andrzej; Wasylewicz, Agnieszka; Żyliński, Paweł
1
2012
Exact and approximation algorithms for geometric and capacitated set cover problems. Zbl 1252.68347
Berman, Piotr; Karpinski, Marek; Lingas, Andrzej
1
2012
A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs. Zbl 1302.05194
Lingas, Andrzej; Sledneu, Dzmitry
1
2012
The complexity of inferring a minimally resolved phylogenetic supertree. Zbl 1242.68115
Jansson, Jesper; Lemence, Richard S.; Lingas, Andrzej
1
2012
Approximation algorithms for buy-at-bulk geometric network design. Zbl 1233.90079
Czumaj, Artur; Czyzowicz, Jurek; Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej; Zylinski, Pawel
1
2011
PTAS for \(k\)-tour cover problem on the plane for moderately large values of \(k^*\). Zbl 1207.90013
Adamaszek, Anna; Czumaj, Artur; Lingas, Andrzej
1
2010
Exact and approximation algorithms for geometric and capacitated set cover problems. Zbl 1286.68461
Berman, Piotr; Karpinski, Marek; Lingas, Andrzej
1
2010
Graphs with equal domination and covering numbers. Zbl 1434.05112
Lingas, Andrzej; Miotk, Mateusz; Topp, Jerzy; Żyliński, Paweł
1
2020
On a fire fighter’s problem. Zbl 1415.68255
Klein, Rolf; Langetepe, Elmar; Schwarzwald, Barbara; Levcopoulos, Christos; Lingas, Andrzej
1
2019
Forest-like abstract Voronoi diagrams in linear time. Zbl 1396.65034
Bohler, Cecilia; Klein, Rolf; Lingas, Andrzej; Liu, Chih-Hung
1
2018
Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution. Zbl 06721533
Lingas, Andrzej
1
2017
Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors). Zbl 1444.90053
Gąsieniec, Leszek; Klasing, Ralf; Levcopoulos, Christos; Lingas, Andrzej; Min, Jie; Radzik, Tomasz
1
2017
Induced subgraph isomorphism: are some patterns substantially easier than others? Zbl 1331.05154
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
5
2015
Detecting and counting small pattern graphs. Zbl 1327.68332
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
3
2015
A fast parallel algorithm for minimum-cost small integral flows. Zbl 1318.90017
Lingas, Andrzej; Persson, Mia
1
2015
Computing the rooted triplet distance between galled trees by counting triangles. Zbl 1284.05293
Jansson, Jesper; Lingas, Andrzej
6
2014
Approximation algorithms for the geometric firefighter and budget fence problems. Zbl 1405.68426
Klein, Rolf; Levcopoulos, Christos; Lingas, Andrzej
4
2014
Counting and detecting small subgraphs via equations. Zbl 1275.68161
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
5
2013
Towards more efficient infection and fire fighting. Zbl 1269.68068
Floderus, Peter; Lingas, Andrzej; Persson, Mia
4
2013
Detecting and counting small pattern graphs. Zbl 1406.68128
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
1
2013
Unique subgraphs are not easier to find. Zbl 1310.68113
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
1
2013
Induced subgraph isomorphism: are some patterns substantially easier than others? Zbl 1364.68228
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
2
2012
Linear-time 3-approximation algorithm for the \(r\)-star covering problem. Zbl 1251.68288
Lingas, Andrzej; Wasylewicz, Agnieszka; Żyliński, Paweł
1
2012
Exact and approximation algorithms for geometric and capacitated set cover problems. Zbl 1252.68347
Berman, Piotr; Karpinski, Marek; Lingas, Andrzej
1
2012
A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs. Zbl 1302.05194
Lingas, Andrzej; Sledneu, Dzmitry
1
2012
The complexity of inferring a minimally resolved phylogenetic supertree. Zbl 1242.68115
Jansson, Jesper; Lemence, Richard S.; Lingas, Andrzej
1
2012
A fast output-sensitive algorithm for Boolean matrix multiplication. Zbl 1218.68195
Lingas, Andrzej
5
2011
Counting and detecting small subgraphs via equations and matrix multiplication. Zbl 1376.05151
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
2
2011
Approximation algorithms for buy-at-bulk geometric network design. Zbl 1233.90079
Czumaj, Artur; Czyzowicz, Jurek; Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej; Zylinski, Pawel
1
2011
Approximability of edge matching puzzles. Zbl 1274.68135
Antoniadis, Antonios; Lingas, Andrzej
3
2010
PTAS for \(k\)-tour cover problem on the plane for moderately large values of \(k^*\). Zbl 1207.90013
Adamaszek, Anna; Czumaj, Artur; Lingas, Andrzej
1
2010
Exact and approximation algorithms for geometric and capacitated set cover problems. Zbl 1286.68461
Berman, Piotr; Karpinski, Marek; Lingas, Andrzej
1
2010
Faster multi-witnesses for Boolean matrix multiplication. Zbl 1190.65073
Gąsieniec, Leszek; Kowaluk, Mirosław; Lingas, Andrzej
7
2009
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication. Zbl 1200.68123
Czumaj, Artur; Lingas, Andrzej
4
2009
PTAS for \(k\)-tour cover problem on the plane for moderately large values of \(k\). Zbl 1273.68404
Adamaszek, Anna; Czumaj, Artur; Lingas, Andrzej
4
2009
Efficient approximation algorithms for shortest cycles in undirected graphs. Zbl 1214.68466
Lingas, Andrzej; Lundell, Eva-Marta
3
2009
Efficient broadcasting in known topology radio networks with long-range interference. Zbl 1291.68080
Galčík, František; Gąsieniec, Leszek; Lingas, Andrzej
1
2009
A fast output-sensitive algorithm for Boolean matrix multiplication. Zbl 1256.68160
Lingas, Andrzej
1
2009
Approximation algorithms for buy-at-bulk geometric network design. Zbl 1253.68359
Czumaj, Artur; Czyzowicz, Jurek; Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej; Zylinski, Pawel
1
2009
Efficient broadcasting in known geometric radio networks with non-uniform ranges. Zbl 1161.90325
Gąsieniec, Leszek; Kowalski, Dariusz R.; Lingas, Andrzej; Wahlen, Martin
2
2008
A path cover technique for LCAs in dags. Zbl 1155.68476
Kowaluk, Mirosław; Lingas, Andrzej; Nowak, Johannes
2
2008
Approximate clustering of incomplete fingerprints. Zbl 1162.68605
Figueroa, A.; Goldstein, A.; Jiang, T.; Kurowski, M.; Lingas, A.; Persson, M.
1
2008
Linear-time 3-approximation algorithm for the \(r\)-star covering problem. Zbl 1132.68821
Lingas, Andrzej; Wasylewicz, Agnieszka; Żyliński, Paweł
1
2008
Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Zbl 1118.68102
Czumaj, Artur; Kowaluk, Mirosław; Lingas, Andrzej
12
2007
On the approximability of maximum and minimum edge clique partition problems. Zbl 1112.68136
Dessmark, Anders; Jansson, Jesper; Lingas, Andrzej; Lundell, Eva-Marta; Persson, Mia
7
2007
Unique lowest common ancestors in dags are almost as easy as matrix multiplication. Zbl 1151.68429
Kowaluk, Mirosław; Lingas, Andrzej
6
2007
Finding a heaviest triangle is not harder than matrix multiplication. Zbl 1302.68123
Czumaj, Artur; Lingas, Andrzej
5
2007
Approximating the maximum clique minor and some subgraph homeomorphism problems. Zbl 1162.05342
Alon, Noga; Lingas, Andrzej; Wahlen, Martin
3
2007
Note on covering monotone orthogonal polygons with star-shaped polygons. Zbl 1187.68644
Lingas, Andrzej; Wasylewicz, Agnieszka; Żyliński, Paweł
2
2007
Embedding point sets into plane graphs of small dilation. Zbl 1185.68775
Ebbers-Baumann, Annette; Grüne, Ansgar; Klein, Rolf; Karpinski, Marek; Knauer, Christian; Lingas, Andrzej
2
2007
Performing work in broadcast networks. Zbl 1266.68207
Chlebus, Bogdan S.; Kowalski, Dariusz R.; Lingas, Andrzej
6
2006
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation. Zbl 1098.65026
Klein, Rolf; Levcopoulos, Christos; Lingas, Andrzej
1
2006
Polynomial time approximation schemes for MAX-BISECTION on planar and geometric graphs. Zbl 1087.90063
Jansen, Klaus; Karpinski, Marek; Lingas, Andrzej; Seidel, Eike
11
2005
LCA queries in directed acyclic graphs. Zbl 1082.68593
Kowaluk, Miroslaw; Lingas, Andrzej
5
2005
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. Zbl 1182.68361
Czumaj, Artur; Halldórsson, Magnús M.; Lingas, Andrzej; Nilsson, Johan
2
2005
Embedding point sets into plane graphs of small dilation. Zbl 1173.68603
Ebbers-Baumann, Annette; Grüne, Ansgar; Karpinski, Marek; Klein, Rolf; Knauer, Christian; Lingas, Andrzej
1
2005
A fast algorithm for approximating the detour of a polygonal chain. Zbl 1045.65017
Ebbers-Baumann, Annette; Klein, Rolf; Langetepe, Elmar; Lingas, Andrzej
13
2004
Approximation algorithms for Hamming clustering problems. Zbl 1118.68762
Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej
4
2004
Approximation algorithms for max-bisection on low degree regular graphs. Zbl 1102.68095
Karpinski, Marek; Kowaluk, Miroslaw; Lingas, Andrzej
3
2004
Polynomial-time algorithms for the ordered maximum agreement subtree problem. Zbl 1103.68967
Dessmark, Anders; Jansson, Jesper; Lingas, Andrzej; Lundell, Eva-Marta
2
2004
A fast algorithm for optimal alignment between similar ordered trees. Zbl 1030.68080
Jansson, Jesper; Lingas, Andrzej
3
2003
An improved bound on Boolean matrix multiplication for highly clustered data. Zbl 1278.68108
Gąsieniec, Leszek; Lingas, Andrzej
2
2003
Approximation algorithms for time-dependent orienteering. Zbl 1043.90076
Fomin, Fedor V.; Lingas, Andrzej
12
2002
Gossiping with bounded size messages in ad hoc radio networks (extended abstract). Zbl 1056.68502
Christersson, Malin; Gasieniec, Leszek; Lingas, Andrzej
11
2002
On adaptive deterministic gossiping in ad hoc radio networks. Zbl 1051.68077
Gąsieniec, Leszek; Lingas, Andrzej
7
2002
A geometric approach to Boolean matrix multiplication. Zbl 1019.68131
Lingas, Andrzej
3
2002
Adaptive algorithms for constructing convex hulls and triangulations of polygonal chains. Zbl 1078.68803
Levcopoulos, Christos; Lingas, Andrzej; Mitchell, Joseph S. B.
1
2002
Polynomial-time approximation schemes for the Euclidean survivable network design problem. Zbl 1057.90053
Czumaj, Artur; Lingas, Andrzej; Zhao, Hairong
1
2002
Polynomial time approximation schemes for MAX-BISECTION on planar and geometric graphs. Zbl 0976.68523
Jansen, Klaus; Karpinski, Marek; Lingas, Andrzej; Seidel, Eike
5
2001
A fast algorithm for optimal alignment between similar ordered trees. Zbl 0990.68638
Jansson, Jesper; Lingas, Andrzej
4
2001
The do-all problem in broadcast networks. Zbl 1333.68051
Chlebus, Bogdan S.; Kowalski, Dariusz R.; Lingas, Andrzej
3
2001
Fast Boolean matrix multiplication for highly clustered data. Zbl 0997.68753
Björklund, Andreas; Lingas, Andrzej
2
2001
Efficient merging and construction of evolutionary trees. Zbl 1050.68165
Lingas, Andrzej; Olsson, Hans; Östlin, Anna
1
2001
Approximation algorithms for maximum two-dimensional pattern matching. Zbl 0974.68041
Arikati, S. R.; Dessmark, A.; Lingas, A.; Marathe, M. V.
1
2001
Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees. Zbl 0960.05098
Dessmark, A.; Lingas, A.; Proskurowski, A.
7
2000
Fast approximation schemes for Euclidean multi-connectivity problems. (Extended abstract). Zbl 0973.90528
Czumaj, Artur; Lingas, Andrzej
1
2000
Approximation algorithms for Hamming clustering problems. Zbl 0964.68115
Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej
1
2000
Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time. Zbl 0938.68143
Dessmark, A.; Lingas, A.; Proskurowski, A.
1
2000
Maximum packing for biconnected outerplanar graphs. Zbl 0944.05075
Kovacs, Tomas; Lingas, Andrzej
1
2000
On the complexity of constructing evolutionary trees. Zbl 0957.90111
Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej; Östlin, Anna
13
1999
Efficient approximation algorithms for the Hamming center problem. Zbl 0929.68086
Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej
9
1999
On approximability of the minimum-cost \(k\)-connected spanning subgraph problem. Zbl 0974.68156
Czumaj, Artur; Lingas, Andrzej
9
1999
Balanced randomized tree splitting with applications to evolutionary tree constructions. Zbl 0930.05090
Kao, Ming-Yang; Lingas, Andrzej; Östlin, Anna
2
1999
Inferring ordered trees from local constraints. Zbl 0952.68109
Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej; Östlin, Anna
4
1998
A polynomial time approximation scheme for Euclidean minimum cost \(k\)-connectivity. Zbl 0913.05069
Czumaj, Artur; Lingas, Andrzej
3
1998
Minimum convex partition of a polygon with holes by cuts in given directions. Zbl 0910.68221
Lingas, A.; Soltan, V.
3
1998
A note on parallel complexity of maximum \(f\)-matching. Zbl 1338.68100
Dessmark, Anders; Garrido, Oscar; Lingas, Andrzej
1
1998
Improved bounds for integer sorting in the EREW PRAM model. Zbl 0898.68018
Dessmark, Anders; Lingas, Andrzej
1
1998
Maximum tree-packing in time \(O(n^{5/2})\). Zbl 0901.68150
Lingas, Andrzej
2
1997
On the complexity of computing evolutionary trees. Zbl 0889.92021
Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej; Östlin, Anna
2
1997
A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon. Zbl 0859.68113
Klein, Rolf; Lingas, Andrzej
5
1996
Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees. Zbl 1379.68255
Dessmark, Anders; Lingas, Andrzej; Proskurowski, Andrzej
3
1996
A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity. Zbl 0900.68237
Garrido, Oscar; Kelsen, Pierre; Lingas, Andrzej
2
1996
Optimal parallel algorithms for rectilinear link-distance problems. Zbl 0831.68108
Lingas, A.; Maheshwari, A.; Sack, J.-R.
6
1995
On computing Voronoi diagrams for sorted point sets. Zbl 0835.68121
Djidjev, Hristo N.; Lingas, Andrzej
5
1995
Manhattonian proximity in a simple polygon. Zbl 0818.68142
Klein, Rolf; Lingas, Andrzej
2
1995
Multilist layering: Complexity and applications. Zbl 0873.68060
Dessmark, Anders; Lingas, Andrzej; Maheshwari, Anil
1
1995
Hamiltonian abstract Voronoi diagrams in linear time. Zbl 0953.68604
Klein, Rolf; Lingas, Andrzej
5
1994
A linear-time construction of the relative neighborhood graph from the Delaunay triangulation. Zbl 0813.68161
Lingas, Andrzej
4
1994
A simple optimal parallel algorithm for reporting paths in a tree. Zbl 0941.68824
Maheshwari, Anil; Lingas, Andrzej
2
1994
The maximum \(k\)-dependent and \(f\)-dependent set problem. Zbl 0925.05062
Dessmark, Anders; Jansen, Klaus; Lingas, Andrzej
5
1993
Parallel algorithms for finding maximal \(k\)-dependent sets and maximal \(f\)-matchings. Zbl 0802.68092
Diks, Krzysztof; Garrido, Oscar; Lingas, Andrzej
3
1993
An \(O(n\log n)\) algorithm for computing the link center of a simple polygon. Zbl 0776.68108
Djidjev, Hristo N.; Lingas, Andrzej; Sack, Jörg-Rüdiger
12
1992
There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Zbl 0764.05021
Levcopoulos, Christos; Lingas, Andrzej
12
1992
Fast algorithms for greedy triangulation. Zbl 0761.68099
Levcopoulos, Christos; Lingas, Andrzej
5
1992
On the relationships among constrained geometric structures. Zbl 0925.68391
Jennings, Esther; Lingas, Andrzej
1
1992
Bit complexity of matrix products. Zbl 0732.68054
Lingas, Andrzej
1
1991
...and 24 more Documents
all top 5

Cited by 707 Authors

43 Lingas, Andrzej
11 Klein, Rolf-Dieter
10 Gąsieniec, Leszek Antoni
10 Levcopoulos, Christos
9 Dumitrescu, Adrian
9 Jansson, Jesper
9 Kowalski, Dariusz R.
9 Kowaluk, Mirosław
8 Sack, Jörg-Rüdiger
7 Tóth, Csaba D.
6 Chlebus, Bogdan Stanislaw
6 Geffert, Viliam
6 Mulzer, Wolfgang Johann Heinrich
6 Pighizzini, Giovanni
5 Bose, Prosenjit K.
5 Grune, Ansgar
5 Kapoutsis, Christos A.
5 Lundell, Eva-Marta
5 Vansteenwegen, Pieter
4 Chazelle, Bernard
4 Chrobak, Marek
4 Czumaj, Artur
4 Díaz, Josep
4 Durocher, Stephane
4 Fomin, Fedor V.
4 Ghosh, Anirban
4 Karpinski, Marek
4 Korman, Matias
4 Liotta, Giuseppe
4 Morin, Pat
4 Wang, Cao An
3 Aghezzaf, El-Houssaine
3 Cygan, Marek
3 Das, Gautam K.
3 Ebbers-Baumann, Annette
3 Floderus, Peter
3 Gonzalez, Teofilo F.
3 Hromkovič, Juraj
3 Huber, Katharina T.
3 Kranakis, Evangelos Konstantinou
3 Langetepe, Elmar
3 Maheshwari, Anil
3 Marx, Dániel
3 Mereghetti, Carlo
3 Moulton, Vincent L.
3 Nilsson, Bengt J.
3 Nishimura, Naomi
3 Okamoto, Yoshio
3 Otachi, Yota
3 Palios, Leonidas
3 Proskurowski, Andrzej
3 Rokicki, Mariusz A.
3 Schlotter, Ildikó
3 Smid, Michiel H. M.
3 Sung, Wing-Kin
3 Verbeeck, Cédric
3 Verbitsky, Oleg
3 Wang, Haitao
3 Xin, Qin
3 Yuster, Raphael
3 Zheng, Si-Qing
3 Zhukovskii, Maxim Evgenievich
3 Żyliński, Paweł
2 Adamaszek, Anna
2 Ahn, Hee-Kap
2 Al-Jubeh, Marwan
2 Bahoo, Yeganeh
2 Bansal, Nikhil
2 Banyassady, Bahareh
2 Barba, Luis Felipe
2 Bauernöppel, Frank
2 Bazgan, Cristina
2 Berry, Vincent
2 Biri, Venceslas
2 Böckenhauer, Hans-Joachim
2 Bongartz, Dirk
2 Bonizzoni, Paola
2 Boros, Endre
2 Brimkov, Valentin E.
2 Brown, Daniel G.
2 Buchin, Kevin
2 Byrka, Jarosław
2 Cheong, Otfried
2 Costello, Kevin Patrick
2 Couprie, Michel
2 Dahlhaus, Elias
2 de Rezende, Pedro J.
2 de Souza, Cid Carvalho
2 Dehne, Frank
2 Della Vedova, Gianluca
2 Dessmark, Anders
2 Di Stefano, Gabriele
2 Droschinsky, Andre
2 Drysdale, Robert Lewis Scot III
2 Elbassioni, Khaled M.
2 Eppstein, David Arthur
2 Fellows, Michael Ralph
2 Fernandes, Cristina G.
2 Fukunaga, Takuro
2 Garrido, Oscar
...and 607 more Authors
all top 5

Cited in 62 Serials

58 Theoretical Computer Science
37 Algorithmica
33 Computational Geometry
25 Information Processing Letters
15 Discrete Applied Mathematics
13 Discrete & Computational Geometry
13 Information and Computation
13 Journal of Discrete Algorithms
9 International Journal of Computational Geometry & Applications
9 European Journal of Operational Research
8 Journal of Combinatorial Optimization
7 Distributed Computing
7 Discrete Optimization
6 Journal of Computer and System Sciences
6 Computers & Operations Research
6 Algorithms
5 SIAM Journal on Discrete Mathematics
5 Theory of Computing Systems
4 Discrete Mathematics
4 BIT
4 SIAM Journal on Computing
4 Journal of Graph Algorithms and Applications
3 International Journal of Foundations of Computer Science
3 Pattern Recognition
2 Networks
2 Journal of Symbolic Computation
2 Annals of Operations Research
2 Journal of Global Optimization
1 International Journal for Numerical Methods in Fluids
1 Journal of Computational Physics
1 Beiträge zur Algebra und Geometrie
1 Computing
1 Information Sciences
1 Statistics & Probability Letters
1 SIAM Journal on Algebraic and Discrete Methods
1 Journal of Classification
1 Acta Mathematicae Applicatae Sinica. English Series
1 Graphs and Combinatorics
1 Journal of Parallel and Distributed Computing
1 Random Structures & Algorithms
1 International Journal of Computer Mathematics
1 Expositiones Mathematicae
1 Mathematical Programming. Series A. Series B
1 Annals of Mathematics and Artificial Intelligence
1 Journal of Heuristics
1 Parallel Algorithms and Applications
1 RAIRO. Theoretical Informatics and Applications
1 RAIRO. Operations Research
1 Journal of Zhejiang University. Science
1 Journal of Machine Learning Research (JMLR)
1 JMMA. Journal of Mathematical Modelling and Algorithms
1 Quantum Information Processing
1 Journal of Zhejiang University. Science A
1 Optimization Letters
1 Logical Methods in Computer Science
1 Discrete Mathematics, Algorithms and Applications
1 RAIRO. Theoretical Informatics and Applications
1 Theory of Computing
1 Numerical Algebra, Control and Optimization
1 Journal of Theoretical Biology
1 Computer Science Review
1 Journal of Mathematical Modelling and Algorithms in Operations Research

Citations by Year

Wikidata Timeline