| 2008 |
|---|
| 152 | EE | Andrzej Lingas,
Eva-Marta Lundell:
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs.
LATIN 2008: 736-746 |
| 151 | EE | Andrzej Lingas,
Agnieszka Wasylewicz,
Pawel Zylinski:
Linear-Time 3-Approximation Algorithm for the r -Star Covering Problem.
WALCOM 2008: 157-168 |
| 150 | EE | Kazuo Iwama,
Andrzej Lingas,
Masaki Okita:
Max-Stretch Reduction for Tree Spanners.
Algorithmica 50(2): 223-235 (2008) |
| 149 | EE | 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) |
| 2007 |
|---|
| 148 | EE | Xin Han,
Kazuo Iwama,
Rolf Klein,
Andrzej Lingas:
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs.
AAIM 2007: 337-345 |
| 147 | EE | Miroslaw Kowaluk,
Andrzej Lingas:
Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication.
ESA 2007: 265-274 |
| 146 | EE | Artur Czumaj,
Andrzej Lingas:
Finding a heaviest triangle is not harder than matrix multiplication.
SODA 2007: 986-994 |
| 145 | EE | Andrzej Lingas,
Martin Wahlen:
On Exact Complexity of Subgraph Homeomorphism.
TAMC 2007: 256-261 |
| 144 | EE | Anders Dessmark,
Jesper Jansson,
Andrzej Lingas,
Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.
Algorithmica 48(3): 233-248 (2007) |
| 143 | EE | Andrzej Lingas,
Agnieszka Wasylewicz,
Pawel Zylinski:
Note on covering monotone orthogonal polygons with star-shaped polygons.
Inf. Process. Lett. 104(6): 220-227 (2007) |
| 142 | EE | 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) |
| 141 | EE | 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) |
| 2006 |
|---|
| 140 | EE | 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 |
| 139 | EE | Rolf Klein,
Christos Levcopoulos,
Andrzej Lingas:
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation.
Comput. Geom. 34(1): 28-34 (2006) |
| 138 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski,
Andrzej Lingas:
Performing work in broadcast networks.
Distributed Computing 18(6): 435-451 (2006) |
| 137 | EE | Andrzej Lingas,
Leszek Gasieniec:
Preface.
Theor. Comput. Sci. 354(3): 319 (2006) |
| 2005 |
|---|
| 136 | EE | Andres Figueroa,
Avraham Goldstein,
Tao Jiang,
Maciej Kurowski,
Andrzej Lingas,
Mia Persson:
Approximate Clustering of Fingerprint Vectors with Missing Values.
CATS 2005: 57-60 |
| 135 | EE | Miroslaw Kowaluk,
Andrzej Lingas:
LCA Queries in Directed Acyclic Graphs.
ICALP 2005: 241-248 |
| 134 | EE | 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 |
| 133 | EE | Kazuo Iwama,
Andrzej Lingas,
Masaki Okita:
Max-stretch Reduction for Tree Spanners.
WADS 2005: 122-133 |
| 132 | EE | Andrzej Lingas,
Martin Wahlen:
A note on maximum independent set and related problems on box graphs.
Inf. Process. Lett. 93(4): 169-171 (2005) |
| 131 | EE | Artur Czumaj,
Magnús M. Halldórsson,
Andrzej Lingas,
Johan Nilsson:
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth.
Inf. Process. Lett. 94(2): 49-53 (2005) |
| 130 | EE | 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) |
| 2004 |
|---|
| 129 | EE | Anders Dessmark,
Jesper Jansson,
Andrzej Lingas,
Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.
CPM 2004: 220-229 |
| 128 | EE | Anders Dessmark,
Andrzej Lingas,
Eva-Marta Lundell:
Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices.
SWAT 2004: 248-259 |
| 127 | EE | 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) |
| 126 | EE | Andrzej Lingas,
Martin Wahlen:
On approximation of the maximum clique minor containment problem and some subgraph homeomorphism problems
Electronic Colloquium on Computational Complexity (ECCC)(039): (2004) |
| 125 | EE | Marek Karpinski,
Miroslaw Kowaluk,
Andrzej Lingas:
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs.
Fundam. Inform. 62(3-4): 369-375 (2004) |
| 124 | EE | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas:
Approximation algorithms for Hamming clustering problems.
J. Discrete Algorithms 2(2): 289-301 (2004) |
| 2003 |
|---|
| 123 | | Andrzej Lingas,
Bengt J. Nilsson:
Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings
Springer 2003 |
| 122 | EE | Andrzej Lingas,
Martin Wahlen:
Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs.
COCOON 2003: 50-56 |
| 121 | EE | Artur Czumaj,
Andrzej Lingas,
Johan Nilsson:
Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth.
ISAAC 2003: 544-553 |
| 120 | EE | Leszek Gasieniec,
Andrzej Lingas:
An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data.
WADS 2003: 329-339 |
| 119 | EE | Jesper Jansson,
Andrzej Lingas:
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees.
Fundam. Inform. 56(1-2): 105-120 (2003) |
| 118 | EE | Anders Dessmark,
Andrzej Lingas,
Andrzej Pelc:
Trade-Offs Between Load and Degree in Virtual Path Layouts.
Parallel Processing Letters 13(3): 485-496 (2003) |
| 2002 |
|---|
| 117 | EE | Malin Christersson,
Leszek Gasieniec,
Andrzej Lingas:
Gossiping with Bounded Size Messages in ad hoc Radio Networks.
ICALP 2002: 377-389 |
| 116 | EE | Artur Czumaj,
Andrzej Lingas,
Hairong Zhao:
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem.
ICALP 2002: 973-984 |
| 115 | EE | Andrzej Lingas:
A Geometric Approach to Boolean Matrix Multiplication.
ISAAC 2002: 501-510 |
| 114 | EE | Leszek Gasieniec,
Andrzej Lingas:
On adaptive deterministic gossiping in ad hoc radio networks.
SODA 2002: 689-690 |
| 113 | EE | Christos Levcopoulos,
Andrzej Lingas,
Joseph S. B. Mitchell:
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains.
SWAT 2002: 80-89 |
| 112 | EE | Fedor V. Fomin,
Andrzej Lingas:
Approximation algorithms for time-dependent orienteering.
Inf. Process. Lett. 83(2): 57-62 (2002) |
| 111 | EE | Leszek Gasieniec,
Andrzej Lingas:
On adaptive deterministic gossiping in ad hoc radio networks.
Inf. Process. Lett. 83(2): 89-93 (2002) |
| 2001 |
|---|
| 110 | EE | Jesper Jansson,
Andrzej Lingas:
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees.
CPM 2001: 232-240 |
| 109 | EE | Bogdan S. Chlebus,
Leszek Gasieniec,
Andrzej Lingas,
Aris Pagourtzis:
Oblivious gossiping in ad-hoc radio networks.
DIAL-M 2001: 44-51 |
| 108 | EE | Annette Ebbers-Baumann,
Rolf Klein,
Elmar Langetepe,
Andrzej Lingas:
A Fast Algorithm for Approximating the Detour of a Polygonal Chain.
ESA 2001: 321-332 |
| 107 | EE | Fedor V. Fomin,
Andrzej Lingas:
Approximation Algorithms for Time-Dependent Orienteering.
FCT 2001: 508-515 |
| 106 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski,
Andrzej Lingas:
The do-all problem in broadcast networks.
PODC 2001: 117-127 |
| 105 | EE | Klaus Jansen,
Marek Karpinski,
Andrzej Lingas,
Eike Seidel:
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.
STACS 2001: 365-375 |
| 104 | EE | Andreas Björklund,
Andrzej Lingas:
Fast Boolean Matrix Multiplication for Highly Clustered Data.
WADS 2001: 258-263 |
| 103 | | Andrzej Lingas,
Hans Olsson,
Anna Östlin:
Efficient Merging and Construction of Evolutionary Trees.
J. Algorithms 41(1): 41-51 (2001) |
| 102 | EE | 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) |
| 2000 |
|---|
| 101 | EE | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas:
Approximation Algorithms for Hamming Clustering Problems.
CPM 2000: 108-118 |
| 100 | EE | Artur Czumaj,
Andrzej Lingas:
Fast Approximation Schemes for Euclidean Multi-connectivity Problems.
ICALP 2000: 856-868 |
| 99 | EE | Anders Dessmark,
Andrzej Lingas,
Andrzej Proskurowski:
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees.
Algorithmica 27(3): 337-347 (2000) |
| 98 | | Tomas Kovacs,
Andrzej Lingas:
Maximum packing for biconnected outerplanar graphs.
Discrete Applied Mathematics 100(1-2): 85-94 (2000) |
| 97 | EE | Marek Karpinski,
Miroslaw Kowaluk,
Andrzej Lingas:
Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs
Electronic Colloquium on Computational Complexity (ECCC) 7(51): (2000) |
| 96 | EE | Klaus Jansen,
Marek Karpinski,
Andrzej Lingas:
A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs
Electronic Colloquium on Computational Complexity (ECCC) 7(64): (2000) |
| 95 | EE | 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) |
| 1999 |
|---|
| 94 | EE | Andrzej Lingas,
Hans Olsson,
Anna Östlin:
Efficient Merging, Construction, and Maintenance of Evolutionary Trees.
ICALP 1999: 544-553 |
| 93 | EE | Artur Czumaj,
Andrzej Lingas:
On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem.
SODA 1999: 281-290 |
| 92 | EE | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas:
Efficient Approximation Algorithms for the Hamming Center Problem.
SODA 1999: 905-906 |
| 91 | EE | Ming-Yang Kao,
Andrzej Lingas,
Anna Östlin:
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions.
STACS 1999: 184-196 |
| 90 | | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas,
Anna Östlin:
On the Complexity of Constructing Evolutionary Trees.
J. Comb. Optim. 3(2-3): 183-197 (1999) |
| 89 | | Krzysztof Diks,
Andrzej Lingas,
Andrzej Pelc:
An Optimal Algorithm for Broadcasting Multiple Messages in Trees.
J. Parallel Distrib. Comput. 59(3): 465-474 (1999) |
| 1998 |
|---|
| 88 | EE | Andrzej Lingas:
Subexponential-time algorithms for minimum weight triangulations and related problems.
CCCG 1998 |
| 87 | EE | Artur Czumaj,
Andrzej Lingas:
A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity.
ICALP 1998: 682-694 |
| 86 | | 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 |
| 85 | | Anders Dessmark,
Andrzej Lingas,
Hans Olsson,
Hiroaki Yamamoto:
Optimal Broadcasting in Almost Trees and Partial k-trees.
STACS 1998: 432-443 |
| 84 | EE | Anders Dessmark,
Oscar Garrido,
Andrzej Lingas:
A Note on Parallel Complexity of Maximum f-Matching.
Inf. Process. Lett. 65(2): 107-109 (1998) |
| 83 | | Anders Dessmark,
Andrzej Lingas:
Improved Bounds for Integer Sorting in the EREW PRAM Model.
J. Parallel Distrib. Comput. 48(1): 64-70 (1998) |
| 82 | EE | Andrzej Lingas,
V. Soltan:
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions.
Theory Comput. Syst. 31(5): 507-538 (1998) |
| 1997 |
|---|
| 81 | | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas,
Anna Östlin:
On the Complexity of Computing Evolutionary Trees.
COCOON 1997: 134-145 |
| 80 | | Krzysztof Diks,
Andrzej Lingas,
Andrzej Pelc:
An Optimal Algorithm for Broadcasting Multiple Messages in Trees.
SIROCCO 1997: 69-80 |
| 79 | | Tomas Kovacs,
Andrzej Lingas:
Maximum Packing for Biconnected Outerplanar Graphs.
TAPSOFT 1997: 393-404 |
| 78 | | Andrzej Lingas,
Anil Maheshwari:
A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree.
Parallel Processing Letters 7(1): 3-11 (1997) |
| 77 | EE | 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) |
| 76 | EE | Andrzej Lingas:
Maximum Tree-Packing in Time O(n5/2).
Theor. Comput. Sci. 181(2): 307-316 (1997) |
| 1996 |
|---|
| 75 | | Rolf G. Karlsson,
Andrzej Lingas:
Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings
Springer 1996 |
| 74 | | Srinivasa Rao Arikati,
Anders Dessmark,
Andrzej Lingas,
Madhav V. Marathe:
Approximation Algorithms for Maximum Two-Dimensional Pattern Matching.
CPM 1996: 348-360 |
| 73 | | Anders Dessmark,
Andrzej Lingas,
Andrzej Proskurowski:
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees.
ESA 1996: 501-513 |
| 72 | | Andrzej Lingas,
V. Soltan:
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions.
ISAAC 1996: 315-325 |
| 71 | | Anders Dessmark,
Andrzej Lingas:
On the Power of Nonconservative PRAM.
MFCS 1996: 303-311 |
| 70 | EE | 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) |
| 69 | EE | Bengt Aspvall,
Christos Levcopoulos,
Andrzej Lingas,
Robert Storlind:
On 2-QBF Truth Testing in Parallel.
Inf. Process. Lett. 57(2): 89-93 (1996) |
| 68 | EE | 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) |
| 67 | | Rolf Klein,
Andrzej Lingas:
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon.
Int. J. Comput. Geometry Appl. 6(3): 263-278 (1996) |
| 66 | | Rolf G. Karlsson,
Andrzej Lingas:
Guest Editor's Foreword.
Nord. J. Comput. 3(4): 293-294 (1996) |
| 1995 |
|---|
| 65 | | Andrzej Lingas:
Maximum Tree-Packing in Time O(n5/2).
COCOON 1995: 121-130 |
| 64 | | Rolf Klein,
Andrzej Lingas:
Fast Skeleton Construction.
ESA 1995: 582-595 |
| 63 | | Christos Levcopoulos,
Andrzej Lingas,
Cao Wang:
On Parallel Complexity of Planar Triangulations.
FSTTCS 1995: 413-427 |
| 62 | | Andrzej Lingas,
Asish Mukhopadhyay:
A Linear-time Construction of the Relative Neighborhood Graph within a Histogram.
WADS 1995: 228-238 |
| 61 | | Andrzej Lingas,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Optimal Parallel Algorithms for Rectilinear Link-Distance Problems.
Algorithmica 14(3): 261-289 (1995) |
| 60 | | Hristo Djidjev,
Andrzej Lingas:
On computing Voronoi diagrams for sorted point sets.
Int. J. Comput. Geometry Appl. 5(3): 327-337 (1995) |
| 59 | | Rolf Klein,
Andrzej Lingas:
Manhattonian proximity in a simple polygon.
Int. J. Comput. Geometry Appl. 5: 53-74 (1995) |
| 58 | EE | Anders Dessmark,
Andrzej Lingas,
Anil Maheshwari:
Multilist Layering: Complexity and Applications.
Theor. Comput. Sci. 141(1&2): 337-350 (1995) |
| 1994 |
|---|
| 57 | | Rolf Klein,
Andrzej Lingas:
Hamiltonian Abstract Voronoi Diagrams in Linear Time.
ISAAC 1994: 11-19 |
| 56 | | Anders Dessmark,
Andrzej Lingas,
Oscar Garrido:
On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem.
MFCS 1994: 316-325 |
| 55 | | Anil Maheshwari,
Andrzej Lingas:
A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree.
STACS 1994: 487-495 |
| 54 | | Piotr Berman,
Andrzej Lingas:
A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon.
SWAT 1994: 73-82 |
| 53 | | Andrzej Lingas:
A Linear-time Construction of the Relative Neighborhood Graph From the Delaunay Triangulation.
Comput. Geom. 4: 199-208 (1994) |
| 52 | | Andrzej Lingas:
Editor's Foreword.
Nord. J. Comput. 1(3): 273 (1994) |
| 1993 |
|---|
| 51 | | Andrzej Lingas,
Rolf G. Karlsson,
Svante Carlsson:
Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings
Springer 1993 |
| 50 | | Rolf Klein,
Andrzej Lingas:
A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon.
CCCG 1993: 370-374 |
| 49 | | Andrzej Lingas,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Parallel Algorithms for Rectilinear Link Distance Problems.
IPPS 1993: 65-72 |
| 48 | | Anders Dessmark,
Klaus Jansen,
Andrzej Lingas:
The Maximum k-Dependent and f-Dependent Set Problem.
ISAAC 1993: 88-98 |
| 47 | | Anders Dessmark,
Andrzej Lingas,
Anil Maheshwari:
Multi-List Ranking: Complexity and Applications.
STACS 1993: 306-316 |
| 46 | EE | Rolf Klein,
Andrzej Lingas:
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon.
Symposium on Computational Geometry 1993: 124-132 |
| 45 | | 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) |
| 1992 |
|---|
| 44 | | Christos Levcopoulos,
Andrzej Lingas:
C-sensitive Triangulations Approximate the MinMax Length Triangulation.
FSTTCS 1992: 104-115 |
| 43 | | Esther Jennings,
Andrzej Lingas:
On the Relationship among Constrained Geometric Structures.
ISAAC 1992: 289-298 |
| 42 | | Oscar Garrido,
Stefan Jarominek,
Andrzej Lingas,
Wojciech Rytter:
A Simple Randomized Parallel Algorithm for Maximal f-Matching.
LATIN 1992: 165-176 |
| 41 | EE | Rolf Klein,
Andrzej Lingas:
Manhattonian Proximity in a Simple Polygon.
Symposium on Computational Geometry 1992: 312-319 |
| 40 | | 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) |
| 39 | | Christos Levcopoulos,
Andrzej Lingas:
Fast Algorithms for Greedy Triangulation.
BIT 32(2): 280-296 (1992) |
| 38 | | Hristo Djidjev,
Andrzej Lingas,
Jörg-Rüdiger Sack:
An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon.
Discrete & Computational Geometry 8: 131-152 (1992) |
| 1991 |
|---|
| 37 | | Christos Levcopoulos,
Andrzej Lingas:
Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case.
ICCI 1991: 139-148 |
| 36 | | Esther Jennings,
Andrzej Lingas,
Lenka Motyckova:
Dynamic Detection of Forest of Tree-Connected Meshes.
ICPP (3) 1991: 300-301 |
| 35 | | Krzysztof Diks,
Oscar Garrido,
Andrzej Lingas:
Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings.
ISA 1991: 385-395 |
| 34 | | Hristo Djidjev,
Andrzej Lingas:
On Computing the Voronoi Diagram for Restricted Planar Figures.
WADS 1991: 54-64 |
| 33 | | Andrzej Lingas:
An Unfeasible Matching Problem.
BIT 31(4): 591-597 (1991) |
| 32 | | Andrzej Lingas:
Bit Complexity of Matrix Products.
Inf. Process. Lett. 38(5): 237-242 (1991) |
| 1990 |
|---|
| 31 | | Christos Levcopoulos,
Andrzej Lingas,
Ola Petersson,
Wojciech Rytter:
Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs.
FSTTCS 1990: 204-214 |
| 30 | | Andrzej Lingas:
Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs.
SIGAL International Symposium on Algorithms 1990: 447-457 |
| 29 | | Christos Levcopoulos,
Andrzej Lingas:
Fast Algorithms for Greedy Triangulation.
SWAT 1990: 238-250 |
| 28 | | Andrzej Lingas:
A Note on a Parallel Heuristic for Minimum.
Bulletin of the EATCS 42: 174-177 (1990) |
| 1989 |
|---|
| 27 | | 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 |
| 26 | | Hristo Djidjev,
Andrzej Lingas,
Jörg-Rüdiger Sack:
An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon.
STACS 1989: 96-107 |
| 25 | | Andrzej Lingas,
Marek Karpinski:
Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching.
Inf. Process. Lett. 30(1): 27-32 (1989) |
| 24 | | Andrzej Lingas:
Voronoi Diagrams with Barriers and the Shortest Diagonal Problem.
Inf. Process. Lett. 32(4): 191-198 (1989) |
| 23 | | Andrzej Lingas:
Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time.
Theor. Comput. Sci. 63(3): 295-302 (1989) |
| 22 | | 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) |
| 21 | | 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) |
| 1988 |
|---|
| 20 | | Rolf G. Karlsson,
Andrzej Lingas:
SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings
Springer 1988 |
| 19 | | Andrzej Lingas,
Maciej M. Syslo:
A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs.
ICALP 1988: 394-409 |
| 18 | | Christos Levcopoulos,
Jyrki Katajainen,
Andrzej Lingas:
An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams.
SWAT 1988: 190-198 |
| 17 | | Andrzej Lingas:
Greedy Triangulation acn be Efficiently Implemented in the Average Case (Extended Abstract).
WG 1988: 253-261 |
| 16 | | James A. Dean,
Andrzej Lingas,
Jörg-Rüdiger Sack:
Recognizing polygons, or how to spy.
The Visual Computer 3(6): 344-355 (1988) |
| 1987 |
|---|
| 15 | | 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 |
| 14 | | 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 |
| 13 | | Christos Levcopoulos,
Andrzej Lingas:
On Approximation Behavior of the Greedy Triangulation for Convex Polygons.
Algorithmica 2: 15-193 (1987) |
| 12 | | Andrzej Lingas,
Christos Levcopoulos,
Jörg-Rüdiger Sack:
Algorithms for Minimum Length Partitions of Polygons.
BIT 27(4): 474-479 (1987) |
| 1986 |
|---|
| 11 | | Andrzej Lingas:
Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time.
STACS 1986: 98-103 |
| 10 | EE | Andrzej Lingas:
On Approximation Behavior and Implementation of the Greedy Triangulation for Convex Planar Point Sets.
Symposium on Computational Geometry 1986: 72-79 |
| 1984 |
|---|
| 9 | | Christos Levcopoulos,
Andrzej Lingas:
Bounds on the Length of Convex Partitions of Polygons.
FSTTCS 1984: 279-295 |
| 8 | | Christos Levcopoulos,
Andrzej Lingas:
Covering Polygons with Minimum Number of Rectangles.
STACS 1984: 63-72 |
| 1983 |
|---|
| 7 | | Andrzej Lingas:
An Application of Maximum Bipartite C-Matching to Subtree Isomorphism.
CAAP 1983: 284-299 |
| 6 | | 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 |
| 5 | | Andrzej Lingas:
Heuristics for minimum edge length rectangular partitions of rectilinear figures.
Theoretical Computer Science 1983: 199-210 |
| 1982 |
|---|
| 4 | | Andrzej Lingas:
The Power of Non-Rectilinear Holes.
ICALP 1982: 369-383 |
| 1981 |
|---|
| 3 | | Andrzej Lingas:
Certain Algorithms for Subgraph Isomorphism Problems.
CAAP 1981: 290-307 |
| 1979 |
|---|
| 2 | | Andrzej Lingas:
The complexity of distributive computations.
FCT 1979: 262-268 |
| 1978 |
|---|
| 1 | | Andrzej Lingas:
A PSPACE Complete Problem Related to a Pebble Game.
ICALP 1978: 300-321 |
