Articles of Tamás Lukovszki are cited by
Books:
  1. Lars Arge: External Memory Data Structures. Book Chapter of Handbook of Massive Data Sets, edited by James M. Abello, Panos M. Pardalos, Mauricio G. C. Resende, Kluwer Academic Publishers, ISBN: 9781402004896, 2002.

  2. K. Erciyes: Topology Control. Book Chapter of Distributed Graph Algorithms for Computer Networks, Series: Computer Communications and Networks, Springer Verlag, ISBN: 978-1-4471-5172-2, 2013.

  3. Holger Karl and Andreas Willig: Protocols and Architectures for Wireless Sensor Networks. Wiley, ISBN: 978-0-470-09510-2, 2005.

  4. Xiang-Yang Li and Yu Wang: Wireless Sensor Networks and Computational Geometry. Book Chapter of Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems, edited by Mohammad Ilyas et al., CRC Press, ISBN: 9780849319686, 2004.

  5. Xiang-Yang Li: Applications of Computational Geometry in Wireless Ad Hoc Networks. Book Chapter of Ad Hoc Wireless Networking, edited by XiuZhen Cheng, Xiao Huang, and Ding-Zhu Du, Springer, ISBN: 978-1-4020-7712-8, 2004.

  6. Xiang-Yang Li: Topology Control in Wireless Ad Hoc Networks. Book Chapter of Mobile Ad Hoc Networking, edited by Stefano Basagni, Marco Conti, Silvia Giordano, and Ivan Stojmenovic, Wiley-IEEE Press, ISBN: 978-0-471-37313-1, 2004.

  7. Anil Maheshwari, Norbert Zeh: A Survey of Techniques for Designing I/O-Efficient Algorithms. Book Chapter of Algorithms for Memory Hierarchies, Lecture Notes in Computer Science, Vol. 2625, edited by U. Meyer, P. Sanders, and J.F. Sibeyn, Springer-Verlag, ISBN: 978-3-540-00883-5, 2003.

  8. Joseph S.B. Mitchell, Wolfgang Mulzer: Proximity Algorithms. Book Chapter of Handbook of Discrete and Computational Geometry, 3rd edition, edited by Jacob E. Goodman, Joseph O'Rourke, and Csaba D. Tóth, CRC Press LLC, 2016.

  9. Giri Narasimhan, Michiel Smid: Geometric Spanner Networks. Cambridge University Press, ISBN-13: 9780521815130, January 2007.

  10. Christian Scheideler: Overlay Networks for Wireless Systems. Book Chapter of Performance Analysis of Mobile and Ad Hoc Networks, Wireless Networks and Mobile Computing Series, Vol. 7, edited by Chansu Yu, Nova Science Publishers, ISBN: 1-60021-277-8, 2007.

  11. Jeffrey Scott Vitter: Algorithms and Data Structures for External Memory. Now Publishers Inc, ISBN 1601981066, 2008.

  12. Yu Wang: Topology Control for Wireless Sensor Networks. Book Chapter of Wireless Sensor Networks and Applications, Series: Signals and Communication Technology, edited by Li, Yingshu; Thai, My T.; Wu, Weili, Springer-Verlag, ISBN: 978-0-387-49591-0, 2008.

  13. Yu Wang: Three-Dimensional Wireless Sensor Networks: Geometric Approaches for Topology and Routing Design. Book Chapter of The Art of Wireless Sensor Networks, Series: Signals and Communication Technology, pp 367-409, edited by Habib M. Ammari, Springer-Verlag, ISBN: 978-3-642-40065-0, 2014.

