default search action
Andrzej Lingas
Person information
- affiliation: Lund University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j108]Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Perpetual maintenance of machines with different urgency requirements. J. Comput. Syst. Sci. 139: 103476 (2024) - [c139]Andrzej Lingas:
Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique. Euro-Par (3) 2024: 45-58 - [i37]Jesper Jansson
, Christos Levcopoulos, Andrzej Lingas:
The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. CoRR abs/2404.06068 (2024) - [i36]Andrzej Lingas:
A Note on Solving Problems of Substantially Super-linear Complexity in No(1) Rounds of the Congested Clique. CoRR abs/2405.15270 (2024) - [i35]Andrzej Lingas:
Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique. CoRR abs/2405.16103 (2024) - 2023
- [j107]Miroslaw Kowaluk, Andrzej Lingas:
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. Algorithmica 85(4): 976-991 (2023) - [j106]Jesper Jansson
Online and Approximate Network Construction from Bounded Connectivity Constraints. Int. J. Found. Comput. Sci. 34(5): 453-468 (2023) - [j105]Artur Czumaj, Andrzej Lingas:
On parallel time in population protocols. Inf. Process. Lett. 179: 106314 (2023) - [c138]Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CCCG 2023: 183-189 - [c137]Andrzej Lingas, Mia Persson:
$(\min ,+)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences. COCOON (2) 2023: 55-68 - [c136]Adrian Dumitrescu, Andrzej Lingas:
Finding Small Complete Subgraphs Efficiently. IWOCA 2023: 185-196 - [c135]Andrzej Lingas
Lower Bounds for Monotone q-Multilinear Boolean Circuits. SOFSEM 2023: 301-312 - [i34]Andrzej Lingas, Mia Persson:
Improved Lower Bounds for Monotone q-Multilinear Boolean Circuits. CoRR abs/2305.07364 (2023) - [i33]Jesper Jansson
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CoRR abs/2305.09987 (2023) - [i32]Adrian Dumitrescu, Andrzej Lingas:
Finding Small Complete Subgraphs Efficiently. CoRR abs/2308.11146 (2023) - [i31]Andrzej Lingas, Mia Persson:
(min, +) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences. CoRR abs/2309.01136 (2023) - 2022
- [j104]Miroslaw Kowaluk
A Multi-Dimensional Matrix Product - A Natural Tool for Parameterized Graph Algorithms. Algorithms 15(12): 448 (2022) - [j103]Stasys Jukna, Andrzej Lingas:
Lower bounds for Boolean circuits of bounded negation width. J. Comput. Syst. Sci. 129: 90-105 (2022) - [c134]Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs. CALDAM 2022: 140-151 - [i30]Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Perpetual maintenance of machines with different urgency requirements. CoRR abs/2202.01567 (2022) - [i29]Andrzej Lingas:
A Note on Lower Bounds for Monotone Multilinear Boolean Circuits. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j102]Leszek Gasieniec, Jesper Jansson
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases. J. Comput. Syst. Sci. 118: 108-118 (2021) - [c133]Miroslaw Kowaluk, Andrzej Lingas:
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products. CALDAM 2021: 440-451 - [c132]Jesper Jansson
Online and Approximate Network Construction from Bounded Connectivity Constraints. CIAC 2021: 314-325 - [c131]Andrzej Lingas:
Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism. LAGOS 2021: 163-171 - [c130]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos
Efficient Assignment of Identities in Anonymous Populations. OPODIS 2021: 12:1-12:21 - [i28]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Efficient Assignment of Identities in Anonymous Populations. CoRR abs/2105.12083 (2021) - [i27]Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs. CoRR abs/2108.03455 (2021) - [i26]Artur Czumaj, Andrzej Lingas:
On Truly Parallel Time in Population Protocols. CoRR abs/2108.11613 (2021) - [i25]Miroslaw Kowaluk, Andrzej Lingas:
Breaking the hegemony of the triangle method in clique detection. CoRR abs/2109.14876 (2021) - 2020
- [j101]Andrzej Lingas, Mia Persson:
Computing the Boolean Product of Two n × n Boolean Matrices Using O(n2) Mechanical Operations. Int. J. Unconv. Comput. 15(3): 225-236 (2020) - [j100]Miroslaw Kowaluk, Andrzej Lingas:
A simple approach to nondecreasing paths. Inf. Process. Lett. 162: 105992 (2020) - [j99]Andrzej Lingas
Graphs with equal domination and covering numbers. J. Comb. Optim. 39(1): 55-71 (2020) - [j98]Andrzej Lingas:
Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth. Theor. Comput. Sci. 820: 17-25 (2020) - [c129]Andrzej Lingas:
Solving Hard Problems by Protein Folding? TPNC 2020: 36-41 - [i24]Andrzej Lingas, Mia Persson:
Computing the Boolean product of two n\times n Boolean matrices using O(n^2) mechanical operation. CoRR abs/2004.13086 (2020) - [i23]Miroslaw Kowaluk, Andrzej Lingas:
Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. CoRR abs/2004.14064 (2020) - [i22]Andrzej Lingas:
Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism. CoRR abs/2011.02428 (2020)
2010 – 2019
- 2019
- [j97]Katharina Dannenberg
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets. Discret. Appl. Math. 257: 101-114 (2019) - [j96]Rolf Klein, Elmar Langetepe, Barbara Schwarzwald
On a Fire Fighter's Problem. Int. J. Found. Comput. Sci. 30(2): 231-246 (2019) - [j95]Dariusz Dereniowski
Clearing directed subgraphs by mobile agents: Variations on covering with paths. J. Comput. Syst. Sci. 102: 57-68 (2019) - [j94]Miroslaw Kowaluk, Andrzej Lingas:
A fast deterministic detection of small pattern graphs in graphs without large cliques. Theor. Comput. Sci. 770: 79-87 (2019) - [c128]Leszek Gasieniec, Jesper Jansson
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. FAW 2019: 156-169 - [c127]Miroslaw Kowaluk, Andrzej Lingas:
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. FCT 2019: 322-334 - [c126]Stasys Jukna
Lower Bounds for DeMorgan Circuits of Bounded Negation Width. STACS 2019: 41:1-41:17 - 2018
- [j93]Peter Floderus, Jesper Jansson
3D Rectangulations and Geometric Matrix Multiplication. Algorithmica 80(1): 136-154 (2018) - [j92]Andrzej Lingas, Mia Persson:
Extreme Witnesses and Their Applications. Algorithmica 80(12): 3943-3957 (2018) - [j91]Rolf Klein, Christos Levcopoulos
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. Algorithms 11(4): 45 (2018) - [j90]Cecilia Bohler, Rolf Klein, Andrzej Lingas, Chih-Hung Liu
Forest-like abstract Voronoi diagrams in linear time. Comput. Geom. 68: 134-145 (2018) - [j89]Miroslaw Kowaluk, Andrzej Lingas:
Are unique subgraphs not easier to find? Inf. Process. Lett. 134: 57-61 (2018) - [j88]Jesper Jansson
Determining the Consistency of Resolved Triplets and Fan Triplets. J. Comput. Biol. 25(7): 740-754 (2018) - [j87]Anna Adamaszek
Approximation Schemes for Capacitated Geometric Network Design. SIAM J. Discret. Math. 32(4): 2720-2746 (2018) - [j86]Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
A QPTAS for the base of the number of crossing-free structures on a planar point set. Theor. Comput. Sci. 711: 56-65 (2018) - [c125]Andrzej Lingas:
Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depth. CCC 2018: 26:1-26:10 - [p1]Artur Czumaj, Andrzej Lingas:
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [i21]Stasys Jukna, Andrzej Lingas:
Lower Bounds for Circuits of Bounded Negation Width. Electron. Colloquium Comput. Complex. TR18 (2018) - [i20]Andrzej Lingas:
Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depth. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j85]Leszek Gasieniec, Christos Levcopoulos
Efficiently Correcting Matrix Products. Algorithmica 79(2): 428-443 (2017) - [c124]Dariusz Dereniowski
The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents). FCT 2017: 190-203 - [c123]Jesper Jansson
Determining the Consistency of Resolved Triplets and Fan Triplets. RECOMB 2017: 82-98 - [c122]Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). SOFSEM 2017: 229-240 - [c121]Andrzej Lingas:
Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution. TAMC 2017: 401-411 - [c120]Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model. TAMC 2017: 412-424 - [c119]Miroslaw Kowaluk, Andrzej Lingas:
A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques. WALCOM 2017: 217-227 - [i19]Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski:
The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents). CoRR abs/1712.00316 (2017) - 2016
- [r3]Artur Czumaj, Andrzej Lingas:
Minimum k-Connected Geometric Networks. Encyclopedia of Algorithms 2016: 1318-1322 - [i18]Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama:
Efficiently Correcting Matrix Products. CoRR abs/1602.00435 (2016) - 2015
- [j84]Andrzej Lingas, Mia Persson:
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows. Algorithmica 72(2): 607-619 (2015) - [j83]Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Detecting monomials with k distinct variables. Inf. Process. Lett. 115(2): 82-86 (2015) - [j82]Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Detecting and Counting Small Pattern Graphs. SIAM J. Discret. Math. 29(3): 1322-1339 (2015) - [j81]Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Induced subgraph isomorphism: Are some patterns substantially easier than others? Theor. Comput. Sci. 605: 119-128 (2015) - [c118]Andrzej Lingas, Mia Persson:
Extreme Witnesses and Their Applications. COCOA 2015: 452-466 - [c117]Jesper Jansson
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. CPM 2015: 272-283 - [c116]Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set. ICALP (1) 2015: 785-796 - 2014
- [j80]Niklas Zechner, Andrzej Lingas:
Efficient Algorithms for Subgraph Listing. Algorithms 7(2): 243-252 (2014) - [j79]Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Iterative merging heuristics for correlation clustering. Int. J. Metaheuristics 3(2): 105-117 (2014) - [j78]Christos Levcopoulos
A note on a QPTAS for maximum weight triangulation of planar point sets. Inf. Process. Lett. 114(8): 414-416 (2014) - [j77]Andrzej Lingas, Leonidas Palios
Corrigendum to "Note on covering monotone orthogonal polygons" [Inf. Process. Lett. 104(6) (2007) 220-227]. Inf. Process. Lett. 114(11): 646-654 (2014) - [j76]Jesper Jansson
Computing the rooted triplet distance between galled trees by counting triangles. J. Discrete Algorithms 25: 66-78 (2014) - [c115]Christos Levcopoulos
Clearing Connections by Few Agents. FUN 2014: 289-300 - [c114]Leszek Gasieniec, Christos Levcopoulos
Efficiently Correcting Matrix Products. ISAAC 2014: 53-64 - [c113]Peter Floderus, Jesper Jansson
3D Rectangulations and Geometric Matrix Multiplication. ISAAC 2014: 65-78 - [c112]Rolf Klein, Christos Levcopoulos
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. LATIN 2014: 261-272 - [i17]Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
A QPTAS for the Base of the Number of Triangulations of a Planar Point Set. CoRR abs/1411.0544 (2014) - [i16]Andrzej Lingas:
Vector convolution in O(n) steps and matrix multiplication in O(n^2) steps : -). Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j75]Frantisek Galcík, Leszek Gasieniec, Andrzej Lingas:
Efficient broadcasting in radio networks with long-range interference. Distributed Comput. 26(1): 59-74 (2013) - [j74]Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Unique subgraphs are not easier to find. Int. J. Comput. Math. 90(6): 1247-1253 (2013) - [j73]Peter Floderus, Andrzej Lingas, Mia Persson:
Towards More Efficient Infection and Fire Fighting. Int. J. Found. Comput. Sci. 24(1): 3-14 (2013) - [j72]Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
Optimal cuts and partitions in tree metrics in polynomial time. Inf. Process. Lett. 113(12): 447-451 (2013) - [j71]Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Counting and Detecting Small Subgraphs via Equations. SIAM J. Discret. Math. 27(2): 892-909 (2013) - [c111]Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Detecting and Counting Small Pattern Graphs. ISAAC 2013: 547-557 - [c110]Andrzej Lingas, Mia Persson:
Simple Iterative Heuristics for Correlation Clustering. LSSC 2013: 264-271 - [i15]Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Detecting Monomials with k Distinct Variables. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j70]Piotr Berman, Marek Karpinski, Andrzej Lingas:
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. Algorithmica 64(2): 295-310 (2012) - [j69]Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski:
Linear-Time 3-Approximation Algorithm for the R-Star Covering Problem. Int. J. Comput. Geom. Appl. 22(2): 103-142 (2012) - [j68]Jesper Jansson
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. SIAM J. Comput. 41(1): 272-291 (2012) - [c109]Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? COCOON 2012: 37-48 - [c108]Jesper Jansson
Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles. CPM 2012: 385-398 - [c107]Andrzej Lingas, Mia Persson:
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows. Euro-Par 2012: 688-699 - [c106]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 - [i14]Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
Optimal Cuts and Bisections on the Real Line in Polynomial Time. CoRR abs/1207.0933 (2012) - [i13]Andrzej Lingas, Mia Persson:
A fast parallel algorithm for minimum-cost small integral flows. CoRR abs/1210.0340 (2012) - [i12]Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
Optimal Cuts and Partitions in Tree Metrics in Polynomial Time. CoRR abs/1212.3471 (2012) - [i11]Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
Optimal Cuts and Partitions in Tree Metrics in Polynomial Time. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j67]Andrzej Lingas:
A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication. Algorithmica 61(1): 36-50 (2011) - [j66]Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Int. J. Found. Comput. Sci. 22(8): 1949-1969 (2011) - [c105]Peter Floderus, Andrzej Lingas, Mia Persson:
Towards More Efficient Infection and Fire Fighting. CATS 2011: 69-74 - [c104]Anna Adamaszek
Approximation Schemes for Capacitated Geometric Network Design. ICALP (1) 2011: 25-36 - [c103]Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Unique Small Subgraphs Are Not Easier to Find. LATA 2011: 336-341 - [c102]Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Counting and detecting small subgraphs via equations and matrix multiplication. SODA 2011: 1468-1476 - [c101]Andrzej Lingas, Cui Di:
Near Approximation of Maximum Weight Matching through Efficient Weight Reduction. TAMC 2011: 48-57 - [i10]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) - [i9]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) - 2010
- [j65]Anna Adamaszek
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) - [c100]Piotr Berman, Marek Karpinski, Andrzej Lingas:
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. COCOON 2010: 226-234 - [c99]Antonios Antoniadis, Andrzej Lingas:
Approximability of Edge Matching Puzzles. SOFSEM 2010: 153-164 - [c98]Jesper Jansson
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. WABI 2010: 262-273 - [i8]Cui Di, Andrzej Lingas:
Near approximation of maximum weight matching through efficient weight reduction. CoRR abs/1012.5911 (2010)
2000 – 2009
- 2009
- [j64]Leszek Gasieniec, Miroslaw Kowaluk, Andrzej Lingas:
Faster multi-witnesses for Boolean matrix multiplication. Inf. Process. Lett. 109(4): 242-247 (2009) - [j63]Andrzej Lingas, Eva-Marta Lundell:
Efficient approximation algorithms for shortest cycles in undirected graphs. Inf. Process. Lett. 109(10): 493-498 (2009) - [j62]Andrzej Lingas, Martin Wahlen:
An exact algorithm for subgraph homeomorphism. J. Discrete Algorithms 7(4): 464-468 (2009) - [j61]Artur Czumaj, Andrzej Lingas:
Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication. SIAM J. Comput. 39(2): 431-444 (2009) - [c97]Andrzej Lingas:
A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication. ESA 2009: 408-419 - [c96]Anna Adamaszek
PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k. ISAAC 2009: 994-1003 - [c95]Frantisek Galcík, Leszek Gasieniec, Andrzej Lingas:
Efficient broadcasting in known topology radio networks with long-range interference. PODC 2009: 230-239 - [c94]Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. WADS 2009: 168-180 - [i7]Piotr Berman, Marek Karpinski, Andrzej Lingas:
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications. CoRR abs/0904.2310 (2009) - [i6]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) - 2008
- [j60]Kazuo Iwama, Andrzej Lingas, Masaki Okita:
Max-Stretch Reduction for Tree Spanners. Algorithmica 50(2): 223-235 (2008) - [j59]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) - [c93]Andrzej Lingas, Eva-Marta Lundell:
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs. LATIN 2008: 736-746 - [c92]Miroslaw Kowaluk, Andrzej Lingas, Johannes Nowak:
A Path Cover Technique for LCAs in Dags. SWAT 2008: 222-233 - [c91]Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski:
Linear-Time 3-Approximation Algorithm for the r -Star Covering Problem. WALCOM 2008: 157-168 - [c90]Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Lingas, Martin Wahlen:
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. DISC 2008: 274-288 - [r2]Artur Czumaj, Andrzej Lingas:
Minimum k-Connected Geometric Networks. Encyclopedia of Algorithms 2008 - 2007
- [j58]Anders Dessmark, Jesper Jansson
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. Algorithmica 48(3): 233-248 (2007) - [j57]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. Geom. Appl. 17(3): 201-230 (2007) - [j56]Anders Dessmark, Jesper Jansson
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. Int. J. Found. Comput. Sci. 18(2): 217-226 (2007) - [j55]Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski:
Note on covering monotone orthogonal polygons with star-shaped polygons. Inf. Process. Lett. 104(6): 220-227 (2007) - [j54]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) - [j53]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) - [c89]Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas:
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. AAIM 2007: 337-345 - [c88]Miroslaw Kowaluk, Andrzej Lingas:
Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication. ESA 2007: 265-274 - [c87]Artur Czumaj, Andrzej Lingas:
Finding a heaviest triangle is not harder than matrix multiplication. SODA 2007: 986-994 - [c86]Andrzej Lingas, Martin Wahlen:
On Exact Complexity of Subgraph Homeomorphism. TAMC 2007: 256-261 - [r1]Artur Czumaj, Andrzej Lingas:
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j52]Rolf Klein, Christos Levcopoulos
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) - [j51]Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas:
Performing work in broadcast networks. Distributed Comput. 18(6): 435-451 (2006) - [j50]Andrzej Lingas, Leszek Gasieniec:
Preface. Theor. Comput. Sci. 354(3): 319 (2006) - [c85]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 - [c84]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 - [i5]Artur Czumaj, Andrzej Lingas:
Finding a Heaviest Triangle is not Harder than Matrix Multiplication. Electron. Colloquium Comput. Complex. TR06 (2006) - [i4]Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas:
Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j49]Andrzej Lingas, Martin Wahlen:
A note on maximum independent set and related problems on box graphs. Inf. Process. Lett. 93(4): 169-171 (2005) - [j48]Artur Czumaj, Magnús M. Halldórsson
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. Inf. Process. Lett. 94(2): 49-53 (2005) - [j47]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) - [c83]Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson:
Approximate Clustering of Fingerprint Vectors with Missing Values. CATS 2005: 57-60 - [c82]Miroslaw Kowaluk, Andrzej Lingas:
LCA Queries in Directed Acyclic Graphs. ICALP 2005: 241-248 - [c81]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 - [c80]Kazuo Iwama, Andrzej Lingas, Masaki Okita:
Max-stretch Reduction for Tree Spanners. WADS 2005: 122-133 - 2004
- [j46]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) - [j45]Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas:
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs. Fundam. Informaticae 62(3-4): 369-375 (2004) - [j44]Leszek Gasieniec, Jesper Jansson
Approximation algorithms for Hamming clustering problems. J. Discrete Algorithms 2(2): 289-301 (2004) - [c79]Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. CPM 2004: 220-229 - [c78]Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell:
Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices. SWAT 2004: 248-259 - [i3]Andrzej Lingas, Martin Wahlen:
On approximation of the maximum clique minor containment problem and some subgraph homeomorphism problems. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j43]Jesper Jansson, Andrzej Lingas:
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. Fundam. Informaticae 56(1-2): 105-120 (2003) - [j42]Anders Dessmark, Andrzej Lingas, Andrzej Pelc:
Trade-Offs Between Load and Degree in Virtual Path Layouts. Parallel Process. Lett. 13(3): 485-496 (2003) - [c77]Andrzej Lingas, Martin Wahlen:
Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs. COCOON 2003: 50-56 - [c76]Artur Czumaj, Andrzej Lingas, Johan Nilsson:
Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. ISAAC 2003: 544-553 - [c75]Leszek Gasieniec, Andrzej Lingas:
An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data. WADS 2003: 329-339 - [e4]Andrzej Lingas, Bengt J. Nilsson:
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 [contents] - 2002
- [j41]Fedor V. Fomin
Approximation algorithms for time-dependent orienteering. Inf. Process. Lett. 83(2): 57-62 (2002) - [j40]Leszek Gasieniec, Andrzej Lingas:
On adaptive deterministic gossiping in ad hoc radio networks. Inf. Process. Lett. 83(2): 89-93 (2002) - [c74]Malin Christersson, Leszek Gasieniec, Andrzej Lingas:
Gossiping with Bounded Size Messages in ad hoc Radio Networks. ICALP 2002: 377-389 - [c73]Artur Czumaj, Andrzej Lingas, Hairong Zhao:
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. ICALP 2002: 973-984 - [c72]Andrzej Lingas:
A Geometric Approach to Boolean Matrix Multiplication. ISAAC 2002: 501-510 - [c71]Leszek Gasieniec, Andrzej Lingas:
On adaptive deterministic gossiping in ad hoc radio networks. SODA 2002: 689-690 - [c70]Christos Levcopoulos
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains. SWAT 2002: 80-89 - 2001
- [j39]Andrzej Lingas, Hans Olsson, Anna Östlin:
Efficient Merging and Construction of Evolutionary Trees. J. Algorithms 41(1): 41-51 (2001) - [j38]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) - [c69]Jesper Jansson
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. CPM 2001: 232-240 - [c68]Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis:
Oblivious gossiping in ad-hoc radio networks. DIAL-M 2001: 44-51 - [c67]Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas:
A Fast Algorithm for Approximating the Detour of a Polygonal Chain. ESA 2001: 321-332 - [c66]Fedor V. Fomin, Andrzej Lingas:
Approximation Algorithms for Time-Dependent Orienteering. FCT 2001: 508-515 - [c65]Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas:
The do-all problem in broadcast networks. PODC 2001: 117-127 - [c64]Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel:
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. STACS 2001: 365-375 - [c63]Andreas Björklund, Andrzej Lingas:
Fast Boolean Matrix Multiplication for Highly Clustered Data. WADS 2001: 258-263 - 2000
- [j37]Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski:
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. Algorithmica 27(3): 337-347 (2000) - [j36]Tomas Kovacs, Andrzej Lingas:
Maximum packing for biconnected outerplanar graphs. Discret. Appl. Math. 100(1-2): 85-94 (2000) - [j35]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) - [c62]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Approximation Algorithms for Hamming Clustering Problems. CPM 2000: 108-118 - [c61]Artur Czumaj, Andrzej Lingas:
Fast Approximation Schemes for Euclidean Multi-connectivity Problems. ICALP 2000: 856-868 - [i2]Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas:
Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs. Electron. Colloquium Comput. Complex. TR00 (2000) - [i1]Klaus Jansen, Marek Karpinski, Andrzej Lingas:
A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j34]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
On the Complexity of Constructing Evolutionary Trees. J. Comb. Optim. 3(2-3): 183-197 (1999) - [j33]Krzysztof Diks, Andrzej Lingas, Andrzej Pelc:
An Optimal Algorithm for Broadcasting Multiple Messages in Trees. J. Parallel Distributed Comput. 59(3): 465-474 (1999) - [c60]Andrzej Lingas, Hans Olsson, Anna Östlin:
Efficient Merging, Construction, and Maintenance of Evolutionary Trees. ICALP 1999: 544-553 - [c59]Artur Czumaj, Andrzej Lingas:
On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem. SODA 1999: 281-290 - [c58]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Efficient Approximation Algorithms for the Hamming Center Problem. SODA 1999: 905-906 - [c57]Ming-Yang Kao, Andrzej Lingas, Anna Östlin:
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions. STACS 1999: 184-196 - 1998
- [j32]Anders Dessmark, Oscar Garrido, Andrzej Lingas:
A Note on Parallel Complexity of Maximum f-Matching. Inf. Process. Lett. 65(2): 107-109 (1998) - [j31]Anders Dessmark, Andrzej Lingas:
Improved Bounds for Integer Sorting in the EREW PRAM Model. J. Parallel Distributed Comput. 48(1): 64-70 (1998) - [j30]Andrzej Lingas, Valeriu Soltan:
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. Theory Comput. Syst. 31(5): 507-538 (1998) - [c56]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
Inferring Ordered Trees from Local Constraints. CATS 1998: 67-76 - [c55]Andrzej Lingas:
Subexponential-time algorithms for minimum weight triangulations and related problems. CCCG 1998 - [c54]Artur Czumaj, Andrzej Lingas:
A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. ICALP 1998: 682-694 - [c53]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 - [c52]Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto:
Optimal Broadcasting in Almost Trees and Partial k-trees. STACS 1998: 432-443 - 1997
- [j29]Andrzej Lingas, Anil Maheshwari:
A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. Parallel Process. Lett. 7(1): 3-11 (1997) - [j28]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) - [j27]Andrzej Lingas:
Maximum Tree-Packing in Time O(n5/2). Theor. Comput. Sci. 181(2): 307-316 (1997) - [c51]Leszek Gasieniec, Jesper Jansson
On the Complexity of Computing Evolutionary Trees. COCOON 1997: 134-145 - [c50]Krzysztof Diks, Andrzej Lingas, Andrzej Pelc:
An Optimal Algorithm for Broadcasting Multiple Messages in Trees. SIROCCO 1997: 69-80 - [c49]Tomas Kovacs, Andrzej Lingas:
Maximum Packing for Biconnected Outerplanar Graphs. TAPSOFT 1997: 393-404 - 1996
- [j26]Rolf Klein, Andrzej Lingas:
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. Int. J. Comput. Geom. Appl. 6(3): 263-278 (1996) - [j25]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) - [j24]Bengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind:
On 2-QBF Truth Testing in Parallel. Inf. Process. Lett. 57(2): 89-93 (1996) - [j23]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) - [j22]Rolf G. Karlsson, Andrzej Lingas:
Guest Editor's Foreword. Nord. J. Comput. 3(4): 293-294 (1996) - [c48]Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe:
Approximation Algorithms for Maximum Two-Dimensional Pattern Matching. CPM 1996: 348-360 - [c47]Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski:
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. ESA 1996: 501-513 - [c46]Andrzej Lingas, Valeriu Soltan:
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. ISAAC 1996: 315-325 - [c45]Anders Dessmark, Andrzej Lingas:
On the Power of Nonconservative PRAM. MFCS 1996: 303-311 - [e3]Rolf G. Karlsson, Andrzej Lingas:
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 [contents] - 1995
- [j21]Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack
Optimal Parallel Algorithms for Rectilinear Link-Distance Problems. Algorithmica 14(3): 261-289 (1995) - [j20]Rolf Klein, Andrzej Lingas:
Manhattonian proximity in a simple polygon. Int. J. Comput. Geom. Appl. 5: 53-74 (1995) - [j19]Hristo N. Djidjev
On computing Voronoi diagrams for sorted point sets. Int. J. Comput. Geom. Appl. 5(3): 327-337 (1995) - [j18]Anders Dessmark, Andrzej Lingas, Anil Maheshwari:
Multilist Layering: Complexity and Applications. Theor. Comput. Sci. 141(1&2): 337-350 (1995) - [c44]Andrzej Lingas:
Maximum Tree-Packing in Time O(n5/2). COCOON 1995: 121-130 - [c43]Rolf Klein, Andrzej Lingas:
Fast Skeleton Construction. ESA 1995: 582-595 - [c42]Christos Levcopoulos, Andrzej Lingas, Cao Wang:
On Parallel Complexity of Planar Triangulations. FSTTCS 1995: 413-427 - [c41]Andrzej Lingas, Asish Mukhopadhyay:
A Linear-time Construction of the Relative Neighborhood Graph within a Histogram. WADS 1995: 228-238 - 1994
- [j17]Andrzej Lingas:
A Linear-time Construction of the Relative Neighborhood Graph From the Delaunay Triangulation. Comput. Geom. 4: 199-208 (1994) - [j16]Andrzej Lingas:
Editor's Foreword. Nord. J. Comput. 1(3): 273 (1994) - [c40]Rolf Klein, Andrzej Lingas:
Hamiltonian Abstract Voronoi Diagrams in Linear Time. ISAAC 1994: 11-19 - [c39]Anders Dessmark, Andrzej Lingas, Oscar Garrido:
On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. MFCS 1994: 316-325 - [c38]Anil Maheshwari, Andrzej Lingas:
A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. STACS 1994: 487-495 - [c37]Piotr Berman, Andrzej Lingas:
A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. SWAT 1994: 73-82 - 1993
- [j15]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) - [c36]Rolf Klein, Andrzej Lingas:
A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon. CCCG 1993: 370-374 - [c35]Rolf Klein, Andrzej Lingas:
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. SCG 1993: 124-132 - [c34]Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack:
Parallel Algorithms for Rectilinear Link Distance Problems. IPPS 1993: 65-72 - [c33]Anders Dessmark, Klaus Jansen, Andrzej Lingas:
The Maximum k-Dependent and f-Dependent Set Problem. ISAAC 1993: 88-98 - [c32]Anders Dessmark, Andrzej Lingas, Anil Maheshwari:
Multi-List Ranking: Complexity and Applications. STACS 1993: 306-316 - [e2]Andrzej Lingas, Rolf G. Karlsson, Svante Carlsson:
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 [contents] - 1992
- [j14]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) - [j13]Christos Levcopoulos, Andrzej Lingas:
Fast Algorithms for Greedy Triangulation. BIT 32(2): 280-296 (1992) - [j12]Hristo N. Djidjev
An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. 8: 131-152 (1992) - [c31]Rolf Klein, Andrzej Lingas:
Manhattonian Proximity in a Simple Polygon. SCG 1992: 312-319 - [c30]Christos Levcopoulos, Andrzej Lingas:
C-sensitive Triangulations Approximate the MinMax Length Triangulation. FSTTCS 1992: 104-115 - [c29]Esther Jennings, Andrzej Lingas:
On the Relationship among Constrained Geometric Structures. ISAAC 1992: 289-298 - [c28]Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter:
A Simple Randomized Parallel Algorithm for Maximal f-Matching. LATIN 1992: 165-176 - 1991
- [j11]Andrzej Lingas:
An Unfeasible Matching Problem. BIT 31(4): 591-597 (1991) - [j10]Andrzej Lingas:
Bit Complexity of Matrix Products. Inf. Process. Lett. 38(5): 237-242 (1991) - [c27]Christos Levcopoulos, Andrzej Lingas:
Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case. ICCI 1991: 139-148 - [c26]Esther Jennings, Andrzej Lingas, Lenka Motyckova:
Dynamic Detection of Forest of Tree-Connected Meshes. ICPP (3) 1991: 300-301 - [c25]Krzysztof Diks, Oscar Garrido, Andrzej Lingas:
Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. ISA 1991: 385-395 - [c24]Hristo N. Djidjev, Andrzej Lingas:
On Computing the Voronoi Diagram for Restricted Planar Figures. WADS 1991: 54-64 - 1990
- [j9]Andrzej Lingas:
A Note on a Parallel Heuristic for Minimum. Bull. EATCS 42: 174-177 (1990) - [c23]Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter:
Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. FSTTCS 1990: 204-214 - [c22]Andrzej Lingas:
Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs. SIGAL International Symposium on Algorithms 1990: 447-457 - [c21]Christos Levcopoulos, Andrzej Lingas:
Fast Algorithms for Greedy Triangulation. SWAT 1990: 238-250
1980 – 1989
- 1989
- [j8]Andrzej Lingas, Marek Karpinski:
Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching. Inf. Process. Lett. 30(1): 27-32 (1989) - [j7]Andrzej Lingas:
Voronoi Diagrams with Barriers and the Shortest Diagonal Problem. Inf. Process. Lett. 32(4): 191-198 (1989) - [j6]Andrzej Lingas:
Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time. Theor. Comput. Sci. 63(3): 295-302 (1989) - [j5]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) - [j4]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) - [c20]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 - [c19]Hristo N. 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 - 1988
- [j3]James A. Dean, Andrzej Lingas, Jörg-Rüdiger Sack
Recognizing polygons, or how to spy. Vis. Comput. 3(6): 344-355 (1988) - [c18]Andrzej Lingas, Maciej M. Syslo:
A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs. ICALP 1988: 394-409 - [c17]Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas:
An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. SWAT 1988: 190-198 - [c16]Andrzej Lingas:
Greedy Triangulation acn be Efficiently Implemented in the Average Case (Extended Abstract). WG 1988: 253-261 - [e1]Rolf G. Karlsson, Andrzej Lingas:
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 [contents] - 1987
- [j2]Christos Levcopoulos, Andrzej Lingas:
On Approximation Behavior of the Greedy Triangulation for Convex Polygons. Algorithmica 2: 15-193 (1987) - [j1]Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack
Algorithms for Minimum Length Partitions of Polygons. BIT 27(4): 474-479 (1987) - [c15]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 - [c14]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 - 1986
- [c13]Andrzej Lingas:
On Approximation Behavior and Implementation of the Greedy Triangulation for Convex Planar Point Sets. SCG 1986: 72-79 - [c12]Andrzej Lingas:
Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time. STACS 1986: 98-103 - 1985
- [c11]Andrzej Lingas:
On partitioning polygons. SCG 1985: 288-295 - 1984
- [c10]Christos Levcopoulos, Andrzej Lingas:
Bounds on the Length of Convex Partitions of Polygons. FSTTCS 1984: 279-295 - [c9]Christos Levcopoulos, Andrzej Lingas:
Covering Polygons with Minimum Number of Rectangles. STACS 1984: 63-72 - 1983
- [c8]Andrzej Lingas:
An Application of Maximum Bipartite C-Matching to Subtree Isomorphism. CAAP 1983: 284-299 - [c7]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 - [c6]Andrzej Lingas:
A Note on Computational Complexity of Logic Programs. Logic Programming Workshop 1983: 461-473 - [c5]Andrzej Lingas:
Heuristics for minimum edge length rectangular partitions of rectilinear figures. Theoretical Computer Science 1983: 199-210 - 1982
- [c4]Andrzej Lingas:
The Power of Non-Rectilinear Holes. ICALP 1982: 369-383 - 1981
- [c3]Andrzej Lingas:
Certain Algorithms for Subgraph Isomorphism Problems. CAAP 1981: 290-307
1970 – 1979
- 1979
- [c2]Andrzej Lingas:
The complexity of distributive computations. FCT 1979: 262-268 - 1978
- [c1]Andrzej Lingas:
A PSPACE Complete Problem Related to a Pebble Game. ICALP 1978: 300-321
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 00:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: