The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Andrzej Lingas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  145. On the Approximability of Maximum and Minimum Edge Clique Partition Problems. [Citation Graph (, )][DBLP]


  146. Inferring Ordered Trees from Local Constraints. [Citation Graph (, )][DBLP]


  147. Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. [Citation Graph (, )][DBLP]


  148. On partitioning polygons. [Citation Graph (, )][DBLP]


  149. A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication. [Citation Graph (, )][DBLP]


  150. PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k. [Citation Graph (, )][DBLP]


  151. Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs. [Citation Graph (, )][DBLP]


  152. Efficient broadcasting in known topology radio networks with long-range interference. [Citation Graph (, )][DBLP]


  153. Approximability of Edge Matching Puzzles. [Citation Graph (, )][DBLP]


  154. A Path Cover Technique for LCAs in Dags. [Citation Graph (, )][DBLP]


  155. The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. [Citation Graph (, )][DBLP]


  156. Approximation Algorithms for Buy-at-Bulk Geometric Network Design. [Citation Graph (, )][DBLP]


  157. Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. [Citation Graph (, )][DBLP]


  158. Linear-Time 3-Approximation Algorithm for the r -Star Covering Problem. [Citation Graph (, )][DBLP]


  159. Max-Stretch Reduction for Tree Spanners. [Citation Graph (, )][DBLP]


  160. Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications [Citation Graph (, )][DBLP]


  161. PTAS for k-tour cover problem on the plane for moderately large values of k [Citation Graph (, )][DBLP]


  162. Faster algorithms for finding lowest common ancestors in directed acyclic graphs. [Citation Graph (, )][DBLP]


  163. Finding a Heaviest Triangle is not Harder than Matrix Multiplication. [Citation Graph (, )][DBLP]


Search in 0.088secs, Finished in 0.095secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002