Sök böcker

Här kan du söka dig fram till bra böcker. Klicka sen på en bok för att läsa mer om den!

Sökning efter: Christos Levcopoulos 54 träffar

Titel Författare År Språk
21 Bounds on the length of convex partitions of polygons Christos Levcopoulos 1984 Engelska
22 C-sensitive triangulation approximate the minmax length triangulation Christos Levcopoulos 1993 Engelska
23 Clearing Connections by Few Agents Italy (2014) Sicily Lipari Island International Conference on Fun with Algorithms (FUN) Christos Levcopoulos 2014 Engelska
24 Close approximation of minimum rectangular covering Christos Levcopoulos 1996 Engelska
25 Covering polygons with minimum number of rectangles Christos Levcopoulos 1984 Engelska
26 Cutting off well-bounded rectangles Christos Levcopoulos 1996 Engelska
27 Efficient algorithms for constructing fault-tolerant geometric spanners Christos Levcopoulos 1998 Engelska
28 Exploiting few inversions when sorting - sequential and parallel algorithms Christos Levcopoulos 1993 Engelska
29 A fast heuristic for covering polygons by rectangles Christos Levcopoulos 1986 Engelska
30 Fast heuristics for minimum length rectangular partitions of polygons Christos Levcopoulos 1986 Engelska
31 Greedy triangulation approximates the minimum weight triangulation and can be computed in linear time in the average case Christos Levcopoulos 1992 Engelska
32 Greedy triangulation approximates the optimum and can be implemented in linear time in the average case Christos Levcopoulos 1990 Engelska
33 The greedy triangulation can be computed from the delaunay in linear time Christos Levcopoulos 1995 Engelska
34 Heapsort - adapted fro presorted files Christos Levcopoulos 1989 Engelska
35 Heuristics for minimum decompositions of polygons Christos Levcopoulos 1987 Engelska
36 A linear-time heuristic for minimum rectangular covering Christos Levcopoulos 1996 Engelska
37 Linear-time heuristics for minimum weight rectangulation Christos Levcopoulos 1996 Engelska
38 Matching parantheses in parallel Christos Levcopoulos 1989 Engelska
39 Minimum length and "thickest-first" rectangular partitions of polygons Christos Levcopoulos 1986 Engelska
40 A near-optimal heuristic for minimum weight triangulation of convex polygons Christos Levcopoulos 1996 Engelska

Förra sidan 1 2 3 Nästa sida

Sökningen görs direkt i Kungl. bibliotekets söktjänst libris. Libris katalog innehåller närmare 7 miljoner titlar från ca 170 bibliotek i Sverige och biblioteken samarbetar om att hålla katalogen uppdaterad. Utan libris skulle inte en tjänst som Boktraven vara möjlig.