10.9k citations
- University of OklahomaUS1.3k papers
- University of ChicagoUS1.3k papers
- Southern Methodist UniversityUS1.3k papers
- University of Illinois Urbana-ChampaignUS1.3k papers
- McGill UniversityCA1.3k papers
- The Ohio State UniversityUS1.3k papers
- University of PittsburghUS1.3k papers
- University of British ColumbiaCA1.2k papers
- Rutherford Appleton LaboratoryGB1.2k papers
- European Organization for Nuclear ResearchCH1.2k papers
- University of AlbertaCA1.2k papers
- University of OxfordGB1.2k papers
4 papers · 2 filters
EPG-representations with small grid-size
Therese Biedl, Martin Derka, Vida Dujmovic +1
In an EPG-representation of a graph each vertex is represented by a path in the rectangular grid, and is an edge in if and only if the paths representing an …
Optimal Algorithms for Separating a Polyhedron from Its Single-Part Mold
Prosenjit Bose, Tzvika Geft, Dan Halperin +1
Casting is a manufacturing process where liquid material is poured into a mold having the shape of a desired product. After the material solidifies, the product is removed from the…
On Plane Constrained Bounded-Degree Spanners
Prosenjit Bose, Rolf Fagerberg, André van Renssen +1
Let be a finite set of points in the plane and a set of non-crossing line segments with endpoints in . The visibility graph of with respect to , denoted $Vis(P,S)…
On Planar Greedy Drawings of 3-Connected Planar Graphs
Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati
A graph drawing is if, for every ordered pair of vertices , there is a path from to such that the Euclidean distance to decreases monotonically…