Journal of Automation and Intelligence
Издатель: Elsevier · ISSN 2949-8554 · 6 статей
-
An improved exact algorithm for the Euclidean k -Steiner tree problem
Publication date: December 2026 Source: Computational Geometry, Volume 135 Author(s): Jae Lee, Marcus Brazil, Charl Ras, Doreen Thomas
-
Computing maximum cliques in unit disk graphs
Publication date: December 2026 Source: Computational Geometry, Volume 135 Author(s): Anastasiia Tkachenko, Haitao Wang
-
The Euclidean k -matching problem is NP-hard
Publication date: December 2026 Source: Computational Geometry, Volume 135 Author(s): José-Miguel Díaz-Báñez, Ruy Fabila-Monroy, José-Manuel Higes-López, Nestaly Marín, Miguel-Angel Pérez-Cutiño, Pablo Pérez-Lantero
-
Ordered Yao graphs: maximum degree, edge density, and clique numbers
Publication date: December 2026 Source: Computational Geometry, Volume 135 Author(s): Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev, Karamjeet Singh, Ji Zeng
-
Editorial Board
Publication date: January–March 2027 Source: Computational Geometry, Volumes 136–137 Author(s):
-
Flip equivalence of ortho-unit polygons
Publication date: January–March 2027 Source: Computational Geometry, Volumes 136–137 Author(s): Diego Favela, Nestaly Marín, Adriana Ramírez-Vigueras, Oriol Solé-Pi, Jorge Urrutia