Modelling and Mining of Network Information Spaces    
Homepage Research Members Students Seminars  
  Publications Events Links Partners  
 

Publications (2001-2009)

    Articles in refereed publications (2009)

  1. W. Aiello, A. Bonato, C. Cooper, J. Janssen, P. Pralat, A spatial web graph model with local influence regions, Internet Mathematics 5 (2009) 175-196.

  2. R. Alshammari, P. Lichodzijewski, M.I. Heywood, A.N. Zincir-Heywood, Classifying SSH encrypted traffic with minimum packet header features using genetic programming, In: Proceedings of Defense applications of computational intelligence workshop. Genetic and Evolutionary Computation Conference.

  3. R. Alshammari, A.N. Zincir-Heywood, Machine learning based encrypted traffic classification: identifying SSH and Skype, In: Proceedings of the IEEE Symposium on Computational Intelligence for Security and Defense Applications, 2009.

  4. R. Alshammari, A.N. Zincir-Heywood, Generalization of signatures for SSH encrypted traffic identification, In: Proceedings of the IEEE Symposium on Computational Intelligence on Cyber Security, 2009.

  5. R. Alshammari, A.N. Zincir-Heywood, A. Farrag, Performance comparison of four rule sets: an example for encrypted traffic classification, In: Proceedings of the IEEE Conference on Privacy, Security and Trust, 2009.

  6. C. Bacquet, A. N. Zincir-Heywood, M. I. Heywood, An investigation of multi-objective genetic algorithms for encrypted traffic identification, In: Proceedings of the International Workshop on Computational Intelligence in Security for Information Systems, Springer Advances on Soft Computing series, 2009.

  7. S. Batsakis, E.G.M. Petrakis, E. Milios, Improving the performance of focused web crawlers, Data and Knowledge Engineering, 68 No. 10 (2009) 1001-1013.

  8. A. Bonato, N. Hadi, P. Horn, P. Pralat, C. Wang, Dynamic models of on-line social networks, Proceedings of WAW'09, 2009.

  9. A. Bonato, J. Janssen, C. Wang, The n-ordered graphs - a new graph class, Journal of Graph Theory 60 (2009) 204-218.

  10. A. Bonato, J. Janssen, Infinite limits and adjacency properties of a generalized copying model, Internet Mathematics 4 (2009) 199-223.

  11. A. Bonato, P. Pralat, C. Wang, Pursuit-evasion in models of complex networks, Internet Mathematics 4 (2009) 419-436.

  12. N.E. Clarke, S. Finbow, S.L. Fitzpatrick, M.E. Messenger, R.J. Nowakowski, Seepage in directed acyclic graphs. Australas. J. Combin. 43 (2009) 91-102.

  13. R. Curry, M.I. Heywood One-class genetic programming, In: Proceedings of the European Conference on Genetic Programming.

  14. J. Doucette, P. Lichodzijewski, M.I. Heywood, Evolving coevolutionary classifiers under large attribute spaces, In: Genetic Programming: Theory and Practice VII.

  15. S. Gaspers, M.E. Messinger, R. Nowakowski, P. Pralat, Clean the graph before you draw it!, Information Processing Letters. 109 (2009), 463-467.

  16. H.G. Kayacik, A.N. Zincir-Heywood, M.I. Heywood, S. Burschka, Generating mimicry attacks using genetic programming: a benchmarking study, In: Proceedings of IEEE Computational Intelligence in Cyber Security.

  17. H.G. Kayacik, M.I. Heywood, A.N. Zincir-Heywood, S. Burshka, Testing detector parameterization using evolutionary exploit generation, In: Proceedings of the European Workshop on Evolutionary Computation in Communications, Networks and Connected Systems.

  18. H.G. Kayacik, A.N. Zincir-Heywood, M. I. Heywood, S. Burshka, Optimizing anomaly detector deployment under evolutionary black-box vulnerability testing, In: Proceedings of the IEEE Symposium of Computational Intelligence in Security and Defense Applications.

  19. P. LaRoche, A.N. Zincir-Heywood, M.I. Heywood, Evolving TCP/IP packets: a case study of port scans, In: Proceedings of the IEEE Symposium on Computational Intelligence for Security and Defense Applications, 2009 .

  20. H.C. Lee, A. Borodin, Cluster based personalized search, In: Proceedings of WAW'09.

  21. P. Lichodzijewski, M.I. Heywood, Binary versus real-valued reward functions under coevolutionary reinforcement learning, In: Proceedings of the European Conference on Artificial Evolution.

  22. M. Lipczak, Y. Hu, Y. Kollet, E. Milios, Tag sources for recommendation in collaborative tagging systems, In: Proceedings of the ECML/PKDD 2009 Discovery Challenge Workshop, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases. First place in vcontent-based" recommendation task, third place in "graph-based" recommendation task and first place in "online" recommendation task.

  23. M. Lipczak, E. Milios, Agglomerative genetic algorithm for clustering in social networks, In: Proceedings of the The ACM Genetic and Evolutionary Computation Conference (GECCO-2009), July 8-12, 2009, Montreal.

  24. A. Makanju, A.N. Zincir-Heywood, E. Milios, Extracting message types from BlueGene/Ls logs, In: Proceedings of the ACM / Usenix Workshop on the Analysis of System Logs, 2009.

  25. A. Makanju, A.N. Zincir-Heywood, E. Milios, Clustering of event logs using iterative partitioning, In: Proceedings of the ACM SIGKDD international conference on Knowledge discovery and data mining, 2009.

  26. M.E. Messinger R.J. Nowakowski, The robot cleans up (extended abstract), In: Proceedings of COCOA'08, 2009.

  27. M.E. Messinger, R.J. Nowakowski, The Robot Cleans Up, J. Combin. Optimization 18 (2009) 350-361.

  28. P. Pralat, Cleaning random graphs with brushes, Australasian Journal of Combinatorics 43 (2009) 237-251.

  29. P. Pralat, N. Wormald, Growing protean graphs, Internet Mathematics 4 (2009) 1-16.

  30. X. Wan, E. Milios, N. Kalyaniwalla: Link-based event detection in email communication networks, Proceedings of the 24th Annual ACM Symposium on Applied Computing, March 8 - 12, 2009, Honolulu, Hawaii, USA.

  31. X. Wan, E. Milios, N. Kalyaniwalla, J. Janssen: Link-based anomaly detection in communication networks, Proceedings of the 2008 IEEE/WIC/ACM International Workshop on Computational Social Networks (IWSCN 2008), Dec 9-12, 2008, Sydney, Australia.

    Articles accepted in refereed publications (2009)

  32. R. Angelova, M. Lipczak, E. Milios, P. Pralat, Investigating the properties of a social bookmarking and tagging network, accepted to International Journal of Data Warehousing and Mining.

  33. S. Gaspers, M.E. Messinger, R. Nowakowski, P. Pralat, Parallel cleaning of a network, accepted to Disc. Applied Math..

  34. J. Janssen, P. Pralat, R. Wilson, Estimating node similarity from co-citation in a spatial graph model, In: Proceedings of 2010 ACM Symposium on Applied Computing--Special Track on Self-organizing Complex Systems.

  35. J. Janssen, P. Pralat, Rank-based attachment leads to power law graphs, accepted to SIAM Journal on Discrete Mathematics.

    Non-Refereed Contributions (2009)

  36. C. Bouveyron, H. Chipman, E. Come, Supervised Classification and Visualization of Social Networks Based on a Probabilistic Latent Space Model, Refereed poster in 7th International Workshop on Mining and Learning with Graphs

  37. N. Hadi, Models of on-line social networks, Master's Thesis, Wilfrid Laurier University, 2009.

  38. S. Henderson, Revenue maximization in ad slot auctions, Master's Thesis, University of Toronto, 2009.

  39. H. G. Kayacik, Can the best defense be a good offense? Evolving (mimicry) attacks for detector vulnerability testing under a 'black-box' assumption, PhD Thesis, Dalhousie University, 2009.

  40. M. Mahdi Shafiei, Leveraging structural information for statistical topic models of text, PhD thesis, Dalhousie University, August 2009.

  41. R. Wilson, Properties of the spatial preferential attachment model, Master's Thesis, Dalhousie University, 2009.

    Monographs and books (2008)

  42. A. Bonato, A Course on the Web Graph, AMS Graduate Mathematics Series and AARMS Monograph Series, 2008.

    Articles in refereed publications (2008)

  43. N. Alon, P. Pralat, N. Wormald, Cleaning regular graphs with brushes, SIAM Journal on Discrete Mathematics 23 (2008) 233-250.

  44. E. Baratis, E.G.M. Petrakis, E. Milios, Automatic Web Site Summarization by Image Content: A Case Study with Logo and Trademark Images, IEEE Transactions on Knowledge and Data Engineering 20 (2008) 1195-1204.

  45. P. Lichodzijewski , M.I. Heywood, Coevolutionary bid-based Genetic Programming for problem decomposition in classification, Genetic Programming and Evolvable Machines, 9 Springer-Verlag, pp 331-365, 2008.

  46. M.E. Messinger, R. Nowakowski, P. Pralat, Cleaning a network with brushes, Theoretical Computer Science 399 (2008) 191-205.

  47. P. Pralat, A note on the diameter of protean graphs, Discrete Mathematics 308 (2008) 3399-3406.

    Articles in refereed conference proceedings (2008)

  48. R. Alshammari, A.N. Zincir-Heywood, Preliminary Performance Comparison of Two Feature Sets for Encrypted Traffic Classification, In: IEEE Computational Intelligence in Security for Information Systems, October 2008.

  49. R. Alshammari, A.N. Zincir-Heywood, Investigating Two Different Approaches for Encrypted Traffic Classification, In: Proceedings of IEEE Conference on Privacy, Security and Trust, 2008.

  50. R. Angelova, M. Lipczak, E. Milios, and P. Pralat, Characterizing a social bookmarking and tagging network, In: Mining Social Data (MSoDa), a Workshop of the 18th European Conference on Artificial Intelligence (ECAI 2008), 21 July 2008, University of Patras, Greece.

  51. D. Angevine, A.N. Zincir-Heywood, A Preliminary Investigation of Skype Traffic Classification Using a Minimalist Feature Set, In: Proceedings of IEEE International Workshop on Privacy and Security by means of Artificial Intelligence, in conjunction with the ARES'2008, 2008.

  52. E. Baratis, E.G.M. Petrakis, E. Milios, Automatic Web Site Summarization by Image Content: A Case Study with Logo and Trademark Images In: IEEE Transactions on Knowledge and Data Engineering.

  53. A. Bonato, D. Delic, C. Wang, Universal random semi-directed graphs, In: Proceedings of ROGICS'08.

  54. A. George, A. Makanju, E. Milios, A. Zincir-Heywood N., M. Latzel, S. Stergiopoulos, NetPal: A Dynamic Network Administration Knowledge Base, In: 18th Annual International Conference on Computer Science and Software Engineering (CASCON 2008), Oct 27-30, 2008, Richmond Hill, Ontario, Canada.

  55. A. George, A. Makanju, A.N. Zincir-Heywood, E. Milios, Information Retrieval in Network Administration, In: Proceedings of IEEE Conference on Computer Networks and Services Research (CNSR 2008), May 5-8, 2008, Halifax, Canada, pp. 561-568.

  56. H.G. Kayacik, A.N. Zincir-Heywood, Mimicry Attacks Demystified: What Can Attackers Do To Evade Detection?, In: Proceedings of IEEE Conference on Privacy, Security and Trust, 2008. Received Best Paper Award.

  57. H.C. Lee, A. Borodin, and L. Goldsmith, Extracting and Ranking Viral Communities Using Seeds and Content Similarity, in Proceedings of HT, 2008.

  58. P. Lichodzijewski, M.I. Heywood, Managing team-based problem solving with symbiotic bid-based Genetic Programming, In: Proceedings of the Genetic and Evolutionary Computation Conference, 2008.

  59. M. Lipczak, Tag Recommendation for Folksonomies Oriented towards Individual Users, In: Proceedings of the ECML/PKDD 2008 Discovery Challenge Workshop, part of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Antwerp, Belgium (system earned 2nd place).

  60. M. Lipczak, J. Blustein, E. Milios, Natural Search Pointers - a query formulation method for structured information search, In: Proceedings of the Conference on Human System Interaction, HIS'08, Krakow (Poland), May 25-27, 2008. Publisher: IEEE Computer Society Press.

  61. A. Makanju, S. Brooks, A. Nur Zincir-Heywood, E. Milios, LogView: Visualizing Event Log Clusters, In: Proceedings of the Sixth Annual Conference on Privacy, Security and Trust (PST2008) , October 1-3, 2008, Fredericton, New Brunswick, Canada.

  62. A. Makanju, A.N. Zincir-Heywood, E. Milios, Adaptability of a GP based IDS on Wireless Networks, In: Proceedings of IEEE International Conference on Availability, Reliability and Security - ARES, March 4-7, 2008, Barcelona, Spain, pp. 310-318, 2008.

  63. A. McIntyre, M.I. Heywood, Cooperative problem decomposition in Pareto competitive classifier models of coevolution, In: 11th European Conference on Genetic Programming, 2008.

  64. A. McIntyre, M.I. Heywood, Pareto cooperative-competitive Genetic Programming: A classification benchmarking study, Chapter 2 in Genetic Programming: Theory and Practice, Springer-Verlag, Volume V, pp 14-30, 2008.

  65. M.E. Messinger, R. J. Nowakowski, The robot cleans up, In: Proceedings of COCOA 2008.

  66. P. Pralat, Protean graphs with a variety of ranking schemes, In: Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA'08).

  67. M. Shafiei, E. Milios, A Statistical Model for Topic Segmentation and Clustering, In: Proceedings of the 21st Canadian Conference on Artificial Intelligence, 2008.

  68. X. Wan, E. Milios, N. Kalyaniwalla, Link-based Event Detection in Email Communication Networks, In: Proceedings of the 24th Annual ACM Symposium on Applied Computing, 2009.

  69. X. Wan, E. Milios, N. Kalyaniwalla, J. Janssen, Link-based Anomaly Detection in Communication Networks, In: IEEE/WIC/ACM International Workshop on Computational Social Networks (IWSCN 2008), 2008.

    Non-refereed publications (2008)

  70. R. Alshamarri, Automatically Classifying Encrypted Network Traffic: A Case Study of SSH, Masters Thesis, Dalhousie University, 2008.

  71. M. Hurshman, Graph Metrics and Continuity, Masters Thesis, Dalhousie University, 2008.

  72. A. MacIntyre, Novelty Detection + Coevolution = Automatic Problem Decomposition: A Framework for Scalable Genetic Programming Classifiers, PhD Thesis, Dalhousie University, November 2007.

  73. L. Samarbakhsh, Web Search Algorithms and Pagerank, Masters Thesis, Wilfrid Laurier University, May 2008.

    Monographs, books, and book chapters (2007)

  74. A. Bonato, F. Chung Graham (eds.), Proceedings of the 5th Workshop On Algorithms And Models For The Web-Graph (WAW'07), 2007.

  75. J. Janssen, P. Pralat (eds.), Proceedings of the 4th Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN'07), 2007.

    Articles in refereed publications (2007)

  76. R. Curry, P. Lichodzijewski, M.I. Heywood, Scaling genetic programming to large datasets using hierarchical dynamic subset selection, IEEE Transactions on Systems, Man and Cybernetics -- Part B: Cybernetics 37 1065-1073.

    Articles in refereed conference proceedings (2007)

  77. W. Aiello, A. Bonato, C. Cooper, J. Janssen, P. Pralat, A spatial web graph model with local influence regions, In: Proceedings of WAW07.

  78. R. Alshammari, A.N. Zincir-Heywood, A flow based approach for SSH traffic detection, In: Proceedings of the IEEE International Conference on System, Man and Cybernetics - SMC'2007.

  79. A. Bonato, P. Pralat, C. Wang, Vertex pursuit games in stochastic network models, In: Proceedings of CAAN'07.

  80. R. Dorrigiv, A. Lopez-Ortiz, P. Pralat, Search algorithms for unstructured peer-to-peer networks, In: Proceedings of the 32nd IEEE Conference on Local Computer Networks, 2007.

  81. J. Healy, J. Janssen, E. Milios, W. Aiello, Characterization of graphs using k-cores, In: Proceedings of Algorithms and Models for the Web-Graph: Fourth International Workshop, WAW 2006, Banff, Canada, Nov. 30 - Dec. 1, 2006, Proceeedings, Lecture Notes in Computer Science, LNCS-4936, Springer Verlag, 2008.

  82. H.G. Kayacik, M.I. Heywood, A.N. Zincir-Heywood, Evolving buffer overflow attacks with detector feedback, 4th European Workshop on the Application of Nature-inspired Techniques to Telecommunication Networks and other Connected Systems (EvoCOMNET'07). Lecture Notes in Computer Science.

  83. H.G. Kayacik, A.N. Zincir-Heywood, M.I. Heywood, Automatically evading IDS using GP authored attacks, IEEE Computational Intelligence for Security and Defense Applications. IEEE Press, 153-160.

  84. H.G. Kayacik, A.N. Zincir-Heywood, On the contribution of preamble to information hiding in mimicry attacks, In: Proceedings of the IEEE Symposium on Security in Networks and Distributed Systems - SSNDS'2007.

  85. M. Lemczyk, M.I. Heywood, Training binary GP classifiers efficiently: a Pareto-coevolutionary approach, 10th European Conference on Genetic Programming, EuroGP'07. M. Ebner et al. (eds), Lecture Notes in Computer Science 4445 229-240.

  86. P. Lichodzijewski, M.I. Heywood, Pareto-coevolutionary genetic programming for problem decomposition in multi-class classification Proceedings of the Genetic and Evolutionary Computation Conference, GECCO'07.

  87. M.E. Messinger, R. Nowakowski, P. Pralat, N. Wormald, Cleaning random d-regular graphs with brushes using a degree-greedy algorithm, In: Proceedings of CAAN07.

  88. X. Wan, N. Kalyaniwalla, Capturing causality in communications graphs, In: Proceedings of DIMACS/DyDAn Workshop on Computational Methods for Dynamic Interaction Networks, 2007.

  89. O. Yeloglu, A.N. Zincir-Heywood, M.I. Heywood, Growing recurrent self organizing map, accepted to Proceedings of the IEEE International Conference on System, Man and Cybernetics - SMC'2007.

    Non-refereed publications (2007)

  90. Hongyu Liu, Probabilistic Models for Focused Web Crawling, PhD thesis, Dalhousie University, July 2007.

  91. I. Nargis, Modeling and Thematic Analysis of Neighborhood Structures in the Web and Hierarchical Identification of Web Communities, Masters Thesis, Memorial University, August 2007.

  92. Ozge Yeloglu, Growing Recurrent Self-Organizing Map, Master of Computer Science Thesis, Dalhousie University, August 2007.

    Monographs, books, and book chapters (2006)

  93. W. Aiello, A. Broder, J. Janssen, E. Milios, Proceedings of the 5th Workshop On Algorithms And Models For The Web-Graph (WAW'06), 2006.

    Articles in refereed publications (2006)

  94. H. Liu, J. Janssen, E. Milios, Using HMM to learn user browsing patterns for focused web crawling, Data and Knowledge Engineering 59 (2006) 270-291.

  95. T. Luczak, P. Pralat, Protean graphs, Internet Mathematics 3 (2006), 21-40.

  96. W. Lu, J. Janssen, E. Milios, N. Japkowicz, Y. Zhang, Node similarity in the citation graph, Knowledge and Information Systems (2006) 1-25.

  97. Z. Shi, E. Milios, N. Zincir-Heywood, Post-supervised template induction for information extraction from lists and tables in dynamic web sources, Journal of Intelligent Information Systems: Integrating Artificial Intelligence and Database Technologies 22 (2005) 1-25.

    Articles in refereed conference proceedings (2006)

  98. A. Hliaoutakis, G. Varelas, E.G.M. Petrakis, E. Milios, MedSearch: A retrieval system for medical information based on semantic similarity, 10th ECDL European Conference on Research and Advanced Technology for Digital Libraries (ECDL'2006), pp. 512-515, September, 17-22, 2006. Alicante, Spain.

  99. H.G. Kayacik, M.I. Heywood , A.N. Zincir-Heywood "On evolving buffer overflow attacks using genetic programming," Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 06, ACM Press, Washington D.C., July 8-12, 2006, pp 1667-1673, ISBN 1-59593-187-2.

  100. H.G. Kayacik, A.N. Zincir-Heywood, "Using self-organizing maps to build an attack map for forensic analysis", Proceedings of the ACM PST 2006 - International Conference on Privacy, Security and Trust, October 30th, 2006 - November 1st, 2006.

  101. H.C. Lee, W.G. Gao, Y.B. Miao, Geographically focused collaborative crawling, Proc. WWW2006.

  102. M. Lemczyk, M.I. Heywood , Pareto-coevolutionary genetic programming classifier, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 6, ACM Press, Washington D.C., July 8-12, 2006, pp 945-946, ISBN 1-59593-187-2.

  103. M.R. McIntyre, M.I. Heywood , "MOGE: GP classification problem decomposition using multi-objective optimization," Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 6, ACM Press, Washington D.C., July 8-12, 2006, pp 863-870, ISBN 1-59593-187-2.

  104. X. Wan, J. Janssen, N. Kalyaniwalla, E. Milios, ``Statistical Analysis of Dynamic Graphs'', In: Network analysis in natural sciences and engineering, part of Adaptation in Artificial and Biological Systems(AISB'06) University of Bristol, Bristol, England, April 2006.

    Non-refereed publications (2006)

  105. Lee Hyun Chul, Extending Link Analysis for Novel Web Mining Applications, PhD Thesis, University of Toronto, Dept of Computer Science, Dec 2006.

  106. Ashley George, Local versus global wrapper functions in Genetic Programming, PhD thesis, Dalhousie University.

  107. Michal Lemczyk, Pareto-coevolutionary Genetic Programming Classifier, PhD thesis, Dalhousie University.

  108. C. Wang, Stochastic Models for Self-Organizing Networks and Infinite Graphs, PhD thesis, Dalhousie University.

    Articles in refereed publications (2005)

  109. A. Borodin, G. Roberts, J.S. Rosenthal, P. Tsaparas, Link Analysis Ranking: Algorithms, Experiments, and Theory, ACM Transactions on Internet Technology, volume 5, number 1, February 2005, pp. 231-297.

  110. H.G. Kayacik, A.N. Zincir-Heywood, M.I. Heywood, Intrusion Detection Systems, Encyclopaedia of Multimedia Technology and Networking, M. Pagani (ed). Idea Group Publishing, pp 494-499, 2005.

  111. D. Song, M.I. Heywood, A.N. Zincir-Heywood, Training Genetic Programming on Half a Million Patterns: An Example from Anomaly Detection, IEEE Transactions on Evolutionary Computation, 9(3), pp 225-239, June 2005.

    Articles in refereed conference proceedings (2005)

  112. A. Alekhnovich, A. Borodin, J. Buresh-Oppenheim, R. Impagliazzo, A. Magen, T. Pitassi, Towards a Model for Backtracking Algorithms (Simple Dynamic Programming Revisted), Proceedings of Computational Complexity Conference (CCC), pp 308-322, June 2005.

  113. A. Bonato, J. Janssen, Infinite limits of the duplication model and graph folding, Proceedings of the European Conference on Combinatorics, Graph Theory, and Applications, Discrete Mathematics and Theoretical Computer Science.

  114. A. Borodin, D. Cashman, A. Magen, How well can Primal-Dual and Local-Ratio algorithms perform?, Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), pp 943-955, July 2005.

  115. H.G. Kayacik, A.N. Zincir-Heywood, M.I. Heywood, Selecting Features for Intrusion Detection: A Feature Relevance Analysis on KDD 99 Benchmark, Third Annual Conference on Privacy, Security and Trust, 12-14 October 2005, pp 85-89.

  116. C. Wang, Growth deletion models for the web graph and other massive networks, Proceedings of Combinatorial and Algorithmic Aspects of Networking, 2005.

  117. L. Wetmore, A.N. Zincir-Heywood, M.I. Heywood, Training the SOFM Efficiently: An Example from Intrusion Detection, IEEE-INNS International Joint Conference on Neural Networks, July 31-August 4, 2005, pp 1575-1580.

    Articles in refereed publications (2004)

  118. Y. An, J. Janssen, E. Milios, Characterizing and Mining the Citation Graph of Computer Science, Knowledge and Information Systems 6 (2004) 664-678.

  119. S. Angelopoulos, A. Borodin, The Power of Priority Algorithms for Facility Location and Set Cover, Algorithmica, volume 40, number 4, December 2004, pp. 271-291.

  120. A. Bonato, J. Janssen, Infinite limits of copying models of the web graph, Internet Mathematics 1 (2004) 193-213.

  121. A. Borodin, R. Ostrovsky, Y. Rabani, Subquadratic Approximation Algorithms For Clustering Problems in High Dimensional Spaces, Machine Learning 56 (2004) 153-167.

  122. Y. Zhang, N. Zincir-Heywood, E. Milios, World Wide Web Site Summarization, Web Intelligence and Agent Systems: An International Journal (The Web Intelligence Consortium), 2 (2004) 39-53.

    Articles in refereed conference proceedings (2004)

  123. Y. An, J. Janssen, E. Milios, Characterizing and Mining the Citation Graph of Computer Science Literature, Knowledge and Information Systems, Volume 6, Number 4 November, 2004.

  124. A. Bonato, A survey of web graph models, Proceedings of Combinatorial and Algorithm Aspects of Networking, 2004.

  125. A. Bonato, J. Janssen, Limits and power laws of models for the web graph and other networked information spaces, Proceedings of Combinatorial and Algorithm Aspects of Networking, 2004.

  126. H. Liu, J. Janssen, E. Milios, Probabilistic Models for Focused Web Crawling, 6th ACM International Workshop on Web Information and Data Management (WIDM 2004), 2004.

  127. H. Liu, J. Janssen, E. Milios, Focused Crawling by Learning HMM from User's Topic-specific Browsing, Proceedings of 2004 IEEE/WIC/ACM international Conference on Web Intelligence, 2004.

  128. H.C. Lee, J. Miao, Information extraction by embedding HMM to the set of induced linguistic features, Proceedings of SPIRE, 2004.

    Articles in refereed conference proceedings (2003)

  129. A. Borodin, R. Ostrovsky, Y. Rabani, Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems, Discrete and Computational Geometry - The Goodman-Polack Festschrift B. Aronov, S. Basu, J. Pach, M. Sharir, eds, Vol. 25 in the series: Algorithms and Combinatorics, Springer Verlag, Berlin, May 2003, pp 255-276.

  130. J.P. Grossman, Recursive Node Similarity in Networked Information Spaces, Proceedings of Innovative Internet Community Systems, 2003.

  131. H.C. Lee, A. Borodin, Perturbation of the hyper-linked environment, Proceedings of the 9th International and Computing Conference COCOON LNCS 2697 (2003), pp 272, 283.

  132. H.C. Lee, Metasearch via the co-citation graph, Proceedings of Internet Computing, 2003.

  133. H.C. Lee, A. Borodin, Perturbation of the hyperlinked-environment, Proceedings of the Ninth International Computing and Combinatorics Conference, 2003.

    Articles in refereed conference proceedings (2002)

  134. J. Janssen, N. Kalyaniwalla Compressibility as a model of local coherence in web graphs, I2CS, 2002.

    Papers in refereed conference proceedings (2001)

  135. W. Lu, J. Janssen, E. Milios, N. Japkowicz, Y. Zhang, Node Similarity in Networked Information Spaces, Knowledge and Information Systems, revised version submitted, September 2004. Presented at CASCON, 2001.

    Presentations (2004-2008)

    2008

  136. R.J. Nowakowski, Cleaning Up after the Bad Guys, University of Calgary, 2008.

  137. R.J. Nowakowski, The Robot Cleans up, COCOA 2008, October 2008.

  138. R.J. Nowakowski, Cleaning a Graph, O Centro de Estruturas Lineares e Combinatoria, Universidade de Lisboa, April, 2008.

    2007

  139. A. Bonato, Random models for the web graph, 4th National Conference on Mathematical and Computational Models (NCMCM'07), Coimbatore, India, December 2007.

  140. J. Janssen, A spatial web graph model with local influence regions, 5th Workshop On Algorithms And Models For The Web-Graph (WAW'07), San Diego, December 2007.

  141. J. Janssen, Modelling Self-Organizing Networks with a hidden metric Coast2Coast seminar October 9, 2007.

  142. Pawel Pralat, Cleaning random d-regular graphs with brushes using a degree-greedy algorithm, The 4th Workshop on Combinatorial and Algorithmic Aspects of Networking, August 2007.

  143. A. Bonato, Vertex pursuit games in stochastic network models, Fourth Workshop on Combinatorial and Algorithmic Aspects of Networking, August 2007.

  144. A. Bonato, Models of the web graph, CMS-MITACS Joint Conference, June 2007.

  145. A. Bonato, Modelling self-organizing networks with a hidden metric, McGill University, June 2007.

  146. J. Janssen, Modelling Self-Organizing Networks with a hidden metric Invited lecture, Workshop on Random and Dynamic Graphs and Networks, May 2007.

  147. A. Bonato, Homomorphisms and the web graph, 1st Canadian Discrete and Algorithmic Mathematics Conference, May 2007.

  148. Isheeta Nargis, A new algorithm to extract a hierarchy of web communities, 1st Canadian Discrete and Algorithmic Mathematics Conference, May 2007.

  149. Pawel Pralat, The differential equation method for random graph processes and greedy algorithms -- series of lectures, Dalhousie University, January and February 2007.

    2006

  150. Pawel Pralat, Growing and classical protean graphs (new probabilistic models of the web), The 4th Workshop on Algorithms and Models for the Web-Graph, December 2006.

  151. Isheeta Nargis, David Pike, Neil McKay, Neighborhoods in the Web Graph, CONNECTING WOMEN IN MATHEMATICS ACROSS CANADA, December 2006.

  152. A. Bonato, Modelling the infinite web, Miniconference on the Mathematics of Computation, Dalhousie University, August 2006.

  153. I. Nargis, D. Pike, N. McKay, Neighborhoods in the Web Graph. In: The Sixteenth Annual Newfoundland Electrical and Computer Engineering Conference, St. John's, Newfoundland, November 2006.

  154. Pawel Pralat, Geodesics and almost geodesic cycles in random regular graphs, Dalhousie University, October 2006. 2005

  155. J. Janssen, The infinite Web, lecture aimed at undergraduate students, presented as a the department colloquium at Acadia University, Mount Allison, and Trent University, and as Honour's seminar at Dalhousie university, 2005.

  156. A. Bonato, Random graph models and the web, Canadian Mathematical Society Winter 2005 Meeting, Victoria, December 2005.

  157. J. Janssen, Infinite limits of the duplication model and graph folding, invited talk, AARMS workshop on Graphs and Combinatorics, Acadia University, Wolfville, October 2005.

  158. J. Janssen, Infinite limits of self-organizing networks, invited talk, symposium on Random Graphs and Applications, CMS summer meeting, U. Waterloo, June 2005.

  159. A. Bonato, Infinite limits and models of the web graph, Models of Real-World Random Networks, MSRI, Berkeley, U.S.A., April 2005.

  160. A. Bonato, Massive scale-free networks and infinite graphs, AMS Special Session on Probabilistic Paradigms in Combinatorics, Newark, Delaware, April 2005.

    2004

  161. A. Bonato, Limits of directed models of the web graph, Combinatorial and Algorithmic Aspects of Networking, Banff International Research Station, Alberta, August 2004.

  162. J. Janssen, Intelligent Web mining, student short course, MITACS annual conference, Halifax, June 2004.

  163. A. Bonato, A unifying model for massive self-organizing networks, Graphs, Games, and the Web Symposium, Canadian Mathematical Society Summer Meeting, Dalhousie University, June 2004.