Journals
- Liu, D, Wang, H, and P. Van Mieghem, 2010, "Spectral Perturbation and Reconstructability of Complex Networks", Physical Review E, Vol. 81, Januari, p. 016101.
- Wang, H, and P. Van Mieghem, 2009, "Sampling networks by the union of m shortest path trees", Computer Networks, to be pubished.
- Van Mieghem, P., 2009, "Weight of a link in a shortest path tree and the Dedekind Eta function", Random Structures and Algorithms, to be published.
- Van Mieghem, P., J. S. Omic and R. E. Kooij, 2009, "Virus Spread in Networks", IEEE/ACM Transaction on Networking, Vol. 17, No. 1, February, pp. 1-14.
- Van Mieghem, P. and H. Wang, 2009, "The Observable Part of a Network", IEEE/ACM Transaction on Networking, Vol. 17, No. 1, February, pp. 93-105.
- Hooghiemstra, G. and P. Van Mieghem, 2008, "The weight and hopcount of the shortest path in the complete graph with exponential weights", Combinatorics, Probability and Computing, Vol. 17, No. 4, pp. 537-548.
- S. G. Walker and P. Van Mieghem, 2008, "On Lower Bounds for the Largest Eigenvalue of a Symmetric Matrix", Linear Algebra and its Applications, Vol. 429, No. 2-3, July, pp. 519-526.
- Wang, H, J. Martin Hernandez and P. Van Mieghem, 2008, "Betweenness Centrality in Weighted Networks", Physical Review E, vol. 77, April, p. 046105.
- Zhou, X., M. Jacobsson, H. Uijterwaal and P. Van Mieghem, 2008, "IPv6 Delay and Loss Performance Evolution", International Journal of Communication Systems, Vol. 21, No. 6, pp. 643-663.
- Lua, E. K., X. Zhou, J. Crowcroft and P. Van Mieghem, 2008, "Scalable multicasting with network-aware geometric overlay", Computer Communications, vol. 31, pp. 464-488.
- Van Mieghem, P., and S. Tang, 2008, "Weight of the Shortest Path to the First Encountered Peer in a Peer Group of Size m", Probability in the Engineering and Informational Sciences (PEIS), vol. 22, pp. 37-52.
- Van Mieghem, P., 2007, "A new type of lower bound for the largest eigenvalue of a symmetric matrix", Linear Algebra and its Applications, Vol. 427, No. 1, November, p. 119-129.
- Dhillon, S. S. and P. Van Mieghem, 2007, "Performance Analysis of the AntNet Algorithm", Computer Networks, Vol. 51, No. 8, June 6, p. 2104-2125.
- Van der Hofstad, R, G. Hooghiemstra and P. Van Mieghem, 2007, "The Weight of the Shortest Path Tree", Random Structures and Algorithms, Vol. 30, No. 3, May, pp. 359-379.
- Van der Hofstad, R, G. Hooghiemstra and P. Van Mieghem, 2006, "Size and Weight of Shortest Path Trees with Exponential Link Weights", Combinatorics, Probability and Computing, vol. 15, pp. 903-926.
- Hekmat, R. and P. Van Mieghem, 2006, "Connectivity in Wireless Ad Hoc Networks with a Log-normal Radio Model", Mobile Networks and Applications, Special Issue: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Vol. 11, No. 3, June, pp. 351-360.
- Masip-Bruin, X., M. Yannuzzi, J. Domingo-Pascual, A. Fonte, M. Curado, E. Monteiro, F. Kuipers, P. Van Mieghem, S. Avallone, G. Ventre, P. Aranda-Gutierrez, M. Hollick, R. Steinmetz, L. Iannone and K. Salamatian, 2006, "Research Challenges in QoS Routing", Computer Communications, Vol. 29, pp. 563-581.
- Janic, M. and P. Van Mieghem, 2006, "On properties of multicast routing trees", International Journal of Communication Systems, vol. 19, No. 1, Februari, pp. 95-114.
- Van Mieghem, P. and S. M. Magdalena, 2005, "A Phase Transition in the Link Weight Structure of Networks", Physical Review E, Vol. 72, November, p. 056138.
- Hooghiemstra, G. and P. Van Mieghem, 2005, "On the Mean Distance in Scale Free Graphs", Methodology and Computing in Applied Probability (MCAP), Vol. 7, pp. 285-306.
- Van Mieghem, P. and S. van Langen, 2005, "Influence of the Link Weight Structure on the Shortest Path", Physical Review E, Vol. 71, May, p. 056113.
- Van der Hofstad, R, G. Hooghiemstra and P. Van Mieghem, 2005, "Distances in Random Graphs with Finite Variance Degrees", Random Structures and Algorithms, Vol. 27, No. 1, August, pp. 76-123.
- Kuipers, F. A. and P. Van Mieghem, 2005, "Conditions that impact the Complexity of QoS Routing", IEEE/ACM Transaction on Networking, Vol. 13, No. 4, pp. 717-730.
- Kuipers, F. A. and P. Van Mieghem, 2005, "Non-Dominance in QoS Routing: an Implementational Perspective", IEEE Communications Letters, Vol. 9, No. 3, March, pp. 267-269.
- Van Mieghem, P. and F. A. Kuipers, 2004, "Concepts of Exact Quality of Service Algorithms", IEEE/ACM Transaction on Networking, vol. 12, No. 5, pp. 851-864.
- Van Mieghem, P., 2004, "The Hopcount to an Anycast Group", International Journal of Communication Systems, vol. 17, pp. 269-285.
- Kuipers, F. A., T. Korkmaz, M. Krunz and P. Van Mieghem, 2004, Performance Evaluation of Constraint-Based Path Selection Algorithms, IEEE Network, vol. 18, No. 5, September/October, pp. 16-22.
- Hekmat, R. and P. Van Mieghem, 2004, "Interference in Wireless Multi-hop Ad-hoc Networks and its effect on Network Capacity", Wireless Networks, vol. 10, pp. 389-399.
- Guo, Y., F. A. Kuipers and P. Van Mieghem, 2003, "Link-Disjoint Paths for Reliable QoS Routing", International Journal of Communication Systems, vol. 16, pp. 779-798.
- Van Mieghem, P. and F. A. Kuipers, 2003, On the Complexity of QoS Routing, Computer Communications, vol. 26, No. 4, March 2003, pp. 376-387.
- Van der Hofstad, R, G. Hooghiemstra and P. Van Mieghem, 2002, "The flooding time in the random graph, Extremes, vol. 5, No. 2, June 2002, pp. 111-129.
- Kuipers, F. A., T. Korkmaz, M. Krunz, and P. Van Mieghem, 2002, Overview of Constraint-Based Path Selection Algorithms for QoS Routing, IEEE Communications Magazine, Vol. 40, No. 12, December, pp. 50-55.
- Van der Hofstad, R, G. Hooghiemstra and P. Van Mieghem, 2002, "On the covariance of the level sizes in random recursive trees, Random Structures and Algorithms, vol. 20, pp. 519-539.
- Kuipers, F. and P. Van Mieghem, 2002, MAMCRA, A Constrained-based Multicast Routing Algorithm, Computer Communications, vol. 25/8, pp. 801-810.
- Van Mieghem, J.A. and P. Van Mieghem, 2002, "Price-coupled Scheduling for Differentiated Services: Gcm versus GPS", International Journal of Communication Systems, vol. 15, pp. 429-452.
- Van Mieghem, P., G. Hooghiemstra and R. Van der Hofstad, 2001, On the Efficiency of Multicast, IEEE/ACM Transactions on Networking, vol. 9, No. 6, pp. 719-732.
- Van Mieghem, P., 2001, "Paths in the simple Random Graph and the Waxman Graph", Probability in the Engineering and Informational Sciences (PEIS), vol. 15, pp. 535-555.
- Van der Hofstad, R, G. Hooghiemstra and P. Van Mieghem, 2001, "First Passage Percolation on the Random Graph", Probability in the Engineering and Informational Sciences (PEIS), vol. 15, pp. 225-237.
- Van Mieghem, P., H. De Neve and F. Kuipers, 2001, "Hop-by-hop Quality of Service Routing", Computer Networks, vol. 37. No 3-4, pp. 407-423.
- De Neve, H, and P. Van Mieghem, 2000, "TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm", Computer Communications, Vol. 23, pp. 667-679.
- Van Mieghem, P., 1999, "Topology Information Condensation in Hierarchical Networks", Computer Networks, Vol.. 31, no. 20, pp. 2115-2137, November.
- Van Mieghem, P., J. David and G. H. Petit, 1998, "Performance of Cell Loss Priority Management Schemes in Shared Buffers with Poisson Arrivals", European Transactions on Telecommunications, Vol. 9, No. 3, pp. 245-258.
- Van Mieghem, P., B. Steyaert and G.H. Petit, 1997, "Performance of Cell Loss Priority Management Schemes in a Single Sever Queue", International Journal of Communication Systems, vol. 10, pp. 161-180.
- Van Mieghem, P., 1996, "The Asymptotic Behaviour of Queueing Systems: Large Deviations Theory and Dominant Pole Approximation", Queueing Systems, vol. 23, pp. 27-55.
Chapter(s) in Books
-
Van Mieghem, P. (ed.), F.A. Kuipers, T. Korkmaz, M. Krunz, M. Curado, E. Monteiro, X. Masip-Bruin, J. Solé-Pareta, and S. Sánchez-López, 2003, Quality of Service Routing, Chapter 3 in Quality of Future Internet Services, EU-COST 263 Final Report, edited by Smirnov et al. in Springer LNCS 2856, pp. 80-117.