Journals:
  1. M. A. Abam, M. de Berg, M. Farshi, and J. Gudmundsson: Region-Fault Tolerant Geometric Spanners. Discrete and Computational Geometry, Vol. 41(4),556-582, 2009.

  2. Bernardetta Addis, Giuliana Carello, Meihui Gao: On a virtual network functions placement and routing problem: Some properties and a comparison of two formulations. Networks, Willey, Vol. 75(2), 158-182, doi:10.1002/net.21915, 2020.

  3. Ranendu Adhikary, Manash Kumar Kundu, Buddhadeb Sau: Circle formation by asynchronous opaque robots on infinite grid. Comput. Sci. 22(1), 2021.

  4. Omar Alhussein, Weihua Zhuang: Robust online Composition, routing and NF placement for NFV-enabled services. IEEE J. Sel. Areas Commun., Vol. 38(6), 1089-1101, DOI: 10.1109/JSAC.2020.2986612, 2020.

  5. Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid: Walking Through Waypoints. Algorithmica 2020.

  6. Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid: Charting the Algorithmic Complexity of Waypoint Routing. ACM SIGCOMM Computer Communication Review (CCR), Vol. 48(1), 2018.

  7. Zaid Allybokus, Nancy Perrot, Jeremie Leguay, Lorenzo Maggi, Eric Gourdin: Virtual Function Placement for Service Chaining with Partial Orders and Anti-Affinity Rules. Networks, Vol. 71(2), 97-106, 2018.

  8. S. Ayoubi, S. Sebbah, C. Assi: A Cut-and-Solve Based Approach for the VNF Assignment Problem. IEEE Transactions on Cloud Computing, Vol. 99, ?-?, 2017.

  9. Enzo Baccarelli, Michele Scarpiniti, Alireza Momenzadeh: EcoMobiFog - Design and Dynamic Optimization of a 5G Mobile-Fog-Cloud Multi-Tier Ecosystem for the Real-Time Distributed Execution of Stream Applications. IEEE Access, Vol. 7, 55565-55608, 2019.

  10. D. Bakhshesh, M. Farshi: Improving Time and Space Complexity of the Gap-Greedy Spanner Algorithm. CSI Journal on Computer Science and Engineering, Vol. 14(1), 6-18, 2016.

  11. D. Bakhshesh, M. Farshi: Angle-constrained spanners with angle at least pi/3. Information Processing Letters, Vol. 120, 44-46, 2017.

  12. Deval Bhamare, Raj Jain, Mohammed Samaka, Aiman Erbad: A Survey on Service Function Chaining. Journal of Network and Computer Applications, Vol. 75, 138-155, 2016.

  13. S. Bereg, M. Segal: Dynamic Algorithms for Approximating Interdistances. Nordic Journal of Computing, Vol. 11(4), 344-355, 2004.

  14. P. Berenbrink, T. Friedetzky, J. Manuch, and L. Stacho: (Quasi) Spanners for Mobile Ad Hoc Networks. Journal of Interconnection Networks, Vol. 6(2), 63-84, 2005.

  15. A. Bianchi, S. Pizzutilo, G. Vessio: Reasoning on Starvation in AODV Using Abstract State Machines. Journal of Theoretical and Applied Information Technology, Vol. 84.1 140-149, 2016.

  16. Ahmad Biniaz, Anil Maheshwari, Michiel Smid: Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties. Computational Geometry, Vol. 48(9), 646-660, 2015.

  17. Kaustav Bose, Manash Kumar Kundu, Ranendu Adhikary, Buddhadeb Sau: Arbitrary pattern formation by asynchronous opaque robots with lights. Theor. Comput. Sci. 849: 138-158, 2021.

  18. P. Bose, V. Dujmovic, P. Morin, and M. Smid: Robust geometric spanners. SIAM Journal on Computing, Vol. 42(4), 1720-1736, 2013.

  19. P. Bose, J. Gudmundsson, and P. Morin: Ordered Theta Graphs. Computational Geometry: Theory and Applications, Vol. 28, 11-18, 2004.

  20. Prosenjit Bose, Mirela Damian, Karim Douieb, Joseph O'Rourke, Ben Seamone, Michiel Smid, and Stefanie Wurher: Pi/2-angle Yao Graphs are Spanners. Int. J. Comput. Geom. Appl., Vol. 22(1), 61, doi: 10.1142/S0218195912600047, 2012.

  21. Gilad Braunschvig, Shiri Chechik, David Peleg, and Adam Sealfon: Fault Tolerant Additive and (mu,alpha)-Spanners. Theoretical Computer Science, Vol. 580, 94-100, doi:10.1016/j.tcs.2015.02.036, 2015.

  22. S. Brienza, S. E. Cebeci, S. S. Masoumzadeh, H. Hlavacs, Ö. Özkasap, G. Anastasi: A Survey of Energy Efficiency in P2P Systems: File Distribution, Content Streaming and Epidemics. ACM Computing Surveys, Vol. 48(3) Article No. 36, 2016.

  23. Azzedine Boukerche, Robson E. De Grande: Vehicular Cloud Computing: Architectures, Applications, and Mobility. Computer Networks, Available online: 7 February 2018. 2015.

  24. Jun Cai, Zhongwei Huang, Jianzhen Luo, Yan Liu, Huimin Zhao, Liping Liao: Composing and deploying parallelized service function chains. Journal of Network and Computer Applications, Available online, doi: 10.1016/j.jnca.2020.102637, 8. April, 2020.

  25. T.-H. Hubert Chan, Mingfei Li, Li Ning: Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree. Algorithmica, Vol. 71(1), 53-65, 2015.

  26. Animesh Chakravarthy, Debasish Ghose: Cooperative Pursuit Guidance to Surround Intruder Swarms Using Collision Cones. Journal of Aerospace Information Systems, Published Online:11 May 2020, doi: 10.2514/1.I010790, 2020.

  27. S. Chechik, M. Langberg, D. Peleg, and L. Roditty: Fault Tolerant Spanners for General Graphs. SIAM Journal on Computing, Vol. 39(7), 3403-3423, 2010.

  28. Freddy C. Chua, Julie Ward, Ying Zhang, Puneet Sharma, Bernardo A. Huberman: Stringer: Balancing Latency and Resource Usage in Service Function Chain Provisioning. IEEE Internet Computing, Vol. 20(6), 22-31, 2016.

  29. Lin Cui, Fung Po Tso, Dimitrios P. Pezaros, Weijia Jia, Wei Zhao: PLAN: Joint Policy-and Network-Aware VM Management for Cloud Data Centers. IEEE Transactions on Parallel and Distributed Systems, Vol. 28(4), 1163-1175, 2017.

  30. Lin Cui, Fung Po Tso, Song Guo, Weijia Jia, Kaimin Wei, Wei Zhao: Enabling Heterogeneous Network Function Chaining. IEEE Transactions on Parallel and Distributed Systems, (Early Access), 24 September, 2018.

  31. J. S. Culpepper, M. Petri, and S. J. Puglisi: Revisiting bounded context block-sorting transformations. Software Practice and Experience, To appear, 2011.

  32. A. Czumaj, H. Zhao: Fault-tolerant Geometric Spanners. Discrete and Computational Geometry, Vol. 32(2), 207-230, 2004.

  33. Salvatore D'Oro, Laura Galluccio, Sergio Palazzo, Giovanni Schembra: Exploiting Congestion Games to Achieve Distributed Service Chaining in NFV Networks. IEEE Journal on Selected Areas in Communications, Special Issue on Game Theory for Networks, Vol. 35, Issue 2, 407-420, 2017.

  34. Mirela Damian, John Iacono, Andrew Winslow: Spanning Properties of Theta-Theta-6. Graphs and Combinatorics, DOI: 10.1007/s00373-020-02135-2, 2020.

  35. Joshua J. Daymude, Zahra Derakhshandeh, Robert Gmyr, Alexandra Porter, Andréa W. Richa, Christian Scheideler, Thim Strothmann: On the runtime of universal coating for programmable matter. Natural Computing, 1-16, DOI: 10.1007/s11047-017-9658-6, 2017.

  36. Zahra Derakhshandeh, Robert Gmyr, Andréa W. Richa, Christian Scheideler, Thim Strothmann: Universal Coating for Programmable Matter. Theoretical Computer Science, available online, 2016.

  37. Luc Devroye, Joachim Gudmundsson, and Pat Morin: On the expected maximum degree of Gabriel and Yao graphs. Advances in Applied Probability, Vol. 41(4), 1123-1140, 2009.

  38. David Dietrich, Ahmed Abujoda, Amr Rizk, Panagiotis Papadimitriou: Multi-Provider Service Chain Embedding with Nestor. IEEE Transactions on Network and Service Management, Vol. 14(1), 91-105, 2017.

  39. Michael Elkin, Shay Solomon: Narrow-Shallow-Low-Light Trees with and without Steiner Points. SIAM J. Discrete Math., Vol. 25(1), 181-210, 2011.

  40. Martin Fürer, Shiva Prasad Kasiviswanathan: Spanners for geometric intersection graphs with applications. Journal of Computational Geometry, Vol. 3(1), 31-64, 2012.

  41. Lingnan Gao, George N. Rouskas: Congestion Minimization for Service Chain Routing Problems with Path Length Considerations. Accepted: IEEE/ACM Transactions on Networking (TON), 2020.

  42. J. Gao, L. Zhang: Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications. SIAM Journal on Computing, Vol. 35(1), 151-169, 2005.

  43. Luca Geretti, Antonio Abramo: Distributed Multilevel Hierarchic Strategy for Broadcast Collaborative Mobile Networks. IEEE Transactions on Mobile Computing, Vol. 9(9), 1255-1266, 2010.

  44. Fabian Gieseke, Joachim Gudmundsson, and Jan Vahrenhold: Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies. Journal of Discrete Algorithms, Vol. 8(3), 259-272, 2010.

  45. Milad Ghaznavi, Nashid Shahriar, Shahin Kamali, Reaz Ahmed, Raouf Boutaba: Distributed Service Function Chaining. IEEE Journal on Selected Areas in Communications, Vol. 35(11), 2479-2489, 2017.

  46. U. Glässer, Q.-P. Gu: Formal Description and Analysis of a Distributed Location Service for Mobile Ad Hoc Networks. Theoretical Computer Science, Vol. 336, 285-309, 2005.

  47. Bo He, Jingyu Wang, Qi Qi, Haifeng Sun, Jianxin Liao: Towards Intelligent Provisioning of Virtualized Network Functions in Cloud of Things: A Deep Reinforcement Learning based Approach. IEEE Transactions on Cloud Computing, (Early Access), DOI: 10.1109/TCC.2020.2985651, 2020.

  48. Shiming He, Kun Xie, Xuhui Zhou, Thabo Semong, Jin Wang: Multi-Source Multicast Routing with QoS Constraints of NFV in Edge Computing. Electronics, 8(10), 1106, doi: 10.3390/electronics8101106, 2019.

  49. Juliver Gil Herrera, Juan-Felipe Botero: Resource Allocation in NFV: A Comprehensive Survey. IEEE Transactions on Network and Service Management, Vol. 13, Issue: 3, 518-532, 2016.

  50. Xinli Huang, Shang Cheng, Kun Cao, Peijin Cong, Tongquan Wei, Shiyan Hu: A Survey of Deployment Solutions and Optimization Strategies for Hybrid SDN Networks. IEEE Communications Surveys & Tutorials, (Early Access), 19 September, 2018.

  51. Huawei Huang, Peng Li, Song Guo, Weifa Liang, Kun Wang: Near-Optimal Deployment of Service Chains by Exploiting Correlations between Network Functions. IEEE Transactions on Cloud Computing, Vol. PP, Issue: 99, 2017.

  52. Meitian Huang, Weifa Liang, Zichuan Xu, Song Guo: Efficient Algorithms for Throughput Maximization in Software-Defined Networks with Consolidated Middleboxes. IEEE Transactions on Network and Service Management, Vol. 14(3), 631-645, 2017.

  53. A. H. M. Jakaria, Mohammad Ashiqur Rahman, Carol Fung: A Requirement-Oriented Design of NFV Topology by Formal Synthesis. IEEE Transactions on Network and Service Management, Early Access, DOI: 10.1109/TNSM.2019.2920824, 2019.

  54. Mike Jia, Weifa Liang, Meitain Huang, Zichuan Xu, Yu Ma: Routing cost minimization and throughput maximization of NFV-enabled unicasting in Software-Defined Networks. IEEE Transactions on Network and Service Management, Vol. 15(2), 732-745, 2018.

  55. Kalpana D.Joshi, Kotaro Kataoka: pSMART: A lightweight, privacy-aware service function chain orchestration in multi-domain NFV/SDN. Computer Networks, Available online 11 May 2020, 107295.

  56. Wolfgang Kellener, Patrick Kalmbach, Andreas Blenk, Arsany Basta, Martin Reisslein, Stefan Schmid: Adaptable and Data-Driven Softwarized Networks: Review, Opportunities, and Challenges. Proceedings of the IEEE, Vol. PP, Issue: 99, 2019.

  57. Gilad Kutiel, Dror Rawitz: Service chain placement in SDNs. Discrete Applied Mathematics, Vol. 270, 168-180, 2019.

  58. C. Levcopoulos, G. Narasimhan, and M. Smid: Improved Algorithms for Constructing Fault-Tolerant Spanners. Algorithmica, Vol. 32, 144-156, 2002.

  59. X.-Y. Li: Localized Construction of Low Weighted Structure and Its Applications in Wireless Ad Hoc Networks. Wireless Networks, Vol. 11(6), 697-708, 2005.

  60. Fan Li, Zeming Chen, Yu Wang: Localized Geometric Topologies with Bounded Node Degree for Three Dimensional Wireless Sensor Networks. EURASIP Journal on Wireless Communications and Networking, 2012:157, 2012.

  61. X.-Y. Li: Algorithmic, Geometric and Graphs Issues in Wireless Networks. Journal of Wireless Communications and Mobile Computing (WCMC), Wiley Publications, Vol. 3(2), 119-140, 2003.

  62. X.-Y. Li, G. Calinescu, P.-J. Wan, and Y. Wang: Localized Delaunay Triangulation with Applications in Wireless Ad Hoc Networks. IEEE Transactions on Parallel and Distributed Systems, Vol. 14, 1035-1047, 2003.

  63. X.-Y. Li, K. Moaveninejad, and Ophir Frieder: Regional Gossip Routing for Wireless Ad Hoc Networks. Mobile Networks and Applications (MONET), Vol. 10(1-2), 61-77, 2005.

  64. X.-Y. Li, W.-Z. Song, Y. Wang: Efficient Topology Control for Ad-Hoc Wireless Networks with Non-Uniform Transmission Ranges. Wireless Networks, Vol. 11(3), 255-264, 2005.

  65. X.-Y. Li, Y. Wang: Efficient Construction of Low-Weighted Bounded Degree Planar Spanner. International Journal of Computational Geometry and Applications (IJCGA), World Science Publications, Vol. 14, 69-84, 2004.

  66. X.-Y. Li, Y. Wang, and W.-Z. Song: Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks. IEEE Transaction on Parallel and Distributed Systems, Vol. 15, 1057-1069, 2004.

  67. X.-Y. Li, Y. Wang, P.-J. Wan, and C.-W. Yi: Fault tolerant deployment and topology control in wireless ad hoc networks. Journal of Wireless Communications and Mobile Computing, Wiley Publications, Vol. 4, 109-125, 2004.

  68. H. Li, L. Wang, X. Wen, Z. Lu, J. Li: MSV: An Algorithm for Coordinated Resource Allocation in Network Function Virtualization. IEEE Access, November, 2018.

  69. Yi Liu, Hongqi Zhang, Jiang Liu, and Yingjie Yang: A New Approach for Delivering Customized Security Everywhere: Security Service Chain. Security and Communication Networks, In press, Accepted 8 November 2017, 2017.

  70. Marcelo Caggiani Luizelli, Weverton Luis da Costa Cordeiro, Luciana S. Buriol, Luciano Paschoal Gaspary: A Fix-and-Optimize Approach for Efficient and Large Scale Virtual Network Function Placement and Chaining. Computer Communications, Vol. 102(1), 67-77, 2017.

  71. Arne Ludwig, Szymon Dudycz, Matthias Rost, Stefan Schmid: Transiently Policy-Compliant Network Updates. IEEE/ACM Transactions on Networking, (Early Access), 28 September, 2018.

  72. J. Luo, W. Wu, M. Yang: Optimization of Gateway Deployment with Load Balancing and Interference Minimization in Wireless Mesh Networks. Journal of Universal Computer Science (J.UCS), Vol. 17(14), 2064-2083, 2011.

  73. Yu Ma, Weifa Liang, Zichuan Xu, Song Guo: Profit Maximization for Admitting Requests with Network Function Services in Distributed Clouds. IEEE Transactions on Parallel and Distributed Systems, (Early Access), 05 October, 2018

  74. W. Ma, J. Beltran, D. Pan, and N. Pissinou: Placing Traffic-Changing and Partially-Ordered NFV Middleboxes via SDN. IEEE Transactions on Network and Service Management (TNSM), Vol. 16(4), 1303-1307, 2019.

  75. A. Maheshwari, M. Smid, and N. Zeh: I/O-efficient algorithms for computing planar geometric spanners. Computational Geometry: Theory and Applications (CGTA), Vol. 40, 252-271, 2008.

  76. F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald: Energy, Congestion and Dilation in Radio Networks. Theory of Computing Systems (TOCS), Vol. 37, 343-370, 2004.

  77. Mohammad Ali Tahmasbi Nejad, Saeedeh Parsaeefard, Mohammad Ali Maddah-Ali, Toktam Mahmoodi, Babak Hossein Khalaj: vSPACE: VNF Simultaneous Placement, Admission Control and Embedding. IEEE Journal on Selected Areas in Communications (JSAC), Vol. PP(99), 2018.

  78. Thi-Minh Nguyen, Michel Minoux, Serge Fdida: Optimizing Resource Utilization in NFV Dynamic Systems: New Exact and Heuristic Approaches. Computer Networks (COMNET), DOI: 10.1016/j.comnet.2018.11.009, Vol. 148, 129-141, 2019.

  79. Thi-Minh Nguyen, André Girard, Catherine Rosenberg, Serge Fdida: Routing via Functions in Virtual Networks: The Curse of Choices. IEEE/ACM Transactions on Networking (TNET), Early Access, DOI: 10.1109/TNET.2019.2912717, 03 May 2019.

  80. Salvatore D'Oro, Sergio Palazzo, Giovanni Schembra: Orchestrating Softwarized Networks with a Marketplace Approach. Procedia Computer Science, Vol. 110, 352-360, 2017.

  81. Charalampos Papamanthou, Ioannis G. Tollis: Algorithms for computing a parameterized st-orientation. Theoretical Computer Science (TCS), Vol. 408, Issue: 2-3, 224-240, 2008.

  82. Merav Parter: Fault-Tolerant Logical Network Structures. The Distributed Computing Column, Bulletin of EATCS, No. 118, Feb. 2016.

  83. Merav Parter, David Peleg: Sparse Fault-Tolerant BFS Structures. ACM Transactions on Algorithms (TALG), Vol. 13, Issue 1, Article No. 11, Oct., 2016.

  84. Konstantinos Poularakis, George Iosifidis, Leandros Tassiulas: Joint Deployment and Pricing of Next-Generation WiFi Networks. IEEE Transactions on Communications (TCOMM), Vol. 67(9), 6193-6205, DOI: 10.1109/TCOMM.2019.2919590, 2019.

  85. Konstantinos Poularakis, Jaime Llorca, Antonia M. Tulino, Ian Taylor, Leandros Tassiulas: Service Placement and Request Routing in MEC Networks With Storage, Computation, and Communication Constraints. IEEE/ACM Transactions on Networking Vol. 28(3), 1047-1060, DOI: 10.1109/TNET.2020.2980175, 2020.

  86. Dandan Qi, Subin Shen, Guanghui Wang: Virtualized Network Function Consolidation Based on Multiple Status Characteristics. IEEE Access, Vol. 7 (2019), 59665-59679, DOI: 10.1109/ACCESS.2019.2915919, 2019.

  87. Yugen Qin, Qiufen Xia, Zichuan Xu, Pan Zhou, Alex Galis, Omer F. Rana, Jiankang Ren, Guowei Wu: Enabling Multicast Slices in Edge Networks. IEEE Internet of Things Journal (Early Access), DOI: 10.1109/JIOT.2020.2991107, 2020.

  88. Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides: Kinetic k-semi-Yao graph and its applications. Computational Geometry, Vol. 77, 10-26, 2019.

  89. Windhya Rankothge, Frank Le, Alessandra Russo, Jorge Lobo: Optimizing Resource Allocation for Virtualized Network Functions in a Cloud Center using Genetic Algorithms. IEEE Transactions on Network and Service Management, DOI: 10.1109/TNSM.2017.2686979, date of publication: 23 March 2017.

  90. Haozhe Ren, Zichuan Xu, Weifa Liang, Qiufen Xia, Pan Zhou, Omer F. Rana, Alex Galis, Guowei Wu: Efficient Algorithms for Delay-Aware NFV-Enabled Multicasting in Mobile Edge Clouds with Resource Sharing. IEEE Transactions on Parallel and Distributed Systems (TPDS), Early Access, DOI: 10.1109/TPDS.2020.2983918, 30 March, 2020.

  91. Matthias Rost, Stefan Schmid: Virtual network embedding approximations: Leveraging randomized rounding. IEEE/ACM Transactions on Networking (TON), DOI: 10.1109/TNET.2019.2939950, Vol 27(5), 2071-2084, 2019.

  92. D. Satyanarayana, S. V. Rao: Fault-tolerant spanners for ad hoc networks. International Journal of Network Management, Vol. 22(4), 311-329, 2012.

  93. Marco Savi, Massimo Tornatore, Giacomo Verticale: Impact of processing-resource sharing on the placement of chained virtual network functions. IEEE Transactions on Cloud Computing, Early Access, DOI: 10.1109/TCC.2019.2914387, 2019.

  94. Chriatian Scheffer: More Flexible Curve Matching via the partial Frechet Similarity. International Journal of Computational Geometry and Applitations, 2016.

  95. C. Schindelhauer, K. Volbert, and M. Ziegler: Geometric spanners with applications in wireless networks. Computational Geometry: Theory and Applications (CGTA), Vol. 36(3), 197-214, 2007.

  96. Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay, Charles Malveaux: Tight Bounds of a Collisionless Robot Gathering Algorithm. ACM Transactions on Autonomous and Adaptive Systems (TAAS), Vol. 12(1), Aricle nr. 3, 2017.

  97. Sidharth Sharma, Anna Engelmann, Admela Jukan, Ashwin Gumaste: VNF Availability and SFC Sizing Model for Service Provider Networks. IEEE Access, Vol. 8, 119768-119784, DOI: 10.1109/ACCESS.2020.3005287, 2020.

  98. W.-Z. Song, Y. Wang, X.-Y. Li, and O. Frieder: Localized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks. Mobile Networks and Applications , Vol. 10(6), 911-923, 2005.

  99. Maryam Tanha, Dawood Sajjadi, Rukhsana Ruby, Jianping Pan: Capacity-aware and Delay-guaranteed Resilient Controller Placement for Software-Defined WANs. IEEE Transactions on Network and Service Management, Vol. 15(3), 991-1005, 2018.

  100. George Trimponias, Yan Xiao, Hong Xu, Xiaorui Wu, and Yanhui Geng: Centrality-based Middlepoint Selection for Traffic Engineering with Segment Routing. IEEE/ACM Transactions on Networking, Vol. ??, ?-?, 2019.

  101. George Trimponias, Yan Xiao, Xiaorui Wu, Hong Xu, Yanhui Geng: Node-Constrained Traffic Engineering: Theory and Applications. IEEE/ACM Transactions on Networking, Vol 27(4), 1344-1358, 2019.

  102. Karima Velasquez, David Perez Abreu, Marilia Curado, Edmundo Monteiro: Service placement for latency reduction in the internet of things. Annals of Telecommunications, Vol. 72(1), 105-115, 2017.

  103. J. S. Vitter: External Memory Algorithms and Data Structures: Dealing with Massive Data. ACM Computig Surveys, Vol. 33, 209-271, 2004.

  104. Jingyu Wang, Bo He, Jing Wang, Tonghong Li: Intelligent VNFs Selection based on Traffic Identification in Vehicular Cloud Networks. IEEE Transactions on Vehicular Technology (Early Access), 2018.

  105. S. Wang, M. Zafer, K.K. Leung: Online Placement of Multi-Component Applications in Edge Computing Environments. IEEE Access, Special Issue on Mobile Edge Computing, 2017.

  106. Y. Wang, X.-Y. Li: Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks. Mobile Networks and Applications, Vol. 11(2), 161-175, 2006.

  107. Y. Wang, X.-Y. Li: Efficient Delaunay-based localized routing for wireless sensor networks. International Journal of Communication Systems, Vol. 20(7), 767 - 789, 2007.

  108. Yu Wang, Fan Li, Teresa A. Dahlberg: Energy-efficient topology control for three-dimensional sensor networks. International Journal of Sensor Networks, Vol. 4, No.1/2, 68-78, 2008.

  109. Y. Wang, X.-Y. Li, and O. Frieder: Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks. International Journal on Foundations of Computer Science, World Science Publications, Vol. 14(2), 183-200, 2003.

  110. J. Wu, F. Dai: Efficient Broadcasting with Guaranteed Coverage in Mobile Ad Hoc Networks. IEEE Transactions on Mobile Computing, Vol. 4(3), 259-270, 2005.

  111. Yicheng Xu, Vincent Chau, Chenchen Wu, Yong Zhang, Yifei Zou: Online Joint Placement and Allocation of Virtual Network Functions with Heterogeneous Servers. IEEE Internet of Things Journal, (Early Access) doi:10.1109/JIOT.2020.2990412, 2020.

  112. Zichuan Xu, Zhiheng Zhang, Weifa Liang, Qiufen Xia, Omer Rana, Guowei Wu: QoS-Aware VNF Placement and Service Chaining for IoT Applications in Multi-Tier Mobile Edge Networks. ACM Transactions on Sensor Networks, Vol. 16(3), Article No. 23, doi:10.1145/3387705, 2020.

  113. Yifu Yao, Songtao Guo, Pan Li, Guiyan Liu, Yue Zeng: Forecasting assisted VNF scaling in NFV-enabled networks. Computer Networks (COMNET), doi:10.1016/j.comnet.2019.107040, Vol. 168, 2020.

  114. Johannes Zerwas, Patrick Kalmbach, Stefan Schmid, Andreas Blenk: Ismael: Using Machine Learning to Predict Acceptance of Virtual Clusters in Data Centers. IEEE Transactions on Network and Service Management (TNSM), Vol. 16(3), 950-964, 2019.

  115. Jiao Zhang, Zenan Wang, Ningning Ma, Tao Huang, Yunjie Liu: Enabling Efficient Service Function Chaining by Integrating NFV and SDN: Architecture, Challenges and Opportunities. IEEE Network, Vol. 32(6), 152-159, 2018.

