LIST OF PUBLICATIONS

Last updated: Feb. 2015

THESES

1. A. Farago, “Algorithmic Problems in Modern Telecommunication Net-works and Services” (In Hungarian), Summary of Achievements for theDistinguished Degree “Doctor of the Hungarian Academy of Sciences”,Budapest, Hungary, Prepared in 1994.

2. A. Farago, “Formal Description Methods of Networks of Automata”(In Hungarian), Ph.D. Dissertation, Technical University of Budapest,Hungary, 1981.

3. A. Farago, “Stochastic Computers” (In Hungarian), M.Sc. Thesis, Tech-nical University of Budapest, Hungary, 1976.

BOOKS AND CHAPTERS/SECTIONS IN BOOKS

4. R. Xu and A. Farago, “Connectivity and Structure in Large Networks,”in: M. Natarajan (Ed.), Advanced Methods for Complex Network Anal-ysis, IGI Global, accepted, in press.

5. A. Farago, “Asymptotic Analysis of Network Topologies,” in: M. Natara-jan (Ed.) Recent Advances in Ad Hoc Networks Research, Nova SciencePublishers, New York, 2014, Chapter 9, pp. 183–204.

6. H. Lian and A. Farago, “Computation of Performance Parameters inMulti-service Cognitive Cellular Networks,” In: N. Meghanathan andY.B. Reddy (Eds.), Cognitive Radio Technology Applications for Wire-less and Mobile Ad hoc Networks, IGI Global Publishers, Hershey, PA,2013, Chapter 11, pp. 234–247.

7. A. Farago, “Random Graph Models and the Limits of Scalability in AdHoc and Sensor Networks”, In: S.K. Makki et al. (eds.), Sensor andad Hoc Networks, Theoretical and Algorithmic Aspects, Springer, 2008,pp. 19-42.

1

8. A. Farago, “Algorithmic Challenges in Ad Hoc Networks”, In: MobileAd Hoc Networking, Ed. by S. Basagni, M. Conti, S. Giordano and I.Stojmenovic, IEEE Press and Wiley-Interscience, 2004, pp. 427-445.

9. A. Farago and V.R. Syrotiuk, “Medium Access Control (MAC) Proto-cols”, In: J. Proakis (Ed.), Encyclopedia of Telecommunications, JohnWiley & Sons, 2002.

10. A. Farago, “VP Network Design Using a Multicommodity Flow Model”,In: J. Roberts, U. Mocci, J. Virtamo (eds.): Broadband Network Traf-fic, Springer, 1996.

11. A. Farago, “Capacity Partitioning among Multiple VP Networks”, In:J. Roberts, U. Mocci, J. Virtamo (eds.): Broadband Network Traffic,Springer, 1996.

12. A. Farago, “Routing at Maximal Carried Traffic in a Logical Network”,In: J. Roberts, U. Mocci, J. Virtamo (eds.): Broadband Network Traf-fic, Springer, 1996.

13. G. B. Sulle, S. Csibi, Gy. Dallos, A. Farago, G. Gordos L. Gyorfi, Z.Gyorfi, L. Osvath, A. Palinszki, Gy. Podoletz, Cs. Szabo, (edited byS. Csibi), Transmission and Processing of Information, (in Hungarian),Hungarian Textbook Publisher, Budapest, 1986.

REFEREED JOURNALS

14. A. Askarian and A. Farago, “Designing Networks with Low StructuralCongestion via Game Theory and Linear Programming,” accepted toTransactions on Networks and Communications, in press.

15. A. Farago, “Optimizing Massive Distance Computations in PatternRecognition,” International Journal of Machine Learning and Com-puting, Vol. 4, No. 1, Feb 2014, pp. 114–119.

16. Z. Chen and A. Farago, “A New Visualization Approach to BetterUnderstanding the World Wide Web,” Journal of Computational In-telligence and Electronic Systems, Vol. 2 (2013), No. 1, pp. 36–44.

2

17. A. Farago, “Analysis of Large Random Network Topologies”, InvitedPaper, Infocommunications Journal, Vol. 4, No. 2, 2012, pp. 1–10.Won the Outstanding Paper Award.

18. H. Lian and A. Farago, “Optimizing Call Admission Control for Cog-nitive Radio Networks Using a New Heuristic Optimization Method”,Science Academy Transactions on Computer and Communication Net-works, Vol. 2, No. 1, 2012, pp. 78-88.

19. A. Farago, “Network Topology Models for Multihop Wireless Net-works,” Invited Paper, ISRN Communications and Networking, Vol.2012 (2012), Article ID 362603, 23 pages.

20. H. Lian and A. Farago, “Optimizing Virtual Private Network DesignUsing a New Heuristic Optimization Method,” ISRN Communicationsand Networking, vol. 2012, Article ID 914953, 9 pages, 2012.

21. A. Farago, “Asymptotically Optimal Trade-Off Between Local andGlobal Connectivity in Wireless Networks”, Performance Evaluation,vol. 68, 2011/2, pp. 142–156.

22. Hongbing Lian and A. Farago, “Analysis of Call Admission Control forMultiservice Cognitive Radio Networks”, Journal of Selected Areas inTelecommunications (JSAT), October 2011, pp. 18–25.

23. C. Wang, J. Willson, M.A. Park, A. Farago, and W. Wu: “On DualPower Assignment Optimization for Biconnectivity,” Journal of Com-binatorial Optimization, 19(2010/2), pp. 174-183.

