Approximating All-Points Furthest Pairs and Maximum Spanning Trees in Metric Spaces.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 5, p. 595, doi. 10.1142/S0129054123500181
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2024 AND VI 35 AND IP 5
Results: 6
1
2
On the Super (Edge)-Connectivity of Generalized Johnson Graphs.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 5, p. 579, doi. 10.1142/S012905412350017X
- By:
- Publication type:
- Article
3
A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 5, p. 535, doi. 10.1142/S0129054123500156
- By:
- Publication type:
- Article
4
Robust Subgroup Multisignature with One-Time Public Keys in Order.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 5, p. 513, doi. 10.1142/S0129054123500144
- By:
- Publication type:
- Article
5
On Two Modifications of the McEliece PKE and the CFS Signature Scheme.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 5, p. 501, doi. 10.1142/S0129054123500132
- By:
- Publication type:
- Article
6
Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 5, p. 551, doi. 10.1142/S0129054123500168
- By:
- Publication type:
- Article