Conferences:
  1. M. A. Abam, M. de Berg, M. Farshi, and J. Gudmundsson: Region-Fault Tolerant Geometric Spanners. In Proc. 18th ACM-SIAM Symp. on Discrete Algorithms (SODA), 1-10, 2007.

  2. Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Mahmoud Parham, Stefan Schmid: Waypoint Routing in Special Networks. 17th IFIP Networking Conference (IFIP Networking 2018), 2018.

  3. Michael Amir, Alfred M Bruckstein: Fast Uniform Dispersion of a Crash-prone Swarm. Proc. Robotics: Science and Systems (RSS 2020), 2020.

  4. Michael Amir, Alfred M Bruckstein: Minimizing Travel in the Uniform Dispersal Problem for Robotic Sensors. Proc. 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019), 2019.

  5. Davood Bakhshesh, Mohammad Farshi: Some Properties of Continuous Yao Graph. Topics in Theoretical Computer Science (TTCS), Revised selected papers, LNCS Vol. 9541, 44-55, 2016.

  6. Davood Bakhshesh, Mohammad Farshi: Geometric spanners merging and its applications. Proc. 28th Canadian Conference on Computational Geometry (CCCG), 133-139, 2016.

  7. S. Bespamyatnikh, M. Segal: Dynamic Algorithms for Approximating Interdistances. Proc. 30th International Colloquium, Automata, Languages and Programming (ICALP), LNCS Vol. 2719, 1169-1180, 2003.

  8. S. Bhattacharjee, R. Inkulu: Fault-Tolerant Additive Weighted Geometric Spanners. Proc. 5th Int. Conference on Algorithms and Discrete Applied Mathematics (CALDAM), LNCS Vol. 11394, 29-41, 2019.

  9. S. Bhattacharjee, R. Inkulu: Geodesic Fault-Tolerant Additive Weighted Spanners. Proc. 25th International Computing and Combinatorics Conference (COCOON), LNCS Vol. 11653, 38-51, 2019.

  10. Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw: Maximum Matchings and Minimum Blocking Sets in $\Theta_6$-Graphs. Proc. Graph-Theoretic Concepts in Computer Science (WG 2019), LNCS Vol. 11789, 258-270, 2019.

  11. M. Bienkowski and F. Meyer auf der Heide: Page Migration in Dynamic Networks. Proc. 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS Vol. 3618, 1-14, 2005.

  12. Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams: Preserving Distances in Very Faulty Graphs. 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), LIPIcs, 73:1-73:14, 2017.

  13. Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams: Optimal Vertex Fault Tolerant Spanners (for fixed stretch). 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), 1884-1900, 2018.

  14. Greg Bodwin, Michael Dinitz, Caleb Robelle: Optimal Vertex Fault-Tolerant Spanners in Polynomial Time. 32th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), 2924-2938, 2021.

  15. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse and David Ilcinkas: Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces Proc. 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG), LNCS Vol. 6410, 266-278, 2010.

  16. Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, Buddhadeb Sau: Arbitrary Pattern Formation by Opaque Fat Robots with Lights. Proc. Algorithms and Discrete Applied Mathematics (CALDAM). LNCS Vol 12016, 346-359, 2020.

  17. Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, Buddhadeb Sau: Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights. Proc. International Colloquium on Structural Information and Communication Complexity (SIROCCO). LNCS Vol 11639, 109-123, 2019.

  18. P. Bose, M. Couture, P. Carmi: Spanners of Additively Weighted Point Sets. Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS Vol. 5124, 367-377, 2008.

  19. Prosenjit Bose, Mirela Damian, Karim Douieb, Joseph O'Rourke, Ben Seamone, Michiel Smid, and Stefanie Wurher: Pi/2-angle Yao Graphs are Spanners. Proc. 21st Internat. Symp. Algorithms Computation (ISAAC), Part II, Lecture Notes in Computer Science, Vol. 6507, 446-457, 2010.

  20. P. Bose, V. Dujmovic, P. Morin, and M. Smid: Robust geometric spanners. Proc. 29th ACM Symposium on Computational Geometry (SoCG 2013), 449-458, 2013.

  21. P. Bose, J. Gudmundsson, and P. Morin: Ordered Theta Graphs. Proc. 14th Canadian Conference on Computational Geometry (CCCG), 2002.

  22. Gilad Braunschvig, Shiri Chechik, David Peleg: Fault Tolerant Additive Spanners. Proc. 38th Graph-Theoretic Concepts in Computer Science (WG), LNCS Vol. 7551, 206-214, 2012.

  23. Kevin Buchin, Sariel Har-Peled, Daniel Olah: Sometimes Reliable Spanners of Almost Linear Size. Proc. 28th European Symposium on Algorithms (ESA 2020), 2020.

  24. Kevin Buchin, Sariel Har-Peled, Daniel Olah: Sometimes Reliable Spanners of Almost Linear Size. Proc. 36th European Workshop on Computational Geometry (EuroCG 2020), 2020.

  25. Kevin Buchin, Sariel Har-Peled, Daniel Olah: A Spanner for the Day After. Proc. 35th International Symposium on Computational Geometry (SoCG 2019), LIPIcs, 19:1-19:15, 2019.

  26. Kevin Buchin, Sariel Har-Peled, Daniel Olah: Reliable Geometric Spanners. Proc. 35th European Workshop on Computational Geometry (EuroCG), 2019.

  27. Paz Carmi, Michiel Smid: An optimal algorithm for computing angle-constrained spanners. Proc. 21st International Symposium on Algorithms and Computation (ISAAC 2010), LNCS Vol. 6506, 316-327, 2010.

  28. Diptarka Chakraborty, Debarati Das: Sparse Weight Tolerant Subgraph for Single Source Shortest Path. Proc. 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), LIPIcs, 15:1-15:15, 2018.

  29. Timothy M. Chan and Sariel Har-Peled and Mitchell Jones: On Locality-Sensitive Orderings and Their Applications. Proc. 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), LIPIcs, 21:1-21:17, 2019.

  30. T. -H. Hubert Chan, Mingfei Li, Li Ni: Sparse fault-tolerant spanners for doubling metrics with bounded hopdiameter or degree. Proc. Automata, Languages, and Programming (ICALP 2012), LNCS Vol. 7391, 182-193, 2012.

  31. Moses Charikar, Yonatan Naamad, Jenifer Rexford, X. Kelvin Zou: Multi-commodity Flow with In-Network Processing. Proc. 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2018), 73-101, 2018.

  32. S. Chechik, M. Langberg, David Peleg, Liam Roditty: Fault-tolerant spanners for general graphs. Proc. 41st ACM Symposium on Theory of Computing (STOC), 435-444, 2009.

  33. Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker: Approximating Nearest Neighbor Distances. Proc. Algorithms and Data Structures (WADS), LNCS Vol. 9214, 200-211, 2015.

  34. J. Crowcroft: Deploying Mesh Networks Through Public Transport. Proc. 2nd IEE Conference on Automotive Electronics, 267-293, 2006.

  35. A. Czumaj, H. Zhao: Fault-tolerant geometric spanners. Proc. 19th Annual ACM Symposium on Computational Geometry (SoCG), 1-10, 2003.

  36. Mirela Damian, John Iacono, Andrew Winslow: Spanning Properties of Theta-Theta-6. Proc. 21st Japan Conference on Discrete and Computational Geometry, Graphs, and Games, 2018.

  37. Zahra Derakhshandeh, Robert Gmyr, Andréa W. Richa, Christian Scheideler, Thim Strothmann: On the Runtime of Universal Coating for Programmable Matter. Proc. Int. Conf. on DNA Computing and Molecular Programming, LNCS, Vol. 9818, 148-164, 2016.

  38. David Dietrich, Chrysa Papagianni, Panagiotis Papadimitriou, John S. Baras: Network Function Placement on Virtualized Cellular Cores. Proc. 9th International Conference on Communication Systems and Networks (COMSNETS), 2017.

  39. Michael Dinitz, Robert Krauthgammer: Fault Tolerant Spanners: Better and Simpler. Proc. 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), 169-178, 2011.

  40. Michael Dinitz, Caleb Robelle: Efficient and Simple Algorithms for Fault-Tolerant Spanners. Proc. 39th Annual ACM Symposium on Principles of Distributed Computing (PODC), 2020.

  41. M. R. E. Dishabi: Construction of a Low Energy Cost Power Spanner for Wireless Ad hoc Networks. Proc. International Wireless Communications and Mobile Computing Conference (IWCMC), 117-122, 2008.

  42. Salvatore D'Oro, Laura Galluccio, Sergio Palazzo, Giovanni Schembra: A marketplace as a scalable solution to the orchestration problem in SDN/NFV networks. Proc. IEEE Conference on Network Softwarization (NetSoft), 2017.

  43. M. Dynia, J. Kutylowski, F. Meyer auf der Heide, and J. Schrieb: Local Strategies for Maintaining a Chain of Relay Stations between an Explorer and a Base Station. Proc. 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 260-269, 2007.

  44. Guy Even, Matthias Rost, Stefan Schmid: An Approximation Algorithm for Path Computation and Function Placement in SDNs. Proc. 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 374-390, 2016.

  45. M. Elkin, S. Solomon: Narrow-Shallow-Low-Light Trees, with and without Steiner Points. Proc. European Symposium on Algorithms (ESA'09), LNCS Vol. 5757, 215-226, 2009.

  46. Giuseppe Fedele, Giuseppe Franze: The target capturing problem for multi-agent double-integrator systems: a distributed model predictive control scheme. Proc. 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 2020.

  47. Klaus-Tycho Förster, Roger Wattenhofer: The Power of Two in Consistent Network Updates: Hard Loop Freedom, Easy Flow Migration. Proc. 25th International Conference on Computer Communication and Networks (ICCCN), 2016.

  48. Klaus-Tycho Förster, Laurent Vanbever, Roger Wattenhofer: Latency and Consistent Flow Migration: Relax for Lossless Updates. Proc. 18th IFIP Networking Conference (IFIP Networking), 2019.

  49. M. Fürer, S. Kasiviswanathan: Spanners for Geometric Intersection Graphs. Proc. 10th Workshop on Algorithms and Data Structures (WADS), LNCS Vol. 4619, 312-324, 2007.

  50. J. Gao, L. Zhang: Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and its Applications. Proc. 35th Annual ACM Symposium on Theory of Computing (STOC), 483-492, 2003.

  51. Lingnan Gao, George N. Rouskas: On Congestion Minimization for Service Chain Routing Problems. Proc. IEEE International Conference on Communications (ICC), doi: 10.1109/ICC.2019.8761660 2019.

  52. T. Germer and T. Strothotte: The Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets. Revised selected papers of the International Conference VISIGRAPH 2007, Communications in Computer and Information Science, Vol. 21, Computer Vision and Computer Graphics. Theory and Applications, Springer, 41-55, 2008.

  53. Lin Gu, Xiaoxiao Chen, Hai Ji, Feng Lu: VNF Deployment and Flow Scheduling in Geo-Distributed Data Centers. IEEE International Conference on Communications (ICC), 1-6, 2018.

  54. J. Gudmundsson and J. Vahrenhold: I/O-Efficiently Pruning Dense Spanners. In: J. Akiyama, M. Kano, and X. Tan, editors: Revised selected papers of the Japanese Conference on Discrete and Computational Geometry (JCDCG 2004), Discrete and Computattional Geometry, LNCS Vol. 3742, 106-116, 2005.

  55. Anupam Gupta, Roie Levin: The Online Submodular Cover Problem. Proc. 40th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2020.

  56. N. Herbaut, D. Negru, D. Dietrich, P. Papadimitriou: Service Chain Modeling and Embedding for NFV-based Content Delivery. Proc. IEEE International Conference on Communications (ICC),, 2017.

  57. Xi Huang, Simeng Bian, Xin Gao, Weijie Wu, Ziyu Shao, Yang Yang: Online VNF Chaining and Scheduling with Prediction: Optimality and Trade-Offs. Proc. IEEE Global Communications Conference (GLOBECOM), 2019.

  58. E. Huang, W. Hu, J. Crowcroft, and I. Wassell: Towards Commercial Mobile Ad Hoc Network Applications: A Radio Dispatch System. Proc. 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 355-365, 2005.

  59. R. Inkulu, Apurv Singh: Vertex Fault-Tolerant Spanners for Weighted Points in Polygonal Domains. Combinatorial Optimization and Applications (COCOA), LNCS, vol 12577, 471-485, DOI: 10.1007/978-3-030-64843-5_32, 2020.

  60. R. Inkulu, B. Sukanya: Fault-Tolerant Additive Weighted Geometric Spanners. Proc. 5th International Symposium on Algorithms and Discrete Applied Mathematics (CALDAM), DOI: 10.1007/978-3-030-11509-8_3, 2019.

  61. L. Jia, R. Rajaraman, and C. Scheideler: On local algorithms for topology control and routing in ad hoc networks. Proc. 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 220-229, 2003.

  62. Mike Jia, Weifa Liang, Meitian Huang, Zichuan Xu, and Yu Ma: Throughput Maximization of NFV-Enabled Unicasting in Software-Defined Networks. Proc. IEEE GLOBECOM 2017, 2017.

  63. Iyad A. Kanj, Ljubomir Perkovic, and Ge Xia: Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. Proc. 4th ACM SIGACT-SIGOPS DIALM/POMC, 2007.

  64. Juha Kärkkäinen and Simon J. Puglisi: Medium-Space Algorithms for the Inverse BWT. Proc. 18th Annual European Symposium on Algorithms (ESA), LNCS Volume 6346, Springer Verlag, 451-462, 2010.

  65. Tung-Wei Kuo, Bang-Heng Liou, Kate Ching-Ju Lin, Ming-Jer Tsai: Deploying chains of virtual network functions: On the relation between link and server usage. Proc. 35th IEEE Conference on Computer Communications (IEEE INFOCOM 2017), 1-9, 2016.

  66. Jian-Jhih Kuo, Shan-Hsiang Shen, Hong-Yu Kang, Ming-Jer Tsai, De-Nian Yang, W. T. Chen: Service Chain Embedding with Maximum Flow in Software Defined Network and Application to the Next-Generation Cellular Network Architecture. Proc. 36th IEEE Conference on Computer Communications (IEEE INFOCOM 2017), 2017.

  67. Jian-Jhih Kuo, Shan-Hsiang Shen, Ming-Hong Yang, De-Nian Yang, Ming-Jer Tsai, and Wen-Tsuen Chen: Service Overlay Forest Embedding for Software-Defined Cloud Networks. Proc. 37th IEEE International Conference on Distributed Computing Systems (ICDCS 2017), 2017.

  68. X.-Y. Li, Y. Wang, P.-J. Wan, and C.-W. Yi: Fault Tolerant Deployment and Topology Control for Wireless Ad Hoc Networks. Proc. 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc), 117-128, 2003.

  69. X.-Y. Li, Y. Wang: Efficient Construction of Low Weight Bounded Degree Spanner. Proc. Annual International Computing and Combinatorics Conference (COCOON), LNCS Vol. 2697, Springer Verlag, 374-384, 2003.

  70. X.-Y. Li, Y. Wang, and O. Frieder: Localized Routing for Wireless Ad Hoc Networks. Proc. IEEE International Conference on Communications (ICC), 443- 447, 2003.

  71. X.-Y. Li, Y. Wang, P.-J. Wan, W.-Z Song, and O. Frieder: Localized Construction of Low Weight Graph Structure and Its Applications in Wireless Ad Hoc Networks. Proc. 23rd IEEE INFOCOM, 2004.

  72. X.-Y. Li, G. Calinescu, P.-J. Wan, and Y. Wang: Distributed Construction of Planar Spanner and Routing for Ad Hoc Wireless Networks. Proc. 21st INFOCOM, 1268-1277, 2002.

  73. X.-Y. Li, P.-J. Wan, and Y. Wang: Power Efficient and Sparse Spanner for Wireless Ad Hoc Networks. Proc. IEEE International Conference on Computer Communications and Networks (ICCCN), 564-567, 2001.

  74. X.-Y. Li, Y. Wang, P.-J. Wan, and C.-W. Yi: Fault tolerant deployment and topology control in wireless ad hoc networks. Proc. 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 117-128 ,2003.

  75. G. Lin, G. Noubir, and R. Rajamaran: Mobility Models for Ad hoc Network Simulation. Proc. 23rd IEEE INFOCOM, 2004.

  76. Yilei Lin, Ting He, Shiqiang Wang, Kevin Chan, Stephen Pasteris: Looking Glass of NFV: Inferring the Structure and State of NFV Network from External Observations. Proc. 38th IEEE INFOCOM, DOI: 10.1109/INFOCOM.2019.8737393, 2019.

  77. Yufei Liu, Shang Cheng, Xinli Huang: Towards Web-Scale and Energy-Efficient Hybrid SDNs: Deployment Optimization and Fine-Grained Link State Management. Web Information Systems Engineering - WISE 2020 LNCS vol 12342, 559-573, DOI: 10.1007/978-3-030-62005-9_40, 2020.

  78. Marcelo Caggiani Luizelli, Danny Raz, Yaniv Sa'ar: Optimizing NFV Chain Deployment Through Minimizing the Cost of Virtual Switching. Proc. 37th IEEE INFOCOM, 2018.

  79. Arne Ludwig, Szymon Dudyzc, Matthias Rost, Stefan Schmid: Transiently Secure Network Updates. Proc. SIGMETRICS 2016, 273-284, 2016.

  80. Y. Luo and J. P. Tsai: A graphical simulation system for modeling and analysis of sensor networks. Proc. 7th IEEE International Symposium on Multimedia, 2005.

  81. Yu Ma, Weifa Liang, Zichuan Xu: Online Revenue Maximization in NFV-Enabled SDNs. IEEE International Conference on Communications (ICC), 1-6, 2018.

  82. A. Maheshwari, M. Smid, and N. Zeh: I/O-efficient algorithms for computing planar geometric spanners. Proc. 7th Workshop on Algorithms and Data Structures (WADS), LNCS Vol. 2125, Springer-Verlag, 287-299, 2001.

  83. Emi Mathews and Hannes Frey: A Localized Link Removal and Addition Based Planarization Algorithm. Proc. 13th International Conference on Distributed Computing and Networking (ICDCN), LNCS, Volume 7129, Springer Verlag, 337-350, 2012.

  84. F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald: Energy, Congestion and Dilation in Radio Networks. Proc. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 230-237, 2002.

  85. Segundo Moreno, Antonio M. Mora, Pablo Padilla, Javier Carmona-Murillo, Pedro A. Castillo: Applying Ant Colony optimization for Service Function Chaining in a 5G Network. Proc. 6th International Conference on Internet of Things: Systems, Management and Security (IOTSMS), 2019.

  86. Thi-Minh Nguyen, Serge Fdida, Tuan-Minh Pham: A Comprehensive Resource Management and Placement for Network Function Virtualization. Proc. 3rd IEEE Conference on Network Softwarization, 2017.

  87. Charalampos Papamanthoua, Ioannis G. Tollis: Algorithms for computing a parameterized st-orientation. Proc. 14th International Symposium on Graph Drawing, LNCS Vol. 4372, 220-233, 2007.

  88. Merav Parter, David Peleg: Sparse Fault-Tolerant-BFS Trees. Proc. 21st European Symposium on Algorithms (ESA), LNCS Vol. 8125, 779-790, 2013.

  89. Merav Parter, David Peleg: Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff. Proc. 27th ACM Symposium on Parallelism in Algorithms and Architectures, 2015.

  90. David Peleg: As Good as It Gets: Competitive Fault Tolerance in Network Structures. Proc. Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS Vol. 5873, 35-46, 2009.

  91. J. Martin Perez, F. Malandrino, C. F. Chiasserini, C. J. Bernardos: OKpi: All-KPI Network Slicing Through Efficient Resource Allocation. Proc. IEEE INFOCOM, 2020.

  92. Pavan Poudel, Gokarna Sharma: Universally Optimal Gathering Under Limited Visibility. Proc. 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2017), LNCS Vol. 10616, 323-340, 2017.

  93. Konstantinos Poularakis, George Iosifidis, Georgios Smaragdakis, Leandros Tassiulas: One Step at a Time: Optimizing SDN Upgrades in ISP Networks. Proc. 36th IEEE Conference on Computer Communications (IEEE INFOCOM 2017), 2017.

  94. Konstantinos Poularakis, Jaime Llorca, Antonia M. Tulino, Ian Taylor, Leandros Tassiulas: Joint Service Placement and Request Routing in Multi-cell Mobile Edge Computing Networks. Proc. 38th IEEE Conference on Computer Communications (IEEE INFOCOM 2019), 2019.

  95. Windhya Rankothge, Helena Ramalhinho, Jorge Lobo: On the Scaling of Virtualized Network Functions. Proc. 2019 IFIP/IEEE Symposium on Integrated Network and Service Management, 2019.

  96. S.S. Rizvi, A. Riasat, M.A. Khan, K. Elleithy: The Worst and Best Case Capacity Analysis of Mobile Ad Hoc Networks (MANET) Using a 3-Phase Algorithm. Proc. 5th IEEE Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 594-596, 2008.

  97. S.S. Rizvi, A. Riasat, M.A. Khan: A New Analytical Model for Maximizing the Capacity and Minimizing the Transmission Delay for MANET. Novel Algorithms and Techniques in Telecommunications and Networking, Springer Netherlands, 275-279, 2010.

  98. S. Rührup, C. Schindelhauer, K. Volbert, and M. Grünewald: Performance of Distributed Algorithms for Topology Control in Wireless Networks. Proc. 17th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2003.

  99. G. Sallam, B. Ji: Joint Placement and Allocation of Virtual Network Functions with Budget and Capacity Constraints. Proc. IEEE INFOCOM 2019, Paris, France, May 2019.

  100. Gamal Sallam, Zizhan Zheng, Bo Ji: Placement and Allocation of Virtual Network Functions: Multi-dimensional Case. Proc. 27th IEEE International Conference on Network Protocols (ICNP 2019), 1-11, 2019.

  101. C. Scheideler: Models and Techniques for Communication in Dynamic Networks. Proc. 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS), LNCS Vol. 2285, Springer Verlag, 27-49, 2002.

  102. C. Schindelhauer, K. Volbert, and M. Ziegler: Spanners, Weak Spanners, and Power Spanners for Wireless Networks. Proc. 15th Annual International Symposium on Algorithms and Computation (ISAAC), LNCS Vol. 3341, Springer Verlag, 805-821, 2004.

  103. Gokarna Sharma, Hari Krishnan: Tight Bounds on Localized Sensor Self-Deployment for Focused Coverage. Proc. 24th International Conference on Computer Communication and Networks (ICCCN), 1-7, 2015.

  104. Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay, Charles Malveaux: Tight analysis of a collisionless robot gathering algorithm. Proc. IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 5189-5194, 2015.

  105. Shay Solomon: From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics. Proc. 46th Annual ACM Symposium on Theory of Computing (STOC), 363-372, 2014.

  106. W.-Z. Song, Y. Wang, X.-Y. Li, and O. Frieder: Localized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks. Proc. 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 98-108 , 2004.

  107. G. Tan, M. Bertier, and A-M. Kermarrec: Visibility-Graph-based Shortest-Path Geographic Routing in Sensor Networks. Proc. of 28th IEEE INFOCOM, 2009.

  108. Y. Tao, N. Mamoulis, and D. Papadias: Validity information retrieval for spatio-temporal queries. Proc. 8th International Symposium SSTD, LNCS Vol. 2750, Springer Verlag, 159-178, 2003.

  109. Laurent Viennot and Philippe Jacquet: Remote-Spanners: What to Know beyond Neighbors. Proc. 23rd IEEE International Parallel & Distributed Processing Symposium (IPDPS), 1-10, 2009.

  110. K. Volbert: Experimental Analysis of Adjustable Sectorized Topologies for Static Ad Hoc Networks. Proc. DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 102-111, 2004.

  111. Y. Wang, X. Shi: Efficient on-demand topology control for wireless ad hoc networks. Proc. 14th International Conference on Computer Communications and Networks (ICCCN), 159-164, 2005.

  112. J. Wu, F. Dai: Mobility management and its applications in efficient broadcasting in mobile ad hoc networks. Proc. 23rd IEEE INFOCOM, 2004.

  113. J.K. Xie, L.P. Huang: Formal description and complexity analysis of routing in mobile ad hoc system. Proc. 6th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), 421-423, 2005.

  114. Kun Xie, Xuhui Zhou, Thabo Semong, Shiming He: Multi-Source Multicast Routing with QoS Constraints in Network Function Virtualization. Proc. IEEE International Conference on Communications (ICC 2019), doi: 10.1109/ICC.2019.8761957, 2019.

  115. J.K. Xie, L.P. Huang: Specification and verification of position based routing for mobile ad hoc system. Proc. 5th International Conference on Computer and Information Technology, 406-409, 2005.

  116. Zichuan Xu, Weifa Liang, Meitian Huang, Mike Jia, Song Guo, Alex Galis: Approximation and Online Algorithms for NFV-Enabled Multicasting in SDNs. Proc. IEEE 37th International Conference on Distributed Computing Systems (ICDCS), 2017.

  117. Zichuan Xu, Yutong Zhang, Weifa Liang, Qiufen Xia, Omer Rana, Alex Galis, Guowei Wu, Pan Zhou: NFV-Enabled Multicasting in Mobile Edge Clouds with Resource Sharing. Proc. 48th International Conference on Parallel Processing (ICPP 2019), Article No. 104, doi: 10.1145/3337821.3337825, 2019.

  118. Bingtian Xue, Stefan Schmid and Kim Larsen: WNetKAT: A Weighted SDN Programming and Verification Language. Proc. 20th International Conference on Principles of Distributed Systems (OPODIS), 18:1-18:18, 2016.

  119. Fan Zhang, Robson De Grande, Azzedine Boukerche: Macroscopic interval-split free-flow model for vehicular cloud computing. Proc. IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT), 2017.

  120. Tao Zhang, Robson E. De Grande, Azzedine Boukerche: Vehicular Cloud: Stochastic Analysis of Computing Resources in a Road Segment. Proc. 12th ACM Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, 9-16, 2015.

  121. Gongming Zhao, Hongli Xu, Jianchun Liu, Chen Qian, Juncheng Ge, Liusheng Huang: SAFE-ME: Scalable and Flexible Middlebox Policy Enforcement with Software Defined Networking. Proc. 27th IEEE International Conference on Network Protocols (ICNP 2019), 1-11, 2019.

