Found: 7
Select item for more details and to access through your institution.
Bounding the tripartite‐circle crossing number of complete tripartite graphs.
- Published in:
- Journal of Graph Theory, 2022, v. 100, n. 1, p. 5, doi. 10.1002/jgt.22763
- By:
- Publication type:
- Article
Adjacency Graphs of Polyhedral Surfaces.
- Published in:
- Discrete & Computational Geometry, 2024, v. 71, n. 4, p. 1429, doi. 10.1007/s00454-023-00537-6
- By:
- Publication type:
- Article
The Complexity of the Hausdorff Distance.
- Published in:
- Discrete & Computational Geometry, 2024, v. 71, n. 1, p. 177, doi. 10.1007/s00454-023-00562-5
- By:
- Publication type:
- Article
Completeness for the Complexity Class ∀∃R and Area-Universality.
- Published in:
- Discrete & Computational Geometry, 2023, v. 70, n. 1, p. 154, doi. 10.1007/s00454-022-00381-0
- By:
- Publication type:
- Article
Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game.
- Published in:
- Annals of Operations Research, 2023, v. 321, n. 1/2, p. 79, doi. 10.1007/s10479-022-04976-x
- By:
- Publication type:
- Article
WORST-CASE OPTIMAL SQUARES PACKING INTO DISKS.
- Published in:
- Journal of Computational Geometry, 2022, v. 13, n. 2, p. 3
- By:
- Publication type:
- Article
WORST-CASE OPTIMAL SQUARES PACKING INTO DISKS.
- Published in:
- Journal of Computational Geometry, 2021, v. 12, n. 2, p. 149
- By:
- Publication type:
- Article