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
 
                             48 results found
no title author magazine year volume issue page(s) type
1 Abstract Voronoi diagrams revisited Klein, Rolf
2009
70-71 9 p. 885-902
18 p.
article
2 A general approach to the analysis of controlled perturbation algorithms Mehlhorn, Kurt
2011
70-71 9 p. 507-528
22 p.
article
3 Algorithms for graphs of bounded treewidth via orthogonal range searching Cabello, Sergio
2009
70-71 9 p. 815-824
10 p.
article
4 An improved data stream algorithm for clustering Kim, Sang-Sub
2015
70-71 9 p. 635-645
11 p.
article
5 Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve Chepoi, Victor
2013
70-71 9 p. 1036-1041
6 p.
article
6 Approximating majority depth Chen, Dan
2013
70-71 9 p. 1059-1064
6 p.
article
7 Approximating the bottleneck plane perfect matching of a point set Abu-Affash, A. Karim
2015
70-71 9 p. 718-731
14 p.
article
8 A survey of geodesic paths on 3D surfaces Bose, Prosenjit
2011
70-71 9 p. 486-498
13 p.
article
9 Bold graph drawings van Kreveld, Marc
2011
70-71 9 p. 499-506
8 p.
article
10 Bounds for cops and robber pursuit Alonso, Laurent
2010
70-71 9 p. 749-766
18 p.
article
11 Coloring half-planes and bottomless rectangles Keszegh, Balázs
2012
70-71 9 p. 495-507
13 p.
article
12 Coloring planar homothets and three-dimensional hypergraphs Cardinal, Jean
2013
70-71 9 p. 1027-1035
9 p.
article
13 Compressing spatio-temporal trajectories Gudmundsson, Joachim
2009
70-71 9 p. 825-841
17 p.
article
14 Computing a visibility polygon using few variables Barba, Luis
2014
70-71 9 p. 918-926
9 p.
article
15 Computing minimum-area rectilinear convex hull and L-shape Bae, Sang Won
2009
70-71 9 p. 903-912
10 p.
article
16 Conflict-Free Coloring of points on a line with respect to a set of intervals Katz, Matthew J.
2012
70-71 9 p. 508-514
7 p.
article
17 Connectivity guarantees for wireless networks with directional antennas Carmi, Paz
2011
70-71 9 p. 477-485
9 p.
article
18 Distance k-sectors exist Imai, Keiko
2010
70-71 9 p. 713-720
8 p.
article
19 Editorial Bose, Prosenjit
2012
70-71 9 p. 475-
1 p.
article
20 Efficient transformations for Klee's measure problem in the streaming model Sharma, Gokarna
2015
70-71 9 p. 688-702
15 p.
article
21 Empty monochromatic triangles Aichholzer, Oswin
2009
70-71 9 p. 934-938
5 p.
article
22 Extension of one-dimensional proximity regions to higher dimensions Ceyhan, Elvan
2010
70-71 9 p. 721-748
28 p.
article
23 Finding long and similar parts of trajectories Buchin, Kevin
2011
70-71 9 p. 465-476
12 p.
article
24 Formal specification and proofs for the topology and classification of combinatorial surfaces Dehlinger, Christophe
2014
70-71 9 p. 869-890
22 p.
article
25 Geometric representation of cubic graphs with four directions Mukkamala, Padmini
2009
70-71 9 p. 842-851
10 p.
article
26 Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties Biniaz, Ahmad
2015
70-71 9 p. 646-660
15 p.
article
27 Minimum enclosing circle of a set of fixed points and a mobile point Banik, Aritra
2014
70-71 9 p. 891-898
8 p.
article
28 Minimum-sum dipolar spanning tree in R 3 Bitner, Steven
2012
70-71 9 p. 476-481
6 p.
article
29 On the approximability of covering points by lines and related problems Dumitrescu, Adrian
2015
70-71 9 p. 703-717
15 p.
article
30 On the dilation spectrum of paths, cycles, and trees Klein, Rolf
2009
70-71 9 p. 923-933
11 p.
article
31 On the minimum corridor connection problem and other generalized geometric problems Bodlaender, Hans L.
2009
70-71 9 p. 939-951
13 p.
article
32 On the minimum number of mutually disjoint holes in planar point sets Hosono, Kiyoshi
2015
70-71 9 p. 661-672
12 p.
article
33 On triconnected and cubic plane graphs on given point sets García, Alfredo
2009
70-71 9 p. 913-922
10 p.
article
34 Planar rectilinear shortest path computation using corridors Inkulu, Rajasekhar
2009
70-71 9 p. 873-884
12 p.
article
35 Pointed drawings of planar graphs Aichholzer, Oswin
2012
70-71 9 p. 482-494
13 p.
article
36 Polynomial area bounds for MST embeddings of trees Frati, Fabrizio
2011
70-71 9 p. 529-543
15 p.
article
37 Realistic roofs over a rectilinear polygon Ahn, Hee-Kap
2013
70-71 9 p. 1042-1055
14 p.
article
38 Rectangular-radial drawings of cubic plane graphs Hasheminezhad, Mahdieh
2010
70-71 9 p. 767-780
14 p.
article
39 Separating bichromatic point sets by L-shapes Sheikhi, Farnaz
2015
70-71 9 p. 673-687
15 p.
article
40 Separating families of convex sets Gerbner, Dániel
2013
70-71 9 p. 1056-1058
3 p.
article
41 Shortest path planning for a tethered robot Brass, Peter
2015
70-71 9 p. 732-742
11 p.
article
42 Small strong epsilon nets Ashok, Pradeesha
2014
70-71 9 p. 899-909
11 p.
article
43 Straight-line drawings of outerplanar graphs in O ( d n log n ) area Frati, Fabrizio
2012
70-71 9 p. 524-533
10 p.
article
44 Symmetric connectivity with directional antennas Aschner, Rom
2013
70-71 9 p. 1017-1026
10 p.
article
45 The medial axis of the union of inner Voronoi balls in the plane Giesen, Joachim
2012
70-71 9 p. 515-523
9 p.
article
46 Theta-3 is connected Aichholzer, Oswin
2014
70-71 9 p. 910-917
8 p.
article
47 Visibility queries in a polygonal region Inkulu, Rajasekhar
2009
70-71 9 p. 852-864
13 p.
article
48 Visibility representations of four-connected plane graphs with near optimal heights Chen, Chieh-Yu
2009
70-71 9 p. 865-872
8 p.
article
                             48 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands