Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             30 results found
no title author magazine year volume issue page(s) type
1 A computational approach to Conwayʼs thrackle conjecture Fulek, Radoslav
2011
70-71 6-7 p. 345-355
11 p.
article
2 An optimal extension of the centerpoint theorem Mustafa, Nabil H.
2009
70-71 6-7 p. 505-510
6 p.
article
3 Approximating the volume of unions and intersections of high-dimensional geometric objects Bringmann, Karl
2010
70-71 6-7 p. 601-610
10 p.
article
4 Approximation algorithm for the kinetic robust K-center problem Friedler, Sorelle A.
2010
70-71 6-7 p. 572-586
15 p.
article
5 Ascending and descending regions of a discrete Morse function Jerše, Gregor
2009
70-71 6-7 p. 639-651
13 p.
article
6 Bounds for point recolouring in geometric graphs Meijer, Henk
2009
70-71 6-7 p. 690-703
14 p.
article
7 Centerpoints and Tverberg's technique Basit, Abdul
2010
70-71 6-7 p. 593-600
8 p.
article
8 Characterization of unlabeled level planar trees Estrella-Balderrama, Alejandro
2009
70-71 6-7 p. 704-721
18 p.
article
9 Compatible geometric matchings Aichholzer, Oswin
2009
70-71 6-7 p. 617-626
10 p.
article
10 Computing the arrangement of circles on a sphere, with applications in structural biology Cazals, Frédéric
2009
70-71 6-7 p. 551-565
15 p.
article
11 Constrained minimum enclosing circle with center on a query line segment Roy, Sasanka
2009
70-71 6-7 p. 632-638
7 p.
article
12 Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere de Castro, Pedro M.M.
2009
70-71 6-7 p. 536-550
15 p.
article
13 Efficient algorithms for computing Reeb graphs Doraiswamy, Harish
2009
70-71 6-7 p. 606-616
11 p.
article
14 Guarding curvilinear art galleries with vertex or point guards Karavelas, Menelaos I.
2009
70-71 6-7 p. 522-535
14 p.
article
15 Linear reconfiguration of cube-style modular robots Aloupis, Greg
2009
70-71 6-7 p. 652-663
12 p.
article
16 Matched drawability of graph pairs and of graph triples Grilli, Luca
2010
70-71 6-7 p. 611-634
24 p.
article
17 Minimum vertex cover in rectangle graphs Bar-Yehuda, Reuven
2011
70-71 6-7 p. 356-364
9 p.
article
18 Normal cone approximation and offset shape isotopy Chazal, Frédéric
2009
70-71 6-7 p. 566-581
16 p.
article
19 Not being (super)thin or solid is hard: A study of grid Hamiltonicity Arkin, Esther M.
2009
70-71 6-7 p. 582-605
24 p.
article
20 Note on the paper “K-vertex guarding simple polygons” [Computational Geometry 42 (4) (May 2009) 352–361] Mehlhorn, Kurt
2009
70-71 6-7 p. 722-
1 p.
article
21 [No title] Mehlhorn, K.
2010
70-71 6-7 p. 555-
1 p.
article
22 On a family of strong geometric spanners that admit local routing strategies Bose, Prosenjit
2011
70-71 6-7 p. 319-328
10 p.
article
23 On a problem about quadrant-depth Ben-Dan, Itay
2010
70-71 6-7 p. 587-592
6 p.
article
24 On minimum weight pseudo-triangulations Aichholzer, Oswin
2009
70-71 6-7 p. 627-631
5 p.
article
25 Operations preserving the global rigidity of graphs and frameworks in the plane Jordán, Tibor
2009
70-71 6-7 p. 511-521
11 p.
article
26 Point-set embeddings of trees with given partial drawings Di Giacomo, Emilio
2009
70-71 6-7 p. 664-676
13 p.
article
27 Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons Seidel, Raimund
2010
70-71 6-7 p. 556-564
9 p.
article
28 Reprint of: Weak ϵ-nets have basis of size O ( 1 / ϵ log ( 1 / ϵ ) ) in any dimension Mustafa, Nabil H.
2010
70-71 6-7 p. 565-571
7 p.
article
29 The equipartition of curves Panagiotakis, Costas
2009
70-71 6-7 p. 677-689
13 p.
article
30 Witness (Delaunay) graphs Aronov, Boris
2011
70-71 6-7 p. 329-344
16 p.
article
                             30 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands