The following pages link to Andrzej Lingas (Q293198):
Displaying 50 items.
- (Q197698) (redirect page) (← links)
- A note on parallel complexity of maximum \(f\)-matching (Q293199) (← links)
- Optimal cuts and partitions in tree metrics in polynomial time (Q396629) (← links)
- Detecting monomials with \(k\) distinct variables (Q477587) (← links)
- A fast output-sensitive algorithm for Boolean matrix multiplication (Q634680) (← links)
- A simple randomized parallel algorithm for maximal f-matchings (Q672735) (← links)
- On 2-QBF truth testing in parallel (Q672737) (← links)
- Multilist layering: Complexity and applications (Q673793) (← links)
- Bit complexity of matrix products (Q808706) (← links)
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products (Q831754) (← links)
- A note on maximum independent set and related problems on box graphs (Q835020) (← links)
- Approximation algorithms for Hamming clustering problems (Q876719) (← links)
- Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
- Faster multi-witnesses for Boolean matrix multiplication (Q976085) (← links)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth (Q1041722) (← links)
- An exact algorithm for subgraph homeomorphism (Q1044032) (← links)
- The greedy and Delaunay triangulations are not bad in the average case (Q1069709) (← links)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← links)
- Algorithms for minimum length partitions of polygons (Q1102107) (← links)
- Recognizing polygons, or how to spy (Q1104085) (← links)
- Subtree isomorphism is NC reducible to bipartite perfect matching (Q1115630) (← links)
- Voronoi diagrams with barriers and the shortest diagonal problem (Q1123618) (← links)
- An unfeasible matching problem (Q1182611) (← links)
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (Q1193703) (← links)
- There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees (Q1194346) (← links)
- Fast algorithms for greedy triangulation (Q1196458) (← links)
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
- Heuristics for optimum binary search trees and minimum weight triangulation problems (Q1263993) (← links)
- A nearly parallel algorithm for the Voronoi diagram of a convex polygon (Q1269914) (← links)
- Minimum convex partition of a polygon with holes by cuts in given directions (Q1271271) (← links)
- On the complexity of constructing evolutionary trees (Q1306398) (← links)
- A linear-time construction of the relative neighborhood graph from the Delaunay triangulation (Q1334610) (← links)
- A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (Q1350189) (← links)
- Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) (← links)
- Improved bounds for integer sorting in the EREW PRAM model (Q1392302) (← links)
- A fast algorithm for approximating the detour of a polygonal chain. (Q1428113) (← links)
- Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees (Q1578418) (← links)
- The snow team problem (clearing directed subgraphs by mobile agents) (Q1679971) (← links)
- A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
- Forest-like abstract Voronoi diagrams in linear time (Q1699286) (← links)
- 3D rectangulations and geometric matrix multiplication (Q1702124) (← links)
- Determining the consistency of resolved triplets and fan triplets (Q1706504) (← links)
- Are unique subgraphs not easier to find? (Q1707980) (← links)
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets (Q1730227) (← links)
- Efficient algorithms for subgraph listing (Q1736617) (← links)
- A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- Exact and approximation algorithms for geometric and capacitated set cover problems (Q1759660) (← links)
