799 results on '"Lingas, Andrzej"'
Search Results
202. Lower Bounds for DeMorgan Circuits of Bounded Negation Width
203. Lower Bounds for DeMorgan Circuits of Bounded Negation Width
204. There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
205. AnO(n logn) algorithm for computing the link center of a simple polygon
206. Fast algorithms for greedy triangulation
207. Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
208. Efficient Merging, Construction, and Maintenance of Evolutionary Trees
209. An unfeasible matching problem
210. Are unique subgraphs not easier to find?
211. A polynomial time approximation scheme for euclidean minimum cost k-connectivity
212. Optimal broadcasting in almost trees and partial k-trees
213. Maximum packing for biconnected outerplanar graphs
214. Approximation algorithms for maximum two-dimensional pattern matching
215. On the power of nonconservative PRAM
216. Faster algorithms for subgraph isomorphism of κ-connected partial κ-trees
217. Hamiltonian abstract Voronoi diagrams in linear time
218. On parallel complexity of maximum f-matching and the degree sequence problem
219. A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
220. Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depth
221. Graphs with equal domination and covering numbers
222. Clearing directed subgraphs by mobile agents
223. A fast deterministic detection of small pattern graphs in graphs without large cliques
224. On a Fire Fighter’s Problem
225. The maximum k-dependent and f-dependent set problem
226. On the relationships among constrained geometric structures
227. Greedy triangulation approximates the optimum and can be implemented in linear time in the average case
228. Fast algorithms for greedy triangulation
229. An optimal expected-time parallel algorithm for Voronoi diagrams
230. Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depth
231. Efficient Merging and Construction of Evolutionary Trees
232. Approximation algorithms for maximum two-dimensional pattern matching
233. Maximum packing for [formula omitted]-connected partial [formula omitted]-trees in polynomial time
234. Computing the Boolean Product of Two n × n Boolean Matrices Using O(n²) Mechanical Operations.
235. Determining the Consistency of Resolved Triplets and Fan Triplets
236. Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
237. A QPTAS for the base of the number of crossing-free structures on a planar point set
238. Approximation Schemes for Capacitated Geometric Network Design
239. Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs
240. Nearly optimal heuristics for binary search trees with geometric generalizations : Extended abstract
241. There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees
242. An O(n log n) algorithm for computing a link center in a simple polygon : Preliminary version
243. Greedy triangulation can be efficiently implemented in the average case : detailed abstract
244. A space efficient algorithm for the greedy triangulation
245. Subgraph isomorphism for biconnected outerplanar graphs in cubic time
246. Heuristics for minimum edge length rectangular partitions of rectilinear figures
247. The power of non-rectilinear holes
248. A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs
249. Bounds on the length of convex partitions of polygons
250. Covering polygons with minimum number of rectangles : Christos levcopoulos
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.