| Load-optimization in reconfigurable networks: Algorithms and complexity of flow routing W Dai, KT Foerster, D Fuchssteiner, S Schmid ACM SIGMETRICS Performance Evaluation Review 48 (3), 39-44, 2021 | 9 | 2021 |
| Improved scalability of demand-aware datacenter topologies with minimal route lengths and congestion M Pacut, W Dai, A Labbe, KT Foerster, S Schmid ACM SIGMETRICS Performance Evaluation Review 49 (3), 35-36, 2022 | 7 | 2022 |
| Robust network flow against attackers with knowledge of routing method V Suppakitpaisarn, W Dai, JF Baffier 2015 IEEE 16th International Conference on High Performance Switching and …, 2015 | 6 | 2015 |
| Brief announcement: Minimizing congestion in hybrid demand-aware network topologies W Dai, M Dinitz, KT Foerster, S Schmid | 4 | 2022 |
| Load-optimization in reconfigurable data-center networks: Algorithms and complexity of flow routing W Dai, KT Foerster, D Fuchssteiner, S Schmid ACM Transactions on Modeling and Performance Evaluation of Computing Systems …, 2023 | 3 | 2023 |
| A tight characterization of fast failover routing: Resiliency to two link failures is possible W Dai, KT Foerster, S Schmid Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023 | 3 | 2023 |
| Reoptimization of minimum latency problem W Dai International Computing and Combinatorics Conference, 162-174, 2017 | 3 | 2017 |
| Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications W Dai, Y Yang Journal of Combinatorial Optimization 37, 601-619, 2019 | 2 | 2019 |
| Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks W Dai, M Dinitz, KT Foerster, L Luo, S Schmid arXiv preprint arXiv:2401.04638, 2024 | 1 | 2024 |
Stefan SchmidProfessor, Computer Science, TU Berlin & Weizenbaum Institute & Fraunhofer SIT在 tu-berlin.de 的电子邮件经过验证
