Marek Chrobak — is a full professor at University of California, Riverside. He is known for his work competitive analysis of online algorithms, particularly for the k server problem. His contributions, with his co author Lawrence L. Larmore, led to the… … Wikipedia
Chrobak — or Chrobok can refer to: Chrobak Andrzej Bogdan Chrobák (born 1973), Polish ski mountaineer Eugeniusz Chrobak; (pl) Ewa Chrobak; (pl) Halina Chrobak; (pl) Jan Chrobák, Czech cyclo cross cyclist; (de) Krzysztof Chrobak; (pl) … Wikipedia
Chrobak — oder Chrobák ist der Familienname folgender Personen: Dobroslav Chrobák (1907–1951), slowakischer Schriftsteller Jan Chrobák (* 1979), tschechischer Cyclocrossfahrer Marek Chrobak (* 1955), polnischer Informatiker Rudolf Chrobak (1843 1910),… … Deutsch Wikipedia
Liste der Biografien/Chk–Chz — Biografien: A B C D E F G H I J K L M N O P Q … Deutsch Wikipedia
Lawrence L. Larmore — Professor Lawrence L. Larmore is a theoretical computer scientist, and a professor at University of Nevada Las Vegas. He is best known for his work with competitive analysis of online algorithms, particularly for the k server problem. His… … Wikipedia
Order of the Smile — The Order of the Smile (Polish: Order Uśmiechu) is an international award given by children, to adults distinguished in their love, care and aid for children. Contents 1 History 2 The design 3 Decorating 4 … Wikipedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia
Tight span — If a set of points in the plane, with the Manhattan metric, has a connected orthogonal convex hull, then that hull coincides with the tight span of the points. In metric geometry, the metric envelope or tight span of a metric space M is an… … Wikipedia
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
Slovaquie — 48° 09′ 00″ N 17° 07′ 00″ E / 48.15, 17.11666667 … Wikipédia en Français