24. A. Farago, “On the Structure of Classes of Random Graphs”, ChicagoJournal of Theoretical Computer Science, June 2010, Article 2010-5(online journal, http://cjtcs.cs.uchicago.edu/)

25. D.T. Tran, Z. Chen, and A. Farago, “On Selfish Behavior in TDMA-based Bandwidth Sharing Protocols in Wireless Networks”, Journal ofTelecommunications, Vol. 4, August 2010, pp. 1–9.

26. A. Farago, “Scalability of Node Degrees in Random Wireless Net-work Topologies”, IEEE Journal on Selected Areas in Communications,Spec. Issue on Stochastic Geometry and Random Graphs for WirelessNetworks, Vol. 27, Sept. 2009, pp. 1238–1244.

3

27. A. Farago, “Efficient Blocking Probability Computation of ComplexTraffic Flows for Network Dimensioning”, Computers and OperationsResearch, Vol. 35, 2008, pp. 3834-3847.

28. N. Meghanathan and A. Farago, “On the Stability of Paths, SteinerTrees and Connected Dominating Sets in Mobile Ad Hoc Networks”,Ad Hoc Networks, Elsevier, Vol. 6, 2008, pp. 744-769.

29. A. Farago, “Algorithmic Challenges in Learning Path Metrics fromObserved Choices” Applied Artificial Intelligence, Vol. 22, 2008, pp.749-760.

30. A. Farago, “A General Tractable Density Concept for Graphs” Math-ematics in Computer Science, Vol. 1, No. 4 / June, 2008, pp. 689-699.

31. C. Wang, M.A. Park, J. Willson Y. Cheng, A. Farago and W. Wu, “OnApproximate Optimal Dual Power Assignment for Biconnectivity andEdge-Biconnectivity”, Theoretical Computer Science, Vol. 396, 2008,pp. 180-190.

32. A. Farago, “On the Fundamental Limits of Topology Control in AdHoc Networks”, Algorithmica, 49(2007), pp. 337-356.

33. A. Farago, “Efficient Blocking Probability Computation of ComplexTraffic Flows for Network Dimensioning”, Computers and OperationsResearch, 35(2008), pp. 3834-3847.

34. N. Meghanathan and A. Farago, “On the Stability of Paths, SteinerTrees and Connected Dominating Sets in Mobile Ad Hoc Networks”,Ad Hoc Networks, 6(2008), pp. 744-769.

35. A. Farago, “On the Typical Case Complexity of Graph Optimization”Discrete Applied Mathematics, Special Issue on Typical Case Complex-ity and Phase Transitions, Vol. 153, December 2005, pp. 73-88.

36. A. Farago and V.R. Syrotiuk, “MERIT: A Scalable Approach for Pro-tocol Assessment”, Mobile Networks and Applications (MONET), Spec.Issue on Mobile Ad Hoc Networks, Vol. 8, October 2003, pp. 567-577.

4

37. A. Farago, A. Szentesi and B. Szviatovszki, “Inverse Optimizationin High Speed Networks”, Discrete Applied Mathematics, Spec. Is-sue on Combinatorial and Algorithmic Aspects of Telecommunications,129(2003), pp. 83-98.

38. G.O. Burnham, C.D. Cantrell, A. Farago, A. Fumagalli, K. Kiasaleh,W.P. Osborne, R. Prakash, “The First Telecommunications Engineer-ing Program in the United States”, ASEE PRISM, Journal of theAmerican Society for Engineering Education, October 2001, pp. 653–657.

39. A. Farago, A.D. Myers, V.R. Syrotiuk, and G. Zaruba. “Meta-MACProtocols: Automatic Combination of MAC Protocols to Optimize Per-formance for Unknown Conditions,” IEEE Journal on Selected Areasin Communications, Volume 18, Number 9, September 2000, pp. 1670–1681.

40. A. Magi, A. Szentesi, B. Szviatovszki, A. Farago, “Dynamic Routing inATM Networks”, Journal on Communications, Vol. 50, No. 11, Novem-ber 1999, pp. 2-11.

41. I. Chlamtac and A. Farago, “A New approach to the Design and Anal-ysis of Peer-to-Peer Mobile Networks”, Wireless Networks, 5(1999/3),pp. 149-156.

42. I. Chlamtac, A. Farago, H. Zhang and A. Fumagalli, “A Determin-istic Approach to the End-to-End Analysis of Packet Flows in Con-nection Oriented Networks”, IEEE/ACM Transactions on Networking,6(1998/4), pp. 422-431.

43. P. Bahl, I. Chlamtac and A. Farago, “Resource Assignment For In-tegrated Services in Wireless ATM Networks”, International Journalof Communication Systems, Spec. Issue on Personal CommunicationSystems, 11(1998), pp. 29-41.

44. I. Chlamtac, A. Farago and T. Zhang: “Time Spread Multiple Access(TSMA) Protocols for Multihop Mobile Radio Networks”, IEEE/ACMTransactions on Networking, 5(1997/6), pp. 804-812.

45. A. Farago, J. Bıro, T. Henk and M. Boda, “Analog Neural Optimiza-tion for ATM Resource Management”, IEEE Journal on Selected Areas

5

in Communications, 15(1997/2), Special Issue on Computational andArtificial Intelligence in High Speed Networks, pp. 156-164.

46. K. Szarkowicz, G. Fodor, A. Farago and T. Henk, “Simulative Analy-sis of Routing Strategies in Multicasting Multiservice Loss Networks”,Simulation, January 1997, Special Issue on Modeling and Simulationof Computer Systems and Networks, pp. 34-43.

47. I. Chlamtac, A. Farago and T. Zhang: “Lightpath (Wavelength) Rout-ing in Large WDM Networks”, IEEE Journal on Selected Areas inCommunications, 14(1996/5), pp. 909-913.

48. A. Farago, V.T. Hai, T. Cinkler, Z. Fekete and A. Arato, “An ATMNetwork Planning Model”, Journal on Communications, Special Issueon ATM Networks I., 47(1996), pp. 13-16.

49. J. Bıro, Z. Koronkai, T. Tron, M. Boda, A. Farago and T. Henk, “Neu-rocomputing in Logical Partitioning of ATM Networks”, Journal onCommunications, Special Issue on ATM Networks II., 47(1996), pp.7-11.

50. A. Farago, S. Blaabjerg, L. Ast, G. Gordos and T. Henk, “A NewDegree of Freedom in ATM Network Dimensioning: Optimizing theLogical Configuration”, IEEE Journal on Selected Areas in Communi-cations, 13(1995/7), pp. 1199-1206.

51. A. Farago, “On the Complexity of Finding Sparsest and Densest Partsin Wireless Networks”, Wireless Networks, 1(1995/2), pp. 221-226.

52. S. Molnar, A. Farago, T. Henk and S. Blaabjerg, “Towards PrecisionTools for ATM Network Design, Dimensioning and Management”, Pe-riodica Polytechnica (Electrical Engineering), 39(1995/1), pp. 37-51.

53. I. Chlamtac, A. Farago and H.Y. Ahn, “A Topology Transparent LinkActivation Protocol for Mobile CDMA Radio Networks”, IEEE Journalon Selected Areas in Communications, 12(1994/8), pp. 1426-1433.

54. I. Chlamtac, A. Farago, T. Zhang, “Optimizing the System of VirtualPaths”, IEEE/ACM Transactions on Networking, 2(1994/6), pp. 581-587.

6

55. I. Chlamtac and A. Farago, “An Optimal Channel Access Protocolwith Multiple Reception Capacity”, IEEE Transactions on Computers,43(1994/4), pp. 480-484.

56. I. Chlamtac and A. Farago, “Making Transmission Schedules Immuneto Topology Changes in Multi-Hop Packet Radio Networks”, IEEE/ACMTransactions on Networking, 2(1994/1), pp. 23-29.

57. A. Farago, T. Linder and G. Lugosi, “Fast Nearest Neighbor Searchin Dissimilarity Spaces”, IEEE Transactions on Pattern Analysis andMachine Intelligence, 15(1993/9), pp. 957-962.

58. A. Farago and G. Lugosi, “Strong Universal Consistency of Neural Net-work Classifiers”, IEEE Transactions on Information Theory, 39(1993/4),pp. 1146-1151.

59. A. Farago, T. Linder and G. Lugosi, “Efficient Search in DissimilaritySpaces for Automatic Speech Recognition”, Journal on Communica-tions 43(1992), Special Issue on Speech Processing, pp. 26-29.

60. A. Farago and G. Lugosi, “Parameter Estimation of Hidden MarkovProcesses in Isolated Word Recognition”, Journal on Communications,43(1992), Special Issue on Speech Processing, pp. 30-31.

61. A. Farago, T. Linder and G. Lugosi, “Nearest Neighbor Search andClassification in O(1) Time”, Problems of Control and InformationTheory, 20(1991/6), pp. 383-395.

62. A. Farago and G. Lugosi, “An Algorithm to Find the Global Opti-mum of Left-to-Right Hidden Markov Model Parameters”, Problems ofControl and Information Theory, 18(1989/6). pp. 435-444.

63. A. Farago, T. Linder and G. Lugosi, “On the Algorithmic Problems ofthe Nearest Neighbor Classification Rule”, (in Hungarian), Journal onCommunications 39(1988/8), pp. 337-341.

64. A. Farago and I. Novak, “High Accuracy Frequency Determinationfrom Discrete Spectra”, Periodica Polytechnica, 32(1988/2-4). pp. 121-127.

7

65. A. Farago, G. Gordos, I. Koutny, G. Magyar and L. Osvath, “TheVerbident-SD-2 Isolated Word Recognizer”, (in Hungarian), Journalon Communications 39(1988/3), pp. 111-115.

REFEREED CONFERENCES

66. A. Farago, “A Challenge for Intelligent Computing: Describing HugeNetworks,” Keynote Speech, 3rd Ionternational Conference on In-formation and Intelligent Computing, Hong Kong, Dec 26-28, 2014.

67. A. Farago, “Making Geometric Random Graph Models More Flexi-ble,” Invited Presentation, 10th ACM International Workshop onthe Foundations Of Mobile Computing (FOMC’14), Philadelphia, PA,Aug. 11, 2014.

68. A. Farago, “Network Reliability Analysis with Unreliable Information,”9th International Conference on Design of Reliable CommunicationNetworks, Budapest, Hungary, March 2013.

69. A. Askarian and A. Farago, “Optimizing Route Systems in Communica-tion Networks,” International conference on Network Science (NetSci’13,Copenhagen, Denmark, June 3-7, 2013.

70. A. Farago, “Optimizing Massive Distance Computations in PatternRecognition,” 2nd International Conference on Information and Intel-ligent Computing (ICIIC 2013), Kuala Lumpur, Malaysia, Dec 29-30,2013. Won the Best Presentation Award.

71. A. Farago, “Network Reliability Analysis with Unreliable Information,”9th International Conference on Design of Reliable CommunicationNetworks, Budapest, Hungary, March 2013.

72. A. Farago, “An Obstacle to Scalability in Wireless Networks,” 31stACM Symposium on Principles of Distributed Computing (PODC’12),July 16-18, 2012, Madeira, Portugal, pp. 235-236.

73. A. Farago, “Network Analysis Under Perturbations,” 8th ACM Inter-national Workshop on the Foundations of Mobile Computing (FOMC’12),Madeira, Portugal, July 19, 2012.

8

74. Z. Chen, A. Farago, and K. Zhang, “Exploring Structural Properties ofWeb Graphs through 3D Visualization”, 14th International Conferenceon Enterprise Information Systems (ICEIS’12),, Wroclaw, Poland, June28 - July 1, 2012.

75. Z. Chen and A. Farago, “A Clique Based Web Graph Model,” IADISInternational Conference on WWW/Internet (ICWI’12), Madrid, Spain,October 18-21, 2012.

76. Z. Chen and A. Farago, “Better Understanding of the Web through 3DVisualization” (poster), IEEE Symposium on Large-Scale Data Analy-sis and Visualization (LDAV’12), Seattle, WA, October 14-15, 2012.

77. A. Farago and S. Basagni, “Connecting Two Worlds: Physical Modelsand Graph Models of Wireless Network Topologies”, 13th IEEE In-ternat. Workshop on Future Trends of Distributed Computing Systems(FTDCS’11), Banff, Canada, Sep 2-4, 2011, pp. 739–744.

78. A. Farago, Low Distortion Metric Embedding into Constant Dimen-sion. 8th Annual Conference on Theory and Applications of Models ofComputation (TAMC’11), May 23-25, 2011, Tokyo, Japan, pp. 114–123.

79. A. Farago and D.T. Tran, “The Multigraph Advantage and Its Appli-cation in Network Analysis”, EURO XXIV Conference on OperationsResearch, Lisbon, Portugal, Session 6.2.52 (Telecommunications), Pa-per 1, July 11-14, 2010.

80. A. Farago and D.T. Tran, “A Self-Tuning Protocol for Optimal Band-width Allocation in Wireless Networks”, 4th IEEE International Con-ference on Self-Adaptive and Self-Organizing Systems (IEEE SASO2010), Budapest, Hungary, Sep. 27-Oct. 1, 2010, pp. 265–266.

81. S. Basagni, A. Farago, M.A. Nanni and Dung T. Tran, “Increased Con-nectivity at Lower Cost: The Case for Multi-radio Nodes in Multi-hopWireless Networks”, IEEE Global Communications Conf. (GLOBE-COM’09), Honolulu, Hawaii, Dec 2009

82. A. Farago, “Analysis of Fundamental Limits for Partial Connectivityin Wireless Networks”, IEEE Global Communications Conf. (GLOBE-COM’09), Honolulu, Hawaii, Dec 2009

9

83. A. Farago, “Quantifying the Trade-off Between the Level of Connectiv-ity and Local Complexity in Random Wireless Network Topologies”,6th International Conference on Quantitative Evaluation of Systems(QEST 2009), Budapest, Hungary, Sept 2009

84. A. Farago, “Local vs. Global Scalability in Ad Hoc and Sensor Net-works”, 4th Internat. Conf. on Scalable Information Systems (INFOS-CALE’09), Hong Kong, June 2009.

85. A. Farago, “Structural Properties of Random Graph Models”, Com-puting: The Australasian Theory Symposium (CATS’09), Wellington,New Zealand, January 20-23, 2009

86. S. Basagni, F, Nidito and A. Farago, “The Multi-radio Advantage”,IEEE Radio and Wireless Symposium (RWS’09), San Diego, CA, Jan18–22, 2009.

87. A. Farago, “On the Descriptional Complexity of Path Optimization inGraphs”, 10th International Workshop on the Descriptional Complexityof Formal Systems (DCFS’08), Charlottetown, PE, Canada, July 16-18, 2008, pp. 207-215.

88. C. Wang, M.A. Park J. Willson, A. Farago and D.Z. Du, “Fault-Tolerant Dual Power Management in Wireless Sensor Networks”, IEEEGLOBECOM, New Orleans, LA, Nov 30 – Dec 4, 2008, pp. 1–6.

89. A. Farago, “On Disjoint Connecting Paths and Unsplittable Flow”,Internat. Conf. on the Foundations of Computer Science (FCS’08),Las Vegas, NV, July 14-17, 2008, pp. 44–50.

90. A. Farago, “Speeding Up Large Scale Distance Computations”, Inter-nat. Conf. on Machine Learning, Models, Technologies and Applica-tions (MLMTA’08), Las Vegas, NV, July 14-17, 2008, pp. 814–820.

91. A. Farago and S. Basagni, “The Effect of Multi-Radio Nodes on Net-work Connectivity - A Graph Theoretic Analysis”, IEEE InternationalWorkshop on Wireless Distributed Networks (WDM’08), Cannes, France,September 2008.

10

92. A. Farago, “Methods for Handling Non-Markovian Performance Mod-els”, International Conference on Communications in Computing (CIC’07),Las Vegas, Nevada, June 25-28, 2007, pp. 97-103.

93. A. Farago, “Random Graph Models and the Limits of Scalability inAd Hoc and Sensor Networks”, International Workshop on Theoreticaland Algorithmic Aspects of Sensor and Ad-hoc Networks (WTASA’07),Miami, Florida, June 28-29, 2007, pp. 1-12.

94. A. Farago, “Sampling from Independence Systems”, International Con-ference on Foundations of Computer Science (FCS’07) Las Vegas, Nevada,June 25-28, 2007, pp. 27-33.

95. M.A. Park, W. Chen. J.K.V. Willson, M.T. Thai, W. Wu and A.Farago, “A Dominating and Absorbent Set in Wireless Ad Hoc Net-works with Different Transmission Ranges”, 8th ACM InternationalSymposium on Mobile Ad Hoc Networking and Computing (Mobi-hoc’07), Montreal, Canada, September 9-14, 2007, pp. 22-31.

96. A. Farago “Learning Path Metrics from Observed Choices”, Interna-tional Conference on Machine Learning, Las Vegas, Nevada, June 25-28, 2007, pp. 163-169.

97. M.A. Park and A. Farago, “Minimum Frequencies for the Virtual Max-imum MAC Capacity in a Multi-Channel Ad-Hoc Network”, ThirdIEEE International Workshop on Performance and Management ofWireless and Mobile Networks (P2MNet’07), part of 32nd IEEE Con-ference on Local Computer Networks (LCN’07) Dublin, Ireland, Octo-ber 15-18, 2007, pp. 725-730.

98. N. Meghanathan and A. Farago, ”Comparison of Routing Strategiesfor Minimizing Energy Consumption in Mobile Ad Hoc Networks”,4th Asian International Mobile Computing Conference (AMOC 2006),Kolkata, India, January 4-7, 2006.

99. A Farago, “Towards the Integration of Reliability and Traffic Engi-neering”, International Conference on Communications in Computing(CIC’06), Las Vegas, Nevada, June 26-29, 2006, pp. 28-34.

11

100. A Farago, “On the Convergence Rate of Quasi Lumpable Markov Chains”,3rd European Performance Engineering Workshop (EPEW’06), Bu-dapest, Hungary, June 21-22, 2006. Published in the Springer SeriesLNCS 4054, pp. 138-147.

101. A Farago, “Speeeding Up Markov Chain Monte Carlo Algorithms”, In-ternational Conference on Foundations of Computer Science (FCS’06),Las Vegas, Nevada, June 26-29, 2006, pp. 102-108.

102. A Farago, “A Graph Theoretic Model for Complex Network Failure Sce-narios”, 8th INFORMS Telecommunications Conference, Dallas, Texas,March 30 - April 1, 2006.

103. H. Wang and A. Farago, “On-line Algorithm for Server Selection ofVideo Streaming over P2P Networks”, International Conference onCommunications in Computing (CIC’06), Las Vegas, Nevada, June 26-29, 2006.

104. A. Farago, “New Analytical Results on Ad Hoc Network Connectiv-ity”, Third IASTED International Conference on Communications andComputer Networks (CCN 2005), Marina del Rey, CA, Oct 24-26, 2005,pp. 126-131.

105. A. Farago, “Almost Surely Almost Exact Optimization in RandomGraphs”, International Conference on Foundations of Computer Sci-ence (FCS’05), Las Vegas, Nevada, June 27-30, 2005, pp. 94-100.

106. A. Farago, “Finding Dense Subgraphs Efficiently”, International Con-ference on Foundations of Computer Science (FCS’05), Las Vegas,Nevada, June 27-30, 2005, pp. 73-79.

107. N. Meghanathan and A. Farago, “An Efficient Algorithm for the Opti-mal Number of Route Transitions in Mobile Ad Hoc Networks”, IEEEInternational Conference on Wireless and Mobile Computing, Network-ing and Communications (WiMob’05), Montreal, Canada, August 22-24, 2005, pp. 41-48.

108. N. Meghanathan and A. Farago, “On the Route Refresh Frequencyfor On-demand Maximum Battery Life Routing in Ad Hoc Networks,”IEEE International Conference on Wireless and Mobile Computing,

12

Networking and Communications (WiMob’05), Montreal, Canada, Au-gust 22-24, 2005, pp. 291-298.

109. N. Meghanathan and A. Farago, ”Maximizing Network Lifetime underFixed Energy Budget in Ad Hoc Networks,” IEEE Southeast Confer-ence, Fort Lauderdale, Florida, April 8-10, 2005, pp. 319-326.

110. N. Meghanathan and A. Farago, ”Power Sensitive Power Control in AdHoc Networks,” 43rd ACM Southeast Conference, March 18-20, 2005,Kennesaw, Georgia, pp. 7C/1-6.

111. H. Wang, A. Farago and S. Venkatesan, “Video Streaming over Multi-hop Wireless Networks”, 7th IEEE International Symposium on Mul-timedia (IEEE ISM’05), Irvine, California, December 12-14, 2005, pp.624-629.

112. A. Farago, “On the Fundamental Limits of Topology Control”, ACMWorkshop on Foundations of Mobile Computing (DIALM-POMC’04),Philadelphia, PA, Oct 1, 2004, pp. 1-7.

113. N. Meghanathan and A. Farago, “Looking at Protocol Efficiency from aNew Angle: Stability - Delay Analysis”, ACM International Workshopon Mobility Management and Wireless Access Protocols (MobiWac’04),Philadelphia, PA, Oct 1, 2004, pp. 51-55.

114. H. Wang, A. Farago and S. Venkatesan, ”A System for Video Stream-ing over Erroneous Multi-hop Wireless Networks” Wireless NetworkingSymposium (WCNG’04), Austin, TX, Oct 20-22, 2004.

115. A. Farago, “Availability Estimation of Routes, Trees and Subnetworksfor End-to-End QoS”, IEEE Global Telecommunications Conference(GLOBECOM’04), Dallas, TX, Nov 29 - Dec 3, 2004, pp. pp. 3583-3587.

116. A. Farago, “Route Metrics: Diversity and Unification”, InternationalNetwork Optimization Conference, Evry/Paris, France, Oct 27-29, 2003,in press.

117. A. Farago, “A Mathematical Method for Analyzing the Effect of Dif-ferent Protocol Layers on Routing in Ad Hoc Networks”, International

13

Conference on Wireless Networks, Las Vegas, Nevada, June 23-26,2003.

118. A. Farago, “A Unified Framework for Routing Metric”, High SpeedNetworking Workshop, Budapest, Hungary, May 21-22, 2003, pp. 114-117.

119. A. Farago, F. Unghvary and A. Fumagalli, “On Incorporating Depen-dent Link Failures in a Traffic Engineering Model”, IEEE InternationalConference on Communications (ICC’03), Anchorage, Alaska, May 11-15, 2003.

120. A. Farago, “Graph Theoretic Analysis of Ad Hoc Network Vulnera-bility”, Workshop on Modeling and Optimization in Mobile, Ad Hocand Wireless Networks (WiOpt’03), INRIA Sophia-Antipolis, France,March 3-5, 2003, pp. 171-180.

121. A. Farago, “Efficient Global Optimization of Physical and Logical Ca-pacity”, accepted to the 7th IFIP Conference on Optical Network De-sign and Modelling (ONDM’03), Budapest, Hungary, Feb. 2-5, 2003,921-938.

122. A. Fumagalli, M. Tacca, F. Unghvary and A. Farago, “Shared PathProtection with Differentiated Reliability”, IEEE International Con-ference on Communications (ICC’02), New York, April 28 – May 2,2002.

123. A. Farago and V. R. Syrotiuk. “Minimum Energy Broadcast with Per-formance Guarantee in Power-Controlled Ad Hoc Networks,” 14th In-ternational Conference on Wireless Communications Calgary, Alberta,July 8-10, 2002.

124. A Farago, “Scalable Analysis and Design of Ad Hoc Networks via Ran-dom Graph Theory”, 6th ACM International Workshop on DiscreteAlgorithms and Methods for Mobile Computing and Communications,(DIAL-M’02), Atlanta, GA, Sep. 28, 2002, pp. 43-50.

125. A Farago, “Network Level Capacity Planning with Efficiently Com-putable Global Optimum” 10th IEEE International Symposium on Mod-eling, Analysis and Simulation of Computer and Telecommunication

14

Systems (MASCOTS’02), Forth Worth, Texas, Oct 11-16, 2002, pp.229-236.

126. A. Farago, “Quick Estimation of Blocking and Utilization for Com-plex Traffic Flows”, 9th International Conference on Telecommunica-tion Systems Modeling and Analysis, Dallas, Texas, March 15–18, 2001,pp. 412–420.

127. A. Farago, “A General Method for the Blocking Analysis of Networkswith Dependent Links”, 2001 IEEE Workshop on High PerformanceSwitching and Routing, Dallas, Texas, May 29–31, 2001, pp. 124–129.

128. A. Farago and V. R. Syrotiuk. “Algorithmic Problems in Power Con-trolled Ad Hoc Networks,” Proceedings of the 14th International Con-ference on Parallel and Distributed Computing Systems (PDCS 2001),Dallas, Texas, August 8–10, 2001.

129. A. Farago and V. R. Syrotiuk. “MERIT: A Unified Framework forRouting Protocol Assessment in Mobile Ad Hoc Networks,” Proceedingsof the 7th Annual International Conference on Mobile Computing andNetworking (Mobicom 2001), Rome, Italy, July 16–21, 2001.

130. A. Farago, “A Method to Handle Dependent Events in Network Per-formance and Reliability Evaluation”, 9th IFIP Working Conferenceon Performance Modelling and Evaluation of ATM and IP Networks,Budapest, Hungary, June 27–29, 2001, pp. 299–305.

131. I. Chlamtac, A. Farago, A.D. Myers, V.R. Syrotiuk, and G. Zaruba. “APerformance Comparison of Hybrid and Conventional MAC Protocolsfor Wireless Networks,” Proceedings of the 51st IEEE InternationalVehicular Technology Conference (VTC’2000), Tokyo, Japan, May 15–18, 2000.

132. A. Farago, A.D. Myers, V.R. Syrotiuk, and G. Zaruba. “A New Ap-proach to MAC Protocol Optimization,” Proceedings of the IEEE GlobalCommunications Conference (Globecom’2000), San Francisco, Califor-nia, November 29–December 1, 2000.

133. A. Farago, “Blocking Probability Estimation for General Traffic UnderIncomplete Information”, IEEE International Conf. on Communica-tions (ICC’2000).

15

134. I. Chlamtac, A. Farago, A.D. Myers V.R. Syrotiuk and G. Zaruba,“ADAPT to Mobility” IEEE Global Telecommunications Conference(GLOBECOM’99), Rio de Janeiro, Brazil, December 1999.

135. S. Basagni, I. Chlamtac, A. Farago, V.R. Syrotiuk, and R. Talebi,“Route Selection in Mobile Multimedia Ad Hoc Networks”, Sixth IEEEInternational Workshop on Mobile Multimedia Communications, (MO-MUC’99), San Diego, CA, November 15-17, 1999.

136. A. Farago, I. Chlamtac and S. Basagni, “Virtual Path Network Topol-ogy Optimization Using Random Graphs”, IEEE INFOCOM’99, NewYork, NY, March 1999, pp. 491-496.

137. H. Zhang, I,. Chlamtac and A. Farago, “Efficient Load Balancing forUBR Traffic in ATM Networks”, IEEE International Conf. on Com-munications (ICC’99), Vancouver, Canada, June 1999.

138. A. Farago, T. Cinkler, S. Racz, A. Magi, G. Gordos, A. Horvath andP. Laborczi, “Virtual Path Layout Design”, 8th International Telecom.Network Planning Symp. (NETWORKS’98), Sorrento, Italy, October1998, pp. 581-585.

139. A. Farago, A Szentesi and B. Szviatovszki, “Allocation of Administra-tive Weights in PNNI”, 8th International Telecom. Network PlanningSymp. (NETWORKS’98), Sorrento, Italy, October 1998, pp. 621-626.

140. H. Zhang, I. Chlamtac, A. Farago, “Performance Analysis of Time-Spread Multiple Access (TSMA) Protocol in Multihop Wireless Net-works”, IEEE International Performance, Computing and Communica-tions Conference, Tempe/Phoenix, AZ, USA; Feb. 1998, pp. 402-408.

141. J. Bıro, A. Farago and T. Tron, “A Linear Programming Neural CircuitModel”, Polish-Czech-Hungarian Workshop on Circuit Theory, SignalProcessing and Applications, Budapest, Hungary, Sept. 3-7, 1997, pp.40-45.

142. P. Bahl, I. Chlamtac and A. Farago, “Optimizing Resource Utilizationin Wireless Multimedia Networks”, IEEE International Conference onCommunications (ICC’97), Montreal, Quebec, Canada, June 1997, pp.1432-37.

16

143. S. Basagni, I. Chlamtac and A. Farago, “A Generalized Clustering Al-gorithm for Peer-to-Peer Networks”, Workshop on Algorithmic Aspectsof Communications, Bologna, Italy, July, 1997.

144. T. Cinkler, L. Ast, A. Farago and T. Henk, “Configuration of the ATM-Layer over Optical Networks”, 5th International Conf. on Telecommu-nication Systems Modeling and Analysis, Nashville, TN, USA, March20-23, 1997.

145. I. Chlamtac, A. Farago and H. Zhang, “A Generalized TSMA Protocolwith Service Guarantees in Mobile Multihop Networks”, IFIP Confer-ence on Personal Wireless Communications (PWC’96), Frankfurt amMain, Germany, Dec. 1996.

146. A. Farago T. Cinkler, H. Vuthanh and Sz. Malomsoky, “Joint Plan-ning of the Physical and Logical Configuration of ATM Networks”NETWORKS’96 International Network Planning Symposium, Sydney,Australia, Nov. 24-29, 1996, pp. 119-124.

147. I. Chlamtac, A. Farago, T. Henk and G. Gordos, ”Optimizing Band-width Allocation in Cellular Networks with Multirate Traffic”, IEEEGlobal Telecommunications Conference (GLOBECOM’96), Nov. 18-22, 1996, London, U.K., pp. 1126-1130.

148. J. Bıro, A. Farago , T. Tron and M. Boda, “Neural Networks for Log-ical Partitioning of ATM Networks” IEEE Global TelecommunicationsConference (GLOBECOM’96), Nov. 18-22, 1996, London, U.K., pp.745-749.

149. I. Chlamtac, A. Farago and H. Zhang, ”A New Criterion for RouteSelection in Communication Networks with Delay Sensitive Traffic”,International Conf. on Computer Communication and Networks (IC-CCN’96), Rockville, Maryland, Oct. 1996, pp. 317-320.

150. I. Chlamtac, A. Farago and T. Zhang, ”Efficient Routing of Light-paths”, MILCOM’96, IEEE Conference on Military Communications,McLean, Virginia, October, 1996.

151. I. Chlamtac, A. Farago and H. Zhang, ”A Fundamental RelationshipBetween Fairness and Optimum Throughput in TDMA Protocols”,

17

IEEE International Conference on Universal Personal Communica-tions (ICUPC’96), Cambridge, MA, Sep. 1996. pp. 671-675.

152. A. Farago, S. Blaabjerg, W. Holender, B. Stavenow, T. Henk, L. Astand S. Szekely, “Enhancing ATM Network Performance by Optimizingthe Virtual Network Configuration”, IFIP Conference on Performanceof Communnication Systems (PCN’95) , Istanbul, Oct 1995, publishedin: S. Fdida and R.O. Onvural (eds.), Data Communications and theirPerformance, Chapman & Hall; London, 1996, pp. 401-414.

153. Zs. Haraszti, I. Dahlquist, A. Farago and T. Henk, “PLASMA - AnIntegrated Tool for ATM Network Operation”, International SwitchingSymposium (ISS’95), Berlin, Germany, 1995, pp. 314-318.

154. A. Farago: Virtual Networking − A New Era in Network Management,International Conference on Effective Network Management Systems,paper # 2, London, May 1995.

155. A. Farago, S. Blaabjerg, M. Boda, G. Gordos, Zs. Haraszti and T.Henk, “Virtual Networking and Real-Time Dimensioning – A ParadigmShift in Network Management”, TELECOM’95, Geneva, Switzerland,1995.

156. A. Farago, M. Boda, H. Brandt, T. Henk, T. Tron, J. Bıro, “VirtualLookahead – A New Approach to Train Neural Nets for Solving On-LineDecision Problems”, IEEE Interantional Workshop on the Applicationof Neural Networks to Telecommunications, Stockholm, May 1995, pp.265-272.

157. J. Bıro, Z. Koronkai, H. Brandt, A. Farago , T. Henk and T. Tron, “Ef-ficient Extensions of Nonlinear Programming Neural Networks”, Inter-national Conference on Artificial Neural Networks (ICANN’95), Paris,1995, vol. 2, pp. 407-411.

158. A. Farago, S. Blaabjerg, W. Holender, T. Henk, A. Szentesi, and Z.Ziaja, “Resource Separation - an Efficient Tool for Optimizing ATMNetwork Configuration”, NETWORKS’94 International Network Plan-ning Symposium, Budapest, Hungary, Sept. 1994, pp. 83-88.

18

159. A. Farago, “VP Networks Designed as Network Infrastructure”, In:COST 242 Interim Report (published by European Cooperation in theField of Science and Technology), 1994, pp. 96-98.

160. I. Chlamtac, A. Farago and T. Zhang, “How to Establish and UtilizeVirtual Paths in ATM Networks”, IEEE International Conference onCommunications (ICC’93), Geneva, Switzerland, May 1993, pp. 1368-1372.

161. A. Farago, “A Neural Structure as a Tool for Optimizing Routing andResource Management in ATM Networks”, Electronic Proceedings ofthe International Conference on the Application of Neural Networks inTelecommunications, Princeton, N.J., Oct 1993.

162. I. Chlamtac and A. Farago, “An Optimal CDMA Channel Access Pro-tocol”, IEEE International Conference on Communications (ICC’93),Geneva, Switzerland, May 1993, pp. 133-136.

163. I. Chlamtac and A. Farago, “Making Transmission Schedules Immuneto Topology Changes in Multi-Hop Packet Radio Networks”, IEEE In-ternational Conference on Communications (ICC’93), Geneva, Switzer-land, May 1993. pp. 1854-1858.

164. A. Farago and G. Lugosi, “Strong Universal Consistency of NeuralNetwork Classifiers”, IEEE International Symposium on InformationTheory, San Antonio, Texas, January, 1993, p. 431.

165. A. Farago, I. Chlamtac and H.Y. Ahn, “Nearly Optimum Scheduling inMobile CDMA Packet Radio Networks”, MILCOM’92, IEEE Confer-ence on Military Communications, San Diego, California, Oct. 1992,pp. 769-773.

166. A. Farago, “On the Intersection of Independence Systems”, Interna-tional Conference on Sets, Graphs and Numbers, Budapest, Hungary,1991, pp. 265-272.

167. G. Lugosi and A. Farago, “A Parameter Estimation Algorithm forSpeech Recognition to Maximize State Optimized Joint Likelihood”,IEEE International Symp. on Information Theory, San Diego, Califor-nia, 1990, p. 161.

19

168. A. Farago, G. Gordos and G. Lugosi, “Methods for Decreasing theResponse Time in Isolated Word Speech Recognition”, Speech ResearchInternational Conference, Budapest, Hungary, 1989, pp. 255-258.

169. A. Farago and G. Lugosi, “Hidden Markov Processes and their Appli-cation in Modelling Signals with Time-Varying Properties”, Conferenceof Program Designers, Eotvos Lorand University, Budapest, Hungary,1988, pp. 243-248.

170. G. Lugosi and A. Farago, “An Optimal Algorithm for an AutomaticSpeech Recognition and Segmentation Model”, In: Digitale Sprachver-arbeitung - Prinzipien und Anwendungen, Vortrage der ITG-Fachtagung,Bad Neuheim, Germany, 1988; VDE-Verlag, Berlin 1988, pp. 159-164.

171. A. Farago, G. Gordos, I. Koutny, G. Magyar and L. Osvath, “VER-BIDENT: an Isolated Word Recognizer”, 9th International Conferenceon Acoustics, Budapest, Hungary, 1988, pp. 115-119.

172. A. Farago, “F-Independence Number of Graphs”, 7th Hungarian Conf.on Combinatorics, Finite and Infinite Sets, Eger, Hungary, 1987, pp.221-226.

173. A. Farago, “On a Combinatorial Clustering Problem”, Conf. of Pro-gram Designers, Eotvos Lorand University, Budapest, 1986, pp. 101-104.

174. A. Farago, “Algorithmic Problems in Graph Theory”, Conf. of ProgramDesigners, Eotvos Lorand University, Budapest, 1985, pp. 61-66.

PATENTS

175. A. Farago and V.R. Syrotiuk, “Method and Device for Communicat-ing Data within a Network by Combining Different CommunicationApproaches”, U.S. Patent # 7,159,027, January 2, 2007.

176. W. Holender, T. Henk, S. Blaabjerg, A. Farago and B. Stavenow, “AMethod and Device for Partitioning Physical Network Resources”, USPatent 6,104,699, Aug 15, 2000.

20

177. W. Holender, T. Henk, S. Blaabjerg, A. Farago and B. Stavenow,“Enhancement of Network Operation and Performance”, U.S. Patent6,069,894, May 30, 2000.

178. M. Boda, T. Szecsy, S. Blaabjerg, J. Biro, J. Vass, T. Tron and A.Farago, “Device and Method for Determining a Distribution of Re-sources of a Physical Network” US Patent 5,687,292, Nov 11, 1997.

179. W. Holender, T. Henk, S. Blaabjerg, A. Farago and B. Stavenow,“A Method and Device for Partitioning Physical Network Resources”,Swedish Patent, June 12, 1995, PCT/SE/95/00703.

180. W. Holender, T. Henk, S. Blaabjerg, A. Farago and B. Stavenow, “En-hancement of Network Operation and Performance”, Swedish Patent,June 12, 1995, PCT/SE/95/00704.

181. M. Boda, T. Szecsy, S. Blaabjerg, J. Bıro, J. Vass, T. Tron and A.Farago, “A Device and Method for Distributing Resources of a PhysicalNetwork”, Swedish Patent, March 8, 1995, PCT/SE/95/00838.

182. A. Farago, G. Gordos, G. Magyar, G. Nemeth, L. Osvath, P. Tataiand Gy. Szilvasi, “Method and Implementation for the Recognition ofSound from a Known Source”, Hungarian Patent, #207899, Dec 21,1989 (6726/1989).

TECHNICAL REPORTS

183. Z. Chen and A. Farago, “An Effective Approach for Web Forum TopicDetection, ” Technical Report UTDCS-06-13, Dept. of Computer Sci-ence, The University of Texas at Dallas, March 2013.

184. Z. Chen and A. Farago, “On the Relationship Between Hyperlinks andTextual Similarity,” Technical Report UTDCS-07-13, Dept. of Com-puter Science, The University of Texas at Dallas, March 2013.

185. A. Farago, “All-Pairs Distances of Points Via Linear Number of Dis-tance Computations in Normed Spaces,” Technical Report UTDCS-17-13, Dept. of Computer Science, The University of Texas at Dallas,October 2013.

21

186. H. Lian and A. Farago, “Optimizing Virtual Private Network De-sign Using a New Heuristic Optimization Method,” Technical ReportUTDCS-07-12, Dept. of Computer Science, The University of Texas atDallas, April 2012.

187. A. Farago, “Random Network Topology Models with Perturbations,”Technical Report UTDCS-08-12, Dept. of Computer Science, The Uni-versity of Texas at Dallas, April 2012.

188. A. Farago, “Network Reliability Analysis with Unreliable Information,”Technical Report UTDCS-22-12, Dept. of Computer Science, The Uni-versity of Texas at Dallas, Nov. 2012.

189. A. Farago, “Low Distortion Metric Embeddings Into Constant Dimen-sion”, Technical Report UTDCS-05-11, Dept. of Computer Science,The University of Texas at Dallas, Jan. 2011.

190. Z. Cheng, K. Zhang, and A. Farago, “Exploring Structural PropertiesOf Web Graphs through 3D Visualization”, Technical Report UTDCS-17-11, Dept. of Computer Science, The University of Texas at Dallas,May 2011.

191. A. Farago, “Handling Deviations in Network Models”, Technical Re-port UTDCS-21-11, Dept. of Computer Science, The University ofTexas at Dallas, July 2011.

192. Hongbing Lian and A. Farago, “A Model for Cognitive Radio Net-works”, Technical Report UTDCS-32-11, Dept. of Computer Science,The University of Texas at Dallas, Nov. 2011.

193. Hongbing Lian and A. Farago, “A Heuristic Optimization Methodand Its Application in Cognitive Radio Networks”, Technical ReportUTDCS-39-11, Dept. of Computer Science, The University of Texas atDallas, Dec. 2011.

194. D.T. Tran and A. Farago, “Noncooperative Game Theory in WirelessNetworks”, Technical Report UTDCS-15-09, Dept. of Computer Sci-ence, The University of Texas at Dallas, June 2010.

22

195. D.T. Tran and A. Farago, “On Selfish Behavior in TDMA-based Band-width Allocation Protocols”, Technical Report UTDCS-16-10, Dept. ofComputer Science, The University of Texas at Dallas, June 2010.

196. D.T. Tran and A. Farago, “Game Theoretic Approach to Network Life-time Maximization in Wireless Networks”, Technical Report UTDCS-17-10, Dept. of Computer Science, The University of Texas at Dallas,June 2010.

197. A. Farago and S. Basagni, “Physical Models vs. Graph Models Of Wire-less Networks Topologies”, Technical Report UTDCS-27-09, Dept. ofComputer Science, The University of Texas at Dallas, Aug 2009.

198. A. Farago, “Local vs. Global Scalability in Ad Hoc and Sensor Net-works”, Technical Report UTDCS-10-09, Dept. of Computer Science,The University of Texas at Dallas, May 2009.

199. A. Farago, “On Disjoint Connecting Paths and Unsplittable Flow”,Technical Report UTDCS-07-08, Dept. of Computer Science, The Uni-versity of Texas at Dallas, March 2008.

200. A. Farago, “Speeding Up Large Scale Distance Computations”, Techni-cal Report UTDCS-08-08, Dept. of Computer Science, The Universityof Texas at Dallas, March 2008.

201. C. Wang, M.A. Park, J. Willson A. Farago, D.Z. Du, “Fault -TolerantDual Power Management In Wireless Sensor Networks”, Technical Re-port UTDCS-09-08, Dept. of Computer Science, The University ofTexas at Dallas, March 2008.

202. A. Farago and S. Basagni, “The Effect of Multi-Radio Nodes on Net-work Connectivity - A Graph Theoretic Analysis”, Technical ReportUTDCS-10-08, Dept. of Computer Science, The University of Texas atDallas, April 2008.

203. A. Farago “On the Descriptional Complexity of Path Andras Optimiza-tion in Graphs”, Technical Report UTDCS-11-08, Dept. of ComputerScience, The University of Texas at Dallas, April 2008.

204. A. Farago, D.T. Tran and S. Basagni, “Improving Fault Tolerance viaMulti- Radio Nodes - A Graph Theoretic Analysis”, Technical Report

23

UTDCS-27-08, Dept. of Computer Science, The University of Texas atDallas, September 2008.

205. A. Farago, “Scalability of Node Degrees in Random Wireless NetworkTopologies”, Technical Report UTDCS-28-08, Dept. of Computer Sci-ence, The University of Texas at Dallas, September 2008.

206. A. Farago, “Sampling from Independence Systems”, Technical ReportUTDCS-10-07, Dept. of Computer Science, The University of Texas atDallas, Feb 2007.

207. A. Farago, “Methods for Handling Non-Markovian Performance Mod-els”, Technical Report UTDCS-11-07, Dept. of Computer Science, TheUniversity of Texas at Dallas, Feb 2007.

208. M. Park, W. Chen. J.K.V. Wilson, W. Wu and A. Farago, “FaultTolerant Dual Power Assignment in Wireless Sensor Networks”, Dept.of Computer Science, The University of Texas at Dallas, TechnicalReport UTDCS-52-06, Oct 2006.

209. M. Park, W. Chen. J.K.V. Wilson, M.T. Thai, W. Wu and A. Farago,“A Dominating and Absorbent Set in Wireless Ad Hoc Networks withDifferent Transmission Range”, Dept. of Computer Science, The Uni-versity of Texas at Dallas, Technical Report UTDCS-53-06, Oct 2006.

210. N. Meghanathan and A. Farago, ”An Efficient Algorithm for the Opti-mal Number of Route Transitions in Mobile Ad Hoc Networks”, Dept.of Computer Science, The University of Texas at Dallas, Technical Re-port UTDCS-02-05.

211. N. Meghanathan and A. Farago, ”Extension of the Algorithm for Opti-mal Number of path Transitions to Steiner Trees and Connected Dom-inating Sets”, Dept. of Computer Science, The University of Texas atDallas, Technical Report UTDCS-03-05.

212. N. Meghanathan and A. Farago, ”Comparison of Routing Strategies forMinimizing Energy Consumption in Mobile Ad Hoc Networks”, Dept.of Computer Science, The University of Texas at Dallas, TechnicalReport UTDCS-04-05.

24

213. N. Meghanathan and A. Farago, ”Survey on Multicast Routing Proto-cols for Mobile Ad Hoc Networks”, Dept. of Computer Science, TheUniversity of Texas at Dallas, Technical Report UTDCS-08-05.

214. N. Meghanathan and A. Farago, “Stability - Delay Analysis in MobileAd Hoc Networks”, Technical Report UTDCS-10-04, Dept. of Com-puter Science, University of Texas at Dallas, March 2004.

215. N. Meghanathan and A. Farago, “Maximizing Network Lifetime underFixed Energy Budget in Ad Hoc Networks,” Technical Report UTDCS-21-04, Dept. of Computer Science, University of Texas at Dallas, July2004

216. N. Meghanathan and A. Farago, “Power Sensitive Power Control in AdHoc Networks,” Technical Report UTDCS-35-04, Dept. of ComputerScience, University of Texas at Dallas, September 2004.

217. N. Meghanathan and A. Farago, “Survey and Taxonomy of 55 UnicastRouting Protocols for Mobile Ad Hoc Networks,” Technical ReportUTDCS-40-04, Dept. of Computer Science, University of Texas atDallas, November 2004.

218. N. Meghanathan and A. Farago, “On the Route Refresh Frequencyfor On-demand Maximum Battery Life Routing in Ad Hoc Networks,”Technical Report UTDCS-45-04, Dept. of Computer Science, Univer-sity of Texas at Dallas, December 2004.

219. A. Farago, F. Unghvary and A. Fumagalli, ”Towards the Unified En-gineering of Traffic and Reliability”, Technical Report UTDCS-34-02,Dept. of Comp. Sci., The Univ. of Texas at Dallas, Dec, 2002.

220. A. Farago, “A Counterexample to the Tang-Zhou Maximum CliqueAlgorithm”, Technical Report, Dept. of Comp. Sci., Univ. of Texas atDallas, UTDCS-11-01, Jan. 2001.

221. A. Farago and V. R. Syrotiuk, “MERIT: A Unified Framework forRouting Protocol Assessment in Mobile Ad Hoc Networks,” TechnicalReport, Dept. of Comp. Sci., Univ. of Texas at Dallas, UTDCS-05-01,Jan. 2001.

25

222. A. Farago and V. R. Syrotiuk, “Transport Layer Routing Assessmentin Mobile Ad Hoc Networks”, Technical Report, Dept. of Comp. Sci.,Univ. of Texas at Dallas, UTDCS-19-01, Aug. 2001.

223. A Farago, “Analysis of Multiservice Loss Networks with Arbitrary LinkDependencies”, Technical Report UTDCS-09-00, Dept. of ComputerScience, UTD, July 2000.

224. A Farago, “Almost Surely Almost Exact Optimization in RandomGraphs” Technical Report UTDCS-10-00, Dept. of Computer Science,UTD, Oct. 2000.

225. I. Chlamtac, A. Farago, T. Zhang, “Optimizing the System of VirtualPaths in ATM Network Architecture”, COST 242 Project Document,No. TD(93)25, (European Cooperation in the Field of Science andTechnology), 1993.

226. I. Chlamtac, A. Farago, H.Y. Ahn, “A Nearly Optimum Slot AllocationAlgorithm for TDMA Protocols in Case of Multiple Reception Capac-ity”, Technical Report TR-93-CSE-29, Dept. of Electrical & ComputerEng., Univ. of Massachusetts, Amherst, 1993.

227. I. Chlamtac, A. Farago, “Bounded Delay Packet Routing in Large Mul-tihop Communication Networks”, Tech. Report TR-93-CSE-26, Dept.of Electr. & Comp. Eng., Univ. of Massachusetts, Amherst., 1993.

228. I. Chlamtac, A. Farago, H.Y. Ahn, “Topology Transparent Schedulesfor Packet Radio Networks”, Technical Report TR-93-CSE-28, Dept.of Electr. & Comp. Eng., Univ. of Massachusetts, Amherst, 1993.

229. I. Chlamtac, A. Farago, “Mobility and Multimedia: Towards MobileISDN Services Based on Packet Radio Networks”, Technical ReportTR-93-CSE-27, Dept. of Electr. & Comp. Eng., Univ. of Mas-sachusetts, Amherst, 1993.

230. I. Chlamtac, A. Farago and T. Zhang, “How to Establish and UtilizeVirtual paths in ATM Netwokrs”, Tech. Report TR-93-CSE-24, Dept.of Electr. & Comp. Eng., Univ. of Massachusetts, Amherst, 1993.

26

231. A. Farago, “Mathematical Formulation Possibilities of the ATM Net-work Dimensioning and Flow Assignment Problem”, Dept. of Telecom.& Telematics, Technical Univ. of Budapest, Hungary, 1993.

232. G. Gordos, A. Farago, “Overview of Routing Algorithms”, Dept. ofTelecom. & Telematics, Technical Univ. of Budapest, Hungary, 1993.

233. G. Gordos, A. Farago, “A Layered Conceptual Model to Support ATMNetwork Dimensioning and Routing”, Dept. of Telecom. & Telematics,Technical Univ. of Budapest, Hungary, 1994.

234. A. Farago, “Extension of Objective Functions from Link Level to Net-work Level in ATM Network Dimensioning”, Dept. of Telecom. &Telematics, Technical Univ. of Budapest, Hungary, 1994.

235. G. Gordos, A. Farago, “Description of Network State for Dimensioningand Routing Purposes”, Dept. of Telecom. & Telematics, TechnicalUniv. of Budapest, Hungary, 1994.

236. A. Farago, “Detailed Mathematical Formulation of the ATM Dimen-sioning Model”, Dept. of Telecom. & Telematics, Technical Univ. ofBudapest, Hungary, 1994.

237. A. Farago, “An Improved Hoeffding-type Bound on Link BlockingProbability”, Dept. of Telecom. & Telematics, Technical Univ. ofBudapest, Hungary, 1994.

238. A. Farago, “Capacity Partitioning in ATM Networks Using the ErlangFixed Point Approximation”, Dept. of Telecom. & Telematics, Tech-nical Univ. of Budapest, Hungary, 1994.

239. A. Farago, “A Simplified Dimensioning Model Based on EquivalentLink Blocking Probabilities”, Dept. of Telecom. & Telematics, Tech-nical Univ. of Budapest, Hungary, 1994.

240. A. Farago, “Comparison of Network Partitioning Algorithms”, Dept.of Telecom. & Telematics, Tech. Univ. of Budapest, Hungary, 1994.

241. A. Farago, “Introducing Revenue and Load Sharing in the Fixed PointModel”, Dept. of Telecom. & Telematics, Technical Univ. of Budapest,Hungary, 1994.

27

242. A. Farago, S. Blaabjerg, W. Holender, T. Henk, L. Ast, A. Szentesi andZs. Ziaja, “Optimal Partitioning of ATM Networks into Virtual Sub-networks”, COST 242 Project Document, No. TD(94)24, (EuropeanCooperation in the Field of Science and Technology), 1994.

Further 25 reports in Hungarian, detailed list is omitted.

28