22 results on '"Lingas, Andrzej"'
Search Results
2. A simple approach to nondecreasing paths
3. Are unique subgraphs not easier to find?
4. Detecting monomials with k distinct variables
5. Corrigendum to “Note on covering monotone orthogonal polygons” [Inf. Process. Lett. 104(6) (2007) 220–227]
6. A note on a QPTAS for maximum weight triangulation of planar point sets
7. Optimal cuts and partitions in tree metrics in polynomial time
8. Efficient approximation algorithms for shortest cycles in undirected graphs
9. Faster multi-witnesses for Boolean matrix multiplication
10. Note on covering monotone orthogonal polygons with star-shaped polygons
11. Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
12. A note on maximum independent set and related problems on box graphs
13. On adaptive deterministic gossiping in ad hoc radio networks
14. Approximation algorithms for time-dependent orienteering
15. A note on parallel complexity of maximum f-matching
16. A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity
17. A simple randomized parallel algorithm for maximal ƒ-matchings
18. On 2-QBF truth testing in parallel
19. Bit complexity of matrix products
20. Voronoi diagrams with barriers and the shortest diagonal problem
21. Subtree isomorphism is NC reducible to bipartite perfect matching
22. The Greedy and Delauney triangulations are not bad in the average case
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.