Ph.D. Theses:
  1. Gilad Kutiel: Approximation Algorithms for Submodular Maximization and Network Design Problems. Ph.D. Thesis, Technion - Computer Science Department, 2019.

  2. Mike Jia: Provisioning Delay-Aware Services in Mobile Edge Cloud-Networks via Efficient Resource Allocation and Optimization. Ph.D. Thesis, Australian National University, 2019.

  3. Matthias Rost: Virtual network embeddings: Theoretical foundations and provably good algorithms. Ph.D. Thesis, Technische Universität Berlin, 2019.

  4. Lingnan Gao: Resource Allocation in Virtual Network Environments. Ph.D. Thesis, North Carolina State University, 2019.

  5. Meihui Gao: Models and Methods for Network Function Virtualization (NFV) Architectures. Ph.D. Thesis, Univ. de Lorraine, 2019.

  6. Ghada Moualla: Resilient Virtualized Network Functions for Data Centers and Decentralized Environments. Ph.D. Thesis, Universite Cote D'Azur, 2019.

  7. Maryamsadat Jalalitabar: Service Function Graph Design And Embedding In Next Generation Internet. Ph.D. Thesis, Georgia State University, 2018.

  8. Zahra Derakhshandeh: Algorithmic Foundations of Self-Organizing Programmable Matter. Ph.D. Thesis, Arizona State University, 2017.

  9. Marcelo Caggiani Luizelli: Scalable Cost-Efficient Placement and Chaining of Virtual Network Functions. Ph.D. Thesis, Univ. Federal do Rio Grande do Sul, Inst. Informatica, 2017.

  10. Windhya Rankothge: Towards virtualized network functions as a service. Ph.D. Thesis, Universitat Pompeu Fabra. Departament de Tecnologies de la Informació i les Comunicacions, 2017.

  11. Jie Gao: Hierarchical Data Structures for Mobile Networks. Ph.D. Thesis, Stanford University, 2004.

  12. S. Jiang: Network and Service Failure Restauration and Prevention in Multi-Hop wireless and Mobile Networks. Ph.D. Thesis, Graduate School of Vanderbilt University, 2009.

  13. K.S. Munasinghe: A Unified Mobility Management Architecture for Interworked Heterogeneous Mobile Networks. Ph.D. Thesis, School of Electrical and Information Engineering, University of Sydney, 2008.

  14. Kevin M. Lillis: Improved Robustness of Topology Control and Routing Algorithms for Ad-Hoc Wireless Sensor Networks. Ph.D. Thesis, Graduate College, University of Iowa, 2008.

  15. R. O'Dell: Understanding Ad hoc Networks From Geometry to Mobility. Ph.D. Thesis, Swiss Federal Institute of Technology Zurich, 2006.

  16. K. Volbert: Geometric Spanners for Topology Control in Wireless Networks. Ph.D. Paderborn University, Germany, 2005.

  17. M. A. Spohn: Using Dominating Sets to Improve the Performance of Mobile Ad Hoc Networks. Ph.D. Thesis, University of California Santa Cruz, 2005.

  18. H. Zhao: Algorithms and Complexity Analyses for some Combinatorial Optimization Problems. Ph.D. Thesis, New Jersey Institute of Technology, Department of Computer Science, 2005.

  19. Y. Wang: Efficient Localized Topology Control for Wireless Ad Hoc Networks. Ph.D. Thesis, Department of Computer Science, Illinois Institute of Technology, 2004.

  20. N. Zeh: I/O-Efficient Algorithms for Shortest Path Related Problems. Ph.D. Thesis, Carleton University, Ottawa, Canada, 2002.