No. Title Author Year
1 Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092) Hong, Seok-Hee et al. 2019
2 Circumscribing Polygons and Polygonizations for Disjoint Line Segments Akitaya, Hugo A. et al. 2019
3 Convex Polygons in Cartesian Products De Carufel, Jean-Lou et al. 2019
4 On the Stretch Factor of Polygonal Chains Chen, Ke et al. 2019
5 Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks Speckmann, Bettina et al. 2018
6 LIPIcs, Volume 99, SoCG'18, Complete Volume Speckmann, Bettina et al. 2018
7 Maximum Area Axis-Aligned Square Packings Akitaya, Hugo A. et al. 2018
8 Two-Planar Graphs Are Quasiplanar Hoffmann, Michael et al. 2017
9 Reconstruction of Weakly Simple Polygons from their Edges Akitaya, Hugo A. et al. 2016
10 Arc Diagrams, Flip Distances, and Hamiltonian Triangulations Cardinal, Jean et al. 2015
11 Computing Opaque Interior Barriers à la Shermer Dumitrescu, Adrian et al. 2014
12 Bounds on the maximum multiplicity of some common geometric graphs Dumitrescu, Adrian et al. 2011
13 Long Non-crossing Configurations in the Plane Dumitrescu, Adrian et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 13


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI