Result 1 to 20 of 145 total
Proportional contact representations of planar graphs. (English)
J. Graph Algorithms Appl. 16, No. 3, 701-728 (2012).
1
The art gallery theorem for polyominoes. (English)
Discrete Comput. Geom. 48, No. 3, 711-720 (2012).
2
Drawing planar graphs on points inside a polygon. (English)
Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2012. 37th international symposium, MFCS 2012, Bratislava, Slovakia, August 27‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32588-5/pbk). Lecture Notes in Computer Science 7464, 172-183 (2012).
3
The Vulcan game of Kal-toh: finding or making triconnected planar subgraphs. (English)
Kranakis, Evangelos (ed.) et al., Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30346-3/pbk). Lecture Notes in Computer Science 7288, 4-15 (2012).
4
Proportional contact representations of planar graphs. (English)
van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 26-38 (2012).
5
Planar open rectangle-of-influence drawings with non-aligned frames. (English)
van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 14-25 (2012).
6
Stoker’s theorem for orthogonal polyhedra. (English)
Int. J. Comput. Geom. Appl. 21, No. 4, 383-391 (2011).
7
Linear-time algorithms for hole-free rectilinear proportional contact graph representations. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 281-291 (2011).
8
Orthogonal cartograms with few corners per face. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 98-109 (2011).
9
Faster optimal algorithms for segment minimization with small maximal value. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 86-97 (2011).
10
Reconstructing orthogonal polyhedra from putative vertex sets. (English)
Comput. Geom. 44, No. 8, 409-417 (2011).
11
Efficient view point selection for silhouettes of convex polyhedra. (English)
Comput. Geom. 44, No. 8, 399-408 (2011).
12
Reconstructing polygons from scanner data. (English)
Theor. Comput. Sci. 412, No. 32, 4161-4172 (2011).
13
Reconstructing convex polygons and convex polyhedra from edge and face counts in orthogonal projections. (English)
Int. J. Comput. Geom. Appl. 21, No. 2, 215-239 (2011).
14
Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs. (English)
Discrete Comput. Geom. 45, No. 1, 141-160 (2011).
15
Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs (English)
Discrete & Computational Geometry 45, No. 1, 141-160 (2011).
16
Guarding polyominoes (English)
Symposium on Computational Geometry, 387-396 (2011).
17
Faster optimal algorithms for segment minimization with small maximal value (English)
WADS, 86-97 (2011).
18
Orthogonal cartograms with few corners per face (English)
WADS, 98-109 (2011).
19
Linear-time algorithms for hole-free rectilinear proportional contact graph representations (English)
ISAAC, 281-291 (2011).
20
Result 1 to 20 of 145 total
Start
Contact
Print
General Help
