Result 1 to 20 of 166 total
Shooting permanent rays among disjoint polygons in the plane. (English)
SIAM J. Comput. 41, No. 4, 1005-1027 (2012).
1
Crossing angles of geometric graphs. (English)
Lin, Guohui (ed.), Combinatorial optimization and applications. 6th international conference, COCOA 2012, Banff, AB, Canada, August 5‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31769-9/pbk). Lecture Notes in Computer Science 7402, 103-114 (2012).
2
Monotone paths in planar convex subdivisions. (English)
Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20‒22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 240-251 (2012).
3
Conflict-free graph orientations with parity constraints. (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, 57-68 (2012).
4
Graphs that admit polyline drawings with few crossing angles. (English)
SIAM J. Discrete Math. 26, No. 1, 305-320 (2012).
5
Minimum convex partitions and maximum empty polytopes. (English)
Fomin, Fedor V. (ed.) et al., Algorithm theory ‒ SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 213-224 (2012).
6
Watchman tours for polygons with holes. (English)
Comput. Geom. 45, No. 7, 326-333 (2012).
7
Graphs that admit right angle crossing drawings. (English)
Comput. Geom. 45, No. 4, 169-177 (2012).
8
Upper bound constructions for untangling planar geometric 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, 290-295 (2012).
9
Connectivity augmentation in planar straight line graphs. (English)
Eur. J. Comb. 33, No. 3, 408-425 (2012).
10
New bounds on the average distance from the Fermat-Weber center of a planar convex body. (English)
Discrete Optim. 8, No. 3, 417-427 (2011).
11
Bounds on the maximum multiplicity of some common geometric graphs. (English)
Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10‒12, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPICS ‒ Leibniz International Proceedings in Informatics 9, 637-648, electronic only (2011).
12
Convex partitions with 2-edge connected dual graphs. (English)
J. Comb. Optim. 22, No. 3, 409-425 (2011).
13
Augmenting the edge connectivity of planar straight line graphs to three. (English)
Algorithmica 61, No. 4, 971-999 (2011).
14
Matching between different image domains. (English)
Stilla, Uwe (ed.) et al., Photogrammetric image analysis. ISPRS conference, PIA 2011, Munich, Germany, October 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24392-9/pbk). Lecture Notes in Computer Science 6952, 37-47 (2011).
15
Counting plane graphs: flippability and its applications. (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, 524-535 (2011).
16
Collinearities in kinetic point sets. (English)
Comput. Res. Repos. 2011, Article No. 1105.3078 (2011).
17
Minimum weight convex Steiner partitions. (English)
Algorithmica 60, No. 3, 627-652 (2011).
18
Binary plane partitions for disjoint line segments. (English)
Discrete Comput. Geom. 45, No. 4, 617-646 (2011).
19
Intersection patterns of curves. (English)
J. Lond. Math. Soc., II. Ser. 83, No. 2, 389-406 (2011).
20
Result 1 to 20 of 166 total
Start
Contact
Print
General Help
