


default search action
Theoretical Computer Science, Volume 1037
Volume 1037, 2025
- Prosenjit Bose, Jean-Lou De Carufel, Sandrine Njoo
:
The exact spanning ratio of the parallelogram Delaunay graph. 115152 - Marc Hellmuth, Guillaume E. Scholz:
Solving NP-hard problems on GaTEx graphs: Linear-time algorithms for perfect orderings, cliques, colorings, and independent sets. 115157 - Andrzej Lingas, Mia Persson:
(min,+) matrix and vector products for inputs decomposable into few monotone subsequences. 115158 - Pascal Koiran, Subhayan Saha
:
Complete decomposition of symmetric tensors in linear time and polylogarithmic precision. 115159 - Prosenjit Bose
, Jean-Lou De Carufel, Anil Maheshwari, Karthik Murali
:
On 1-planar graphs with bounded cop-number. 115160 - Tomislav Petrovic:
Kolmogorov-Loveland betting strategies lose the Betting game on open sets. 115177 - Bei Niu
:
Some new results on equitable tree-coloring parameters of graphs. 115178

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.