• Gańczorz A, Gąsieniec L, Jurdziński T, Kowalski J and Stachowiak G. (2025). Selective Population Protocols. Stabilization, Safety, and Security of Distributed Systems. 10.1007/978-3-031-74498-3_16. (225-239).

    https://link.springer.com/10.1007/978-3-031-74498-3_16

  • Aufiero S, Ibba G, Bartolucci S, Destefanis G, Neykova R and Ortu M. (2024). DApps ecosystems: mapping the network structure of smart contract interactions. EPJ Data Science. 10.1140/epjds/s13688-024-00497-8. 13:1.

    https://epjdatascience.springeropen.com/articles/10.1140/epjds/s13688-024-00497-8

  • Liu Z, Ji F, Yang J, Cao X, Zhang M, Chen H and Chang Y. Refining Euclidean Obfuscatory Nodes Helps: A Joint-Space Graph Learning Method for Graph Neural Networks. IEEE Transactions on Neural Networks and Learning Systems. 10.1109/TNNLS.2024.3405898. 35:9. (11720-11733).

    https://ieeexplore.ieee.org/document/10557658/

  • Zhao W, Liu J, Ren R and Wen J. (2023). Dense Text Retrieval Based on Pretrained Language Models: A Survey. ACM Transactions on Information Systems. 42:4. (1-60). Online publication date: 31-Jul-2024.

    https://doi.org/10.1145/3637870

  • Hemmer C, Brenner M, Hess F and Durstewitz D. Optimal recurrent network topologies for dynamical systems reconstruction. Proceedings of the 41st International Conference on Machine Learning. (18174-18204).

    /doi/10.5555/3692070.3692800

  • Kung P, Fan Z, Zhao T, Liu Y, Lai Z, Shi J, Wu Y, Yu J, Shah N and Venkataraman G. Improving Embedding-Based Retrieval in Friend Recommendation with ANN Query Expansion. Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval. (2930-2934).

    https://doi.org/10.1145/3626772.3661367

  • Yang C, Cheng M, Lumveerakul A, Hsu Y and Lai P. (2024). An empirical study of network reduction: the measurement and comparison. Social Network Analysis and Mining. 10.1007/s13278-024-01276-z. 14:1.

    https://link.springer.com/10.1007/s13278-024-01276-z

  • Li Y, Su L, Joe-Wong C, Yeh E and Ioannidis S. (2024). Distributed Experimental Design Networks IEEE INFOCOM 2024 - IEEE Conference on Computer Communications. 10.1109/INFOCOM52122.2024.10621241. 979-8-3503-8350-8. (2368-2377).

    https://ieeexplore.ieee.org/document/10621241/

  • Xu Y, Yang M, Ling Z, Liu Z, Gu X and Luo L. (2024). A De-anonymization Attack against Downloaders in Freenet IEEE INFOCOM 2024 - IEEE Conference on Computer Communications. 10.1109/INFOCOM52122.2024.10621209. 979-8-3503-8350-8. (1-10).

    https://ieeexplore.ieee.org/document/10621209/

  • Mehrab Z, Stundal L, Swarup S, Venaktramanan S, Lewis B, Mortveit H, Barrett C, Pandey A, Wells C, Galvani A, Singer B, Leblang D, Colwell R and Marathe M. Network Agency: An Agent-based Model of Forced Migration from Ukraine. Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems. (1372-1380).

    /doi/10.5555/3635637.3662996

  • Hosseinzadeh M, Mohammadi V, Lansky J and Nulicek V. (2024). Advancing the Social Internet of Things (SIoT): Challenges, Innovations, and Future Perspectives. Mathematics. 10.3390/math12050715. 12:5. (715).

    https://www.mdpi.com/2227-7390/12/5/715

  • Liu F, Li Z, Yang C, Gong D, Lu H and Liu F. (2024). SEGCN: a subgraph encoding based graph convolutional network model for social bot detection. Scientific Reports. 10.1038/s41598-024-54809-z. 14:1.

    https://www.nature.com/articles/s41598-024-54809-z

  • Díaz A, Morris P, Perarnau G and Serra O. Speeding up random walk mixing by starting from a uniform vertex. Electronic Journal of Probability. 10.1214/24-EJP1091. 29:none.

    https://projecteuclid.org/journals/electronic-journal-of-probability/volume-29/issue-none/Speeding-up-random-walk-mixing-by-starting-from-a-uniform/10.1214/24-EJP1091.full

  • Wang H, Li Y, Gong K, Pathan M, Xi S, Zhu B, Wen Z and Dev S. (2024). MFCSNet: A Musician–Follower Complex Social Network for Measuring Musical Influence. Entertainment Computing. 10.1016/j.entcom.2023.100601. 48. (100601). Online publication date: 1-Jan-2024.

    https://linkinghub.elsevier.com/retrieve/pii/S1875952123000563

  • Alon B, Naor M, Omri E and Stemmer U. (2024). MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. Advances in Cryptology – CRYPTO 2024. 10.1007/978-3-031-68397-8_3. (74-108).

    https://link.springer.com/10.1007/978-3-031-68397-8_3

  • Karras A, Karras C, Schizas N, Sioutas S and Zaroliagis C. (2024). Algorithmic Aspects of Distributed Hash Tables on Cloud, Fog, and Edge Computing Applications: A Survey. Algorithmic Aspects of Cloud Computing. 10.1007/978-3-031-49361-4_8. (133-171).

    https://link.springer.com/10.1007/978-3-031-49361-4_8

  • Gila O, Ozel E and Goodrich M. Highway Preferential Attachment Models for Geographic Routing. Combinatorial Optimization and Applications. (56-80).

    https://doi.org/10.1007/978-3-031-49614-1_4

  • Lu Z, Chen J, Lian D, Zhang Z, Ge Y and Chen E. Knowledge distillation for high dimensional search index. Proceedings of the 37th International Conference on Neural Information Processing Systems. (33403-33419).

    /doi/10.5555/3666122.3667574

  • Marche C and Nitti M. (2023). An Evaluation of Service Discovery Mechanisms for a Network of Social Digital Twins GLOBECOM 2023 - 2023 IEEE Global Communications Conference. 10.1109/GLOBECOM54140.2023.10437182. 979-8-3503-1090-0. (3215-3221).

    https://ieeexplore.ieee.org/document/10437182/

  • Hassani H, Komendantova N, Rovenskaya E and Yeganegi M. (2023). Social Trend Mining: Lead or Lag. Big Data and Cognitive Computing. 10.3390/bdcc7040171. 7:4. (171).

    https://www.mdpi.com/2504-2289/7/4/171

  • Lalou M and Kheddouci H. (2023). Network Vulnerability Assessment Using Critical Nodes Identification 2023 International Symposium on Networks, Computers and Communications (ISNCC). 10.1109/ISNCC58260.2023.10323870. 979-8-3503-3559-0. (1-6).

    https://ieeexplore.ieee.org/document/10323870/

  • Li Y, Liu Y, Su L, Yeh E and Ioannidis S. Experimental Design Networks: A Paradigm for Serving Heterogeneous Learners Under Networking Constraints. IEEE/ACM Transactions on Networking. 10.1109/TNET.2023.3243534. 31:5. (2236-2250).

    https://ieeexplore.ieee.org/document/10049385/

  • Semenkov K and Promyslov G. (2023). Quantitative Criteria for Classification of Small-World Networks for Industrial Systems 2023 16th International Conference Management of large-scale system development (MLSD). 10.1109/MLSD58227.2023.10303950. 979-8-3503-3790-7. (1-5).

    https://ieeexplore.ieee.org/document/10303950/

  • Amati G, Cruciani A, Pasquini D, Vocca P and Angelini S. propagate: A Seed Propagation Framework to Compute Distance-Based Metrics on Very Large Graphs. Machine Learning and Knowledge Discovery in Databases: Research Track. (671-688).

    https://doi.org/10.1007/978-3-031-43418-1_40

  • Shukla U, Singh A and Singhal N. (2023). Congestion control analysis of optical packet switch for optical data center applications. Journal of Optical Communications. 10.1515/joc-2023-0236.

    https://www.degruyter.com/document/doi/10.1515/joc-2023-0236/html

  • Malak D, Li Y, Ioannidis S, Yeh E and Médard M. (2023). Joint Optimization of Storage and Transmission via Coding Traffic Flows for Content Distribution 2023 21st International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt). 10.23919/WiOpt58741.2023.10349849. 978-3-903176-55-3. (310-317).

    https://ieeexplore.ieee.org/document/10349849/

  • Shi J, Chaurasiya V, Liu Y, Vij S, Wu Y, Kanduri S, Shah N, Yu P, Srivastava N, Shi L, Venkataraman G and Yu J. Embedding Based Retrieval in Friend Recommendation. Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval. (3330-3334).

    https://doi.org/10.1145/3539618.3591848

  • Li Y, Zhang Y, Ioannidis S and Crowcroft J. (2023). Jointly Optimal Routing and Caching with Bounded Link Capacities ICC 2023 - IEEE International Conference on Communications. 10.1109/ICC45041.2023.10279235. 978-1-5386-7462-8. (1130-1136).

    https://ieeexplore.ieee.org/document/10279235/

  • Peng Y, Choi B, Chan T, Yang J and Xu J. (2023). Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases. Proceedings of the ACM on Management of Data. 1:1. (1-27). Online publication date: 26-May-2023.

    https://doi.org/10.1145/3588908

  • Ugander J and Yin H. (2023). Randomized graph cluster randomization. Journal of Causal Inference. 10.1515/jci-2022-0014. 11:1. Online publication date: 25-May-2023.. Online publication date: 1-Jan-2023.

    https://www.degruyter.com/document/doi/10.1515/jci-2022-0014/html

  • Lu Z, Lian D, Zhang J, Zhang Z, Feng C, Wang H and Chen E. Differentiable Optimized Product Quantization and Beyond. Proceedings of the ACM Web Conference 2023. (3353-3363).

    https://doi.org/10.1145/3543507.3583482

  • Subratie K, Aditya S and Figueiredo R. (2023). EdgeVPN. Future Generation Computer Systems. 140:C. (104-116). Online publication date: 1-Mar-2023.

    https://doi.org/10.1016/j.future.2022.10.007

  • Zerwas J, Györgyi C, Blenk A, Schmid S and Avin C. (2023). Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 7:1. (1-25). Online publication date: 27-Feb-2023.

    https://doi.org/10.1145/3579449

  • Mishra S, Singh S, Kumar A and Biswas B. (2022). HOPLP − MUL: link prediction in multiplex networks based on higher order paths and layer fusion. Applied Intelligence. 10.1007/s10489-022-03733-8. 53:3. (3415-3443). Online publication date: 1-Feb-2023.

    https://link.springer.com/10.1007/s10489-022-03733-8

  • Bisanzio D, Davis A, Talbird S, Van Effelterre T, Metz L, Gaudig M, Mathieu V and Brogan A. (2023). Targeted preventive vaccination campaigns to reduce Ebola outbreaks: An individual-based modeling study. Vaccine. 10.1016/j.vaccine.2022.11.036. 41:3. (684-693). Online publication date: 1-Jan-2023.

    https://linkinghub.elsevier.com/retrieve/pii/S0264410X22014499

  • Hafner L, Holdener C and Eikmeier N. (2022). Functional Ball Dropping: A superfast hypergraph generation scheme 2022 IEEE International Conference on Big Data (Big Data). 10.1109/BigData55660.2022.10020506. 978-1-6654-8045-1. (4606-4615).

    https://ieeexplore.ieee.org/document/10020506/

  • Goodrich M and Ozel E. Modeling the small-world phenomenon with road networks. Proceedings of the 30th International Conference on Advances in Geographic Information Systems. (1-10).

    https://doi.org/10.1145/3557915.3560981

  • Hao N and Heydenreich M. (2022). Graph distances in scale-free percolation: the logarithmic case. Journal of Applied Probability. 10.1017/jpr.2022.44. (1-19).

    https://www.cambridge.org/core/product/identifier/S0021900222000444/type/journal_article

  • Kroll H, Mainzer N and Balke W. On Dimensions of Plausibility for Narrative Information Access to Digital Libraries. Linking Theory and Practice of Digital Libraries. (433-441).

    https://doi.org/10.1007/978-3-031-16802-4_43

  • Chen C, Vitenberg R and Jacobsen H. Building Fault-Tolerant Overlays With Low Node Degrees for Topic-Based Publish/Subscribe. IEEE Transactions on Dependable and Secure Computing. 10.1109/TDSC.2021.3080281. 19:5. (3011-3023).

    https://ieeexplore.ieee.org/document/9431707/

  • Dorogovtsev S and Mendes J. (2022). Treating General Interdependent Networks. The Nature of Complex Networks. 10.1093/oso/9780199695119.005.0007. (406-409).

    https://academic.oup.com/book/43797/chapter/370804238

  • Dorogovtsev S and Mendes J. (2022). Non-backtracking Matrix. The Nature of Complex Networks. 10.1093/oso/9780199695119.005.0006. (402-405).

    https://academic.oup.com/book/43797/chapter/370804187

  • Dorogovtsev S and Mendes J. (2022). Degree Distribution of a Damaged Network. The Nature of Complex Networks. 10.1093/oso/9780199695119.005.0005. (401-401).

    https://academic.oup.com/book/43797/chapter/370804174

  • Dorogovtsev S and Mendes J. (2022). Hyperscaling Relations for Percolation. The Nature of Complex Networks. 10.1093/oso/9780199695119.005.0004. (397-400).

    https://academic.oup.com/book/43797/chapter/370804123

  • Dorogovtsev S and Mendes J. (2022). Generating Functions. The Nature of Complex Networks. 10.1093/oso/9780199695119.005.0003. (392-396).

    https://academic.oup.com/book/43797/chapter/370804045

  • Dorogovtsev S and Mendes J. (2022). Spectra of symmetric normalized Laplacians of sample graphs. The Nature of Complex Networks. 10.1093/oso/9780199695119.005.0002. (390-391).

    https://academic.oup.com/book/43797/chapter/370804024

  • Dorogovtsev S and Mendes J. (2022). Adjacency Matrix for Hypergraphs. The Nature of Complex Networks. 10.1093/oso/9780199695119.005.0001. (388-389).

    https://academic.oup.com/book/43797/chapter/370804004

  • Dorogovtsev S and Mendes J. (2022). What’s Next?. The Nature of Complex Networks. 10.1093/oso/9780199695119.003.0014. (380-381).

    https://academic.oup.com/book/43797/chapter/370803877

  • Dorogovtsev S and Mendes J. (2022). Inference and Reconstruction. The Nature of Complex Networks. 10.1093/oso/9780199695119.003.0013. (374-379).

    https://academic.oup.com/book/43797/chapter/370803838

  • Dorogovtsev S and Mendes J. (2022). Cooperative Systems on Networks. The Nature of Complex Networks. 10.1093/oso/9780199695119.003.0012. (356-373).

    https://academic.oup.com/book/43797/chapter/370803681

  • Dorogovtsev S and Mendes J. (2022). Temporal Networks. The Nature of Complex Networks. 10.1093/oso/9780199695119.003.0011. (345-355).

    https://academic.oup.com/book/43797/chapter/370803599

  • Dorogovtsev S and Mendes J. (2022). Walks and Search. The Nature of Complex Networks. 10.1093/oso/9780199695119.003.0010. (326-344).

    https://academic.oup.com/book/43797/chapter/370803451

  • Dorogovtsev S and Mendes J. (2022). Spectra and Communities. The Nature of Complex Networks. 10.1093/oso/9780199695119.003.0009. (284-325).

    https://academic.oup.com/book/43797/chapter/370803149

  • Dorogovtsev S and Mendes J. (2022). Networks of Networks. The Nature of Complex Networks. 10.1093/oso/9780199695119.003.0008. (258-283).

    https://academic.oup.com/book/43797/chapter/370802982

  • Dorogovtsev S and Mendes J. (2022). Epidemics and Spreading Phenomena. The Nature of Complex Networks. 10.1093/oso/9780199695119.003.0007. (216-257).

    https://academic.oup.com/book/43797/chapter/370802637

  • Dorogovtsev S and Mendes J. (2022). Connected Components. The Nature of Complex Networks. 10.1093/oso/9780199695119.003.0006. (146-215).

    https://academic.oup.com/book/43797/chapter/370801962

  • Dorogovtsev S and Mendes J. (2022). Evolving Networks. The Nature of Complex Networks. 10.1093/oso/9780199695119.003.0005. (113-145).

    https://academic.oup.com/book/43797/chapter/370801597

  • Dorogovtsev S and Mendes J. (2022). Equilibrium Networks. The Nature of Complex Networks. 10.1093/oso/9780199695119.003.0004. (70-112).

    https://academic.oup.com/book/43797/chapter/370801148

  • Dorogovtsev S and Mendes J. (2022). Classical Random Graphs. The Nature of Complex Networks. 10.1093/oso/9780199695119.003.0003. (55-69).

    https://academic.oup.com/book/43797/chapter/370800978

  • Dorogovtsev S and Mendes J. (2022). Graphs. The Nature of Complex Networks. 10.1093/oso/9780199695119.003.0002. (23-54).

    https://academic.oup.com/book/43797/chapter/370800620

  • Dorogovtsev S and Mendes J. (2022). First Insight. The Nature of Complex Networks. 10.1093/oso/9780199695119.003.0001. (1-22).

    https://academic.oup.com/book/43797/chapter/370800387

  • (2022). Further reading. The Nature of Complex Networks. 10.1093/oso/9780199695119.002.0008. (382-387).

    https://academic.oup.com/book/43797/chapter/370803885

  • (2022). Contents. The Nature of Complex Networks. 10.1093/oso/9780199695119.002.0007. (xiii-xvi).

    https://academic.oup.com/book/43797/chapter/370800380

  • (2022). Preface. The Nature of Complex Networks. 10.1093/oso/9780199695119.002.0006. (ix-xii).

    https://academic.oup.com/book/43797/chapter/370800365

  • (2022). Epigraph. The Nature of Complex Networks. 10.1093/oso/9780199695119.002.0005. (vii-viii).

    https://academic.oup.com/book/43797/chapter/370800359

  • (2022). Dedication. The Nature of Complex Networks. 10.1093/oso/9780199695119.002.0004. (v-vi).

    https://academic.oup.com/book/43797/chapter/370800354

  • (2022). Copyright Page. The Nature of Complex Networks. 10.1093/oso/9780199695119.002.0003. (iv-iv).

    https://academic.oup.com/book/43797/chapter/370800321

  • Dorogovtsev S and Mendes J. (2022). The Nature of Complex Networks

    https://academic.oup.com/book/43797

  • Liu Y, Li Y, Su L, Yeh E and Ioannidis S. (2022). Experimental Design Networks: A Paradigm for Serving Heterogeneous Learners under Networking Constraints IEEE INFOCOM 2022 - IEEE Conference on Computer Communications. 10.1109/INFOCOM48880.2022.9796907. 978-1-6654-5822-1. (210-219).

    https://ieeexplore.ieee.org/document/9796907/

  • Yu Y, Wen D, Zhang Y, Qin L, Zhang W and Lin X. (2022). GPU-accelerated Proximity Graph Approximate Nearest Neighbor Search and Construction 2022 IEEE 38th International Conference on Data Engineering (ICDE). 10.1109/ICDE53745.2022.00046. 978-1-6654-0883-7. (552-564).

    https://ieeexplore.ieee.org/document/9835618/

  • Bringmann K, Keusch R, Lengler J, Maus Y and Molla A. (2022). Greedy routing and the algorithmic small-world phenomenon. Journal of Computer and System Sciences. 10.1016/j.jcss.2021.11.003. 125. (59-105). Online publication date: 1-May-2022.

    https://linkinghub.elsevier.com/retrieve/pii/S0022000021001112

  • Liu X, Yang X, Yu J and Yu K. (2022). Cooperative communication design of physical layer security enhancement with social ties in random networks. Ad Hoc Networks. 130:C. Online publication date: 1-May-2022.

    https://doi.org/10.1016/j.adhoc.2022.102822

  • Mahler B. (2022). Contagion Dynamics for Manifold Learning. Frontiers in Big Data. 10.3389/fdata.2022.668356. 5.

    https://www.frontiersin.org/articles/10.3389/fdata.2022.668356/full

  • Amin F, Majeed A, Mateen A, Abbasi R and Hwang S. A Systematic Survey on the Recent Advancements in the Social Internet of Things. IEEE Access. 10.1109/ACCESS.2022.3183261. 10. (63867-63884).

    https://ieeexplore.ieee.org/document/9796539/

  • Guo D. (2022). State-of-the-Art DCN Topologies. Data Center Networking. 10.1007/978-981-16-9368-7_2. (25-56).

    https://link.springer.com/10.1007/978-981-16-9368-7_2

  • Wang Q. (2022). On Tree Equilibria in Max-Distance Network Creation Games. Algorithmic Game Theory. 10.1007/978-3-031-15714-1_17. (293-310).

    https://link.springer.com/10.1007/978-3-031-15714-1_17

  • He W, Lu M, Zheng Y and Xiong N. (2022). Research on Graph Structure Data Adversarial Examples Based on Graph Theory Metrics. Smart Computing and Communication. 10.1007/978-3-030-97774-0_36. (394-403).

    https://link.springer.com/10.1007/978-3-030-97774-0_36

  • Barthelemy M. (2022). Spatial Small-Worlds. Spatial Networks. 10.1007/978-3-030-94106-2_12. (243-252).

    https://link.springer.com/10.1007/978-3-030-94106-2_12

  • UNUTULMAZ S and DULUPÇU M. (2021). Ağ Teorisinin Temelleri ve Evrimi: Bütünsel Bir DeğerlendirmeFundamentals and Evolution of Network Theory: A Holistic Evaluation. Politik Ekonomik Kuram. 10.30586/pek.1012279. 5:2. (265-288).

    http://dergipark.org.tr/tr/doi/10.30586/pek.1012279

  • Banerjee S. (2021). (2021). Lymph node inspired computing: towards immune system inspired human-engineered complex systems. Interdisciplinary Description of Complex Systems. 10.7906/indecs.19.4.4. 19:4. (502-510). Online publication date: 30-Dec-2022.. Online publication date: 30-Dec-2022.

    http://indecs.eu/index.php?s=x&y=2021&p=502-510

  • Biswas C, Ganguly D and Bhattacharya U. Approximate Nearest Neighbour Search on Privacy-aware Encoding of User Locations to Identify Susceptible Infections in Simulated Epidemics. Proceedings of the 13th Annual Meeting of the Forum for Information Retrieval Evaluation. (35-42).

    https://doi.org/10.1145/3503162.3503164

  • Shakibajahromi B, Shayestehmanesh S, Schwartz D and Shokoufandeh A. (2021). HyNet: 3D Segmentation Using Hybrid Graph Networks 2021 International Conference on 3D Vision (3DV). 10.1109/3DV53792.2021.00089. 978-1-6654-2688-6. (805-814).

    https://ieeexplore.ieee.org/document/9665946/

  • Müngen A, Gündoğan E and Kaya M. (2021). Identifying multiple social network accounts belonging to the same users. Social Network Analysis and Mining. 10.1007/s13278-021-00736-0. 11:1. Online publication date: 1-Dec-2021.

    https://link.springer.com/10.1007/s13278-021-00736-0

  • Amaral L and Belich H. (2021). Kleinberg’s Navigation in Fractal Small-World Networks by Dynamic Rejection Sampling. Brazilian Journal of Physics. 10.1007/s13538-021-00995-4.

    https://link.springer.com/10.1007/s13538-021-00995-4

  • Yang X and Hayashi T. (2021). Exploring the Effects of Internet Memes in Social Media Marketing through A/B Testing 2021 IEEE 23rd Conference on Business Informatics (CBI). 10.1109/CBI52690.2021.10060. 978-1-6654-2069-3. (97-106).

    https://ieeexplore.ieee.org/document/9610683/

  • Guo X, Du Y and Zhao L. Deep Generative Models for Spatial Networks. Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. (505-515).

    https://doi.org/10.1145/3447548.3467394

  • Kolumbus Y and Nisan N. (2021). On the effectiveness of tracking and testing in SEIR models for improving health vs. economy trade-offs. Scientific Reports. 10.1038/s41598-021-95415-7. 11:1.

    https://www.nature.com/articles/s41598-021-95415-7

  • Pauliková A, Lestyánszka Škůrková K, Kopilčáková L, Zhelyazkova-Stoyanova A and Kirechev D. (2021). Innovative Approaches to Model Visualization for Integrated Management Systems. Sustainability. 10.3390/su13168812. 13:16. (8812).

    https://www.mdpi.com/2071-1050/13/16/8812

  • Zhong Y, Hua K, Li P, Deng D, Liu X and Chen Y. Dynamic Periodic Location Encounter Network Analysis for Vehicular Social Networks. IEEE Transactions on Vehicular Technology. 10.1109/TVT.2021.3091165. 70:8. (7453-7463).

    https://ieeexplore.ieee.org/document/9462386/

  • Clementi A, d'Amore F, Giakkoupis G and Natale E. Search via Parallel Lévy Walks on Z2. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. (81-91).

    https://doi.org/10.1145/3465084.3467921

  • Wang M, Xu X, Yue Q and Wang Y. (2021). A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search. Proceedings of the VLDB Endowment. 14:11. (1964-1978). Online publication date: 1-Jul-2021.

    https://doi.org/10.14778/3476249.3476255

  • Nguyen T and Wahib M. (2021). An Allreduce Algorithm and Network Co-design for Large-Scale Training of Distributed Deep Learning 2021 IEEE/ACM 21st International Symposium on Cluster, Cloud and Internet Computing (CCGrid). 10.1109/CCGrid51090.2021.00049. 978-1-7281-9586-5. (396-405).

    https://ieeexplore.ieee.org/document/9499662/

  • Pashaei Barbin J, Yousefi S and Masoumi B. (2021). Navigation in the social internet-of-things (SIoT) for discovering the influential service-providers using distributed learning automata. The Journal of Supercomputing. 10.1007/s11227-021-03699-3.

    http://link.springer.com/10.1007/s11227-021-03699-3

  • Ding J, Wu Y, Xu J and Yang D. Consistent recovery threshold of hidden nearest neighbor graphs. IEEE Transactions on Information Theory. 10.1109/TIT.2021.3085773. (1-1).

    https://ieeexplore.ieee.org/document/9446505/

  • Alrasheed H. On the Utilization of Shortest Paths in Complex Networks. IEEE Access. 10.1109/ACCESS.2021.3101176. 9. (110989-111004).

    https://ieeexplore.ieee.org/document/9500207/

  • Predari M, Tzovas C, Schulz C and Meyerhenke H. (2021). An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures. Euro-Par 2021: Parallel Processing. 10.1007/978-3-030-85665-6_11. (167-182).

    https://link.springer.com/10.1007/978-3-030-85665-6_11

  • Gumzej R. (2021). Smart Services. Intelligent Logistics Systems for Smart Cities and Communities. 10.1007/978-3-030-81203-4_3. (17-32).

    https://link.springer.com/10.1007/978-3-030-81203-4_3

  • Pranave S, Uppada S, Vishnu Priya A and SivaSelvan B. (2021). Frequent Pattern Mining Approach for Fake News Detection. Conference Proceedings of ICDLAIR2019. 10.1007/978-3-030-67187-7_12. (103-118).

    http://link.springer.com/10.1007/978-3-030-67187-7_12

  • Malekshahi Rad M, Rahmani A, Sahafi A and Nasih Qader N. (2020). Social Internet of Things: vision, challenges, and trends. Human-centric Computing and Information Sciences. 10.1186/s13673-020-00254-6. 10:1. Online publication date: 1-Dec-2020.

    https://hcis-journal.springeropen.com/articles/10.1186/s13673-020-00254-6

  • Slota G, Root C, Devine K, Madduri K and Rajamanickam S. Scalable, Multi-Constraint, Complex-Objective Graph Partitioning. IEEE Transactions on Parallel and Distributed Systems. 10.1109/TPDS.2020.3002150. 31:12. (2789-2801).

    https://ieeexplore.ieee.org/document/9115834/

  • Zheng Q, Cranor C, Jain A, Ganger G, Gibson G, Amvrosiadis G, Settlemyer B and Grider G. (2020). Streaming Data Reorganization at Scale with DeltaFS Indexed Massive Directories. ACM Transactions on Storage. 16:4. (1-31). Online publication date: 30-Nov-2020.

    https://doi.org/10.1145/3415581

  • Do J, Ferreira V, Bobarshad H, Torabzadehkashi M, Rezaei S, Heydarigorji A, Souza D, Goldstein B, Santiago L, Kim M, Lima P, França F and Alves V. (2020). Cost-effective, Energy-efficient, and Scalable Storage Computing for Large-scale AI Applications. ACM Transactions on Storage. 16:4. (1-37). Online publication date: 30-Nov-2020.

    https://doi.org/10.1145/3415580

  • Kougkas A, Devarajan H and Sun X. (2020). Bridging Storage Semantics Using Data Labels and Asynchronous I/O. ACM Transactions on Storage. 16:4. (1-34). Online publication date: 30-Nov-2020.

    https://doi.org/10.1145/3415579

  • Ye L, Feng D, Hu Y and Wei X. (2020). Hybrid Codes. ACM Transactions on Storage. 16:4. (1-26). Online publication date: 30-Nov-2020.

    https://doi.org/10.1145/3407193

  • Gasparetti F, Sansonetti G and Micarelli A. (2020). Community detection in social recommender systems: a survey. Applied Intelligence. 10.1007/s10489-020-01962-3.

    http://link.springer.com/10.1007/s10489-020-01962-3

  • Zhu H. (2020). Multilevel understanding dynamic changes in inbound tourist flow network ( ITFN ) structure: topology, collaboration, and competitiveness . Current Issues in Tourism. 10.1080/13683500.2020.1842341. (1-19).

    https://www.tandfonline.com/doi/full/10.1080/13683500.2020.1842341

  • De Meo P, Levene M, Messina F and Provetti A. A General Centrality Framework-Based on Node Navigability. IEEE Transactions on Knowledge and Data Engineering. 10.1109/TKDE.2019.2947035. 32:11. (2088-2100).

    https://ieeexplore.ieee.org/document/8868221/

  • Rehman A, Paul A and Ahmad A. (2020). A Query based Information search in an Individual’s Small World of Social Internet of Things. Computer Communications. 10.1016/j.comcom.2020.08.027. 163. (176-185). Online publication date: 1-Nov-2020.

    https://linkinghub.elsevier.com/retrieve/pii/S0140366420319149

  • Ertuğrul Ö. (2020). A novel randomized machine learning approach: Reservoir computing extreme learning machine. Applied Soft Computing. 10.1016/j.asoc.2020.106433. 94. (106433). Online publication date: 1-Sep-2020.

    https://linkinghub.elsevier.com/retrieve/pii/S1568494620303732

  • Arabghalizi T and Labrinidis A. (2020). Data-driven Bus Crowding Prediction Models Using Context-specific Features. ACM/IMS Transactions on Data Science. 1:3. (1-33). Online publication date: 31-Aug-2020.

    https://doi.org/10.1145/3406962

  • Li Y, Kotwal P, Wang P, Xie Y, Shekhar S and Northrop W. (2020). Physics-guided Energy-efficient Path Selection Using On-board Diagnostics Data. ACM/IMS Transactions on Data Science. 1:3. (1-28). Online publication date: 31-Aug-2020.

    https://doi.org/10.1145/3406596

  • Xie Y and Shekhar S. (2020). A Unified Framework for Robust and Efficient Hotspot Detection in Smart Cities. ACM/IMS Transactions on Data Science. 1:3. (1-29). Online publication date: 31-Aug-2020.

    https://doi.org/10.1145/3379562

  • Yang Z, Zheng B, Li G, Hung N, Liu G and Zheng K. (2020). Searching Activity Trajectories by Exemplar. ACM/IMS Transactions on Data Science. 1:3. (1-18). Online publication date: 31-Aug-2020.

    https://doi.org/10.1145/3379561

  • Xu X, Fu Y, Wu J, Wang Y, Huang Z, Fu Z and Yin M. (2020). Adaptive Weighted Finite Mixture Model. ACM/IMS Transactions on Data Science. 1:3. (1-16). Online publication date: 31-Aug-2020.

    https://doi.org/10.1145/3379560

  • Ding W, Zhao Z, Wang J and Li H. (2020). Task Allocation in Hybrid Big Data Analytics for Urban IoT Applications. ACM/IMS Transactions on Data Science. 1:3. (1-22). Online publication date: 31-Aug-2020.

    https://doi.org/10.1145/3374751

  • Kaminski M. (2020). A recent renaissance in privacy law. Communications of the ACM. 63:9. (24-27). Online publication date: 21-Aug-2020.

    https://doi.org/10.1145/3411049

  • Lowe A, Agarwal P and Rav M. (2020). Flood-risk analysis on terrains. Communications of the ACM. 63:9. (94-102). Online publication date: 21-Aug-2020.

    https://doi.org/10.1145/3410413

  • Narayanan A, Mathur A, Chetty M and Kshirsagar M. (2020). Dark patterns. Communications of the ACM. 63:9. (42-47). Online publication date: 21-Aug-2020.

    https://doi.org/10.1145/3397884

  • Katzir L, Shikhelman C and Yogev E. Interactive Proofs for Social Graphs. Advances in Cryptology – CRYPTO 2020. (574-601).

    https://doi.org/10.1007/978-3-030-56877-1_20

  • Prokhorenkova L and Shekhovtsov A. Graph-based nearest neighbor search. Proceedings of the 37th International Conference on Machine Learning. (7803-7813).

    /doi/10.5555/3524938.3525661

  • Ghosh S and Saha K. (2020). Transmission and Navigation on Disordered Lattice Networks, Directed Spanning Forests and Brownian Web. Journal of Statistical Physics. 10.1007/s10955-020-02604-1.

    http://link.springer.com/10.1007/s10955-020-02604-1

  • Basu S, Roy S, Bandyopadhyay S and Das Bit S. A Utility Driven Post Disaster Emergency Resource Allocation System Using DTN. IEEE Transactions on Systems, Man, and Cybernetics: Systems. 10.1109/TSMC.2018.2813008. 50:7. (2338-2350).

    https://ieeexplore.ieee.org/document/8323418/

  • Orellana A and Michele C. (2020). Algorithm 1010. ACM Transactions on Mathematical Software. 46:2. (1-28). Online publication date: 30-Jun-2020.

    https://doi.org/10.1145/3386241

  • Michail D, Kinable J, Naveh B and Sichi J. (2020). JGraphT—A Java Library for Graph Data Structures and Algorithms. ACM Transactions on Mathematical Software. 46:2. (1-29). Online publication date: 30-Jun-2020.

    https://doi.org/10.1145/3381449

  • Frison G, Sartor T, Zanelli A and Diehl M. (2020). The BLAS API of BLASFEO. ACM Transactions on Mathematical Software. 46:2. (1-36). Online publication date: 30-Jun-2020.

    https://doi.org/10.1145/3378671

  • Casado J and Hewson R. (2020). Algorithm 1008. ACM Transactions on Mathematical Software. 46:2. (1-26). Online publication date: 30-Jun-2020.

    https://doi.org/10.1145/3378542

  • Marques O, Demmel J and Vasconcelos P. (2020). Bidiagonal SVD Computation via an Associated Tridiagonal Eigenproblem. ACM Transactions on Mathematical Software. 46:2. (1-25). Online publication date: 30-Jun-2020.

    https://doi.org/10.1145/3361746

  • Dyer M, Galanis A, Goldberg L, Jerrum M and Vigoda E. (2020). Random Walks on Small World Networks. ACM Transactions on Algorithms. 16:3. (1-33). Online publication date: 26-Jun-2020.

    https://doi.org/10.1145/3382208

  • Sambaturu P, Adhikari B, Prakash B, Venkatramanan S and Vullikanti A. Designing Effective and Practical Interventions to Contain Epidemics. Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems. (1187-1195).

    /doi/10.5555/3398761.3398899

  • Malkov Y and Yashunin D. Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence. 10.1109/TPAMI.2018.2889473. 42:4. (824-836).

    https://ieeexplore.ieee.org/document/8594636/

  • Manin V and Lang B. (2020). Cannon-type triangular matrix multiplication for the reduction of generalized HPD eigenproblems to standard form. Parallel Computing. 91:C. Online publication date: 1-Mar-2020.

    https://doi.org/10.1016/j.parco.2019.102597

  • Lee H and Kobsa A. (2019). Confident Privacy Decision-Making in IoT Environments. ACM Transactions on Computer-Human Interaction. 27:1. (1-39). Online publication date: 29-Feb-2020.

    https://doi.org/10.1145/3364223

  • Blum A, Hopcroft J and Kannan R. (2020). Foundations of Data Science

    https://www.cambridge.org/core/product/identifier/9781108755528/type/book

  • Tan S, Zhou Z, Xu Z and Li P. Fast Item Ranking under Neural Network based Measures. Proceedings of the 13th International Conference on Web Search and Data Mining. (591-599).

    https://doi.org/10.1145/3336191.3371830

  • Faustino J, Iyer N, Mendonza J and Menezes R. (2020). Characterizing the Dynamics of Academic Affiliations: A Network Science Approach. Complex Networks XI. 10.1007/978-3-030-40943-2_33. (393-404).

    http://link.springer.com/10.1007/978-3-030-40943-2_33

  • Xu W and Wu W. (2020). Introduction of Social Influence Analysis. Optimal Social Influence. 10.1007/978-3-030-37775-5_1. (1-20).

    http://link.springer.com/10.1007/978-3-030-37775-5_1

  • Halim N, Kuhlman C, Marathe A, Mozumder P and Vullikanti A. (2020). Two-Mode Threshold Graph Dynamical Systems for Modeling Evacuation Decision-Making During Disaster Events. Complex Networks and Their Applications VIII. 10.1007/978-3-030-36687-2_43. (519-531).

    http://link.springer.com/10.1007/978-3-030-36687-2_43

  • Sambaturu P and Vullikanti A. (2020). Designing Robust Interventions to Control Epidemic Outbreaks. Complex Networks and Their Applications VIII. 10.1007/978-3-030-36687-2_39. (469-480).

    http://link.springer.com/10.1007/978-3-030-36687-2_39

  • Athey S. (2020). Psychology, Torture, Networks: Or, Structure as the Subject of Human Rights. Writing Beyond the State. 10.1007/978-3-030-34456-6_9. (175-198).

    http://link.springer.com/10.1007/978-3-030-34456-6_9

  • Calle F, Cuadra D, Rivero J and Isasi P. (2020). Boosting the Exploration of Huge Dynamic Graphs. Sampling Techniques for Supervised or Unsupervised Tasks. 10.1007/978-3-030-29349-9_7. (205-226).

    http://link.springer.com/10.1007/978-3-030-29349-9_7

  • Razzaque A and Hamdan A. (2020). Peak-End Rule Promotes Social Capital for Knowledge Management in Thru Social Internet of Things. Toward Social Internet of Things (SIoT): Enabling Technologies, Architectures and Applications. 10.1007/978-3-030-24513-9_14. (235-247).

    http://link.springer.com/10.1007/978-3-030-24513-9_14

  • Zhou Z, Tan S, Xu Z and Li P. Möbius transformation for fast inner product search on graph. Proceedings of the 33rd International Conference on Neural Information Processing Systems. (8218-8229).

    /doi/10.5555/3454287.3455025

  • Caballero V, Vernet D and Zaballos A. Social Internet of Energy—A New Paradigm for Demand Side Management. IEEE Internet of Things Journal. 10.1109/JIOT.2019.2932508. 6:6. (9853-9867).

    https://ieeexplore.ieee.org/document/8784194/

  • Maier B, Huepe C, Brockmann D and Gomez-Gardenes J. (2019). Modular hierarchical and power-law small-world networks bear structural optima for minimal first passage times and cover time. Journal of Complex Networks. 10.1093/comnet/cnz010. 7:6. (865-895). Online publication date: 1-Dec-2019.

    https://academic.oup.com/comnet/article/7/6/865/5432290

  • Echihabi K, Zoumpatianos K, Palpanas T and Benbrahim H. (2019). Return of the Lernaean Hydra. Proceedings of the VLDB Endowment. 13:3. (403-420). Online publication date: 1-Nov-2019.

    https://doi.org/10.14778/3368289.3368303

  • De Meo P, Levene M and Provetti A. Potential gain as a centrality measure. IEEE/WIC/ACM International Conference on Web Intelligence. (418-422).

    https://doi.org/10.1145/3350546.3352559

  • Qin Y, Guo D, Luo L, Cheng G and Ding Z. (2019). Design and optimization of VLC based small-world data centers. Frontiers of Computer Science: Selected Publications from Chinese Universities. 13:5. (1034-1047). Online publication date: 1-Oct-2019.

    https://doi.org/10.1007/s11704-018-7315-6

  • Zhang Y, Shen Y and Jiang X. (2019). Friendship-based cooperative jamming for secure communication in Poisson networks. Wireless Networks. 25:7. (4077-4095). Online publication date: 1-Oct-2019.

    https://doi.org/10.1007/s11276-018-1732-1

  • Putman K, Boekhout H and Takes F. Fast incremental computation of harmonic closeness centrality in directed weighted networks. Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. (1018-1025).

    https://doi.org/10.1145/3341161.3344829

  • Bilò D and Lenzner P. (2019). On the Tree Conjecture for the Network Creation Game. Theory of Computing Systems. 10.1007/s00224-019-09945-9.

    http://link.springer.com/10.1007/s00224-019-09945-9

  • Wang Y, Bao Q and Zhang Z. (2019). Combinatorial properties of Farey graphs. Theoretical Computer Science. 10.1016/j.tcs.2019.08.022. Online publication date: 1-Aug-2019.

    https://linkinghub.elsevier.com/retrieve/pii/S0304397519305110

  • Arjunasamy A and Rathi S. (2019). Relationship Based Heuristic for Selecting Friends in Social Internet of Things. Wireless Personal Communications: An International Journal. 107:4. (1537-1547). Online publication date: 1-Aug-2019.

    https://doi.org/10.1007/s11277-019-06344-8

  • Bhattacharya K, Takko T, Monsivais D and Kaski K. (2019). Group formation on a small-world: experiment and modelling. Journal of The Royal Society Interface. 10.1098/rsif.2018.0814. 16:156. (20180814). Online publication date: 26-Jul-2019.

    https://royalsocietypublishing.org/doi/10.1098/rsif.2018.0814

  • Monath N, Kobren A, Krishnamurthy A, Glass M and McCallum A. Scalable Hierarchical Clustering with Tree Grafting. Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. (1438-1448).

    https://doi.org/10.1145/3292500.3330929

  • Karyotis V. (2019). A Markov Random Field Framework for Modeling Malware Propagation in Complex Communications Networks. IEEE Transactions on Dependable and Secure Computing. 16:4. (551-564). Online publication date: 1-Jul-2019.

    https://doi.org/10.1109/TDSC.2017.2703622

  • Maier B. (2019). Generalization of the small-world effect on a model approaching the Erdős–Rényi random graph. Scientific Reports. 10.1038/s41598-019-45576-3. 9:1.

    https://www.nature.com/articles/s41598-019-45576-3

  • Shirazi F, Simeonovski M, Asghar M, Backes M and Diaz C. (2018). A Survey on Routing in Anonymous Communication Protocols. ACM Computing Surveys. 51:3. (1-39). Online publication date: 31-May-2019.

    https://doi.org/10.1145/3182658

  • XI L, SUN B and YAO J. (2019). FRACTALITY OF SUBSTITUTION NETWORKS. Fractals. 10.1142/S0218348X19500348. 27:03. (1950034). Online publication date: 1-May-2019.

    https://www.worldscientific.com/doi/abs/10.1142/S0218348X19500348

  • Tapolcai J, Retvari G, Babarczi P and Berczi-Kovacs E. Scalable and Efficient Multipath Routing via Redundant Trees. IEEE Journal on Selected Areas in Communications. 10.1109/JSAC.2019.2906742. 37:5. (982-996).

    https://ieeexplore.ieee.org/document/8672589/

  • Demaine E, Reidl F, Rossmanith P, Villaamil F, Sikdar S and Sullivan B. (2019). Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. Journal of Computer and System Sciences. 10.1016/j.jcss.2019.05.004. Online publication date: 1-May-2019.

    https://linkinghub.elsevier.com/retrieve/pii/S0022000019300418

  • Ding R, Ujang N, Hamid H, Manan M, Li R, Albadareen S, Nochian A and Wu J. (2019). Application of Complex Networks Theory in Urban Traffic Network Researches. Networks and Spatial Economics. 10.1007/s11067-019-09466-5.

    http://link.springer.com/10.1007/s11067-019-09466-5

  • Ma L, Srivatsa M, Cansever D, Yan X, Kase S and Vanni M. (2019). Performance Bounds of Decentralized Search in Expert Networks for Query Answering. ACM Transactions on Knowledge Discovery from Data. 13:2. (1-23). Online publication date: 30-Apr-2019.

    https://doi.org/10.1145/3300230

  • Amin F, Abbasi R, Rehman A and Choi G. (2019). An Advanced Algorithm for Higher Network Navigation in Social Internet of Things Using Small-World Networks. Sensors. 10.3390/s19092007. 19:9. (2007).

    https://www.mdpi.com/1424-8220/19/9/2007

  • Tariq S, Saleem M and Shahbaz M. (2019). User Similarity Determination in Social Networks. Technologies. 10.3390/technologies7020036. 7:2. (36).

    https://www.mdpi.com/2227-7080/7/2/36

  • Platt E, Romero D and Gallos L. (2019). Towards attack tolerant networks: Concurrent multipath routing and the butterfly network. PLOS ONE. 10.1371/journal.pone.0214292. 14:4. (e0214292).

    http://dx.plos.org/10.1371/journal.pone.0214292

  • Aydin M and Perdahci N. (2019). Dynamic network analysis of online interactive platform. Information Systems Frontiers. 21:2. (229-240). Online publication date: 1-Apr-2019.

    https://doi.org/10.1007/s10796-017-9740-8

  • Rengasamy R and Chidambaram M. (2019). A Novel Predictive Resource Allocation Framework for Cloud Computing 2019 5th International Conference on Advanced Computing & Communication Systems (ICACCS). 10.1109/ICACCS.2019.8728526. 978-1-5386-9531-9. (118-122).

    https://ieeexplore.ieee.org/document/8728526/

  • Barmpalias G, Huang N, Lewis-Pye A, Li A, Li X, Pan Y and Roughgarden T. (2019). The idemetric property: when most distances are (almost) the same. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 10.1098/rspa.2018.0283. 475:2222. (20180283). Online publication date: 1-Feb-2019.

    https://royalsocietypublishing.org/doi/10.1098/rspa.2018.0283

  • Jia J and Benson A. Random Spatial Network Models for Core-Periphery Structure. Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining. (366-374).

    https://doi.org/10.1145/3289600.3290976

  • Liu A, Wu Q, Liu Z and Xia L. Near-neighbor methods in random preference completion. Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence. (4336-4343).

    https://doi.org/10.1609/aaai.v33i01.33014336

  • Antelmi A, Cordasco G, D’Auria M, De Vinco D, Negro A and Spagnuolo C. (2019). On Evaluating Rust as a Programming Language for the Future of Massive Agent-Based Simulations. Methods and Applications for Modeling and Simulation of Complex Systems. 10.1007/978-981-15-1078-6_2. (15-28).

    http://link.springer.com/10.1007/978-981-15-1078-6_2

  • Basu S, Roy S and Das Bit S. (2019). Need Accumulation Over DTN. Reliable Post Disaster Services over Smartphone Based DTN. 10.1007/978-981-13-6573-7_3. (47-71).

    http://link.springer.com/10.1007/978-981-13-6573-7_3

  • Gulati N and Kaur P. (2019). When Things Become Friends: A Semantic Perspective on the Social Internet of Things. Smart Innovations in Communication and Computational Sciences. 10.1007/978-981-10-8971-8_15. (149-159).

    http://link.springer.com/10.1007/978-981-10-8971-8_15

  • Lindholm J. (2019). The Lay of the Land: The Topography of CAS Jurisprudence. Water Governance and Management in India. 10.1007/978-94-6265-285-9_3. (45-83).

    http://link.springer.com/10.1007/978-94-6265-285-9_3

  • Jin R, Sheng Y, Liu L, Chen X and Phan N. (2019). Limiting the Neighborhood: De-Small-World Network for Outbreak Prevention. Computational Data and Social Networks. 10.1007/978-3-030-34980-6_27. (229-245).

    http://link.springer.com/10.1007/978-3-030-34980-6_27

  • Chen S, Wang S and Huang J. (2019). Analysis of Best Network Routing Structure for IoT. Wireless Algorithms, Systems, and Applications. 10.1007/978-3-030-23597-0_45. (556-563).

    http://link.springer.com/10.1007/978-3-030-23597-0_45

  • Zhang J and Yu P. (2019). Information Diffusion. Broad Learning Through Fusions. 10.1007/978-3-030-12528-8_9. (315-349).

    http://link.springer.com/10.1007/978-3-030-12528-8_9

  • Fontenaille C, Petit E, de Oliveira Castro P, Uemura S, Sohier D, Lesnicki P, Lartigue G and Moureau V. (2019). Scalable Work-Stealing Load-Balancer for HPC Distributed Memory Systems. Euro-Par 2018: Parallel Processing Workshops. 10.1007/978-3-030-10549-5_12. (146-158).

    https://link.springer.com/10.1007/978-3-030-10549-5_12

  • Bruin G, Veenman C, van den Herik H and Takes F. (2019). Understanding Behavioral Patterns in Truck Co-driving Networks. Complex Networks and Their Applications VII. 10.1007/978-3-030-05414-4_18. (223-235).

    http://link.springer.com/10.1007/978-3-030-05414-4_18

  • Zhang M, Liu X, Wang W, Gao J and He Y. Navigating with graph representations for fast and scalable decoding of neural language models. Proceedings of the 32nd International Conference on Neural Information Processing Systems. (6311-6322).

    /doi/10.5555/3327345.3327528

  • Pattanayak H, Verma H and Sangal A. (2018). Community Detection Metrics and Algorithms in Social Networks 2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC). 10.1109/ICSCCC.2018.8703215. 978-1-5386-6373-8. (483-489).

    https://ieeexplore.ieee.org/document/8703215/

  • Yang Z and Chen W. (2018). A Game Theoretic Model for the Formation of Navigable Small-World Networks—The Tradeoff between Distance and Reciprocity. ACM Transactions on Internet Technology. 18:4. (1-38). Online publication date: 19-Nov-2018.

    https://doi.org/10.1145/3183325

  • Gyongyosi L and Imre S. (2018). Topology adaption for the quantum Internet. Quantum Information Processing. 17:11. (1-12). Online publication date: 1-Nov-2018.

    https://doi.org/10.1007/s11128-018-2064-x

  • Qin Z, Gan X, Fu L, Di X, Tian J and Wang X. (2018). Content Delivery in Cache-Enabled Wireless Evolving Social Networks. IEEE Transactions on Wireless Communications. 17:10. (6749-6761). Online publication date: 1-Oct-2018.

    https://doi.org/10.1109/TWC.2018.2863687

  • Pantone R, Kendall J and Nino J. (2018). Memristive nanowires exhibit small-world connectivity. Neural Networks. 10.1016/j.neunet.2018.07.002. 106. (144-151). Online publication date: 1-Oct-2018.

    https://linkinghub.elsevier.com/retrieve/pii/S0893608018302016

  • Zhong C and Sastry N. (2017). Systems Applications of Social Networks. ACM Computing Surveys. 50:5. (1-42). Online publication date: 30-Sep-2018.

    https://doi.org/10.1145/3092742

  • Chai Y, Zhu M, Zhu Y, Zhang Z and Zhang Z. On Two-Dimensional Structural Information of Beijing Transportation Networks Based on Traffic Big Data. Proceedings of the 2018 2nd International Conference on Cloud and Big Data Computing. (28-32).

    https://doi.org/10.1145/3264560.3264564

  • Jia R, Liu T, Zhang J, Fu L, Gan X and Wang X. Impact of Content Popularity on Information Coverage in Online Social Networks. IEEE Transactions on Vehicular Technology. 10.1109/TVT.2018.2800094. 67:8. (7465-7474).

    https://ieeexplore.ieee.org/document/8276572/

  • Rao P, Venkatesha M, Kanavalli A, Shenoy P and Venugopal K. (2018). A Micromodel to Predict Message Propagation for Twitter Users 2018 International Conference on Data Science and Engineering (ICDSE). 10.1109/ICDSE.2018.8527807. 978-1-5386-4855-1. (1-5).

    https://ieeexplore.ieee.org/document/8527807/

  • Shaikh N and Castro L. (2018). Random Node Pair Sampling-Based Estimation of Average Path Lengths in Networks. International Journal of Operations Research and Information Systems. 9:3. (27-51). Online publication date: 1-Jul-2018.

    https://doi.org/10.4018/IJORIS.2018070102

  • Anthes G. (2018). You've got mail!. Communications of the ACM. 61:7. (18-19). Online publication date: 25-Jun-2018.

    https://doi.org/10.1145/3213776

  • Chen C, Tock Y and Girdzijauskas S. BeaConvey. Proceedings of the 12th ACM International Conference on Distributed and Event-based Systems. (64-75).

    https://doi.org/10.1145/3210284.3210287

  • Zhang Z, Zhu M and Zhou H. (2018). Dynamical complexity analysis of beijing transportation network based on district structural information 2018 Chinese Control And Decision Conference (CCDC). 10.1109/CCDC.2018.8407232. 978-1-5386-1244-6. (755-760).

    https://ieeexplore.ieee.org/document/8407232/

  • Frydenlund E and Earnest D. (2018). EMERGENCE IN INFORMATION ECONOMIES: AN AGENT‐BASED MODELING PERSPECTIVE. Emergent Behavior in Complex Systems Engineering. 10.1002/9781119378952.ch7. (129-147). Online publication date: 7-May-2018.

    https://onlinelibrary.wiley.com/doi/10.1002/9781119378952.ch7

  • Tato G, Bertier M and Tedeschi C. (2018). Koala: Towards Lazy and Locality-Aware Overlays for Decentralized Clouds 2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC). 10.1109/CFEC.2018.8358728. 978-1-5386-6488-9. (1-10).

    https://ieeexplore.ieee.org/document/8358728/

  • Amoretti M and Zanichelli F. (2017). P2P-PL: A pattern language to design efficient and robust peer-to-peer systems. Peer-to-Peer Networking and Applications. 10.1007/s12083-017-0551-y. 11:3. (518-547). Online publication date: 1-May-2018.

    http://link.springer.com/10.1007/s12083-017-0551-y

  • Nédelec B, Tanke J, Frey D, Molli P and Mostéfaoui A. (2018). An adaptive peer-sampling protocol for building networks of browsers. World Wide Web. 21:3. (629-661). Online publication date: 1-May-2018.

    https://doi.org/10.1007/s11280-017-0478-5

  • Chiasserini C, Garetto M and Leonardi E. (2018). De-anonymizing Clustered Social Networks by Percolation Graph Matching. ACM Transactions on Knowledge Discovery from Data. 12:2. (1-39). Online publication date: 30-Apr-2018.

    https://doi.org/10.1145/3127876

  • Kim J, Baskerville R and Ding Y. (2018). Breaking the Privacy Kill Chain: Protecting Individual and Group Privacy Online. Information Systems Frontiers. 10.1007/s10796-018-9856-5.

    http://link.springer.com/10.1007/s10796-018-9856-5

  • Ioannidis S, Yeh E, Yeh E and Ioannidis S. (2018). Adaptive Caching Networks With Optimality Guarantees. IEEE/ACM Transactions on Networking. 26:2. (737-750). Online publication date: 1-Apr-2018.

    https://doi.org/10.1109/TNET.2018.2793581

  • Shafi J and Waheed A. (2018). S-IoT: A new platform for Online Social Networks Using loT 2018 1st International Conference on Computer Applications & Information Security (ICCAIS). 10.1109/CAIS.2018.8441970. 978-1-5386-4427-0. (1-6).

    https://ieeexplore.ieee.org/document/8441970/

  • Clemente G, Fattore M and Grassi R. (2017). Structural comparisons of networks and model-based detection of small-worldness. Journal of Economic Interaction and Coordination. 10.1007/s11403-017-0202-7. 13:1. (117-141). Online publication date: 1-Apr-2018.

    http://link.springer.com/10.1007/s11403-017-0202-7

  • Liu R, Liang J, Gao W and Yu R. (2018). Privacy-based recommendation mechanism in mobile participatory sensing systems using crowdsourced users preferences. Future Generation Computer Systems. 80:C. (76-88). Online publication date: 1-Mar-2018.

    https://doi.org/10.1016/j.future.2017.08.055

  • Zhou Z, Zhao D, Liu L and Hung P. (2018). Energy-aware composition for wireless sensor networks as a service. Future Generation Computer Systems. 80:C. (299-310). Online publication date: 1-Mar-2018.

    https://doi.org/10.1016/j.future.2017.02.050

  • Han L, Liu S, Han S, Jia W and Lei J. (2018). Owner based malware discrimination. Future Generation Computer Systems. 80:C. (496-504). Online publication date: 1-Mar-2018.

    https://doi.org/10.1016/j.future.2016.05.020

  • Suresh G, Chakraborty A and Manoj B. (2018). Deterministic Evolution Through Indexed Leaf Node Based Attachment in Complex Networks 2018 Twenty Fourth National Conference on Communications (NCC). 10.1109/NCC.2018.8599918. 978-1-5386-1224-8. (1-6).

    https://ieeexplore.ieee.org/document/8599918/

  • Spivak A, Razumovskiy A, Nasonov D, Boukhanovsky A and Redice A. (2018). Storage tier-aware replicative data reorganization with prioritization for efficient workload processing. Future Generation Computer Systems. 79:P2. (618-629). Online publication date: 1-Feb-2018.

    https://doi.org/10.1016/j.future.2017.04.010

  • Wickramasinghe S, Onyerikwu O, Sun J, ben-Avraham D and Diaz-Guilera A. (2018). Modeling Spatial Social Complex Networks for Dynamical Processes. Complexity. 2018. Online publication date: 1-Jan-2018.

    https://doi.org/10.1155/2018/1428719

  • Liu Q, Xiao H, Qiu X and Yu L. Impact of Social Interaction on the Capacity of Hybrid Wireless Networks. IEEE Access. 10.1109/ACCESS.2018.2866416. 6. (46683-46694).

    https://ieeexplore.ieee.org/document/8444620/

  • Khomami M, Rezvanian A and Meybodi M. (2018). A new cellular learning automata-based algorithm for community detection in complex social networks. Journal of Computational Science. 10.1016/j.jocs.2017.10.009. 24. (413-426). Online publication date: 1-Jan-2018.

    https://linkinghub.elsevier.com/retrieve/pii/S1877750317302119

  • Huang H, Chen X, Wu Q, Huang X and Shen J. (2018). Bitcoin-based fair payments for outsourcing computations of fog devices. Future Generation Computer Systems. 78:P2. (850-858). Online publication date: 1-Jan-2018.

    https://doi.org/10.1016/j.future.2016.12.016

  • Casalicchio E, Cardellini V, Interino G and Palmirani M. (2018). Research challenges in legal-rule and QoS-aware cloud service brokerage. Future Generation Computer Systems. 78:P1. (211-223). Online publication date: 1-Jan-2018.

    https://doi.org/10.1016/j.future.2016.11.025

  • Fernndez Anta A, Georgiou C, Kowalski D and Zavou E. (2018). Competitive analysis of fundamental scheduling algorithms on a fault-prone machine and the impact of resource augmentation. Future Generation Computer Systems. 78:P1. (245-256). Online publication date: 1-Jan-2018.

    https://doi.org/10.1016/j.future.2016.05.042

  • da Rosa Righi R, de Quadros Gomes R, Rodrigues V, da Costa C, Alberti A, Pilla L and Navaux P. (2018). MigPF. Future Generation Computer Systems. 78:P1. (272-286). Online publication date: 1-Jan-2018.

    https://doi.org/10.1016/j.future.2016.05.004

  • Khadangi E, Bagheri A and Zarean A. (2017). Empirical analysis of structural properties, macroscopic and microscopic evolution of various Facebook activity networks. Quality & Quantity. 10.1007/s11135-016-0465-4. 52:1. (249-275). Online publication date: 1-Jan-2018.

    http://link.springer.com/10.1007/s11135-016-0465-4

  • Raj P. M. K, Mohan A and Srinivasa K. (2018). Small World Phenomena. Practical Social Network Analysis with Python. 10.1007/978-3-319-96746-2_4. (57-85).

    http://link.springer.com/10.1007/978-3-319-96746-2_4

  • Ponomarenko A, Utkina I and Batsyn M. (2018). A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search. Computational Aspects and Applications in Large-Scale Networks. 10.1007/978-3-319-96247-4_14. (197-203).

    http://link.springer.com/10.1007/978-3-319-96247-4_14

  • Dimitrov D, Helic D and Strohmaier M. (2018). Tag-Based Navigation and Visualization. Social Information Access. 10.1007/978-3-319-90092-6_6. (181-212).

    http://link.springer.com/10.1007/978-3-319-90092-6_6

  • Boczkowski L, Guinard B, Korman A, Lotker Z and Renault M. (2018). Random Walks with Multiple Step Lengths. LATIN 2018: Theoretical Informatics. 10.1007/978-3-319-77404-6_14. (174-186).

    http://link.springer.com/10.1007/978-3-319-77404-6_14

  • Ni C, Lin Y, Gao J and Gu X. (2018). Network Alignment by Discrete Ollivier-Ricci Flow. Graph Drawing and Network Visualization. 10.1007/978-3-030-04414-5_32. (447-462).

    https://link.springer.com/10.1007/978-3-030-04414-5_32

  • Bockholt M and Zweig K. (2018). Paths in Complex Networks. Encyclopedia of Social Network Analysis and Mining. 10.1007/978-1-4939-7131-2_110183. (1766-1776).

    http://link.springer.com/10.1007/978-1-4939-7131-2_110183

  • Datta A. (2018). Load Balancing in Peer-to-Peer Overlay Networks. Encyclopedia of Database Systems. 10.1007/978-1-4614-8265-9_1043. (2105-2111).

    http://link.springer.com/10.1007/978-1-4614-8265-9_1043

  • Li C, Wong F, Liu Z and Kanade V. From which world is your graph?. Proceedings of the 31st International Conference on Neural Information Processing Systems. (1468-1478).

    /doi/10.5555/3294771.3294911

  • Lamprecht D, Strohmaier M and Helic D. (2017). A method for evaluating discoverability and navigability of recommendation algorithms. Computational Social Networks. 10.1186/s40649-017-0045-3. 4:1. Online publication date: 1-Dec-2017.

    http://computationalsocialnetworks.springeropen.com/articles/10.1186/s40649-017-0045-3

  • Wax A, DeChurch L and Contractor N. (2017). Self-Organizing Into Winning Teams: Understanding the Mechanisms That Drive Successful Collaborations. Small Group Research. 10.1177/1046496417724209. 48:6. (665-718). Online publication date: 1-Dec-2017.

    https://journals.sagepub.com/doi/10.1177/1046496417724209

  • Qin Y, Guo D, Cheng G, Zhang D and Luo L. (2017). WSWDC: VLC Enabled Wireless Small-World Data Centers 2017 IEEE 23rd International Conference on Parallel and Distributed Systems (ICPADS). 10.1109/ICPADS.2017.00075. 978-1-5386-2129-5. (529-536).

    https://ieeexplore.ieee.org/document/8368404/

  • Tato G, Bertier M and Tedeschi C. (2017). Designing Overlay Networks for Decentralized Clouds 2017 IEEE International Conference on Cloud Computing Technology and Science (CloudCom). 10.1109/CloudCom.2017.64. 978-1-5386-0692-6. (391-396).

    http://ieeexplore.ieee.org/document/8241137/

  • Arora V and Ventresca M. (2017). Action-based Modeling of Complex Networks. Scientific Reports. 10.1038/s41598-017-05444-4. 7:1. Online publication date: 1-Dec-2017.

    http://www.nature.com/articles/s41598-017-05444-4

  • Qin Z, Gan X, Wang J, Fu L and Wang X. Capacity of Social-Aware Wireless Networks With Directional Antennas. IEEE Transactions on Communications. 10.1109/TCOMM.2017.2737982. 65:11. (4831-4844).

    http://ieeexplore.ieee.org/document/8007232/

  • Zhao H, Yao Q, Kwok J and Lee D. (2017). Collaborative Filtering with Social Local Models 2017 IEEE International Conference on Data Mining (ICDM). 10.1109/ICDM.2017.74. 978-1-5386-3835-4. (645-654).

    https://ieeexplore.ieee.org/document/8215537/

  • Dzida D. (2017). Using complex networks in social impact models. Computer Science and Mathematical Modelling. 10.5604/01.3001.0010.5519. 0:0. (17-28). Online publication date: 18-Oct-2017.

    http://isi-wat.publisherspanel.com/gicid/01.3001.0010.5519

  • Jingnan L, Pengfei L and Kai L. (2017). Research on UAV communication network topology based on small world network model 2017 IEEE International Conference on Unmanned Systems (ICUS). 10.1109/ICUS.2017.8278386. 978-1-5386-3107-2. (444-447).

    http://ieeexplore.ieee.org/document/8278386/

  • Yang Y, Pei J and Al-Barakati A. (2017). Measuring in-network node similarity based on neighborhoods. Knowledge and Information Systems. 53:1. (43-70). Online publication date: 1-Oct-2017.

    https://doi.org/10.1007/s10115-017-1033-5

  • Sun G, Liao D, Li H, Yu H and Chang V. (2017). L2P2. Future Generation Computer Systems. 74:C. (375-384). Online publication date: 1-Sep-2017.

    https://doi.org/10.1016/j.future.2016.08.023

  • Qiang W, Chen F, Yang L and Jin H. (2017). MUC. Future Generation Computer Systems. 74:C. (254-264). Online publication date: 1-Sep-2017.

    https://doi.org/10.1016/j.future.2015.12.003

  • Ma X, Lu H, Gan Z and Zeng J. (2017). An explicit trust and distrust clustering based collaborative filtering recommendation approach. Electronic Commerce Research and Applications. 25:C. (29-39). Online publication date: 1-Sep-2017.

    https://doi.org/10.1016/j.elerap.2017.06.005

  • Meng X, Meng H and Li T. (2016). Research on the implicit feedback mechanism in peer-to-peer trust models. Peer-to-Peer Networking and Applications. 10.1007/s12083-016-0478-8. 10:5. (1257-1269). Online publication date: 1-Sep-2017.

    http://link.springer.com/10.1007/s12083-016-0478-8

  • Kowshalya A and Valarmathi M. (2017). Trust Management in the Social Internet of Things. Wireless Personal Communications: An International Journal. 96:2. (2681-2691). Online publication date: 1-Sep-2017.

    https://doi.org/10.1007/s11277-017-4319-8

  • Jaradat Y, Huang H, Masoud M and Janoud I. Capacity of Wireless Networks With Directed Energy Links in the Presence of Obstacles. IEEE Transactions on Wireless Communications. 10.1109/TWC.2017.2707487. 16:8. (5273-5283).

    http://ieeexplore.ieee.org/document/7934376/

  • Brinkmann G, Rietveld K and Takes F. (2017). Exploiting GPUs for Fast Force-Directed Visualization of Large-Scale Networks 2017 46th International Conference on Parallel Processing (ICPP). 10.1109/ICPP.2017.47. 978-1-5386-1042-8. (382-391).

    http://ieeexplore.ieee.org/document/8025312/

  • Gera R, Juliano N and Schmitt K. Optimizing Network Discovery with Clever Walks. Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017. (1217-1224).

    https://doi.org/10.1145/3110025.3120961

  • Vaknin D, Danziger M and Havlin S. (2017). Spreading of localized attacks in spatial multiplex networks. New Journal of Physics. 10.1088/1367-2630/aa7b09. 19:7. (073037).

    http://stacks.iop.org/1367-2630/19/i=7/a=073037?key=crossref.7ec425ef83ce8762f7fc2090bbe78c52

  • Bringmann K, Keusch R, Lengler J, Maus Y and Molla A. Greedy Routing and the Algorithmic Small-World Phenomenon. Proceedings of the ACM Symposium on Principles of Distributed Computing. (371-380).

    https://doi.org/10.1145/3087801.3087829

  • Cai T, Liang T and Rakhlin A. On Detection and Structural Reconstruction of Small-World Random Networks. IEEE Transactions on Network Science and Engineering. 10.1109/TNSE.2017.2703102. 4:3. (165-176).

    http://ieeexplore.ieee.org/document/7924316/

  • Yang H, Fu D and Zheng Z. (2017). Factors that influence scope of information dissemination in online social networks and phase transition in process of communication 2017 9th International Conference on Modelling, Identification and Control (ICMIC). 10.1109/ICMIC.2017.8321559. 978-1-5090-6575-2. (776-781).

    http://ieeexplore.ieee.org/document/8321559/

  • Meena Kowshalya A and Valarmathi M. (2017). Trust management for reliable decision making among social objects in the Social Internet of Things. IET Networks. 10.1049/iet-net.2017.0021. 6:4. (75-80). Online publication date: 1-Jul-2017.

    https://onlinelibrary.wiley.com/doi/10.1049/iet-net.2017.0021

  • Olszak A. (2016). HyCube: A distributed hash table based on a variable metric. Peer-to-Peer Networking and Applications. 10.1007/s12083-016-0455-2. 10:4. (954-982). Online publication date: 1-Jul-2017.

    http://link.springer.com/10.1007/s12083-016-0455-2

  • Rachkovskij D. (2017). Distance-Based Index Structures for Fast Similarity Search. Cybernetics and Systems Analysis. 53:4. (636-658). Online publication date: 1-Jul-2017.

    https://doi.org/10.1007/s10559-017-9966-y

  • Wu J. (2017). Uncovering the Useful Structures of Complex Networks in Socially-Rich and Dynamic Environments 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS). 10.1109/ICDCS.2017.129. 978-1-5386-1792-2. (1787-1795).

    http://ieeexplore.ieee.org/document/7980117/

  • Slota G, Rajamanickam S, Devine K and Madduri K. (2017). Partitioning Trillion-Edge Graphs in Minutes 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS). 10.1109/IPDPS.2017.95. 978-1-5386-3914-6. (646-655).

    http://ieeexplore.ieee.org/document/7967155/

  • Tiwari V. (2017). Analysis and detection of fake profile over social network 2017 International Conference on Computing, Communication and Automation (ICCCA). 10.1109/CCAA.2017.8229795. 978-1-5090-6471-7. (175-179).

    http://ieeexplore.ieee.org/document/8229795/

  • Zhang D, Guo H, Yang T and Wu J. (2017). Optical switching based small-world data center network. Computer Communications. 103:C. (153-164). Online publication date: 1-May-2017.

    https://doi.org/10.1016/j.comcom.2017.01.001

  • Truong N, Fujiwara I, Koibuchi M and Nguyen K. (2017). Distributed Shortcut Networks. IEEE Transactions on Parallel and Distributed Systems. 28:4. (989-1001). Online publication date: 1-Apr-2017.

    https://doi.org/10.1109/TPDS.2016.2613043

  • Hou R, Cheng Y, Li J, Sheng M and Lui K. (2017). Capacity of Hybrid Wireless Networks With Long-Range Social Contacts Behavior. IEEE/ACM Transactions on Networking. 25:2. (834-848). Online publication date: 1-Apr-2017.

    https://doi.org/10.1109/TNET.2016.2611606

  • Zuo X and Iamnitchi A. (2016). A Survey of Socially Aware Peer-to-Peer Systems. ACM Computing Surveys. 49:1. (1-28). Online publication date: 31-Mar-2017.

    https://doi.org/10.1145/2894761

  • Jackson M, Rogers B and Zenou Y. (2017). The Economic Consequences of Social-Network Structure. Journal of Economic Literature. 10.1257/jel.20150694. 55:1. (49-95). Online publication date: 1-Mar-2017.

    http://pubs.aeaweb.org/doi/10.1257/jel.20150694

  • Richerzhagen N, Richerzhagen B, Stingl D and Steinmetz R. (2017). The human factor: A simulation environment for networked mobile social applications 2017 International Conference on Networked Systems (NetSys). 10.1109/NetSys.2017.7903955. 978-1-5090-4394-1. (1-8).

    http://ieeexplore.ieee.org/document/7903955/

  • Bhandari A, Gupta A and Das D. Betweenness centrality updation and community detection in streaming graphs using incremental algorithm. Proceedings of the 6th International Conference on Software and Computer Applications. (159-164).

    https://doi.org/10.1145/3056662.3056673

  • Gao J, Li B, Schoenebeck G and Yu F. Engineering agreement. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence. (537-543).

    /doi/10.5555/3298239.3298319

  • Ran Y, Zhang Z, Du H and Zhu Y. (2017). Approximation algorithm for partial positive influence problem in social network. Journal of Combinatorial Optimization. 33:2. (791-802). Online publication date: 1-Feb-2017.

    https://doi.org/10.1007/s10878-016-0005-0

  • Chepoi V, Dragan F and Vaxès Y. Core congestion is inherent in hyperbolic networks. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. (2264-2279).

    /doi/10.5555/3039686.3039835

  • KOTANI H. (2017). EVALUATION OF THE FUNCTION OF LOCAL ASSETS ON SOCIAL NETWORK FORMATION. Journal of Japan Society of Civil Engineers, Ser. D3 (Infrastructure Planning and Management). 10.2208/jscejipm.73.I_19. 73:5. (I_19-I_33).

    https://www.jstage.jst.go.jp/article/jscejipm/73/5/73_I_19/_article/-char/ja/

  • Figueiredo D and Garetto M. On the Emergence of Shortest Paths by Reinforced Random Walks. IEEE Transactions on Network Science and Engineering. 10.1109/TNSE.2016.2618063. 4:1. (55-69).

    http://ieeexplore.ieee.org/document/7593357/

  • Qayum M, Badawy A and Cook J. (2017). StAdHyTM: A Statically Adaptive Hybrid Transactional Memory: A scalability study on large parallel graphs 2017 IEEE 7th Annual Computing and Communication Workshop and Conference (CCWC). 10.1109/CCWC.2017.7868398. 978-1-5090-4228-9. (1-7).

    http://ieeexplore.ieee.org/document/7868398/

  • He Y, Wang C and Jiang C. Mining Coherent Topics With Pre-Learned Interest Knowledge in Twitter. IEEE Access. 10.1109/ACCESS.2017.2696558. 5. (10515-10525).

    http://ieeexplore.ieee.org/document/7941989/

  • Tang K, Song P and Chen X. 3D Object Recognition in Cluttered Scenes With Robust Shape Description and Correspondence Selection. IEEE Access. 10.1109/ACCESS.2017.2658681. 5. (1833-1845).

    http://ieeexplore.ieee.org/document/7843593/

  • Gao J, Schoenebeck G and Yu F. (2017). Cascades and Myopic Routing in Nonhomogeneous Kleinberg’s Small World Model. Web and Internet Economics. 10.1007/978-3-319-71924-5_27. (383-394).

    https://link.springer.com/10.1007/978-3-319-71924-5_27

  • van der Hofstad R. (2017). Counting Graphs and Null Models of Complex Networks: Configuration Model and Extensions. Graph-Theoretic Concepts in Computer Science. 10.1007/978-3-319-68705-6_1. (1-17).

    http://link.springer.com/10.1007/978-3-319-68705-6_1

  • Hoyos A, Ruiz U, Tellez E and Chavez E. (2017). Self-indexed Motion Planning. Similarity Search and Applications. 10.1007/978-3-319-68474-1_15. (220-233).

    http://link.springer.com/10.1007/978-3-319-68474-1_15

  • Lamprecht D, Strohmaier M and Helic D. (2017). A Method for Evaluating the Navigability of Recommendation Algorithms. Complex Networks & Their Applications V. 10.1007/978-3-319-50901-3_20. (247-259).

    http://link.springer.com/10.1007/978-3-319-50901-3_20

  • Datta A. (2017). Load Balancing in Peer-to-Peer Overlay Networks. Encyclopedia of Database Systems. 10.1007/978-1-4899-7993-3_1043-2. (1-7).

    http://link.springer.com/10.1007/978-1-4899-7993-3_1043-2

  • Bockholt M and Zweig K. (2017). Paths in Complex Networks. Encyclopedia of Social Network Analysis and Mining. 10.1007/978-1-4614-7163-9_110183-1. (1-11).

    http://link.springer.com/10.1007/978-1-4614-7163-9_110183-1

  • Abraham I, Delling D, Fiat A, Goldberg A and Werneck R. (2016). Highway Dimension and Provably Efficient Shortest Path Algorithms. Journal of the ACM. 63:5. (1-26). Online publication date: 20-Dec-2016.

    https://doi.org/10.1145/2985473

  • Nitti M, Pilloni V and Giusto D. (2016). Searching the social Internet of Things by exploiting object similarity 2016 IEEE 3rd World Forum on Internet of Things (WF-IoT). 10.1109/WF-IoT.2016.7845506. 978-1-5090-4130-5. (371-376).

    http://ieeexplore.ieee.org/document/7845506/

  • Akiba T, Nakamura K and Takaguchi T. (2016). Fractality of Massive Graphs: Scalable Analysis with Sketch-Based Box-Covering Algorithm 2016 IEEE 16th International Conference on Data Mining (ICDM). 10.1109/ICDM.2016.0088. 978-1-5090-5473-2. (769-774).

    http://ieeexplore.ieee.org/document/7837901/

  • Qin J, Zhu H, Zhu Y, Yu J, Xue G, Qian S and Li M. (2016). On Unified Mobile Sensing Data Gathering with Urban Vehicular Networks GLOBECOM 2016 - 2016 IEEE Global Communications Conference. 10.1109/GLOCOM.2016.7842064. 978-1-5090-1328-9. (1-6).

    http://ieeexplore.ieee.org/document/7842064/

  • Qin Z, Gan X, Shen M, Wang X and Tian X. (2016). Capacity of Wireless Networks with Social Behavior and Directional Antennas GLOBECOM 2016 - 2016 IEEE Global Communications Conference. 10.1109/GLOCOM.2016.7841651. 978-1-5090-1328-9. (1-6).

    http://ieeexplore.ieee.org/document/7841651/

  • Veiga J, Expósito R, Taboada G and Touriño J. (2016). Flame-MR. Future Generation Computer Systems. 65:C. (46-56). Online publication date: 1-Dec-2016.

    https://doi.org/10.1016/j.future.2016.06.006

  • Takes F and Heemskerk E. (2016). Centrality in the global network of corporate control. Social Network Analysis and Mining. 10.1007/s13278-016-0402-5. 6:1. Online publication date: 1-Dec-2016.

    http://link.springer.com/10.1007/s13278-016-0402-5

  • Zhai E, Li Z, Li Z, Wu F and Chen G. (2016). Resisting tag spam by leveraging implicit user behaviors. Proceedings of the VLDB Endowment. 10:3. (241-252). Online publication date: 1-Nov-2016.

    https://doi.org/10.14778/3021924.3021939

  • Biswas P, Mishra A, Mackey S, Cansever D, Patel M, Panettieri B, Ramanathan R and Basu P. (2016). Smallworld routing for tactical networks MILCOM 2016 - 2016 IEEE Military Communications Conference (MILCOM). 10.1109/MILCOM.2016.7795430. 978-1-5090-3781-0. (817-822).

    http://ieeexplore.ieee.org/document/7795430/

  • Liang Ma , Srivatsa M, Cansever D, Yan X, Kase S and Vanni M. (2016). Decentralized search in expert networks: Generic models and performance bounds 2016 IEEE 24th International Conference on Network Protocols (ICNP). 10.1109/ICNP.2016.7784416. 978-1-5090-3281-5. (1-10).

    http://ieeexplore.ieee.org/document/7784416/

  • Arnaboldi V, La Gala M, Passarella A and Conti M. (2015). Information diffusion in distributed OSN: The impact of trusted relationships. Peer-to-Peer Networking and Applications. 10.1007/s12083-015-0395-2. 9:6. (1195-1208). Online publication date: 1-Nov-2016.

    http://link.springer.com/10.1007/s12083-015-0395-2

  • Zhang J, Yu P, Lv Y and Zhan Q. Information Diffusion at Workplace. Proceedings of the 25th ACM International on Conference on Information and Knowledge Management. (1673-1682).

    https://doi.org/10.1145/2983323.2983848

  • Ma L, Srivatsa M, Cansever D, Yan X, Kase S and Vanni M. Query Answering Efficiency in Expert Networks Under Decentralized Search. Proceedings of the 25th ACM International on Conference on Information and Knowledge Management. (2119-2124).

    https://doi.org/10.1145/2983323.2983652

  • Han F, Suri S and Yan X. (2016). Observability of Lattice Graphs. Algorithmica. 76:2. (474-489). Online publication date: 1-Oct-2016.

    https://doi.org/10.1007/s00453-015-0049-z

  • Singer Y. (2016). Influence maximization through adaptive seeding. ACM SIGecom Exchanges. 15:1. (32-59). Online publication date: 6-Sep-2016.

    https://doi.org/10.1145/2994501.2994503

  • Huang S, Fan C and Tseng Y. (2016). Enabled/disabled predicate encryption in clouds. Future Generation Computer Systems. 62:C. (148-160). Online publication date: 1-Sep-2016.

    https://doi.org/10.1016/j.future.2015.12.008

  • Khor S. (2016). Comparing local search paths with global search paths on protein residue networks: allosteric communication. Journal of Complex Networks. 10.1093/comnet/cnw020. (cnw020).

    https://academic.oup.com/comnet/article-lookup/doi/10.1093/comnet/cnw020

  • Zheng K, Zhang J, Yao S, Wu W, Wang X and Peng C. (2016). Impacts of Social Relationships and Inhomogeneous Node Distribution on the Network Performance. IEEE Transactions on Wireless Communications. 15:8. (5467-5479). Online publication date: 1-Aug-2016.

    https://doi.org/10.1109/TWC.2016.2560170

  • Wong F, Liu Z, Chiang M, Ming Fai Wong F, Zhenming Liu and Mung Chiang . (2016). On the Efficiency of Social Recommender Networks. IEEE/ACM Transactions on Networking. 24:4. (2512-2524). Online publication date: 1-Aug-2016.

    https://doi.org/10.1109/TNET.2015.2475616

  • Qin Y, Jia R, Zhang J, Wu W, Wang X, Yi Qin , Riheng Jia , Jinbei Zhang , Weijie Wu and Xinbing Wang . (2016). Impact of Social Relation and Group Size in Multicast Ad Hoc Networks. IEEE/ACM Transactions on Networking. 24:4. (1989-2004). Online publication date: 1-Aug-2016.

    https://doi.org/10.1109/TNET.2015.2437955

  • Kong X, Xu Z, Shen G, Wang J, Yang Q and Zhang B. (2016). Urban traffic congestion estimation and prediction based on floating car trajectory data. Future Generation Computer Systems. 61:C. (97-107). Online publication date: 1-Aug-2016.

    https://doi.org/10.1016/j.future.2015.11.013

  • Alamdari S. Brief Announcement. Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. (51-53).

    https://doi.org/10.1145/2933057.2933067

  • Gao J, Ghasemiesfeh G, Schoenebeck G and Yu F. General Threshold Model for Social Cascades. Proceedings of the 2016 ACM Conference on Economics and Computation. (617-634).

    https://doi.org/10.1145/2940716.2940778

  • Schoenebeck G, Snook A and Yu F. Sybil Detection Using Latent Network Structure. Proceedings of the 2016 ACM Conference on Economics and Computation. (739-756).

    https://doi.org/10.1145/2940716.2940747

  • (2016). Enhancing the navigability in a social network of smart objects. Computer Networks: The International Journal of Computer and Telecommunications Networking. 103:C. (1-14). Online publication date: 5-Jul-2016.

    https://doi.org/10.1016/j.comnet.2016.03.007

  • Pengfei Z and Dongzhi H. (2016). Searching in Navigable Small-World Network 2016 3rd International Conference on Information Science and Control Engineering (ICISCE). 10.1109/ICISCE.2016.236. 978-1-5090-2535-0. (1094-1099).

    http://ieeexplore.ieee.org/document/7726333/

  • Ioannidis S and Yeh E. (2016). Adaptive Caching Networks with Optimality Guarantees. ACM SIGMETRICS Performance Evaluation Review. 44:1. (113-124). Online publication date: 30-Jun-2016.

    https://doi.org/10.1145/2964791.2901467

  • Malkov Y, Ponomarenko A and Hayasaka S. (2016). Growing Homophilic Networks Are Natural Navigable Small Worlds. PLOS ONE. 10.1371/journal.pone.0158162. 11:6. (e0158162).

    http://dx.plos.org/10.1371/journal.pone.0158162

  • Ioannidis S and Yeh E. Adaptive Caching Networks with Optimality Guarantees. Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science. (113-124).

    https://doi.org/10.1145/2896377.2901467

  • Chen C, Vitenberg R and Jacobsen H. OMen. Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems. (105-116).

    https://doi.org/10.1145/2933267.2933305

  • Li A and Pan Y. Structural Information and Dynamical Complexity of Networks. IEEE Transactions on Information Theory. 10.1109/TIT.2016.2555904. 62:6. (3290-3339).

    http://ieeexplore.ieee.org/document/7456290/

  • Chakraborty A, B. S. V and Manoj B. Analytical Identification of Anchor Nodes in a Small-World Network. IEEE Communications Letters. 10.1109/LCOMM.2016.2554117. 20:6. (1215-1218).

    http://ieeexplore.ieee.org/document/7452549/

  • Ma L, Srivatsa M, Cansever D, Yan X, Kase S and Vanni M. (2016). On the Efficiency of Decentralized Search in Expert Networks 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS). 10.1109/ICDCS.2016.22. 978-1-5090-1483-5. (733-734).

    http://ieeexplore.ieee.org/document/7536576/

  • Khor S. (2015). Protein residue networks from a local search perspective. Journal of Complex Networks. 10.1093/comnet/cnv014. 4:2. (245-278). Online publication date: 1-Jun-2016.

    https://academic.oup.com/comnet/article-lookup/doi/10.1093/comnet/cnv014

  • Broniatowski D and Moses J. (2016). Measuring Flexibility, Descriptive Complexity, and Rework Potential in Generic System Architectures. Systems Engineering. 19:3. (207-221). Online publication date: 1-May-2016.

    https://doi.org/10.1002/sys.21351

  • Yuan X, Wei Z, Feng Z, Zhang Q and Li W. (2016). Throughput scaling laws of hybrid wireless networks with proximity preference 2016 IEEE Wireless Communications and Networking Conference (WCNC). 10.1109/WCNC.2016.7564887. 978-1-4673-9814-5. (1-6).

    http://ieeexplore.ieee.org/document/7564887/

  • Chandekar P and Chopra S. (2016). A collaborative trust based model for peer to peer system 2016 International Conference on Computing, Communication and Automation (ICCCA). 10.1109/CCAA.2016.7813827. 978-1-5090-1666-2. (747-752).

    http://ieeexplore.ieee.org/document/7813827/

  • Roos S and Strufe T. (2016). Dealing with Dead Ends. ACM Transactions on Modeling and Performance Evaluation of Computing Systems. 1:1. (1-30). Online publication date: 31-Mar-2016.

    https://doi.org/10.1145/2809779

  • Khomami M, Rezvanian A and Meybodi M. (2016). Distributed learning automata-based algorithm for community detection in complex networks. International Journal of Modern Physics B. 10.1142/S0217979216500429. 30:08. (1650042). Online publication date: 30-Mar-2016.

    http://www.worldscientific.com/doi/abs/10.1142/S0217979216500429

  • Bonato A, Janssen J and Roshanbin E. (2015). How to Burn a Graph. Internet Mathematics. 10.1080/15427951.2015.1103339. 12:1-2. (85-100). Online publication date: 3-Mar-2016.

    http://www.internetmathematicsjournal.com/article/1599

  • Cotroneo D, Paudice A and Pecchia A. (2016). Automated root cause identification of security alerts. Future Generation Computer Systems. 56:C. (375-387). Online publication date: 1-Mar-2016.

    https://doi.org/10.1016/j.future.2015.09.009

  • Paranjape A, West R, Zia L and Leskovec J. Improving Website Hyperlink Structure Using Server Logs. Proceedings of the Ninth ACM International Conference on Web Search and Data Mining. (615-624).

    https://doi.org/10.1145/2835776.2835832

  • Chen C, Jacobsen H and Vitenberg R. (2016). Algorithms based on divide and conquer for topic-based publish/subscribe overlay design. IEEE/ACM Transactions on Networking. 24:1. (422-436). Online publication date: 1-Feb-2016.

    https://doi.org/10.1109/TNET.2014.2369346

  • Chen S, Wang G and Jia W. (2016). Cluster-group based trusted computing for mobile social networks using implicit social behavioral graph. Future Generation Computer Systems. 55:C. (391-400). Online publication date: 1-Feb-2016.

    https://doi.org/10.1016/j.future.2014.06.005

  • Holzbauer B, Szymanski B, Nguyen T and Pentland A. Social Ties as Predictors of Economic Development. Proceedings of the 12th International Conference and School on Advances in Network Science - Volume 9564. (178-185).

    https://doi.org/10.1007/978-3-319-28361-6_15

  • Banerjee S. (2016). A Biologically Inspired Model of Distributed Online Communication Supporting Efficient Search and Diffusion of Innovation. Interdisciplinary Description of Complex Systems. 10.7906/indecs.14.1.2. 14:1. (10-22).

    http://indecs.eu/index.php?s=x&y=2016&p=10-22

  • Qu Chen , Jiang-Hai Qian , Liang Zhu and Ding-Ding Han . (2016). OPTIMAL TEMPORAL PATH ON SPATIAL DECAYING NETWORKS. Journal of Applied Analysis & Computation. 10.11948/2016003. 6:1. (30-37).

    http://www.jaac-online.com/article/doi/10.11948/2016003

  • Chen Z, Zhu K and Ying L. Detecting Multiple Information Sources in Networks under the SIR Model. IEEE Transactions on Network Science and Engineering. 10.1109/TNSE.2016.2523804. 3:1. (17-31).

    http://ieeexplore.ieee.org/document/7395374/

  • (2016). References. Malware Diffusion Models for Wireless Complex Networks. 10.1016/B978-0-12-802714-1.00025-6. (283-292).

    https://linkinghub.elsevier.com/retrieve/pii/B9780128027141000256

  • Zweig K. (2016). Random Graphs and Network Models. Network Analysis Literacy. 10.1007/978-3-7091-0741-6_6. (149-181).

    http://link.springer.com/10.1007/978-3-7091-0741-6_6

  • Zweig K. (2016). Literacy Interpretation. Network Analysis Literacy. 10.1007/978-3-7091-0741-6_14. (431-474).

    http://link.springer.com/10.1007/978-3-7091-0741-6_14

  • Zweig K. (2016). Literacy: Choosing the Best Null Model. Network Analysis Literacy. 10.1007/978-3-7091-0741-6_13. (395-429).

    http://link.springer.com/10.1007/978-3-7091-0741-6_13

  • Zweig K. (2016). Literacy: When Is a Network Model Explanatory?. Network Analysis Literacy. 10.1007/978-3-7091-0741-6_12. (363-393).

    http://link.springer.com/10.1007/978-3-7091-0741-6_12

  • Lin S, Jia L, Wang Y, Qin Y and Li M. (2016). Reliability Study of Bogie System of High-Speed Train Based on Complex Networks Theory. Proceedings of the 2015 International Conference on Electrical and Information Technologies for Rail Transportation. 10.1007/978-3-662-49370-0_12. (117-124).

    http://link.springer.com/10.1007/978-3-662-49370-0_12

  • Ludu A. (2016). Networks and Their Boundaries. Boundaries of a Complex World. 10.1007/978-3-662-49078-5_7. (211-227).

    http://link.springer.com/10.1007/978-3-662-49078-5_7

  • Ludu A. (2016). Introduction. Boundaries of a Complex World. 10.1007/978-3-662-49078-5_1. (3-7).

    http://link.springer.com/10.1007/978-3-662-49078-5_1

  • van Engelen J, Boekhout H and Takes F. (2016). Explainable and Efficient Link Prediction in Real-World Network Data. Advances in Intelligent Data Analysis XV. 10.1007/978-3-319-46349-0_26. (295-307).

    http://link.springer.com/10.1007/978-3-319-46349-0_26

  • Chen W, Li Q, Sun X and Zhang J. (2016). The Routing of Complex Contagion in Kleinberg’s Small-World Networks. Computing and Combinatorics. 10.1007/978-3-319-42634-1_25. (307-318).

    http://link.springer.com/10.1007/978-3-319-42634-1_25

  • Coltzau H and Kubek M. (2016). User-Triggered Structural Changes in OSN-Alike Distributed Content Networks. Recent Advances in Information and Communication Technology 2016. 10.1007/978-3-319-40415-8_2. (7-15).

    http://link.springer.com/10.1007/978-3-319-40415-8_2

  • de Nigris S and Leoncini X. (2016). Hidden dimensions in an Hamiltonian system on networks. Complex Motions and Chaos in Nonlinear Systems. 10.1007/978-3-319-28764-5_6. (173-202).

    http://link.springer.com/10.1007/978-3-319-28764-5_6

  • Malkhi D. (2016). P2P. Encyclopedia of Algorithms. 10.1007/978-1-4939-2864-4_272. (1491-1497).

    http://link.springer.com/10.1007/978-1-4939-2864-4_272

  • Abu-Ata M and Dragan F. (2016). Metric tree-like structures in real-world networks. Networks. 67:1. (49-68). Online publication date: 1-Jan-2016.

    https://doi.org/10.1002/net.21631

  • Sutcliffe A, Wang D and Dunbar R. (2015). Modelling the Role of Trust in Social Relationships. ACM Transactions on Internet Technology. 15:4. (1-24). Online publication date: 14-Dec-2015.

    https://doi.org/10.1145/2815620

  • Jiang W, Wu J and Wang G. (2015). On Selecting Recommenders for Trust Evaluation in Online Social Networks. ACM Transactions on Internet Technology. 15:4. (1-21). Online publication date: 14-Dec-2015.

    https://doi.org/10.1145/2807697

  • Ros S, Canelles Á, Pérez M, Mármol F and Pérez G. (2015). Chasing Offensive Conduct in Social Networks. ACM Transactions on Internet Technology. 15:4. (1-20). Online publication date: 14-Dec-2015.

    https://doi.org/10.1145/2797139

  • Paul R, Van Roy P and Vlassov V. Interaction between Network Partitioning and Churn in a Self-Healing Structured Overlay Network. Proceedings of the 2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS). (232-241).

    https://doi.org/10.1109/ICPADS.2015.37

  • Achlioptas D and Siminelakis P. Navigability is a Robust Property. Proceedings of the 12th International Workshop on Algorithms and Models for the Web Graph - Volume 9479. (78-91).

    https://doi.org/10.1007/978-3-319-26784-5_7

  • Chen C and Tock Y. Design of Routing Protocols and Overlay Topologies for Topic-based Publish/Subscribe on Small-World Networks. Proceedings of the Industrial Track of the 16th International Middleware Conference. (1-7).

    https://doi.org/10.1145/2830013.2830017

  • Atabati O and Farzad B. (2015). A strategic model for network formation. Computational Social Networks. 10.1186/s40649-014-0008-x. 2:1. Online publication date: 1-Dec-2015.

    http://www.computationalsocialnetworks.com/content/2/1/1

  • Yi Y, Zhang Z, Lin Y and Chen G. (2015). Small-World Topology Can Significantly Improve the Performance of Noisy Consensus in a Complex Network. The Computer Journal. 10.1093/comjnl/bxv014. 58:12. (3242-3254). Online publication date: 1-Dec-2015.

    https://academic.oup.com/comjnl/article-lookup/doi/10.1093/comjnl/bxv014

  • Leonesi S. (2015). The mystery of the six degrees of separation, part II: navigability and small worlds. Lettera Matematica. 10.1007/s40329-015-0096-y. 3:4. (215-220). Online publication date: 1-Dec-2015.

    http://link.springer.com/10.1007/s40329-015-0096-y

  • Lv Q, Yi Y and Zhang Z. (2015). Corona graphs as a model of small-world networks. Journal of Statistical Mechanics: Theory and Experiment. 10.1088/1742-5468/2015/11/P11024. 2015:11. (P11024).

    https://iopscience.iop.org/article/10.1088/1742-5468/2015/11/P11024

  • Parnandi A, Karappa V, Lan T, Shahin M, McKechnie J, Ballard K, Ahmed B and Gutierrez-Osuna R. (2015). Development of a Remote Therapy Tool for Childhood Apraxia of Speech. ACM Transactions on Accessible Computing. 7:3. (1-23). Online publication date: 14-Nov-2015.

    https://doi.org/10.1145/2776895

  • Oh U, Branham S, Findlater L and Kane S. (2015). Audio-Based Feedback Techniques for Teaching Touchscreen Gestures. ACM Transactions on Accessible Computing. 7:3. (1-29). Online publication date: 14-Nov-2015.

    https://doi.org/10.1145/2764917

  • Tapolcai J, Retvari G, Babarczi P, Berczi-Kovacs E, Kristof P and Enyedi G. (2015). Scalable and Efficient Multipath Routing: Complexity and Algorithms 2015 IEEE 23rd International Conference on Network Protocols (ICNP). 10.1109/ICNP.2015.44. 978-1-4673-8295-3. (376-385).

    https://ieeexplore.ieee.org/document/7437145/

  • Louati A, El Haddad J and Pinson S. Trust-Based Coalition Formation for Dynamic Service Composition in Social Networks. Proceedings, Part I, of the 16th International Conference on Web Information Systems Engineering --- WISE 2015 - Volume 9418. (570-585).

    https://doi.org/10.1007/978-3-319-26190-4_38

  • Lamprecht D, Geigl F, Karas T, Walk S, Helic D and Strohmaier M. Improving recommender system navigability through diversification. Proceedings of the 15th International Conference on Knowledge Technologies and Data-driven Business. (1-8).

    https://doi.org/10.1145/2809563.2809603

  • He Y, Wang C and Jiang C. Discovering Canonical Correlations between Topical and Topological Information in Document Networks. Proceedings of the 24th ACM International on Conference on Information and Knowledge Management. (1281-1290).

    https://doi.org/10.1145/2806416.2806518

  • Chen S, Wang G and Jia W. (2015). κ-FuzzyTrust. Information Sciences: an International Journal. 318:C. (123-143). Online publication date: 10-Oct-2015.

    https://doi.org/10.1016/j.ins.2014.09.058

  • Inayat I and Salim S. (2015). A framework to study requirements-driven collaboration among agile teams. Computers in Human Behavior. 51:PB. (1367-1379). Online publication date: 1-Oct-2015.

    https://doi.org/10.1016/j.chb.2014.10.040

  • Sarma A, Dinitz M and Pandurangan G. (2015). Efficient distributed computation of distance sketches in networks. Distributed Computing. 28:5. (309-320). Online publication date: 1-Oct-2015.

    https://doi.org/10.1007/s00446-015-0246-7

  • Leonesi S. (2016). Il mistero dei 6 gradi di separazione: navigabilità e piccoli mondi □ parte II □. Lettera Matematica Pristem. 10.1007/BF03356691. 94:1. (13-17). Online publication date: 1-Oct-2015.

    http://link.springer.com/10.1007/BF03356691

  • Mukhtar N, Baig M and Khan L. Improved trust based key management for end-to-end secure communication in cellular networks. Proceedings of the 8th International Conference on Security of Information and Networks. (68-75).

    https://doi.org/10.1145/2799979.2800014

  • Alkhawaldeh R and Jose J. Experimental Study on Semi-structured Peer-to-Peer Information Retrieval Network. Proceedings of the 6th International Conference on Experimental IR Meets Multilinguality, Multimodality, and Interaction - Volume 9283. (3-14).

    https://doi.org/10.1007/978-3-319-24027-5_1

  • Sagduyu Y, Shi Y and Neema K. Search in Combined Social and Wireless Communication Networks: Delay and Success Analysis. IEEE Transactions on Wireless Communications. 10.1109/TWC.2015.2430857. 14:9. (4972-4980).

    http://ieeexplore.ieee.org/document/7103343/

  • Zhou H, Wu J, Zhao H, Tang S, Chen C and Chen J. Incentive-Driven and Freshness-Aware Content Dissemination in Selfish Opportunistic Mobile Networks. IEEE Transactions on Parallel and Distributed Systems. 10.1109/TPDS.2014.2366474. 26:9. (2493-2505).

    http://ieeexplore.ieee.org/document/6942224/

  • Nasir M, Girdzijauskas S and Kourtellis N. (2015). Socially-aware distributed hash tables for decentralized online social networks 2015 IEEE International Conference on Peer-to-Peer Computing (P2P). 10.1109/P2P.2015.7328524. 978-1-5090-0300-6. (1-10).

    http://ieeexplore.ieee.org/document/7328524/

  • Malatras A. (2015). State-of-the-art survey on P2P overlay networks in pervasive computing environments. Journal of Network and Computer Applications. 10.1016/j.jnca.2015.04.014. 55. (1-23). Online publication date: 1-Sep-2015.

    https://linkinghub.elsevier.com/retrieve/pii/S1084804515000879

  • Cartledge C and Nelson M. (2015). When should I make preservation copies of myself?. International Journal on Digital Libraries. 10.1007/s00799-015-0155-1. 16:3-4. (183-205). Online publication date: 1-Sep-2015.

    http://link.springer.com/10.1007/s00799-015-0155-1

  • Dimitrov D, Singer P, Helic D and Strohmaier M. The Role of Structural Information for Designing Navigational User Interfaces. Proceedings of the 26th ACM Conference on Hypertext & Social Media. (59-68).

    https://doi.org/10.1145/2700171.2791025

  • Duwairi R and Alfaqeeh M. RUM Extractor. Proceedings of the 2015 3rd International Conference on Future Internet of Things and Cloud. (709-713).

    https://doi.org/10.1109/FiCloud.2015.116

  • Lamprecht D, Strohmaier M, Helic D, Nyulas C, Tudorache T, Noy N, Musen M and Kuhn W. Using ontologies to model human navigation behavior in information networks: A study based on Wikipedia. Semantic Web. 10.3233/SW-140143. 6:4. (403-422).

    https://www.medra.org/servlet/aliasResolver?alias=iospress&doi=10.3233/SW-140143

  • Li Z, Tang C, Hu J and Chen Z. (2015). Making Tagging Systems Resistant to Tricky Spam Attacks 2015 IEEE 12th Intl Conf on Ubiquitous Intelligence and Computing and 2015 IEEE 12th Intl Conf on Autonomic and Trusted Computing and 2015 IEEE 15th Intl Conf on Scalable Computing and Communications and Its Associated Workshops (UIC-ATC-ScalCom). 10.1109/UIC-ATC-ScalCom-CBDCom-IoP.2015.169. 978-1-4673-7211-4. (871-879).

    http://ieeexplore.ieee.org/document/7518348/

  • Zhang L, Li X, Lei J, Sun J and Liu Y. Mechanism Design for Finding Experts Using Locally Constructed Social Referral Web. IEEE Transactions on Parallel and Distributed Systems. 10.1109/TPDS.2013.117. 26:8. (2316-2326).

    http://ieeexplore.ieee.org/document/6866889/

  • Hojo M, Nagao H, Miyao T and Shudo K. A two-dimensional structured overlay based on flexible routing tables. Proceedings of the 2015 IEEE Symposium on Computers and Communication (ISCC). (289-294).

    https://doi.org/10.1109/ISCC.2015.7405530

  • Avin C, Lotker Z, Nahum Y and Peleg D. Core Size and Densification in Preferential Attachment Networks. Proceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming - Volume 9135. (492-503).

    https://doi.org/10.1007/978-3-662-47666-6_39

  • Hu J, Yang L and Hanzo L. Distributed Multistage Cooperative-Social-Multicast-Aided Content Dissemination in Random Mobile Networks. IEEE Transactions on Vehicular Technology. 10.1109/TVT.2014.2354295. 64:7. (3075-3089).

    http://ieeexplore.ieee.org/document/6891363/

  • Nushi B, Alonso O, Hentschel M and Kandylas V. CrowdSTAR. Proceedings of the 15th International Conference on Engineering the Web in the Big Data Era - Volume 9114. (219-230).

    https://doi.org/10.1007/978-3-319-19890-3_15

  • Christensen H, Rudzicz F, Portet F and Alexandersson J. (2015). Perspectives on Speech and Language Interaction for Daily Assistive Technology. ACM Transactions on Accessible Computing. 6:3. (1-3). Online publication date: 7-Jun-2015.

    https://doi.org/10.1145/2756765

  • Martínez D, Lleida E, Green P, Christensen H, Ortega A and Miguel A. (2015). Intelligibility Assessment and Speech Recognizer Word Accuracy Rate Prediction for Dysarthric Speakers in a Factor Analysis Subspace. ACM Transactions on Accessible Computing. 6:3. (1-21). Online publication date: 7-Jun-2015.

    https://doi.org/10.1145/2746405

  • Mazhari S, Fakhrahmad S and Sadeghbeygi H. (2015). A user-profile-based friendship recommendation solution in social networks. Journal of Information Science. 10.1177/0165551515569651. 41:3. (284-295). Online publication date: 1-Jun-2015.

    http://journals.sagepub.com/doi/10.1177/0165551515569651

  • Chaikalis T and Chatzigeorgiou A. Forecasting Java Software Evolution Trends Employing Network Models. IEEE Transactions on Software Engineering. 10.1109/TSE.2014.2381249. 41:6. (582-602).

    http://ieeexplore.ieee.org/document/6985636/

  • Shen H, Lin Y and Li J. (2015). A social-network-aided efficient peer-to-peer live streaming system. IEEE/ACM Transactions on Networking. 23:3. (987-1000). Online publication date: 1-Jun-2015.

    https://doi.org/10.1109/TNET.2014.2311431

  • Mokhtarian K and Jacobsen H. (2015). Minimum-delay multicast algorithms for mesh overlays. IEEE/ACM Transactions on Networking. 23:3. (973-986). Online publication date: 1-Jun-2015.

    https://doi.org/10.1109/TNET.2014.2310735

  • Karbasi A, Ioannidis S and Massoulie L. From Small-World Networks to Comparison-Based Search. IEEE Transactions on Information Theory. 10.1109/TIT.2015.2418284. 61:6. (3056-3074).

    http://ieeexplore.ieee.org/document/7078845/

  • Nitti M, Atzori L and Cvijikj I. Friendship Selection in the Social Internet of Things: Challenges and Possible Strategies. IEEE Internet of Things Journal. 10.1109/JIOT.2014.2384734. 2:3. (240-247).

    http://ieeexplore.ieee.org/document/6994231/

  • Militano L, Nitti M, Atzori L and Iera A. (2015). Using a distributed Shapley-value based approach to ensure navigability in a social network of smart objects 2015 IEEE International Conference on Signal Processing for Communications (ICC). 10.1109/ICC.2015.7248402. 978-1-4673-6432-4. (692-697).

    http://ieeexplore.ieee.org/document/7248402/

  • Abraham I, Bartal Y and Neiman O. (2015). Local Embeddings of Metric Spaces. Algorithmica. 72:2. (539-606). Online publication date: 1-Jun-2015.

    https://doi.org/10.1007/s00453-013-9864-2

  • West R, Paranjape A and Leskovec J. Mining Missing Hyperlinks from Human Navigation Traces. Proceedings of the 24th International Conference on World Wide Web. (1242-1252).

    https://doi.org/10.1145/2736277.2741666

  • Yang Z and Chen W. A Game Theoretic Model for the Formation of Navigable Small-World Networks. Proceedings of the 24th International Conference on World Wide Web. (1329-1339).

    https://doi.org/10.1145/2736277.2741110

  • Wong F, Liu Z and Chiang M. (2015). On the efficiency of social recommender networks IEEE INFOCOM 2015 - IEEE Conference on Computer Communications. 10.1109/INFOCOM.2015.7218619. 978-1-4799-8381-0. (2317-2325).

    http://ieeexplore.ieee.org/document/7218619/

  • Roos S and Strufe T. (2015). On the impossibility of efficient self-stabilization in virtual overlays with churn IEEE INFOCOM 2015 - IEEE Conference on Computer Communications. 10.1109/INFOCOM.2015.7218394. 978-1-4799-8381-0. (298-306).

    http://ieeexplore.ieee.org/document/7218394/

  • Aoyama K, Ogawa A, Hattori T and Hori T. (2015). Double-layer neighborhood graph based similarity search for fast query-by-example spoken term detection ICASSP 2015 - 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). 10.1109/ICASSP.2015.7178966. 978-1-4673-6997-8. (5216-5220).

    http://ieeexplore.ieee.org/document/7178966/

  • Miller C and Connolly R. (2015). Introduction to the Special Issue on Web Development. ACM Transactions on Computing Education. 15:1. (1-5). Online publication date: 4-Mar-2015.

    https://doi.org/10.1145/2724759

  • Zhang Y and Dang Y. (2015). Investigating Essential Factors on Students' Perceived Accomplishment and Enjoyment and Intention to Learn in Web Development. ACM Transactions on Computing Education. 15:1. (1-21). Online publication date: 4-Mar-2015.

    https://doi.org/10.1145/2700515

  • Park T, Dorn B and Forte A. (2015). An Analysis of HTML and CSS Syntax Errors in a Web Development Course. ACM Transactions on Computing Education. 15:1. (1-21). Online publication date: 4-Mar-2015.

    https://doi.org/10.1145/2700514

  • Alston P, Walsh D and Westhead G. (2015). Uncovering “Threshold Concepts” in Web Development: An Instructor Perspective. ACM Transactions on Computing Education. 15:1. (1-18). Online publication date: 4-Mar-2015.

    https://doi.org/10.1145/2700513

  • Ahsan M, Singh T and Kumari M. (2015). Influential node detection in social network during community detection 2015 International Conference on Cognitive Computing and Information Processing (CCIP). 10.1109/CCIP.2015.7100737. 978-1-4799-7171-8. (1-6).

    http://ieeexplore.ieee.org/document/7100737/

  • Das Sarma A, Molla A and Pandurangan G. (2015). Efficient random walk sampling in distributed networks. Journal of Parallel and Distributed Computing. 77:C. (84-94). Online publication date: 1-Mar-2015.

    https://doi.org/10.1016/j.jpdc.2015.01.002

  • Tetarave S, Tripathy S and Peri S. S-Gossip. Proceedings of the 11th International Conference on Distributed Computing and Internet Technology - Volume 8956. (288-298).

    https://doi.org/10.1007/978-3-319-14977-6_28

  • Nazi A, Zhou Z, Thirumuruganathan S, Zhang N and Das G. (2015). Walk, not wait. Proceedings of the VLDB Endowment. 8:6. (678-689). Online publication date: 1-Feb-2015.

    https://doi.org/10.14778/2735703.2735707

  • Ebrahimi R, Gao J, Ghasemiesfeh G and Schoenebeck G. Complex Contagions in Kleinberg's Small World Model. Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science. (63-72).

    https://doi.org/10.1145/2688073.2688110

  • Ramezanian R and Emdadi A. (2015). Simulation of Skulduggery in a Multi-Agent System. International Journal of Agent Technologies and Systems. 7:1. (17-31). Online publication date: 1-Jan-2015.

    https://doi.org/10.4018/ijats.2015010102

  • Hu J, Yang L, Poor H and Hanzo L. Bridging the Social and Wireless Networking Divide: Information Dissemination in Integrated Cellular and Opportunistic Networks. IEEE Access. 10.1109/ACCESS.2015.2477307. 3. (1809-1848).

    https://ieeexplore.ieee.org/document/7268759/

  • Hexmoor H. (2015). Ubiquity of Networks. Computational Network Science. 10.1016/B978-0-12-800891-1.00001-9. (1-14).

    https://linkinghub.elsevier.com/retrieve/pii/B9780128008911000019

  • Vora M and Mirnalinee T. (2015). Small-World Particle Swarm Optimizer for Real-World Optimization Problems. Artificial Intelligence and Evolutionary Algorithms in Engineering Systems. 10.1007/978-81-322-2126-5_51. (465-472).

    https://link.springer.com/10.1007/978-81-322-2126-5_51

  • Zhang K and Shen X. (2015). Health Data Sharing with Misbehavior Detection. Security and Privacy for Mobile Healthcare Networks. 10.1007/978-3-319-24717-5_4. (47-80).

    http://link.springer.com/10.1007/978-3-319-24717-5_4

  • Li J. (2015). A Multi-round Global Performance Evaluation Method for Interactive Image Retrieval. Web-Age Information Management. 10.1007/978-3-319-21042-1_13. (161-168).

    https://link.springer.com/10.1007/978-3-319-21042-1_13

  • (2014). Network Topologies: Basic Models and Properties. Fundamentals of Complex Networks. 10.1002/9781118718124.ch3. (103-136). Online publication date: 30-Dec-2015.

    https://onlinelibrary.wiley.com/doi/10.1002/9781118718124.ch3

  • Dabirmoghaddam A and Garcia-Luna-Aceves J. (2014). Proximity-driven social interactions and their impact on the throughput scaling of wireless networks 2014 IEEE International Performance Computing and Communications Conference (IPCCC). 10.1109/PCCC.2014.7017074. 978-1-4799-7575-4. (1-10).

    http://ieeexplore.ieee.org/document/7017074/

  • Korzun D and Gurtov A. (2013). Hierarchical architectures in structured peer-to-peer overlay networks. Peer-to-Peer Networking and Applications. 10.1007/s12083-013-0200-z. 7:4. (359-395). Online publication date: 1-Dec-2014.

    http://link.springer.com/10.1007/s12083-013-0200-z

  • Antoniadis K, Zafiropoulos K and Vrana V. Exploring potential communities of followers in governmental Twitter accounts of EU countries. Proceedings of the 2014 Conference on Electronic Governance and Open Society: Challenges in Eurasia. (167-174).

    https://doi.org/10.1145/2729104.2729108

  • Szüle J, Kondor D, Dobos L, Csabai I, Vattay G and Garcia-Ojalvo J. (2014). Lost in the City: Revisiting Milgram's Experiment in the Age of Social Networks. PLoS ONE. 10.1371/journal.pone.0111973. 9:11. (e111973).

    https://dx.plos.org/10.1371/journal.pone.0111973

  • Li F, Liu B, Xiao Z and Fu Y. Detecting and Defending against Sybil Attacks in Social Networks. Proceedings of the 2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications. (104-112).

    https://doi.org/10.1109/BWCCA.2014.67

  • Hao F, Min G, Lin M, Luo C and Yang L. MobiFuzzyTrust: An Efficient Fuzzy Trust Inference Mechanism in Mobile Social Networks. IEEE Transactions on Parallel and Distributed Systems. 10.1109/TPDS.2013.309. 25:11. (2944-2955).

    http://ieeexplore.ieee.org/document/6684155/

  • Ferrara E, De Meo P, Fiumara G and Baumgartner R. (2014). Web data extraction, applications and techniques. Knowledge-Based Systems. 70:C. (301-323). Online publication date: 1-Nov-2014.

    https://doi.org/10.1016/j.knosys.2014.07.007

  • Fu L, Zhang J and Wang X. Evolution-Cast: Temporal Evolution in Wireless Social Networks and Its Impact on Capacity. IEEE Transactions on Parallel and Distributed Systems. 10.1109/TPDS.2013.237. 25:10. (2583-2594).

    http://ieeexplore.ieee.org/document/6604392/

  • Zhang K, Liang X, Lu R and Shen X. Sybil Attacks and Their Defenses in the Internet of Things. IEEE Internet of Things Journal. 10.1109/JIOT.2014.2344013. 1:5. (372-383).

    http://ieeexplore.ieee.org/document/6868197/

  • Tian G, Duan Z, Baumeister T and Dong Y. (2014). Reroute on loop in anonymous peer-to-peer content sharing networks 2014 IEEE Conference on Communications and Network Security (CNS). 10.1109/CNS.2014.6997510. 978-1-4799-5890-0. (409-417).

    http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6997510

  • Cartledge C and Nelson M. When should I make preservation copies of myself?. Proceedings of the 14th ACM/IEEE-CS Joint Conference on Digital Libraries. (1-10).

    /doi/10.5555/2740769.2740771

  • Vukašinović V, Šilc J and Škrekovski R. (2014). Modeling acquaintance networks based on balance theory. International Journal of Applied Mathematics and Computer Science. 24:3. (683-696). Online publication date: 1-Sep-2014.

    https://doi.org/10.2478/amcs-2014-0050

  • Gu Y, Liu W, Yao Y and Song J. Fast Routing in Location-Based Social Networks Leveraging Check-in Data. Proceedings of the 2014 IEEE International Conference on Internet of Things(iThings), and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom). (428-435).

    https://doi.org/10.1109/iThings.2014.77

  • Cartledge C and Nelson M. (2014). When should i make preservation copies of myself? 2014 IEEE/ACM Joint Conference on Digital Libraries (JCDL). 10.1109/JCDL.2014.6970143. 978-1-4799-5569-5. (1-10).

    http://ieeexplore.ieee.org/document/6970143/

  • Malkov Y, Ponomarenko A, Logvinov A and Krylov V. (2014). Approximate nearest neighbor algorithm based on navigable small world graphs. Information Systems. 10.1016/j.is.2013.10.006. 45. (61-68). Online publication date: 1-Sep-2014.

    https://linkinghub.elsevier.com/retrieve/pii/S0306437913001300

  • Takes F and Kosters W. Adaptive Landmark Selection Strategies for Fast Shortest Path Computation in Large Real-World Graphs. Proceedings of the 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) - Volume 01. (27-34).

    https://doi.org/10.1109/WI-IAT.2014.13

  • Fraigniaud P and Giakkoupis G. (2014). Greedy routing in small-world networks with power-law degrees. Distributed Computing. 27:4. (231-253). Online publication date: 1-Aug-2014.

    https://doi.org/10.1007/s00446-014-0210-y

  • Teixeira F and Shanahan M. (2014). Does plasticity promote criticality? 2014 International Joint Conference on Neural Networks (IJCNN). 10.1109/IJCNN.2014.6889562. 978-1-4799-1484-5. (2383-2390).

    http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6889562

  • Symeonidis P and Tiakas E. (2014). Transitive node similarity. World Wide Web. 17:4. (743-776). Online publication date: 1-Jul-2014.

    https://doi.org/10.1007/s11280-013-0228-2

  • Delling D, Goldberg A, Savchenko R and Werneck R. Hub Labels. Proceedings of the 13th International Symposium on Experimental Algorithms - Volume 8504. (259-270).

    https://doi.org/10.1007/978-3-319-07959-2_22

  • Tadayon N, Zonouz A, Aïssa S and Xing L. (2014). Cost‐effective design and evaluation of wireless sensor networks using topology‐planning methods in small‐world context. IET Wireless Sensor Systems. 10.1049/iet-wss.2013.0078. 4:2. (43-53). Online publication date: 1-Jun-2014.

    https://onlinelibrary.wiley.com/doi/10.1049/iet-wss.2013.0078

  • Botón-Fernández M, Prieto-Castrillo F and Vega-Rodríguez M. (2014). A self-adaptive resources selection model through a small-world based heuristic. The Journal of Supercomputing. 68:3. (1441-1461). Online publication date: 1-Jun-2014.

    https://doi.org/10.1007/s11227-014-1100-6

  • Lee J and Quek T. (2014). Device-to-Device Communication in Wireless Mobile Social Networks 2014 IEEE Vehicular Technology Conference (VTC 2014-Spring). 10.1109/VTCSpring.2014.7022879. 978-1-4799-4482-8. (1-5).

    http://ieeexplore.ieee.org/document/7022879/

  • Helic D. (2014). Regular equivalence in informed network search 2014 37th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO). 10.1109/MIPRO.2014.6859731. 978-953-233-077-9. (1088-1093).

    http://ieeexplore.ieee.org/document/6859731/

  • Aoyama K, Ogawa A, Hattori T, Hori T and Nakamura A. (2014). Zero-resource spoken term detection using hierarchical graph-based similarity search ICASSP 2014 - 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). 10.1109/ICASSP.2014.6854976. 978-1-4799-2893-4. (7093-7097).

    http://ieeexplore.ieee.org/document/6854976/

  • Bayir M and Demirbas M. (2014). On the fly learning of mobility profiles for routing in pocket switched networks. Ad Hoc Networks. 16. (13-27). Online publication date: 1-May-2014.

    https://doi.org/10.1016/j.adhoc.2013.11.011

  • Kutty S, Nayak R and Chen L. (2014). A people-to-people matching system using graph mining techniques. World Wide Web. 17:3. (311-349). Online publication date: 1-May-2014.

    https://doi.org/10.1007/s11280-013-0202-z

  • Wang Y, Yao S, Li J, Xia Z, Yan H and Xu J. ReSpam. Proceedings of the 2014 IEEE 8th International Symposium on Service Oriented System Engineering. (338-343).

    https://doi.org/10.1109/SOSE.2014.49

  • Hu J, Yang L and Hanzo L. (2014). Throughput and delay analysis of wireless multicast in distributed mobile social networks based on geographic social relationships 2014 IEEE Wireless Communications and Networking Conference (WCNC). 10.1109/WCNC.2014.6952555. 978-1-4799-3083-8. (1874-1879).

    http://ieeexplore.ieee.org/document/6952555/

  • Huang H, Jaradat Y, Misra S and Tourani R. Towards Achieving Linear Capacity Scaling in Wireless Networks through Directed Energy Links. IEEE Transactions on Wireless Communications. 10.1109/TWC.2014.030614.130330. 13:4. (1806-1814).

    http://ieeexplore.ieee.org/document/6775368/

  • Dabirmoghaddam A and Garcia-Luna-Aceves J. (2014). Scaling properties of random networks under proximity-based social relations IEEE INFOCOM 2014 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). 10.1109/INFCOMW.2014.6849340. 978-1-4799-3088-3. (843-848).

    http://ieeexplore.ieee.org/document/6849340/

  • Meier D, Pignolet Y, Schmid S and Wattenhofer R. (2014). On the Windfall and price of friendship. Computer Networks: The International Journal of Computer and Telecommunications Networking. 62. (221-236). Online publication date: 1-Apr-2014.

    https://doi.org/10.1016/j.bjp.2013.12.004

  • Hallé S, Breton G, Maronnaud F, Massé A and Gaboury S. Exhaustive Exploration of Ajax Web Applications with Selective Jumping. Proceedings of the 2014 IEEE International Conference on Software Testing, Verification, and Validation Workshops. (243-252).

    https://doi.org/10.1109/ICSTW.2014.26

  • Nitti M, Atzori L and Cvijikj I. (2014). Network navigability in the social Internet of Things 2014 IEEE World Forum on Internet of Things (WF-IoT). 10.1109/WF-IoT.2014.6803200. 978-1-4799-3459-1. (405-410).

    http://ieeexplore.ieee.org/document/6803200/

  • Yueli Zhang and Marbach P. (2014). Microscopic generative models for complex networks 2014 48th Annual Conference on Information Sciences and Systems (CISS). 10.1109/CISS.2014.6814136. 978-1-4799-3001-2. (1-6).

    http://ieeexplore.ieee.org/document/6814136/

  • Yang S, Mo S and Zhu X. (2014). An empirical study of the financial community network on Twitter 2014 IEEE Conference on Computational Intelligence for Financial Engineering & Economics (CIFEr). 10.1109/CIFEr.2014.6924054. 978-1-4799-2380-9. (55-62).

    http://ieeexplore.ieee.org/document/6924054/

  • Quattrone G, Mashhadi A, Quercia D, Smith-Clarke C and Capra L. Modelling growth of urban crowd-sourced information. Proceedings of the 7th ACM international conference on Web search and data mining. (563-572).

    https://doi.org/10.1145/2556195.2556244

  • Scaria A, Philip R, West R and Leskovec J. The last click. Proceedings of the 7th ACM international conference on Web search and data mining. (213-222).

    https://doi.org/10.1145/2556195.2556232

  • Zhong E, Fan W and Yang Q. (2014). User behavior learning and transfer in composite social networks. ACM Transactions on Knowledge Discovery from Data. 8:1. (1-32). Online publication date: 1-Feb-2014.

    https://doi.org/10.1145/2556613

  • Maiya A and Berger-Wolf T. (2013). Expansion and decentralized search in complex networks. Knowledge and Information Systems. 10.1007/s10115-012-0596-4. 38:2. (469-490). Online publication date: 1-Feb-2014.

    http://link.springer.com/10.1007/s10115-012-0596-4

  • Gupta R, Roughgarden T and Seshadhri C. Decompositions of triangle-dense graphs. Proceedings of the 5th conference on Innovations in theoretical computer science. (471-482).

    https://doi.org/10.1145/2554797.2554840

  • Marin E and Carvalho C. Search in Social Networks. Proceedings of the 2014 47th Hawaii International Conference on System Sciences. (1586-1595).

    https://doi.org/10.1109/HICSS.2014.203

  • Dietzfelbinger M and Woelfel P. Tight lower bounds for greedy routing in higher-dimensional small-world grids. Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms. (816-829).

    /doi/10.5555/2634074.2634134

  • WARASHINA T, AOYAMA K, SAWADA H and HATTORI T. (2014). Efficient K-Nearest Neighbor Graph Construction Using MapReduce for Large-Scale Data Sets. IEICE Transactions on Information and Systems. 10.1587/transinf.2014EDP7108. E97.D:12. (3142-3154).

    https://www.jstage.jst.go.jp/article/transinf/E97.D/12/E97.D_2014EDP7108/_article

  • Luo L, Fang J and Huang H. (2014). A Study of How the Watts‐Strogatz Model Relates to an Economic System’s Utility. Mathematical Problems in Engineering. 10.1155/2014/693743. 2014:1. Online publication date: 1-Jan-2014.

    https://onlinelibrary.wiley.com/doi/10.1155/2014/693743

  • Kamel K, Al Aghbari Z and Kamel I. (2014). Realistic team formation using navigation and homophily 2014 International Conference on Big Data and Smart Computing (BIGCOMP). 10.1109/BIGCOMP.2014.6741436. 978-1-4799-3919-0. (197-203).

    http://ieeexplore.ieee.org/document/6741436/

  • Levy M and Goldenberg J. (2014). The gravitational law of social interaction. Physica A: Statistical Mechanics and its Applications. 10.1016/j.physa.2013.08.067. 393. (418-426). Online publication date: 1-Jan-2014.

    https://linkinghub.elsevier.com/retrieve/pii/S0378437113008170

  • Gomes A and da Graça Campos Pimentel M. (2014). Evaluation of Media-Based Social Interactions: Linking Collective Actions to Media Types, Applications, and Devices in Social Networks. Online Collective Action. 10.1007/978-3-7091-1340-0_5. (75-95).

    https://link.springer.com/10.1007/978-3-7091-1340-0_5

  • Sarkar R. (2014). Geometric Methods of Information Storage and Retrieval in Sensor Networks. The Art of Wireless Sensor Networks. 10.1007/978-3-642-40009-4_14. (465-493).

    https://link.springer.com/10.1007/978-3-642-40009-4_14

  • Bonato A, Janssen J and Roshanbin E. (2014). Burning a Graph as a Model of Social Contagion. Algorithms and Models for the Web Graph. 10.1007/978-3-319-13123-8_2. (13-22).

    http://link.springer.com/10.1007/978-3-319-13123-8_2

  • Atabati O and Farzad B. (2014). Social and Economic Network Formation: A Dynamic Model. Combinatorial Optimization and Applications. 10.1007/978-3-319-12691-3_43. (581-592).

    https://link.springer.com/10.1007/978-3-319-12691-3_43

  • Roos S, Schiller B, Hacker S and Strufe T. (2014). Measuring Freenet in the Wild: Censorship-Resilience under Observation. Privacy Enhancing Technologies. 10.1007/978-3-319-08506-7_14. (263-282).

    http://link.springer.com/10.1007/978-3-319-08506-7_14

  • Chen Y and Chang C. (2014). A Short Note on Derandomization of Perfect Target Set Selection. Proceedings of the 2nd International Conference on Intelligent Technologies and Engineering Systems (ICITES2013). 10.1007/978-3-319-04573-3_59. (477-481).

    http://link.springer.com/10.1007/978-3-319-04573-3_59

  • Yu S and Kak S. (2014). Social Network Dynamics: An Attention Economics Perspective. Social Networks: A Framework of Computational Intelligence. 10.1007/978-3-319-02993-1_11. (225-258).

    https://link.springer.com/10.1007/978-3-319-02993-1_11

  • Xu W, Wu W, Fan L, Lu Z and Du D. (2014). Influence Diffusion in Social Networks. Optimization in Science and Engineering. 10.1007/978-1-4939-0808-0_27. (567-581).

    https://link.springer.com/10.1007/978-1-4939-0808-0_27

  • Bonato A and Chung F. (2013). Complex Networks. Handbook of Graph Theory, Second Edition. 10.1201/b16132-86. (1456-1476). Online publication date: 16-Dec-2013.

    http://www.crcnetbase.com/doi/abs/10.1201/b16132-86

  • Gabow H. (2013). Searching. Handbook of Graph Theory, Second Edition. 10.1201/b16132-71. (1174-1206). Online publication date: 16-Dec-2013.

    http://www.crcnetbase.com/doi/abs/10.1201/b16132-71

  • Wei W, Xu F, Tan C and Li Q. (2013). SybilDefender. IEEE Transactions on Parallel and Distributed Systems. 24:12. (2492-2502). Online publication date: 1-Dec-2013.

    https://doi.org/10.1109/TPDS.2013.9

  • Heymendran J and De Zoysa T. (2013). XMPP based data abstraction layer for smart phone sensors 2013 IEEE 8th International Conference on Industrial and Information Systems (ICIIS). 10.1109/ICIInfS.2013.6732034. 978-1-4799-0910-0. (495-500).

    http://ieeexplore.ieee.org/document/6732034/

  • Çavuşoğlu A and Türker İ. (2013). Scientific collaboration network of Turkey. Chaos, Solitons & Fractals. 10.1016/j.chaos.2013.07.022. 57. (9-18). Online publication date: 1-Dec-2013.

    https://linkinghub.elsevier.com/retrieve/pii/S0960077913001549

  • Perez C, Birregah B and Lemercier M. (2013). A smartphone-based online social network trust evaluation system. Social Network Analysis and Mining. 10.1007/s13278-013-0138-4. 3:4. (1293-1310). Online publication date: 1-Dec-2013.

    http://link.springer.com/10.1007/s13278-013-0138-4

  • Wagaman A. (2013). Graph construction and random graph generation for modeling protein structures. Statistical Analysis and Data Mining: The ASA Data Science Journal. 10.1002/sam.11203. 6:6. (482-495). Online publication date: 1-Dec-2013.

    https://onlinelibrary.wiley.com/doi/10.1002/sam.11203

  • Takes F and Kosters W. Mining User-Generated Path Traversal Patterns in an Information Network. Proceedings of the 2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) - Volume 01. (284-289).

    https://doi.org/10.1109/WI-IAT.2013.41

  • Bilò V, Celi A, Flammini M and Gallotti V. (2013). Social context congestion games. Theoretical Computer Science. 514. (21-35). Online publication date: 1-Nov-2013.

    https://doi.org/10.1016/j.tcs.2012.10.041

  • Huang Y, Shen C and Contractor N. (2013). Distance matters. Decision Support Systems. 55:4. (969-977). Online publication date: 1-Nov-2013.

    https://doi.org/10.1016/j.dss.2013.01.006

  • (2013). References. Evolutionary Dynamics of Complex Communications Networks. 10.1201/b15505-12. (267-276). Online publication date: 16-Oct-2013.

    http://www.crcnetbase.com/doi/abs/10.1201/b15505-12

  • Giakkoupis G, Kermarrec A and Woelfel P. Gossip Protocols for Renaming and Sorting. Proceedings of the 27th International Symposium on Distributed Computing - Volume 8205. (194-208).

    https://doi.org/10.1007/978-3-642-41527-2_14

  • Jain P, Jain P and Kumaraguru P. Call me maybe. Proceedings of the first ACM conference on Online social networks. (101-106).

    https://doi.org/10.1145/2512938.2512959

  • Cohen E, Delling D, Fuchs F, Goldberg A, Goldszmidt M and Werneck R. Scalable similarity estimation in social networks. Proceedings of the first ACM conference on Online social networks. (131-142).

    https://doi.org/10.1145/2512938.2512944

  • Shiting Hu , Li Yu , Qiuming Liu and Peng Yang . (2013). Throughput capacity of wireless networks with social features 2013 International Conference on Wireless Communications and Signal Processing (WCSP). 10.1109/WCSP.2013.6677140. 978-1-4799-0308-5. (1-6).

    http://ieeexplore.ieee.org/document/6677140/

  • Nguyen V, Le N, Fujiwara I and Koibuchi M. Distributed Shortcut Networks. Proceedings of the 2013 42nd International Conference on Parallel Processing. (572-581).

    https://doi.org/10.1109/ICPP.2013.71

  • Ažderska T and Jerman-Blažič B. (2012). A Holistic Approach for Designing Human-Centric Trust Systems. Systemic Practice and Action Research. 10.1007/s11213-012-9259-3. 26:5. (417-450). Online publication date: 1-Oct-2013.

    http://link.springer.com/10.1007/s11213-012-9259-3

  • Grassberger P. (2013). Two-Dimensional SIR Epidemics with Long Range Infection. Journal of Statistical Physics. 10.1007/s10955-013-0824-7. 153:2. (289-311). Online publication date: 1-Oct-2013.

    http://link.springer.com/10.1007/s10955-013-0824-7

  • Rutherford A, Cebrian M, Rahwan I, Dsouza S, McInerney J, Naroditskiy V, Venanzi M, Jennings N, deLara J, Wahlstedt E, Miller S and Huerta-Quintanilla R. (2013). Targeted Social Mobilization in a Global Manhunt. PLoS ONE. 10.1371/journal.pone.0074628. 8:9. (e74628).

    http://dx.plos.org/10.1371/journal.pone.0074628

  • Allden N and Harris L. (2013). (2013). Building a positive candidate experience: towards a networked model of e-recruitment. Journal of Business Strategy. 10.1108/JBS-11-2012-0072. 34:5. (36-47). Online publication date: 2-Sep-2013.. Online publication date: 2-Sep-2013.

    https://www.emerald.com/insight/content/doi/10.1108/JBS-11-2012-0072/full/html

  • Ren S, Sheng M and Liu R. (2013). Scalable Random Cooperation Routing protocol for large-scale wireless sensor networks 2013 IEEE 24th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC Workshops). 10.1109/PIMRCW.2013.6707842. 978-1-4799-0122-7. (86-90).

    http://ieeexplore.ieee.org/document/6707842/

  • Kwang-Cheng Chen , Mung Chiang and Poor H. From Technological Networks to Social Networks. IEEE Journal on Selected Areas in Communications. 10.1109/JSAC.2013.SUP.0513049. 31:9. (548-572).

    http://ieeexplore.ieee.org/document/6544549/

  • Wang Y and Shi W. (2013). On service migration in the cloud to facilitate mobile accesses 2013 IEEE International Conference on Cluster Computing (CLUSTER). 10.1109/CLUSTER.2013.6702646. 978-1-4799-0898-1. (1-5).

    http://ieeexplore.ieee.org/document/6702646/

  • Chelmis C and Prasanna V. (2013). An empirical analysis of microblogging behavior in the enterprise. Social Network Analysis and Mining. 10.1007/s13278-013-0110-3. 3:3. (611-633). Online publication date: 1-Sep-2013.

    http://link.springer.com/10.1007/s13278-013-0110-3

  • Lee C, Nick B, Brandes U and Cunningham P. Link prediction with social vector clocks. Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. (784-792).

    https://doi.org/10.1145/2487575.2487615

  • Kiskani M, Sadjadpour H and Guizani M. (2013). Social interaction increases capacity of wireless networks 2013 9th International Wireless Communications and Mobile Computing Conference (IWCMC 2013). 10.1109/IWCMC.2013.6583603. 978-1-4673-2480-9. (467-472).

    http://ieeexplore.ieee.org/document/6583603/

  • Dragan F and Xiang Y. (2012). How to Use Spanning Trees to Navigate in Graphs. Algorithmica. 10.1007/s00453-012-9647-1. 66:3. (479-511). Online publication date: 1-Jul-2013.

    http://link.springer.com/10.1007/s00453-012-9647-1

  • Macko P, Margo D and Seltzer M. Performance introspection of graph databases. Proceedings of the 6th International Systems and Storage Conference. (1-10).

    https://doi.org/10.1145/2485732.2485750

  • Ghasemiesfeh G, Ebrahimi R and Gao J. Complex contagion and the weakness of long ties in social networks. Proceedings of the fourteenth ACM conference on Electronic commerce. (507-524).

    https://doi.org/10.1145/2492002.2482550

  • Ghasemiesfeh G, Ebrahimi R and Gao J. Complex contagion and the weakness of long ties in social networks. Proceedings of the fourteenth ACM conference on Electronic commerce. (507-524).

    https://doi.org/10.1145/2482540.2482550

  • Shen Y, Nguyen N, Xuan Y and Thai M. (2013). On the discovery of critical links and nodes for assessing network vulnerability. IEEE/ACM Transactions on Networking. 21:3. (963-973). Online publication date: 1-Jun-2013.

    https://doi.org/10.1109/TNET.2012.2215882

  • Dabirmoghaddam A and Garcia-Luna-Aceves J. (2013). Opportunistic walks on Random Geometric Networks and their application in scalability analysis 2013 10th Annual IEEE Communications Society Conference on Sensing and Communication in Wireless Networks (SECON). 10.1109/SAHCN.2013.6645028. 978-1-4799-0230-9. (559-567).

    http://ieeexplore.ieee.org/document/6645028/

  • Ghaderi J and Srikant R. (2013). Opinion dynamics in social networks: A local interaction game with stubborn agents 2013 American Control Conference (ACC). 10.1109/ACC.2013.6580126. 978-1-4799-0178-4. (1982-1987).

    http://ieeexplore.ieee.org/document/6580126/

  • Helic D, Strohmaier M, Granitzer M and Scherer R. Models of human navigation in information networks based on decentralized search. Proceedings of the 24th ACM Conference on Hypertext and Social Media. (89-98).

    https://doi.org/10.1145/2481492.2481502

  • Sarkar R, Zhu X and Gao J. (2013). Distributed and compact routing using spatial distributions in wireless sensor networks. ACM Transactions on Sensor Networks. 9:3. (1-20). Online publication date: 1-May-2013.

    https://doi.org/10.1145/2480730.2480735

  • Feng J, Lu Y, Jung B, Peroulis D and Hu Y. (2013). Energy-efficient data dissemination using beamforming in wireless sensor networks. ACM Transactions on Sensor Networks. 9:3. (1-30). Online publication date: 1-May-2013.

    https://doi.org/10.1145/2480730.2480734

  • Klein D, Venkateswaran S, Isaacs J, Burman J, Pham T, Hespanha J and Madhow U. (2013). Localization with sparse acoustic sensor network using UAVs as information-seeking data mules. ACM Transactions on Sensor Networks. 9:3. (1-29). Online publication date: 1-May-2013.

    https://doi.org/10.1145/2480730.2480733

  • Blumrosen G, Hod B, Anker T, Dolev D and Rubinsky B. (2013). Enhancing RSSI-based tracking accuracy in wireless sensor networks. ACM Transactions on Sensor Networks. 9:3. (1-28). Online publication date: 1-May-2013.

    https://doi.org/10.1145/2480730.2480732

  • Tan R, Xing G, Yuan Z, Liu X and Yao J. (2013). System-level calibration for data fusion in wireless sensor networks. ACM Transactions on Sensor Networks. 9:3. (1-27). Online publication date: 1-May-2013.

    https://doi.org/10.1145/2480730.2480731

  • Aoyama K, Ogawa A, Hattori T, Hori T and Nakamura A. (2013). Graph index based query-by-example search on a large speech data set ICASSP 2013 - 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). 10.1109/ICASSP.2013.6639328. 978-1-4799-0356-6. (8520-8524).

    http://ieeexplore.ieee.org/document/6639328/

  • He R, Wang J, Tian J, Chu C, Mauney B and Perisic I. (2013). Session analysis of people search within a professional social network. Journal of the American Society for Information Science and Technology. 10.1002/asi.22814. 64:5. (929-950). Online publication date: 1-May-2013.

    https://onlinelibrary.wiley.com/doi/10.1002/asi.22814

  • Rutherford A, Cebrian M, Dsouza S, Moro E, Pentland A and Rahwan I. (2013). Limits of social mobilization. Proceedings of the National Academy of Sciences. 10.1073/pnas.1216338110. 110:16. (6281-6286). Online publication date: 16-Apr-2013.

    https://pnas.org/doi/full/10.1073/pnas.1216338110

  • Schneider B, Abu-El-Haija S, Reesman J and Pea R. Toward collaboration sensing. Proceedings of the Third International Conference on Learning Analytics and Knowledge. (107-111).

    https://doi.org/10.1145/2460296.2460317

  • Botón-Fernández M, Castrillo F and Vega-Rodríguez M. The small-world phenomenon applied to a self-adaptive resources selection model. Proceedings of the 16th European conference on Applications of Evolutionary Computation. (82-91).

    https://doi.org/10.1007/978-3-642-37192-9_9

  • Grassberger P. (2013). SIR epidemics with long-range infection in one dimension. Journal of Statistical Mechanics: Theory and Experiment. 10.1088/1742-5468/2013/04/P04004. 2013:04. (P04004).

    http://stacks.iop.org/1742-5468/2013/i=04/a=P04004?key=crossref.8e9e81db1a5611fbee083c7439b13502

  • Mokhtarian K and Jacobsen H. (2013). Minimum-delay overlay multicast IEEE INFOCOM 2013 - IEEE Conference on Computer Communications. 10.1109/INFCOM.2013.6566975. 978-1-4673-5946-7. (1771-1779).

    http://ieeexplore.ieee.org/document/6566975/

  • Jin Y, Yi Y, Kesidis G, Kocak F and Shin J. (2013). Hybrid client-server and peer-to-peer caching systems with selfish peers IEEE INFOCOM 2013 - IEEE Conference on Computer Communications. 10.1109/INFCOM.2013.6566972. 978-1-4673-5946-7. (1744-1752).

    http://ieeexplore.ieee.org/document/6566972/

  • Roos S and Strufe T. (2013). A contribution to analyzing and enhancing Darknet routing IEEE INFOCOM 2013 - IEEE Conference on Computer Communications. 10.1109/INFCOM.2013.6566846. 978-1-4673-5946-7. (615-619).

    http://ieeexplore.ieee.org/document/6566846/

  • Buyukkaya E and Abdallah M. Routing over Relaxed Triangulation Structures for P2P-based Virtual Environments. Proceedings of the 2013 27th International Conference on Advanced Information Networking and Applications Workshops. (1167-1173).

    https://doi.org/10.1109/WAINA.2013.142

  • Hofer A, Roos S and Strufe T. Greedy Embedding, Routing and Content Addressing for Darknets. Proceedings of the 2013 Conference on Networked Systems. (43-50).

    https://doi.org/10.1109/NetSys.2013.23

  • Melgar Estrada M and Jimenez R. (2013). Search in power-law node degree networks 2013 IEEE Eleventh International Symposium on Autonomous Decentralized Systems (ISADS). 10.1109/ISADS.2013.6513424. 978-1-4673-5070-9. (1-4).

    http://ieeexplore.ieee.org/document/6513424/

  • GovorčIn J, Knor M and ŠKrekovski R. (2013). Line graph operation and small worlds. Information Processing Letters. 113:5-6. (196-200). Online publication date: 1-Mar-2013.

    https://doi.org/10.1016/j.ipl.2012.12.013

  • Takes F and Kosters W. (2013). Computing the Eccentricity Distribution of Large Graphs. Algorithms. 10.3390/a6010100. 6:1. (100-118).

    https://www.mdpi.com/1999-4893/6/1/100

  • Chen X and Xia J. (2013). Strategy Study on Maximum Degree and Bisection Degree Synchronization Search in Scale-Free Networks. Applied Mechanics and Materials. 10.4028/www.scientific.net/AMM.303-306.2157. 303-306. (2157-2160).

    https://www.scientific.net/AMM.303-306.2157

  • Das Sarma A, Nanongkai D, Pandurangan G and Tetali P. (2013). Distributed Random Walks. Journal of the ACM. 60:1. (1-31). Online publication date: 1-Feb-2013.

    https://doi.org/10.1145/2432622.2432624

  • Nettleton D. (2013). Survey. Computer Science Review. 7. (1-34). Online publication date: 1-Feb-2013.

    https://doi.org/10.1016/j.cosrev.2012.12.001

  • Vincent K, Tauskela J, Mealing G, Thivierge J and Rota R. (2013). Altered Network Communication Following a Neuroprotective Drug Treatment. PLoS ONE. 10.1371/journal.pone.0054478. 8:1. (e54478).

    http://dx.plos.org/10.1371/journal.pone.0054478

  • Abraham I, Chechik S, Kempe D and Slivkins A. Low-distortion inference of latent similarities from a multiplex social network. Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms. (1853-1883).

    /doi/10.5555/2627817.2627949

  • Figueira Á, Devezas J, Cravino N and Revilla L. Creating and Analysing a Social Network Built from Clips of Online News. Information Systems and Technology for Organizations in a Networked Society. 10.4018/978-1-4666-4062-7.ch005. (67-86).

    http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-4666-4062-7.ch005

  • Teuscher C, Gulbahce N, Rohlf T and Goudarzi A. Random Dynamical Network Automata for Nanoelectronics. Industrial Engineering. 10.4018/978-1-4666-1945-6.ch090. (1699-1718).

    http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-4666-1945-6.ch090

  • Vega D, Messeguer R, Ochoa S, Pino J, Freitag F, Medina E and Royo D. (2013). Sharing hardware resources in heterogeneous computer-supported collaboration scenarios. Integrated Computer-Aided Engineering. 20:1. (59-77). Online publication date: 1-Jan-2013.

    https://doi.org/10.3233/ICA-120419

  • Azimdoost B, Sadjadpour H and Garcia-Luna-Aceves J. Capacity of Wireless Networks with Social Behavior. IEEE Transactions on Wireless Communications. 10.1109/TWC.2012.121112.111581. 12:1. (60-69).

    http://ieeexplore.ieee.org/document/6397546/

  • Can A and Bhargava B. (2013). SORT. IEEE Transactions on Dependable and Secure Computing. 10:1. (14-27). Online publication date: 1-Jan-2013.

    https://doi.org/10.1109/TDSC.2012.74

  • Shuo Jia , St. Juste P and Figueiredo R. (2013). A multidimensional heuristic for social routing in peer-to-peer networks 2013 IEEE 10th Consumer Communications and Networking Conference (CCNC). 10.1109/CCNC.2013.6488466. 978-1-4673-3133-3. (329-335).

    http://ieeexplore.ieee.org/document/6488466/

  • Farrahi K, Zia K, Sharpanskykh A, Ferscha A and Muchnik L. (2013). Agent Perception Modeling for Movement in Crowds. Advances on Practical Applications of Agents and Multi-Agent Systems. 10.1007/978-3-642-38073-0_7. (73-84).

    http://link.springer.com/10.1007/978-3-642-38073-0_7

  • Morzy M and Forenc K. (2013). Social Network Analysis on Highly Aggregated Data: What Can We Find?. Advances in Databases and Information Systems. 10.1007/978-3-642-32741-4_18. (195-206).

    https://link.springer.com/10.1007/978-3-642-32741-4_18

  • Collingsworth B and Menezes R. (2013). A Self-organized Approach for Detecting Communities in Networks. Intelligent Distributed Computing VI. 10.1007/978-3-642-32524-3_6. (29-39).

    https://link.springer.com/10.1007/978-3-642-32524-3_6

  • Heyer G. (2013). Soziale Netzwerke und inhaltsbasierte Suchein P2P-Systemen. Die Dynamik sozialer und sprachlicher Netzwerke. 10.1007/978-3-531-93336-8_14. (311-330).

    http://link.springer.com/10.1007/978-3-531-93336-8_14

  • Xu R. (2013). An L p Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model. Algorithms and Models for the Web Graph. 10.1007/978-3-319-03536-9_12. (144-155).

    https://link.springer.com/10.1007/978-3-319-03536-9_12

  • Khoury J and Abdallah C. (2013). On the Feasibility of Dynamic, Efficient, and Scalable Name-Based Discovery Systems. Internet Naming and Discovery. 10.1007/978-1-4471-4552-3_5. (63-79).

    http://link.springer.com/10.1007/978-1-4471-4552-3_5

  • Borgs C, Brautbar M, Chayes J, Khanna S and Lucier B. The power of local information in social networks. Proceedings of the 8th international conference on Internet and Network Economics. (406-419).

    https://doi.org/10.1007/978-3-642-35311-6_30

  • Zhang W, Lau R, Xia Y, Li C and Li W. Latent Business Networks Mining. Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01. (558-562).

    /doi/10.5555/2457524.2457646

  • Wilkinson L, Anand A and Dang T. (2012). Substantial improvements in the set-covering projection classifier CHIRP (composite hypercubes on iterated random projections). ACM Transactions on Knowledge Discovery from Data. 6:4. (1-18). Online publication date: 1-Dec-2012.

    https://doi.org/10.1145/2382577.2382583

  • Chattopadhyay R, Sun Q, Fan W, Davidson I, Panchanathan S and Ye J. (2012). Multisource domain adaptation and its application to early detection of fatigue. ACM Transactions on Knowledge Discovery from Data. 6:4. (1-26). Online publication date: 1-Dec-2012.

    https://doi.org/10.1145/2382577.2382582

  • Chu S and Cheng J. (2012). Triangle listing in massive networks. ACM Transactions on Knowledge Discovery from Data. 6:4. (1-32). Online publication date: 1-Dec-2012.

    https://doi.org/10.1145/2382577.2382581

  • Giordanelli R, Mastroianni C and Meo M. (2012). Bio-Inspired P2P Systems. ACM Transactions on Autonomous and Adaptive Systems. 7:4. (1-28). Online publication date: 1-Dec-2012.

    https://doi.org/10.1145/2382570.2382571

  • Ferrara E. (2012). A large-scale community structure analysis in Facebook. EPJ Data Science. 10.1140/epjds9. 1:1. Online publication date: 1-Dec-2012.

    http://www.epjdatascience.com/content/1/1/9

  • Zhang W, Lau R, Xia Y, Li C and Li W. (2012). Latent Business Networks Mining: A Probabilistic Generative Model 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT). 10.1109/WI-IAT.2012.195. 978-1-4673-6057-9. (558-562).

    http://ieeexplore.ieee.org/document/6511940/

  • Wang J, Xu C and Feng J. (2012). Synchronizability and Navigability of Small-World Networks Generated by One Dimensional Kleinberg Model 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT). 10.1109/WI-IAT.2012.171. 978-1-4673-6057-9. (679-683).

    http://ieeexplore.ieee.org/document/6511962/

  • Azimdoost B and Sadjadpour H. (2012). Capacity of scale free wireless networks GLOBECOM 2012 - 2012 IEEE Global Communications Conference. 10.1109/GLOCOM.2012.6503472. 978-1-4673-0921-9. (2379-2384).

    http://ieeexplore.ieee.org/document/6503472/

  • Lingjun Li , Xinxin Zhao and Guoliang Xue . (2012). Searching in the dark: A framework for authenticating unknown users in online social networks GLOBECOM 2012 - 2012 IEEE Global Communications Conference. 10.1109/GLOCOM.2012.6503197. 978-1-4673-0921-9. (714-719).

    http://ieeexplore.ieee.org/document/6503197/

  • Zonouz A, Tadayon N, Aissa S and Xing L. (2012). Design and evaluation of small-world wireless ad-hoc networks under rayleigh fading GLOBECOM 2012 - 2012 IEEE Global Communications Conference. 10.1109/GLOCOM.2012.6503190. 978-1-4673-0921-9. (670-675).

    http://ieeexplore.ieee.org/document/6503190/

  • Yu S and Kak S. (2012). An empirical study of how users adopt famous entities 2012 International Conference on Future Generation Communication Technology (FGCT). 10.1109/FGCT.2012.6476555. 978-1-4673-5861-3. (64-69).

    http://ieeexplore.ieee.org/document/6476555/

  • Rees B and Gallagher K. (2012). Overlapping community detection using a community optimized graph swarm. Social Network Analysis and Mining. 10.1007/s13278-012-0050-3. 2:4. (405-417). Online publication date: 1-Dec-2012.

    http://link.springer.com/10.1007/s13278-012-0050-3

  • Zhao Y, Feng J and Wang J. On Synchronizability of Kleinberg Small World Networks. Proceedings of the 2012 Eighth International Conference on Computational Intelligence and Security. (204-208).

    https://doi.org/10.1109/CIS.2012.53

  • Chang Y and Kao H. Link Prediction in a Bipartite Network Using Wikipedia Revision Information. Proceedings of the 2012 Conference on Technologies and Applications of Artificial Intelligence. (50-55).

    https://doi.org/10.1109/TAAI.2012.49

  • Atzori L, Iera A, Morabito G and Nitti M. (2012). The Social Internet of Things (SIoT) - When social networks meet the Internet of Things. Computer Networks: The International Journal of Computer and Telecommunications Networking. 56:16. (3594-3608). Online publication date: 1-Nov-2012.

    https://doi.org/10.1016/j.comnet.2012.07.010

  • Shen H, Li Z, Wang H and Li J. Leveraging social network concepts for efficient peer-to-peer live streaming systems. Proceedings of the 20th ACM international conference on Multimedia. (249-258).

    https://doi.org/10.1145/2393347.2393387

  • Stai E, Baras J and Papavassiliou S. A class of backpressure algorithms for networks embedded in hyperbolic space with controllable delay-throughput trade-off. Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems. (15-22).

    https://doi.org/10.1145/2387238.2387244

  • Gao Y and Zhan J. Design of a Recommendation System Based on Top-k Query in a Pure P2P Environment. Proceedings of the 2012 International Conference on Management of e-Commerce and e-Government. (42-47).

    https://doi.org/10.1109/ICMeCG.2012.58

  • Xie Y, Yu F, Ke Q, Abadi M, Gillum E, Vitaldevaria K, Walter J, Huang J and Mao Z. Innocent by association. Proceedings of the 2012 ACM conference on Computer and communications security. (353-364).

    https://doi.org/10.1145/2382196.2382235

  • Gulyás A, Korösi A, Szabó D and Biczók G. (2012). On greedy network formation. ACM SIGMETRICS Performance Evaluation Review. 40:2. (49-52). Online publication date: 8-Oct-2012.

    https://doi.org/10.1145/2381056.2381069

  • Wong F and Marbach P. (2012). Similarity-based network formation 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton). 10.1109/Allerton.2012.6483245. 978-1-4673-4539-2. (394-399).

    http://ieeexplore.ieee.org/document/6483245/

  • Aylward B, Odar C, Kessler E, Canter K and Roberts M. (2012). Six Degrees of Separation: An Exploratory Network Analysis of Mentoring Relationships in Pediatric Psychology. Journal of Pediatric Psychology. 10.1093/jpepsy/jss078. 37:9. (972-979). Online publication date: 1-Oct-2012.. Online publication date: 1-Oct-2012.

    https://academic.oup.com/jpepsy/article-lookup/doi/10.1093/jpepsy/jss078

  • Chatzigeorgiou A, Melas G and Chaikalis T. SEANets. Proceedings of the 2012 IEEE International Conference on Software Maintenance (ICSM). (634-637).

    https://doi.org/10.1109/ICSM.2012.6405341

  • Collingsworth B and Menezes R. SOCIAL. Proceedings of the 2012 IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems. (217-222).

    https://doi.org/10.1109/SASO.2012.28

  • Trattner C, Singer P, Helic D and Strohmaier M. Exploring the differences and similarities between hierarchical decentralized search and human navigation in information networks. Proceedings of the 12th International Conference on Knowledge Management and Knowledge Technologies. (1-8).

    https://doi.org/10.1145/2362456.2362474

  • Strohmaier M, Helic D, Benz D, Körner C and Kern R. (2012). Evaluation of Folksonomy Induction Algorithms. ACM Transactions on Intelligent Systems and Technology. 3:4. (1-22). Online publication date: 1-Sep-2012.

    https://doi.org/10.1145/2337542.2337559

  • Le Q and Panchal J. (2012). Building Smaller Sized Surrogate Models of Complex Bipartite Networks Based on Degree Distributions. IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans. 42:5. (1152-1166). Online publication date: 1-Sep-2012.

    https://doi.org/10.1109/TSMCA.2012.2183589

  • Carminati B, Ferrari E and Perego A. (2012). A multi-layer framework for personalized social tag-based applications. Data & Knowledge Engineering. 79-80. (62-86). Online publication date: 1-Sep-2012.

    https://doi.org/10.1016/j.datak.2012.06.002

  • Datta A. (2012). Merging ring-structured overlay indices: toward network-data transparency. Computing. 10.1007/s00607-012-0201-4. 94:8-10. (783-809). Online publication date: 1-Sep-2012.

    http://link.springer.com/10.1007/s00607-012-0201-4

  • Sharma R and Datta A. A Tunable Graph Model for Incorporating Geographic Spread in Social Graph Models. Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012). (294-301).

    https://doi.org/10.1109/ASONAM.2012.57

  • Raei H, Yazdani N and Asadpour M. A New Algorithm for Positive Influence Dominating Set in Social Networks. Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012). (253-257).

    https://doi.org/10.1109/ASONAM.2012.51

  • M. V, Iyengar S, SM V, Ramesh A, Pandurangan C and Madhavan V. A Navigation Algorithm Inspired by Human Navigation. Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012). (1309-1314).

    https://doi.org/10.1109/ASONAM.2012.225

  • Boldi P and Vigna S. Four Degrees of Separation, Really. Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012). (1222-1227).

    https://doi.org/10.1109/ASONAM.2012.211

  • Chelmis C and Prasanna V. Microblogging in the Enterprise. Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012). (62-70).

    https://doi.org/10.1109/ASONAM.2012.21

  • Ma W, Zhang Y and Meng X. Spread of Behavior in Unstructured Peer-to-Peer Networks. Proceedings of the 2012 International Conference on Computer Science and Service System. (1236-1239).

    https://doi.org/10.1109/CSSS.2012.313

  • Malkov Y, Ponomarenko A, Logvinov A and Krylov V. Scalable distributed algorithm for approximate nearest neighbor search problem in high dimensional general metric spaces. Proceedings of the 5th international conference on Similarity Search and Applications. (132-147).

    https://doi.org/10.1007/978-3-642-32153-5_10

  • Arsuaga-Rios M, Prieto-Castrillo F and Vega-Rodriguez M. Multiobjective Optimization Comparison - MOSWO vs MOGSA - for Solving the Job Scheduling Problem in Grid Environments. Proceedings of the 2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications. (570-575).

    https://doi.org/10.1109/ISPA.2012.85

  • Chen L, Mulvenna M and Quinn D. (2012). Social Network Analysis. International Journal of Ambient Computing and Intelligence. 4:3. (46-58). Online publication date: 1-Jul-2012.

    https://doi.org/10.4018/jaci.2012070104

  • Goth G. (2012). Degrees of separation. Communications of the ACM. 55:7. (13-15). Online publication date: 1-Jul-2012.

    https://doi.org/10.1145/2209249.2209255

  • Banerjee A, Agarwal R, Gauthier V, Yeo C, Afifi H and Lee F. A Self-Organization Framework for Wireless Ad Hoc Networks as Small Worlds. IEEE Transactions on Vehicular Technology. 10.1109/TVT.2012.2197768. 61:6. (2659-2673).

    http://ieeexplore.ieee.org/document/6195032/

  • Das Sarma A, Dinitz M and Pandurangan G. Efficient computation of distance sketches in distributed networks. Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures. (318-326).

    https://doi.org/10.1145/2312005.2312060

  • Helic D, Körner C, Granitzer M, Strohmaier M and Trattner C. Navigational efficiency of broad vs. narrow folksonomies. Proceedings of the 23rd ACM conference on Hypertext and social media. (63-72).

    https://doi.org/10.1145/2309996.2310008

  • Perez C, Birrebgah B and Lemercier M. The Multi-layer Imbrication for Data Leakage Prevention from Mobile Devices. Proceedings of the 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications. (813-819).

    https://doi.org/10.1109/TrustCom.2012.274

  • Schiöberg D, Schneider F, Schiöberg H, Schmid S, Uhlig S and Feldmann A. Tracing the birth of an OSN. Proceedings of the 4th Annual ACM Web Science Conference. (265-274).

    https://doi.org/10.1145/2380718.2380753

  • Backstrom L, Boldi P, Rosa M, Ugander J and Vigna S. Four degrees of separation. Proceedings of the 4th Annual ACM Web Science Conference. (33-42).

    https://doi.org/10.1145/2380718.2380723

  • Cooper C, Frieze A and Prałat P. Some typical properties of the spatial preferred attachment model. Proceedings of the 9th international conference on Algorithms and Models for the Web Graph. (29-40).

    https://doi.org/10.1007/978-3-642-30541-2_3

  • Roos S and Strufe T. Provable Polylog Routing for Darknets. Proceedings of the 2012 32nd International Conference on Distributed Computing Systems Workshops. (140-146).

    https://doi.org/10.1109/ICDCSW.2012.24

  • Rahimian F, Le Nguyen Huu T and Girdzijauskas S. Locality-Awareness in a peer-to-peer publish/subscribe network. Proceedings of the 12th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems. (45-58).

    https://doi.org/10.1007/978-3-642-30823-9_4

  • Chaganty A, Gaur P and Ravindran B. Learning in a small world. Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1. (391-397).

    /doi/10.5555/2343576.2343632

  • Chatzigeorgiou A and Melas G. Trends in object-oriented software evolution: investigating network properties. Proceedings of the 34th International Conference on Software Engineering. (1309-1312).

    /doi/10.5555/2337223.2337403

  • Ziotopoulos A and de Veciana G. (2012). Addressing non-homogeneities in a ubiquitous P2P platform for context exchange 2012 IEEE Thirteenth International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM). 10.1109/WoWMoM.2012.6263743. 978-1-4673-1239-4. (1-6).

    http://ieeexplore.ieee.org/document/6263743/

  • Chatzigeorgiou A and Melas G. (2012). Trends in object-oriented software evolution: Investigating network properties 2012 34th International Conference on Software Engineering (ICSE 2012). 10.1109/ICSE.2012.6227092. 978-1-4673-1066-6. (1309-1312).

    http://ieeexplore.ieee.org/document/6227092/

  • Li A and Peng P. (2012). The small-community phenomenon in networks. Mathematical Structures in Computer Science. 22:3. (373-407). Online publication date: 1-Jun-2012.

    https://doi.org/10.1017/S0960129511000570

  • Kniesburges S, Koutsopoulos A and Scheideler C. A Self-Stabilization Process for Small-World Networks. Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium. (1261-1271).

    https://doi.org/10.1109/IPDPS.2012.115

  • Pan Y. Principles of network computing. Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation. (30-39).

    https://doi.org/10.1007/978-3-642-29952-0_9

  • Peng P. The small community phenomenon in networks. Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation. (40-49).

    https://doi.org/10.1007/978-3-642-29952-0_10

  • Hsiao H and Su H. (2012). On Optimizing Overlay Topologies for Search in Unstructured Peer-to-Peer Networks. IEEE Transactions on Parallel and Distributed Systems. 23:5. (924-935). Online publication date: 1-May-2012.

    https://doi.org/10.1109/TPDS.2011.241

  • Wu S, Yin S and Li M. (2012). A new approach for clustering problem based on binary small world optimization algorithms 2012 IEEE International Conference on Computer Science and Automation Engineering (CSAE). 10.1109/CSAE.2012.6272983. 978-1-4673-0089-6. (412-416).

    http://ieeexplore.ieee.org/document/6272983/

  • Arsuaga-Ríos M, Prieto-Castrillo F and Vega-Rodríguez M. Small-World optimization applied to job scheduling on grid environments from a multi-objective perspective. Proceedings of the 2012t European conference on Applications of Evolutionary Computation. (42-51).

    https://doi.org/10.1007/978-3-642-29178-4_5

  • Mercier A, Occello M and Jamont J. (2012). Using multiagent self-organization techniques for seeking information in virtual social communities. Web Intelligence and Agent Systems. 10:2. (235-246). Online publication date: 1-Apr-2012.

    /doi/10.5555/2589968.2589976

  • Liu Z, Xue K, Hong P and Du Z. (2012). Small World P2P overlay for video sharing service 2012 IEEE Wireless Communications and Networking Conference (WCNC). 10.1109/WCNC.2012.6214361. 978-1-4673-0437-5. (3215-3220).

    http://ieeexplore.ieee.org/document/6214361/

  • Rybicki J, Scheuermann B and Mauve M. (2012). Peer-to-peer data structures for cooperative traffic information systems. Pervasive and Mobile Computing. 8:2. (194-209). Online publication date: 1-Apr-2012.

    https://doi.org/10.1016/j.pmcj.2011.06.002

  • Zhou L and Yan F. The Complexity of Routing Algorithm in Small-World Networks. Proceedings of the 2012 International Conference on Computer Science and Electronics Engineering - Volume 02. (423-427).

    https://doi.org/10.1109/ICCSEE.2012.413

  • Das Sarma A, Molla A and Pandurangan G. (2012). Near-optimal random walk sampling in distributed networks IEEE INFOCOM 2012 - IEEE Conference on Computer Communications. 10.1109/INFCOM.2012.6195727. 978-1-4673-0775-8. (2906-2910).

    http://ieeexplore.ieee.org/document/6195727/

  • Felix Ming , Wong F and Marbach P. (2012). Cosine-neighbourhood-refinement: Towards a robust network formation mechanism IEEE INFOCOM 2012 - IEEE Conference on Computer Communications. 10.1109/INFCOM.2012.6195542. 978-1-4673-0775-8. (1710-1718).

    http://ieeexplore.ieee.org/document/6195542/

  • Gandole Y. (2012). Modeling the Quality of Service Rerouting in Cognitive Network. i-manager's Journal on Electronics Engineering. 10.26634/jele.2.2.1624. 2:2. (23-35). Online publication date: 15-Feb-2012.

    http://www.imanagerpublications.com/article/1624

  • del Val E, Rebollo M and Botti V. Self-Organized Service Management in Social Systems. Proceedings of the 2012 45th Hawaii International Conference on System Sciences. (810-817).

    https://doi.org/10.1109/HICSS.2012.522

  • Shu X and Li X. (2012). A Scalable and Robust DHT Protocol for Structured P2P Network. International Journal of Communications, Network and System Sciences. 10.4236/ijcns.2012.512084. 05:12. (802-809).

    http://www.scirp.org/journal/doi.aspx?DOI=10.4236/ijcns.2012.512084

  • Takeda H, Truex D, Cuellar M and Vidgen R. (2012). Scholarly Influence Research (SIR). International Journal of Social and Organizational Dynamics in IT. 10.4018/ijsodit.2012010102. 2:1. (17-31). Online publication date: 1-Jan-2012.

    https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijsodit.2012010102

  • Kadaba R, Budalakoti S, DeAngelis D and Barber K. Modeling Virtual Footprints. Theoretical and Practical Frameworks for Agent-Based Systems. 10.4018/978-1-4666-1565-6.ch007. (96-113).

    http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-4666-1565-6.ch007

  • Bergenti F, Franchi E and Poggi A. Enhancing Social Networks with Agent and Semantic Web Technologies. Collaboration and the Semantic Web. 10.4018/978-1-4666-0894-8.ch005. (83-100).

    http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-4666-0894-8.ch005

  • Muhamad R. Social Network. Encyclopedia of Cyber Behavior. 10.4018/978-1-4666-0315-8.ch002. (8-24).

    http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-4666-0315-8.ch002

  • KAMI N, BABA T, YOSHIKAWA T and MORIKAWA H. (2012). Study on Dissemination Patterns in Location-Aware Gossiping Networks. IEICE Transactions on Communications. 10.1587/transcom.E95.B.1519. E95.B:5. (1519-1528).

    http://japanlinkcenter.org/JST.JSTAGE/transcom/E95.B.1519?from=CrossRef&type=abstract

  • Sharma R and Datta A. (2012). DRank: Decentralized ranking mechanism for semantic community overlays 2012 Fourth International Conference on Communication Systems and Networks (COMSNETS). 10.1109/COMSNETS.2012.6151352. 978-1-4673-0298-2. (1-7).

    http://ieeexplore.ieee.org/document/6151352/

  • Ma L, Jiang X, Wu K, Zhang Z, Tang S and Zheng Z. (2012). Surveying network community structure in the hidden metric space. Physica A: Statistical Mechanics and its Applications. 10.1016/j.physa.2011.07.057. 391:1-2. (371-378). Online publication date: 1-Jan-2012.

    http://linkinghub.elsevier.com/retrieve/pii/S0378437111006066

  • Nissan E. (2012). Accounting for Social, Spatial, and Textual Interconnections. Computer Applications for Handling Legal Evidence, Police Investigation and Case Argumentation. 10.1007/978-90-481-8990-8_6. (483-765).

    https://link.springer.com/10.1007/978-90-481-8990-8_6

  • Chen W, Fang W, Hu G and Mahoney M. (2012). On the Hyperbolicity of Small-World and Tree-Like Random Graphs. Algorithms and Computation. 10.1007/978-3-642-35261-4_31. (278-288).

    http://link.springer.com/10.1007/978-3-642-35261-4_31

  • Bonato A and Tian Y. (2012). Complex Networks and Social Networks. Advances in Network Analysis and its Applications. 10.1007/978-3-642-30904-5_12. (269-286).

    http://link.springer.com/10.1007/978-3-642-30904-5_12

  • Kaminski B and Latek M. On pricing strategies of boundedly rational telecommunication operators. Transactions on Compuational Collective Intelligence VI. (170-180).

    https://doi.org/10.1007/978-3-642-29356-6_8

  • del Val E, Rebollo M and Botti V. (2012). Decentralized Semantic Service Discovery in Preferential Attachment Networks. Agent-Based Technologies and Applications for Enterprise Interoperability. 10.1007/978-3-642-28563-9_8. (130-150).

    http://link.springer.com/10.1007/978-3-642-28563-9_8

  • Lertsuwanakul L and Unger H. (2012). Self-organizing Shortcuts in an Overlay Network. Autonomous Systems: Developments and Trends. 10.1007/978-3-642-24806-1_10. (119-131).

    http://link.springer.com/10.1007/978-3-642-24806-1_10

  • Catanese S, De Meo P, Ferrara E, Fiumara G and Provetti A. (2012). Extraction and Analysis of Facebook Friendship Relations. Computational Social Networks. 10.1007/978-1-4471-4054-2_12. (291-324).

    https://link.springer.com/10.1007/978-1-4471-4054-2_12

  • McCubbin C, Perozzi B, Levine A and Rahman A. Finding the 'Needle'. Proceedings of the 2011 IEEE 11th International Conference on Data Mining Workshops. (180-187).

    https://doi.org/10.1109/ICDMW.2011.84

  • Shi XinLing and Zhang liJun . (2011). Search in complex networks with local efficient information 2011 International Conference on Transportation and Mechanical & Electrical Engineering (TMEE). 10.1109/TMEE.2011.6199217. 978-1-4577-1701-7. (359-362).

    http://ieeexplore.ieee.org/document/6199217/

  • Xinxin Zhao , Lingjun Li and Guoliang Xue . (2011). Authenticating Strangers in Fast Mixing Online Social Networks 2011 IEEE Global Communications Conference (GLOBECOM 2011). 10.1109/GLOCOM.2011.6134343. 978-1-4244-9268-8. (1-5).

    http://ieeexplore.ieee.org/document/6134343/

  • Cutillo L, Molva R and Onen M. (2011). Analysis of Privacy in Online Social Networks from the Graph Theory Perspective 2011 IEEE Global Communications Conference (GLOBECOM 2011). 10.1109/GLOCOM.2011.6133517. 978-1-4244-9268-8. (1-5).

    http://ieeexplore.ieee.org/document/6133517/

  • Zhang C, Xiao W, Tang D and Tang J. (2011). P2P-based multidimensional indexing methods. Journal of Systems and Software. 84:12. (2348-2362). Online publication date: 1-Dec-2011.

    https://doi.org/10.1016/j.jss.2011.07.027

  • Korzun D and Gurtov A. (2010). Survey on hierarchical routing schemes in “flat” distributed hash tables. Peer-to-Peer Networking and Applications. 10.1007/s12083-010-0093-z. 4:4. (346-375). Online publication date: 1-Dec-2011.

    http://link.springer.com/10.1007/s12083-010-0093-z

  • Quan H, Wu J and Shi Y. (2011). Online Social Networks and Social Network Services. Pervasive Communications Handbook. 10.1201/b11271-22. (1-22). Online publication date: 14-Nov-2011.

    http://www.crcnetbase.com/doi/10.1201/b11271-22

  • Atzori L, Iera A and Morabito G. SIoT: Giving a Social Structure to the Internet of Things. IEEE Communications Letters. 10.1109/LCOMM.2011.090911.111340. 15:11. (1193-1195).

    http://ieeexplore.ieee.org/document/6042288/

  • Man S, Hong D, Palis M and Martin J. (2011). A computational model for signaling pathways in bounded small-world networks corresponding to brain size. Neurocomputing. 74:18. (3793-3799). Online publication date: 1-Nov-2011.

    https://doi.org/10.1016/j.neucom.2011.07.022

  • Shin J, Wong B and Sirer E. Small-world datacenters. Proceedings of the 2nd ACM Symposium on Cloud Computing. (1-13).

    https://doi.org/10.1145/2038916.2038918

  • Papagelis M, Bonchi F and Gionis A. Suggesting ghost edges for a smaller world. Proceedings of the 20th ACM international conference on Information and knowledge management. (2305-2308).

    https://doi.org/10.1145/2063576.2063952

  • Kermarrec A, Leroy V and Trédan G. Distributed social graph embedding. Proceedings of the 20th ACM international conference on Information and knowledge management. (1209-1214).

    https://doi.org/10.1145/2063576.2063751

  • Takes F and Kosters W. Determining the diameter of small world networks. Proceedings of the 20th ACM international conference on Information and knowledge management. (1191-1196).

    https://doi.org/10.1145/2063576.2063748

  • Helic D and Strohmaier M. Building directories for social tagging systems. Proceedings of the 20th ACM international conference on Information and knowledge management. (525-534).

    https://doi.org/10.1145/2063576.2063655

  • Yu H. (2011). Sybil defenses via social networks. ACM SIGACT News. 42:3. (80-101). Online publication date: 14-Oct-2011.

    https://doi.org/10.1145/2034575.2034593

  • Schiller B, Roos S, Hofer A and Strufe T. Attack Resistant Network Embeddings for Darknets. Proceedings of the 2011 IEEE 30th Symposium on Reliable Distributed Systems Workshops. (90-95).

    https://doi.org/10.1109/SRDSW.2011.19

  • Legtchenko S, Monnet S and Sens P. DONUT. Proceedings of the 2011 IEEE 30th International Symposium on Reliable Distributed Systems. (91-100).

    https://doi.org/10.1109/SRDS.2011.20

  • Gomes A and Pimentel M. A Technique for Human-readable Representation e Evaluation of Media-based Social Interactions in Social Networks. Proceedings of the 17th Brazilian Symposium on Multimedia and the Web on Brazilian Symposium on Multimedia and the Web - Volume 1. (119-126).

    /doi/10.5555/3021508.3021527

  • Jelasity M and Bilicki V. (2011). Scalable Stealth Mode P2P Overlays of Very Small Constant Degree. ACM Transactions on Autonomous and Adaptive Systems. 6:4. (1-20). Online publication date: 1-Oct-2011.

    https://doi.org/10.1145/2019591.2019596

  • Balinsky H, Balinsky A and Simske S. (2011). Document sentences as a small world 2011 IEEE International Conference on Systems, Man and Cybernetics - SMC. 10.1109/ICSMC.2011.6084065. 978-1-4577-0653-0. (2583-2588).

    http://ieeexplore.ieee.org/document/6084065/

  • Eppstein D, Goodrich M, Loffler M, Strash D and Trott L. (2011). Category-based routing in social networks: Membership dimension and the small-world phenomenon 2011 International Conference on Computational Aspects of Social Networks (CASoN 2011). 10.1109/CASON.2011.6085926. 978-1-4577-1133-6. (102-107).

    http://ieeexplore.ieee.org/document/6085926/

  • Bilò V, Fanelli A, Flammini M and Moscardelli L. (2011). Graphical Congestion Games. Algorithmica. 61:2. (274-297). Online publication date: 1-Oct-2011.

    https://doi.org/10.1007/s00453-010-9417-x

  • Pimentel M. Documenting social networks. Proceedings of the 11th ACM symposium on Document engineering. (277-280).

    https://doi.org/10.1145/2034691.2034749

  • Balinsky H, Balinsky A and Simske S. Automatic text summarization and small-world networks. Proceedings of the 11th ACM symposium on Document engineering. (175-184).

    https://doi.org/10.1145/2034691.2034731

  • Gomes A and da Graca C. Pimentel M. Social Interactions Representation as Users Behavioral Contingencies and Evaluation in Social Networks. Proceedings of the 2011 IEEE Fifth International Conference on Semantic Computing. (275-278).

    https://doi.org/10.1109/ICSC.2011.103

  • Helic D, Wilhelm S, Hasani-Mavriqi I and Strohmaier M. The effects of navigation tools on the navigability of web-based information systems. Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies. (1-8).

    https://doi.org/10.1145/2024288.2024308

  • Goodrich M and Pszona P. External-memory network analysis algorithms for naturally sparse graphs. Proceedings of the 19th European conference on Algorithms. (664-676).

    /doi/10.5555/2040572.2040645

  • Chen X, Tao F and Chao W. (2011). Indexing Associated Knowledge Flow on the Web. Advanced Engineering Forum. 10.4028/www.scientific.net/AEF.1.305. 1. (305-309).

    https://www.scientific.net/AEF.1.305

  • Girdzijauskas S, Galuba W, Darlagiannis V, Datta A and Aberer K. (2010). Fuzzynet: Ringless routing in a ring-like structured overlay. Peer-to-Peer Networking and Applications. 10.1007/s12083-010-0081-3. 4:3. (259-273). Online publication date: 1-Sep-2011.

    http://link.springer.com/10.1007/s12083-010-0081-3

  • Sun L, Cheng R, Li X, Cheung D and Han J. (2011). On link-based similarity join. Proceedings of the VLDB Endowment. 4:11. (714-725). Online publication date: 1-Aug-2011.

    https://doi.org/10.14778/3402707.3402712

  • Maier M, Rattigan M and Jensen D. (2011). Indexing Network Structure with Shortest-Path Trees. ACM Transactions on Knowledge Discovery from Data. 5:3. (1-25). Online publication date: 1-Aug-2011.

    https://doi.org/10.1145/1993077.1993079

  • Nagao H and Shudo K. (2011). Flexible routing tables: Designing routing algorithms for overlays based on a total order on a routing table set 2011 IEEE International Conference on Peer-to-Peer Computing (P2P). 10.1109/P2P.2011.6038664. 978-1-4577-0150-4. (72-81).

    http://ieeexplore.ieee.org/document/6038664/

  • Rajagopalan S and Shah D. Distributed Averaging in Dynamic Networks. IEEE Journal of Selected Topics in Signal Processing. 10.1109/JSTSP.2011.2114635. 5:4. (845-854).

    http://ieeexplore.ieee.org/document/5713222/

  • Ke Q, Dong Y and Wu B. Efficient Search in Networks Using Conductance. Proceedings of the 2011 International Conference on Advances in Social Networks Analysis and Mining. (37-44).

    https://doi.org/10.1109/ASONAM.2011.60

  • Karbasi A, Ioannidis S and Massoulié L. Content search through comparisons. Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II. (601-612).

    /doi/10.5555/2027223.2027284

  • Azimdoost B, Sadjadpour H and Garcia-Luna-Aceves J. (2011). Capacity of social networks in wireless environments 2011 7th International Wireless Communications and Mobile Computing Conference (IWCMC 2011). 10.1109/IWCMC.2011.5982700. 978-1-4244-9539-9. (1135-1140).

    http://ieeexplore.ieee.org/document/5982700/

  • Zhu Y. (2011). Making P2P Downloading Dependable by Exploiting Social Networks 2011 20th International Conference on Computer Communications and Networks - ICCCN 2011. 10.1109/ICCCN.2011.6006030. 978-1-4577-0637-0. (1-6).

    http://ieeexplore.ieee.org/document/6006030/

  • Zhu Y, Liu H, Guo Y and Zeng W. (2011). Network Assisted Media Streaming in Multi-Hop Wireless Networks 2011 20th International Conference on Computer Communications and Networks - ICCCN 2011. 10.1109/ICCCN.2011.6005909. 978-1-4577-0637-0. (1-7).

    http://ieeexplore.ieee.org/document/6005909/

  • Mtibaa A and Harras K. (2011). Social Forwarding in Large Scale Networks: Insights Based on Real Trace Analysis 2011 20th International Conference on Computer Communications and Networks - ICCCN 2011. 10.1109/ICCCN.2011.6005907. 978-1-4577-0637-0. (1-8).

    http://ieeexplore.ieee.org/document/6005907/

  • Zhu J and Zhang Y. (2011). Towards Accountable Mobility Model: A Language Approach on User Behavior Modeling in Office WLAN 2011 20th International Conference on Computer Communications and Networks - ICCCN 2011. 10.1109/ICCCN.2011.6005738. 978-1-4577-0637-0. (1-6).

    http://ieeexplore.ieee.org/document/6005738/

  • Wu B, Ke Q and Dong Y. (2011). Degree and similarity based search in networks 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2011). 10.1109/FSKD.2011.6019636. 978-1-61284-180-9. (1267-1270).

    http://ieeexplore.ieee.org/document/6019636/

  • Bhattacharyya P, Garg A and Wu S. (2010). Analysis of user keyword similarity in online social networks. Social Network Analysis and Mining. 10.1007/s13278-010-0006-4. 1:3. (143-158). Online publication date: 1-Jul-2011.

    http://link.springer.com/10.1007/s13278-010-0006-4

  • Mahdian M and Xu Y. (2011). Stochastic kronecker graphs. Random Structures & Algorithms. 38:4. (453-466). Online publication date: 1-Jul-2011.

    https://doi.org/10.1002/rsa.20335

  • Bergenti F, Franchi E and Poggi A. Agent-based Social Networks for Enterprise Collaboration. Proceedings of the 2011 IEEE 20th International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises. (25-28).

    https://doi.org/10.1109/WETICE.2011.12

  • Zhai E, Ding L and Qing S. Towards a Reliable Spam-Proof Tagging System. Proceedings of the 2011 Fifth International Conference on Secure Software Integration and Reliability Improvement. (174-181).

    https://doi.org/10.1109/SSIRI.2011.30

  • Bilò V, Celi A, Flammini M and Gallotti V. Social context congestion games. Proceedings of the 18th international conference on Structural information and communication complexity. (282-293).

    /doi/10.5555/2032229.2032262

  • Azimdoost B, Sadjadpour H and Garcia-Luna-Aceves J. The impact of social groups on the capacity of wireless networks. Proceedings of the 2011 IEEE Network Science Workshop. (30-37).

    https://doi.org/10.1109/NSW.2011.6004655

  • Oikonomou K, Loukidou A and Sioutas S. A study of a time-graph friendship model. Proceedings of the 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks. (1-6).

    https://doi.org/10.1109/WoWMoM.2011.5986150

  • Nanongkai D, Das Sarma A and Pandurangan G. A tight unconditional lower bound on distributed randomwalk computation. Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing. (257-266).

    https://doi.org/10.1145/1993806.1993853

  • Giakkoupis G and Schabanel N. Optimal path search in small worlds. Proceedings of the forty-third annual ACM symposium on Theory of computing. (393-402).

    https://doi.org/10.1145/1993636.1993689

  • Sheng M, Li J, Li H and Shi Y. (2011). Small World Based Cooperative Routing Protocol for Large Scale Wireless Ad Hoc Networks ICC 2011 - 2011 IEEE International Conference on Communications. 10.1109/icc.2011.5963281. 978-1-61284-232-5. (1-5).

    http://ieeexplore.ieee.org/document/5963281/

  • Kami N, Baba T, Yoshikawa T and Morikawa H. (2011). Information Dissemination Network for Dynamic Target Location Pursuit ICC 2011 - 2011 IEEE International Conference on Communications. 10.1109/icc.2011.5962663. 978-1-61284-232-5. (1-6).

    http://ieeexplore.ieee.org/document/5962663/

  • Vega D, Medina E, Messeguer R, Royo D, Freitag F, Ochoa S and Pino J. (2011). Characterizing the effects of sharing hardware resources in mobile collaboration scenarios 2011 15th International Conference on Computer Supported Cooperative Work in Design (CSCWD). 10.1109/CSCWD.2011.5960114. 978-1-4577-0386-7. (465-472).

    http://ieeexplore.ieee.org/document/5960114/

  • Airoldi E, Bai X and Carley K. (2011). Network sampling and classification. Decision Support Systems. 51:3. (506-518). Online publication date: 1-Jun-2011.

    https://doi.org/10.1016/j.dss.2011.02.014

  • Zhai E, Sun H, Qing S and Chen Z. (2010). Sorcery: Overcoming deceptive votes in P2P content sharing systems. Peer-to-Peer Networking and Applications. 10.1007/s12083-010-0074-2. 4:2. (178-191). Online publication date: 1-Jun-2011.

    http://link.springer.com/10.1007/s12083-010-0074-2

  • Aberer K. (2011). Peer-to-Peer Data Management. Synthesis Lectures on Data Management. 10.2200/S00338ED1V01Y201104DTM015. 3:2. (1-150). Online publication date: 31-May-2011.

    http://www.morganclaypool.com/doi/abs/10.2200/S00338ED1V01Y201104DTM015

  • Foudalis I, Jain K, Papadimitriou C and Sideri M. Modeling social networks through user background and behavior. Proceedings of the 8th international conference on Algorithms and models for the web graph. (85-102).

    /doi/10.5555/2022148.2022156

  • Catanese S, De Meo P, Ferrara E, Fiumara G and Provetti A. Crawling Facebook for social network analysis purposes. Proceedings of the International Conference on Web Intelligence, Mining and Semantics. (1-8).

    https://doi.org/10.1145/1988688.1988749

  • Rahimian F, Girdzijauskas S, Payberah A and Haridi S. Vitis. Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium. (746-757).

    https://doi.org/10.1109/IPDPS.2011.75

  • Xu Q, Sun L, Zhang M and Zhao T. (2011). Enhancing the Flexibility of Kademlia under Churn. Advanced Materials Research. 10.4028/www.scientific.net/AMR.255-260.2121. 255-260. (2121-2125).

    https://www.scientific.net/AMR.255-260.2121

  • Wang G and Wu J. (2011). Multi-dimensional evidence-based trust management with multi-trusted paths. Future Generation Computer Systems. 27:5. (529-538). Online publication date: 1-May-2011.

    https://doi.org/10.1016/j.future.2010.04.015

  • Kadaba R, Budalakoti S, DeAngelis D and Barber K. (2011). Modeling Virtual Footprints. International Journal of Agent Technologies and Systems. 3:2. (1-17). Online publication date: 1-Apr-2011.

    /doi/10.5555/2815760.2815761

  • Kadaba R, Budalakoti S, DeAngelis D and Barber K. (2011). Modeling Virtual Footprints. International Journal of Agent Technologies and Systems. 10.4018/jats.2011040101. 3:2. (1-17). Online publication date: 1-Apr-2011.

    https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jats.2011040101

  • Magnien C, Latapy M and Guillaume J. (2011). Impact of random failures and attacks on Poisson and power-law random networks. ACM Computing Surveys. 43:3. (1-31). Online publication date: 1-Apr-2011.

    https://doi.org/10.1145/1922649.1922650

  • Verma C, Tamma B, Manoj B and Rao R. A Realistic Small-World Model for Wireless Mesh Networks. IEEE Communications Letters. 10.1109/LCOMM.2011.020111.100266. 15:4. (455-457).

    http://ieeexplore.ieee.org/document/5713283/

  • Moses M and Banerjee S. (2011). Biologically inspired design principles for Scalable, Robust, Adaptive, Decentralized search and automated response (RADAR) 2011 Ieee Symposium On Artificial Life - Part Of 17273 - 2011 Ssci. 10.1109/ALIFE.2011.5954663. 978-1-61284-062-8. (30-37).

    http://ieeexplore.ieee.org/document/5954663/

  • Lattanzi S, Panconesi A and Sivakumar D. Milgram-routing in social networks. Proceedings of the 20th international conference on World wide web. (725-734).

    https://doi.org/10.1145/1963405.1963507

  • Dong W, Moses C and Li K. Efficient k-nearest neighbor graph construction for generic similarity measures. Proceedings of the 20th international conference on World wide web. (577-586).

    https://doi.org/10.1145/1963405.1963487

  • Helic D, Strohmaier M, Trattner C, Muhr M and Lerman K. Pragmatic evaluation of folksonomies. Proceedings of the 20th international conference on World wide web. (417-426).

    https://doi.org/10.1145/1963405.1963465

  • Wang B and Yang X. (2011). A transfer method of public transport network based on adjacency matrix multiplication searching algorithm. WSEAS Transactions on Circuits and Systems. 10:3. (104-113). Online publication date: 1-Mar-2011.

    /doi/10.5555/2001157.2001160

  • Azimdoost B, Sadjadpour H and Garcia-Luna-Aceves J. (2011). Capacity of composite networks: Combining social and wireless ad hoc networks 2011 IEEE Wireless Communications and Networking Conference (WCNC). 10.1109/WCNC.2011.5779177. 978-1-61284-255-4. (464-468).

    http://ieeexplore.ieee.org/document/5779177/

  • Ziotopoulos A and de Veciana G. (2011). P2P network for storage and query of a spatio-temporal flow of events 2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops). 10.1109/PERCOMW.2011.5766938. 978-1-61284-938-6. (483-489).

    http://ieeexplore.ieee.org/document/5766938/

  • Draief M and Ganesh A. (2011). A random walk model for infection on graphs. Discrete Event Dynamic Systems. 21:1. (41-61). Online publication date: 1-Mar-2011.

    https://doi.org/10.1007/s10626-010-0092-5

  • Teuscher C, Gulbahce N, Rohlf T and Goudarzi A. Random Dynamical Network Automata for Nanoelectronics. Theoretical and Technological Advancements in Nanotechnology and Molecular Computation. 10.4018/978-1-60960-186-7.ch019. (295-314).

    http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-60960-186-7.ch019

  • Trattner C. (2011). Improving the Navigability of Tagging Systems with Hierarchically Constructed Resource Lists and Tag Trails. Journal of Computing and Information Technology. 10.2498/cit.1001961. 19:3.

    http://cit.srce.unizg.hr/index.php/CIT/article/view/1961

  • Caballero-Gil P and Hernández-Goya C. (2011). Efficient public key certificate management for mobile ad hoc networks. EURASIP Journal on Wireless Communications and Networking. 2011. (1-11). Online publication date: 1-Jan-2011.

    https://doi.org/10.1155/2011/935457

  • Urdaneta G, Pierre G and Steen M. (2011). A survey of DHT security techniques. ACM Computing Surveys. 43:2. (1-49). Online publication date: 1-Jan-2011.

    https://doi.org/10.1145/1883612.1883615

  • Huang H, Le Q and Panchal J. (2011). Analysis of the Structure and Evolution of an Open-Source Community. Journal of Computing and Information Science in Engineering. 10.1115/1.3615677. 11:3. (031008).

    http://ComputingEngineering.asmedigitalcollection.asme.org/article.aspx?articleid=1402455

  • Ahmed R and Boutaba R. A Survey of Distributed Search Techniques in Large Scale Distributed Systems. IEEE Communications Surveys & Tutorials. 10.1109/SURV.2011.040410.00097. 13:2. (150-167).

    http://ieeexplore.ieee.org/document/5473882/

  • Sriram I and Cliff D. (2011). Hybrid Complex Network Topologies Are Preferred for Component-Subscription in Large-Scale Data-Centres. Complex Networks. 10.1007/978-3-642-25501-4_13. (130-137).

    http://link.springer.com/10.1007/978-3-642-25501-4_13

  • Goodrich M and Pszona P. (2011). External-Memory Network Analysis Algorithms for Naturally Sparse Graphs. Algorithms – ESA 2011. 10.1007/978-3-642-23719-5_56. (664-676).

    http://link.springer.com/10.1007/978-3-642-23719-5_56

  • Karbasi A, Ioannidis S and Massoulié L. (2011). Content Search through Comparisons. Automata, Languages and Programming. 10.1007/978-3-642-22012-8_48. (601-612).

    http://link.springer.com/10.1007/978-3-642-22012-8_48

  • Rivière E and Voulgaris S. (2011). Gossip-Based Networking for Internet-Scale Distributed Systems. E-Technologies: Transformation in a Connected World. 10.1007/978-3-642-20862-1_18. (253-284).

    http://link.springer.com/10.1007/978-3-642-20862-1_18

  • Sukjit P and Unger H. (2011). Dezentrale Echtzeitverarbeitung von RFID-Daten. Eingebettete Systeme. 10.1007/978-3-642-16189-6_10. (91-100).

    http://link.springer.com/10.1007/978-3-642-16189-6_10

  • Shen Y, Nguyen D and Thai M. On the hardness and inapproximability of optimization problems on power law graphs. Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I. (197-211).

    /doi/10.5555/1940390.1940407

  • Falahi K, Atif Y and Elnaffar S. Social Networks. Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing. (804-808).

    https://doi.org/10.1109/GreenCom-CPSCom.2010.14

  • Turgut D, Atilgan A, Atilgan C and Ben-Jacob E. (2010). Assortative Mixing in Close-Packed Spatial Networks. PLoS ONE. 10.1371/journal.pone.0015551. 5:12. (e15551).

    https://dx.plos.org/10.1371/journal.pone.0015551

  • Wang Y, Zhai E, Cao C, Xie Y, Wang Z, Hu J and Chen Z. DSpam. Proceedings of the 2010 IEEE 16th International Conference on Parallel and Distributed Systems. (139-146).

    https://doi.org/10.1109/ICPADS.2010.63

  • Verma A, Verma C, Tamma B and Manoj B. (2010). New link addition strategies for Multi-Gateway small world Wireless Mesh Networks 2010 IEEE 4th International Symposium on Advanced Networks and Telecommunication Systems (ANTS). 10.1109/ANTS.2010.5983519. 978-1-4244-9852-9. (31-33).

    http://ieeexplore.ieee.org/document/5983519/

  • Aycock T, Headley J, Floyd J and Hu F. (2010). Sociotechnical Network Models. Socio-Technical Networks. 10.1201/b10327-6. (105-126). Online publication date: 17-Nov-2010.

    http://www.crcnetbase.com/doi/10.1201/b10327-6

  • Liu L, Tian S, Sun X and Yu T. (2010). Research on a Navigating Hierarchy Model of Aircraft Manufacturing Supply Chain. Advanced Materials Research. 10.4028/www.scientific.net/AMR.160-162.464. 160-162. (464-469).

    https://www.scientific.net/AMR.160-162.464

  • Chen G, Sarrafzadeh A, Low C and Zhang L. (2010). A self-organization mechanism based on cross-entropy method for P2P-like applications. ACM Transactions on Autonomous and Adaptive Systems. 5:4. (1-31). Online publication date: 1-Nov-2010.

    https://doi.org/10.1145/1867713.1867716

  • Sun X, Zhuge H and Jiang X. The Interactive Computing Model for Cyber Physical Society. Proceedings of the 2010 Sixth International Conference on Semantics, Knowledge and Grids. (25-32).

    https://doi.org/10.1109/SKG.2010.9

  • Sun W, Ma Y, Qi F and Liu X. (2010). Searching Minimum Fractional 1-Factor in Graphs 2010 International Conference on E-Product E-Service and E-Entertainment (ICEEE 2010). 10.1109/ICEEE.2010.5660163. 978-1-4244-7159-1. (1-4).

    http://ieeexplore.ieee.org/document/5660163/

  • Muthukrishnan S and Pandurangan G. (2010). Thresholding random geometric graph properties motivated by ad hoc sensor networks. Journal of Computer and System Sciences. 76:7. (686-696). Online publication date: 1-Nov-2010.

    https://doi.org/10.1016/j.jcss.2010.01.002

  • Maiya A and Berger-Wolf T. Expansion and search in networks. Proceedings of the 19th ACM international conference on Information and knowledge management. (239-248).

    https://doi.org/10.1145/1871437.1871471

  • Wang B and Yang X. A transfer method of public transport networks by adjacency matrix. Proceedings of the 2010 international conference on Applied computing conference. (123-127).

    /doi/10.5555/1950153.1950173

  • Matthias M, Carlos C, Turgut T and Rothkugel R. LSWTC. Proceedings of the 2010 IEEE 35th Conference on Local Computer Networks. (144-151).

    https://doi.org/10.1109/LCN.2010.5735688

  • Garetto M and Leonardi E. (2010). Restricted mobility improves delay-throughput tradeoffs in mobile ad hoc networks. IEEE Transactions on Information Theory. 56:10. (5016-5029). Online publication date: 1-Oct-2010.

    https://doi.org/10.1109/TIT.2010.2059510

  • Chuan Huang , Yinzi Chen , Wendong Wang , Yidong Cui , Hao Wang and Nan Du . (2010). A novel social search model based on trust and popularity Multimedia Technology (IC-BNMT 2010). 10.1109/ICBNMT.2010.5705245. 978-1-4244-6769-3. (1030-1034).

    http://ieeexplore.ieee.org/document/5705245/

  • Halim F, Wu Y and Yap R. Routing in the Watts and Strogatz Small World Networks Revisited. Proceedings of the 2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshop. (247-250).

    https://doi.org/10.1109/SASOW.2010.70

  • Singh J, Hansen M and Podolny J. (2010). The World Is Not Small for Everyone. Management Science. 56:9. (1415-1438). Online publication date: 1-Sep-2010.

    https://doi.org/10.1287/mnsc.1100.1201

  • Inaltekin H, Chiang M and Poor H. (2010). Average message delivery time for small-world networks in the continuum limit. IEEE Transactions on Information Theory. 56:9. (4447-4470). Online publication date: 1-Sep-2010.

    https://doi.org/10.1109/TIT.2010.2054490

  • Cui L, Kumara S and Albert R. (2010). Complex networks. IEEE Circuits and Systems Magazine. 10:3. (10-25). Online publication date: 1-Sep-2010.

    https://doi.org/10.1109/MCAS.2010.937883

  • Liu S, Ying L and Shakkottai S. (2010). Influence maximization in social networks: An ising-model-based approach 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton). 10.1109/ALLERTON.2010.5706958. 978-1-4244-8215-3. (570-576).

    http://ieeexplore.ieee.org/document/5706958/

  • Viswanath B, Post A, Gummadi K and Mislove A. An analysis of social network-based Sybil defenses. Proceedings of the ACM SIGCOMM 2010 conference. (363-374).

    https://doi.org/10.1145/1851182.1851226

  • Helic D, Trattner C, Strohmaier M and Andrews K. On the Navigability of Social Tagging Systems. Proceedings of the 2010 IEEE Second International Conference on Social Computing. (161-168).

    https://doi.org/10.1109/SocialCom.2010.31

  • Viswanath B, Post A, Gummadi K and Mislove A. (2010). An analysis of social network-based Sybil defenses. ACM SIGCOMM Computer Communication Review. 40:4. (363-374). Online publication date: 16-Aug-2010.

    https://doi.org/10.1145/1851275.1851226

  • Tisselli E. (2010). thinkflickrthink. Communications of the ACM. 53:8. (141-145). Online publication date: 1-Aug-2010.

    https://doi.org/10.1145/1787234.1787270

  • Mordacchini M, Ricci L, Ferrucci L, Albano M and Baraglia R. (2010). Hivory: Range Queries on Hierarchical Voronoi Overlays 2010 IEEE Tenth International Conference on Peer-to-Peer Computing (P2P). 10.1109/P2P.2010.5569973. 978-1-4244-7140-9. (1-10).

    http://ieeexplore.ieee.org/document/5569973/

  • Bodine-Baron E, Hassibi B and Wierman A. Distance-Dependent Kronecker Graphs for Modeling Social Networks. IEEE Journal of Selected Topics in Signal Processing. 10.1109/JSTSP.2010.2049412. 4:4. (718-731).

    http://ieeexplore.ieee.org/document/5456189/

  • Tzevelekas L, Oikonomou K and Stavrakakis I. (2010). Random walk with jumps in large-scale random geometric graphs. Computer Communications. 33:13. (1505-1514). Online publication date: 1-Aug-2010.

    https://doi.org/10.1016/j.comcom.2010.01.026

  • Diaz F, Metzler D and Amer-Yahia S. Relevance and ranking in online dating systems. Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval. (66-73).

    https://doi.org/10.1145/1835449.1835463

  • Toninelli A, Pathak A, Seyedi A, Cardoso R and Issarny V. Middleware Support for Mobile Social Ecosystems. Proceedings of the 2010 IEEE 34th Annual Computer Software and Applications Conference Workshops. (293-298).

    https://doi.org/10.1109/COMPSACW.2010.58

  • Girdzijauskas S, Chockler G, Vigfusson Y, Tock Y and Melamed R. Magnet. Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems. (172-183).

    https://doi.org/10.1145/1827418.1827456

  • Wattenhofer R. Physical algorithms. Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II. (38-51).

    /doi/10.5555/1880999.1881004

  • Hui C, Goldberg M, Magdon-Ismail M and Wallace W. (2010). Simulating the Diffusion of Information. International Journal of Agent Technologies and Systems. 2:3. (31-46). Online publication date: 1-Jul-2010.

    https://doi.org/10.4018/jats.2010070103

  • Hsiao H, Liao H and Yeh P. (2010). A Near-Optimal Algorithm Attacking the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks. IEEE Transactions on Parallel and Distributed Systems. 21:7. (983-997). Online publication date: 1-Jul-2010.

    https://doi.org/10.1109/TPDS.2009.160

  • Sun J and ben-Avraham D. (2010). Greedy connectivity of geographically embedded graphs. Physical Review E. 10.1103/PhysRevE.82.016109. 82:1.

    https://link.aps.org/doi/10.1103/PhysRevE.82.016109

  • Cui J, Chen X, Lei Y and Xu W. Improving the Efficiency of Scheduling and Placement in FPGA by Small-world Model Based Genetic Algorithm. Proceedings of the 2010 10th IEEE International Conference on Computer and Information Technology. (99-106).

    https://doi.org/10.1109/CIT.2010.58

  • Kaminski B and Latek M. The influence of call graph topology on the dynamics of telecommunication markets. Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part I. (263-272).

    /doi/10.5555/1883838.1883872

  • Demaine E and Zadimoghaddam M. Minimizing the diameter of a network using shortcut edges. Proceedings of the 12th Scandinavian conference on Algorithm Theory. (420-431).

    https://doi.org/10.1007/978-3-642-13731-0_39

  • Fraigniaud P and Giakkoupis G. On the searchability of small-world networks with arbitrary underlying structure. Proceedings of the forty-second ACM symposium on Theory of computing. (389-398).

    https://doi.org/10.1145/1806689.1806744

  • Bressan M and Peserico E. Urban hitchhiking. Proceedings of the 5th international conference on Fun with algorithms. (68-76).

    /doi/10.5555/1875616.1875625

  • Yu H, Gibbons P, Kaminsky M and Xiao F. (2010). SybilLimit. IEEE/ACM Transactions on Networking. 18:3. (885-898). Online publication date: 1-Jun-2010.

    https://doi.org/10.1109/TNET.2009.2034047

  • Athanassopoulos S, Kaklamanis C, Laftsidis I and Papaioannou E. (2010). An experimental study of greedy routing algorithms Simulation (HPCS). 10.1109/HPCS.2010.5547143. 978-1-4244-6827-0. (150-156).

    http://ieeexplore.ieee.org/document/5547143/

  • Ghadge S, Killingback T, Sundaram B and Tran D. (2010). A statistical construction of power-law networks. International Journal of Parallel, Emergent and Distributed Systems. 25:3. (223-235). Online publication date: 1-Jun-2010.

    https://doi.org/10.1080/17445760903429963

  • Inaltekin H, Ozgencil N, Xu H, Chiang M and Poor H. (2010). Online Content Trading: Sharing Mart System and Auction Experiments 2010 International Conference On Communications Workshops. 10.1109/ICCW.2010.5503928. 978-1-4244-6824-9. (1-6).

    http://ieeexplore.ieee.org/document/5503928/

  • Xu D, Bai Z, Waadt A, Bruck G and Jung P. (2010). Combining Mimo with Network Coding: A Viable Means to Provide Multiplexing and Diversity in Wireless Relay Networks ICC 2010 - 2010 IEEE International Conference on Communications. 10.1109/ICC.2010.5502535. 978-1-4244-6402-9. (1-5).

    http://ieeexplore.ieee.org/document/5502535/

  • Xu H, Jin J and Li B. (2010). A Channel Portfolio Optimization Framework for Trading in a Spectrum Secondary Market ICC 2010 - 2010 IEEE International Conference on Communications. 10.1109/ICC.2010.5502442. 978-1-4244-6402-9. (1-5).

    http://ieeexplore.ieee.org/document/5502442/

  • Xu K, Xie J and Li V. (2010). Locating Experts via Online Social Networks ICC 2010 - 2010 IEEE International Conference on Communications. 10.1109/ICC.2010.5502193. 978-1-4244-6402-9. (1-5).

    http://ieeexplore.ieee.org/document/5502193/

  • Hao Yu , Yucheng Zhou , Yan Ma and Yuanwei Jing . (2010). Study on scale-free network traffic with bandwidth of links 2010 Chinese Control and Decision Conference (CCDC). 10.1109/CCDC.2010.5498456. 978-1-4244-5181-4. (3966-3969).

    http://ieeexplore.ieee.org/document/5498456/

  • Bertier M, Bonnet F, Kermarrec A, Leroy V, Peri S and Raynal M. D2HT. Proceedings of the 2010 European Dependable Computing Conference. (135-144).

    https://doi.org/10.1109/EDCC.2010.25

  • Backstrom L, Sun E and Marlow C. Find me if you can. Proceedings of the 19th international conference on World wide web. (61-70).

    https://doi.org/10.1145/1772690.1772698

  • Schiller B, Bradler D, Schweizer I, Mühlhäuser M and Strufe T. GTNA. Proceedings of the 2010 Spring Simulation Multiconference. (1-8).

    https://doi.org/10.1145/1878537.1878653

  • Hui C, Goldberg M, Magdon-Ismail M and Wallace W. Agent-based simulation of the diffusion of warnings. Proceedings of the 2010 Spring Simulation Multiconference. (1-8).

    https://doi.org/10.1145/1878537.1878547

  • Lertsuwanakul L, Tuammee S and Unger H. Routing with Temperature Field in Mesh Overlay Network. Proceedings of the 2010 Ninth International Conference on Networks. (285-290).

    https://doi.org/10.1109/ICN.2010.52

  • Hartmann B, Böhm K, Khachatryan A, Schosser S and Vogt B. (2010). Incentivizing connectivity in structured Peer-to-Peer systems. Web Intelligence and Agent Systems. 8:2. (123-147). Online publication date: 1-Apr-2010.

    /doi/10.5555/1734741.1734742

  • Tae Woong Choi and Boykin P. (2010). Deetoo: Scalable unstructured search built on a structured overlay Distributed Processing, Workshops and Phd Forum (IPDPSW). 10.1109/IPDPSW.2010.5470932. 978-1-4244-6533-0. (1-8).

    http://ieeexplore.ieee.org/document/5470932/

  • Wu X. (2010). Research on routing method on peer-to-peer network 2010 2nd International Conference on Computer Engineering and Technology. 10.1109/ICCET.2010.5485361. 978-1-4244-6347-3. (V7-81-V7-84).

    http://ieeexplore.ieee.org/document/5485361/

  • Shi H and Lv F. (2010). A Blind Digital Watermark Technique for Color Image Based on Integer Wavelet Transform 2010 International Conference on Biomedical Engineering and Computer Science (ICBECS). 10.1109/ICBECS.2010.5462499. 978-1-4244-5315-3. (1-4).

    http://ieeexplore.ieee.org/document/5462499/

  • Shi Q and Wu R. (2010). A Protocol for Text Retrieval in Structured P2P Networks 2010 International Conference on Biomedical Engineering and Computer Science (ICBECS). 10.1109/ICBECS.2010.5462449. 978-1-4244-5315-3. (1-4).

    http://ieeexplore.ieee.org/document/5462449/

  • Ribe-Baumann L and Sattler K. A small-world DHT built on generalized network coordinates. Proceedings of the 2010 EDBT/ICDT Workshops. (1-6).

    https://doi.org/10.1145/1754239.1754286

  • Sriram I and Cliff D. Effects of Component-Subscription Network Topology on Large-Scale Data Centre Performance Scaling. Proceedings of the 2010 15th IEEE International Conference on Engineering of Complex Computer Systems. (72-81).

    https://doi.org/10.1109/ICECCS.2010.21

  • Bakun O and Konjevod G. (2010). Adaptive Decentralized Routing in Small-World Networks IEEE INFOCOM 2010 - IEEE Conference on Computer Communications Workshops. 10.1109/INFCOMW.2010.5466704. 978-1-4244-6739-6. (1-6).

    http://ieeexplore.ieee.org/document/5466704/

  • Aoyama K, Watanabe S, Sawada H, Minami Y, Ueda N and Saito K. (2010). Fast similarity search on a large speech data set with neighborhood graph indexing 2010 IEEE International Conference on Acoustics, Speech and Signal Processing. 10.1109/ICASSP.2010.5494950. 978-1-4244-4295-9. (5358-5361).

    http://ieeexplore.ieee.org/document/5494950/

  • Fraigniaud P, Lebhar E and Lotker Z. (2010). Recovering the long-range links in augmented graphs. Theoretical Computer Science. 411:14-15. (1613-1625). Online publication date: 1-Mar-2010.

    https://doi.org/10.1016/j.tcs.2010.01.009

  • Xu M, Zhou S, Guan J and Hu X. (2010). A path-traceable query routing mechanism for search in unstructured peer-to-peer networks. Journal of Network and Computer Applications. 33:2. (115-127). Online publication date: 1-Mar-2010.

    https://doi.org/10.1016/j.jnca.2009.11.003

  • Datta S, Kaulgud V, Sharma V and Kumar N. A social network based study of software team dynamics. Proceedings of the 3rd India software engineering conference. (33-42).

    https://doi.org/10.1145/1730874.1730883

  • Jahanbakhsh K, Shoja G and King V. Social-Greedy. Proceedings of the Second International Workshop on Mobile Opportunistic Networking. (159-162).

    https://doi.org/10.1145/1755743.1755773

  • (2010). References. Overlay Networks. 10.1201/9781439813737-b. (217-234). Online publication date: 9-Feb-2010.

    http://www.crcnetbase.com/doi/10.1201/9781439813737-b

  • Girdzijauskas Š, Datta A and Aberer K. (2010). Structured overlay for heterogeneous environments. ACM Transactions on Autonomous and Adaptive Systems. 5:1. (1-25). Online publication date: 1-Feb-2010.

    https://doi.org/10.1145/1671948.1671950

  • Rezaei B, Sarshar N and Roychowdhury V. (2010). Distributed resource sharing in low-latency wireless ad hoc networks. IEEE/ACM Transactions on Networking. 18:1. (190-201). Online publication date: 1-Feb-2010.

    https://doi.org/10.1109/TNET.2009.2025928

  • Roy N, Gu T and Das S. (2010). Supporting pervasive computing applications with active context fusion and semantic context delivery. Pervasive and Mobile Computing. 6:1. (21-42). Online publication date: 1-Feb-2010.

    https://doi.org/10.1016/j.pmcj.2009.10.002

  • Abraham I, Fiat A, Goldberg A and Werneck R. Highway dimension, shortest paths, and provably efficient algorithms. Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms. (782-793).

    /doi/10.5555/1873601.1873665

  • Kesidis G. (2010). An Introduction to Models of Online Peer-to-Peer Social Networking. Synthesis Lectures on Communication Networks. 10.2200/S00313ED1V01Y201011CNT008. 3:1. (1-125). Online publication date: 1-Jan-2010.

    http://www.morganclaypool.com/doi/abs/10.2200/S00313ED1V01Y201011CNT008

  • Yildiz M, Pagliari R, Ozdaglar A and Scaglione A. (2010). Voting models in random networks 2010 Information Theory and Applications Workshop (ITA). 10.1109/ITA.2010.5454090. 978-1-4244-7012-9. (1-7).

    http://ieeexplore.ieee.org/document/5454090/

  • Hong D and Man S. (2010). Signal propagation in small-world biological networks with weak noise. Journal of Theoretical Biology. 10.1016/j.jtbi.2009.10.019. 262:2. (370-380). Online publication date: 1-Jan-2010.

    https://linkinghub.elsevier.com/retrieve/pii/S0022519309004949

  • Demaine E and Zadimoghaddam M. (2010). Constant Price of Anarchy in Network Creation Games via Public Service Advertising. Algorithms and Models for the Web-Graph. 10.1007/978-3-642-18009-5_12. (122-131).

    http://link.springer.com/10.1007/978-3-642-18009-5_12

  • Bonato A, Janssen J and Prałat P. (2010). The Geometric Protean Model for On-Line Social Networks. Algorithms and Models for the Web-Graph. 10.1007/978-3-642-18009-5_11. (110-121).

    http://link.springer.com/10.1007/978-3-642-18009-5_11

  • Nagaraja S. (2010). Privacy Amplification with Social Networks. Security Protocols. 10.1007/978-3-642-17773-6_7. (58-73).

    http://link.springer.com/10.1007/978-3-642-17773-6_7

  • Danezis G and Laurie B. (2010). Private Yet Abuse Resistant Open Publishing. Security Protocols. 10.1007/978-3-642-17773-6_28. (222-243).

    http://link.springer.com/10.1007/978-3-642-17773-6_28

  • Shen Y, Nguyen D and Thai M. (2010). On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs. Combinatorial Optimization and Applications. 10.1007/978-3-642-17458-2_17. (197-211).

    http://link.springer.com/10.1007/978-3-642-17458-2_17

  • Banerjee S and Moses M. (2010). Modular RADAR: An Immune System Inspired Search and Response Strategy for Distributed Systems. Artificial Immune Systems. 10.1007/978-3-642-14547-6_10. (116-129).

    http://link.springer.com/10.1007/978-3-642-14547-6_10

  • Chinnappen-Rimer S and Hancke G. (2010). Energy Efficient Message Routing in a Small World Wireless Sensor Network. Advances in Wireless Networks and Information Systems. 10.1007/978-3-642-14350-2_23. (183-192).

    http://link.springer.com/10.1007/978-3-642-14350-2_23

  • Xu X, Wang X and Wang Z. (2010). Life Cycle of Virtualized Service Resource in BIRIS Environment. Exploring Services Science. 10.1007/978-3-642-14319-9_17. (215-223).

    http://link.springer.com/10.1007/978-3-642-14319-9_17

  • Wattenhofer R. (2010). Physical Algorithms. Automata, Languages and Programming. 10.1007/978-3-642-14162-1_4. (38-51).

    http://link.springer.com/10.1007/978-3-642-14162-1_4

  • Blasco A and Pin P. (2010). Simulations on Correlated Behavior and Social Learning. Progress in Artificial Economics. 10.1007/978-3-642-13947-5_8. (89-100).

    https://link.springer.com/10.1007/978-3-642-13947-5_8

  • Bressan M and Peserico E. (2010). Urban Hitchhiking. Fun with Algorithms. 10.1007/978-3-642-13122-6_9. (68-76).

    http://link.springer.com/10.1007/978-3-642-13122-6_9

  • Metaxas P. (2010). Web Spam, Social Propaganda and the Evolution of Search Engine Rankings. Web Information Systems and Technologies. 10.1007/978-3-642-12436-5_13. (170-182).

    http://link.springer.com/10.1007/978-3-642-12436-5_13

  • Liben-Nowell D. (2010). Wayfinding in Social Networks. Algorithms for Next Generation Networks. 10.1007/978-1-84882-765-3_18. (435-456).

    http://link.springer.com/10.1007/978-1-84882-765-3_18

  • Donato D and Gionis A. (2010). Next Generation Search. Algorithms for Next Generation Networks. 10.1007/978-1-84882-765-3_16. (373-401).

    http://link.springer.com/10.1007/978-1-84882-765-3_16

  • Kumar R, Novak J and Tomkins A. (2010). Structure and Evolution of Online Social Networks. Link Mining: Models, Algorithms, and Applications. 10.1007/978-1-4419-6515-8_13. (337-357).

    http://link.springer.com/10.1007/978-1-4419-6515-8_13

  • Kurucz M and Benczúr A. (2010). Geographically Organized Small Communities and the Hardness of Clustering Social Networks. Data Mining for Social Network Data. 10.1007/978-1-4419-6287-4_10. (177-199).

    https://link.springer.com/10.1007/978-1-4419-6287-4_10

  • Mathieu F. (2010). Acyclic preference-based systems. Handbook of Peer-to-Peer Networking. 10.1007/978-0-387-09751-0_42. (1165-1203).

    https://link.springer.com/10.1007/978-0-387-09751-0_42

  • Kersch P and Szabo R. (2010). Mathematical Modeling of Routing in DHTs. Handbook of Peer-to-Peer Networking. 10.1007/978-0-387-09751-0_14. (367-401).

    https://link.springer.com/10.1007/978-0-387-09751-0_14

  • Datta A. (2010). The Gamut of Bootstrapping Mechanisms for Structured Overlay Networks. Handbook of Peer-to-Peer Networking. 10.1007/978-0-387-09751-0_11. (281-308).

    https://link.springer.com/10.1007/978-0-387-09751-0_11

  • Chinnappen-Rimer S and Hancke G. Modelling a Wireless Sensor Network as a Small World Network. Proceedings of the 2009 International Conference on Wireless Networks and Information Systems. (7-10).

    https://doi.org/10.1109/WNIS.2009.57

  • Ma Y, Song N, Zhang J, Deng Y and Qiu Y. A Strategy Research on Resource Discovery Based on Education Grid Community. Proceedings of the 2009 First IEEE International Conference on Information Science and Engineering. (2246-2249).

    https://doi.org/10.1109/ICISE.2009.169

  • Shu X and Li X. Tambour. Proceedings of the 2009 First IEEE International Conference on Information Science and Engineering. (417-420).

    https://doi.org/10.1109/ICISE.2009.1156

  • Mellet K. (2009). Aux sources du marketing viral. Réseaux. 10.3917/res.157.0267. n° 157-158:5. (267-292). Online publication date: 16-Dec-2009.

    https://www.cairn.info/revue-reseaux-2009-5-page-267.htm?ref=doi

  • Prakash E, Brindle G, Jones K, Zhou S, Chaudhari N and Wong K. (2009). Advances in Games Technology. Simulation and Gaming. 40:6. (752-801). Online publication date: 1-Dec-2009.

    https://doi.org/10.1177/1046878109335120

  • Garetto M, Giaccone P and Leonardi E. (2009). Capacity scaling in ad hoc networks with heterogeneous mobile nodes. IEEE/ACM Transactions on Networking. 17:6. (1888-1901). Online publication date: 1-Dec-2009.

    https://doi.org/10.1109/TNET.2009.2015572

  • Jian Zhu , Oliya M and Hung Keng Pung . (2009). A pragmatic approach to location-aware service organization and discovery 2009 IEEE 28th International Performance Computing and Communications Conference (IPCCC). 10.1109/PCCC.2009.5403831. 978-1-4244-5737-3. (272-279).

    http://ieeexplore.ieee.org/document/5403831/

  • Zhai E, Chen R, Lua E, Zhang L, Sun H, Cai Z, Qing S and Chen Z. SpamResist. Proceedings of the 28th IEEE conference on Global telecommunications. (5300-5305).

    /doi/10.5555/1811982.1812259

  • Vasserman E, Jansen R, Tyra J, Hopper N and Kim Y. Membership-concealing overlay networks. Proceedings of the 16th ACM conference on Computer and communications security. (390-399).

    https://doi.org/10.1145/1653662.1653709

  • Jelasity M and Bilicki V. Scalable P2P Overlays of Very Small Constant Degree. Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems. (399-412).

    https://doi.org/10.1007/978-3-642-05118-0_28

  • Kermarrec A. Challenges in Personalizing and Decentralizing the Web. Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems. (1-16).

    https://doi.org/10.1007/978-3-642-05118-0_1

  • Hsiao H, Liao H and Huang C. (2009). Resolving the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks. IEEE Transactions on Parallel and Distributed Systems. 20:11. (1668-1681). Online publication date: 1-Nov-2009.

    https://doi.org/10.1109/TPDS.2009.24

  • Zhai E, Chen R, Lua E, Zhang L, Sun H, Cai Z, Qing S and Chen Z. (2009). SpamResist: Making Peer-to-Peer Tagging Systems Robust to Spam GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference. 10.1109/GLOCOM.2009.5425801. 978-1-4244-4148-8. (1-6).

    http://ieeexplore.ieee.org/document/5425801/

  • Cordasco G and Gargano L. (2009). Navigable Small-World networks with few random bits. Theoretical Computer Science. 410:47-49. (4975-4988). Online publication date: 1-Nov-2009.

    https://doi.org/10.1016/j.tcs.2009.07.050

  • Quercia D and Capra L. FriendSensing. Proceedings of the third ACM conference on Recommender systems. (273-276).

    https://doi.org/10.1145/1639714.1639766

  • Uhrmacher A, Schulz H, Schumann H, Schwabe L and Timmermann D. Regenerative systems. Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools. (1-10).

    https://doi.org/10.4108/ICST.VALUETOOLS2009.7907

  • Ganesh A and Draief M. A random walk model for infection on graphs. Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools. (1-8).

    https://doi.org/10.4108/ICST.VALUETOOLS2009.7447

  • Teuscher C, Gulbahce N and Rohlf T. (2009). An Assessment of Random Dynamical Network Automata for Nanoelectronics. International Journal of Nanotechnology and Molecular Computation. 10.4018/jnmc.2009120904. 1:4. (58-76). Online publication date: 1-Oct-2009.

    https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jnmc.2009120904

  • Gu T, Zhang D and Pung H. (2009). An Ontology-Based P2P Network for Semantic Search. International Journal of Grid and High Performance Computing. 10.4018/jghpc.2009070803. 1:4. (26-39). Online publication date: 1-Oct-2009.

    https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jghpc.2009070803

  • Carminati B, Ferrari E and Perego A. (2009). Enforcing access control in Web-based social networks. ACM Transactions on Information and System Security. 13:1. (1-38). Online publication date: 1-Oct-2009.

    https://doi.org/10.1145/1609956.1609962

  • Huang Y, He W and Nahrstedt K. (2009). ChainFarm: A novel authentication protocol for high-rate any source probabilistic broadcast 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems (MASS). 10.1109/MOBHOC.2009.5336988. 978-1-4244-5114-2. (264-273).

    http://ieeexplore.ieee.org/document/5336988/

  • Karrels D, Peterson G and Mullins B. (2009). RC-Chord: Resource clustering in a large-scale hierarchical peer-to-peer system MILCOM 2009 - 2009 IEEE Military Communications Conference. 10.1109/MILCOM.2009.5379742. 978-1-4244-5238-5. (1-7).

    http://ieeexplore.ieee.org/document/5379742/

  • Garcia-Banuelos L, Portilla A, Chávez-Aragón A, Reyes-Galaviz O and Ayanegui-Santiago H. Finding and Analyzing Social Collaboration Networks in the Mexican Computer Science Community. Proceedings of the 2009 Mexican International Conference on Computer Science. (167-175).

    https://doi.org/10.1109/ENC.2009.17

  • Rebollo M. Small World Model for Agent Searching. Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02. (355-362).

    https://doi.org/10.1109/WI-IAT.2009.177

  • Zhong N, Guo R and Li W. Local Search in Weighted and Directed Social Networks. Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01. (12-19).

    https://doi.org/10.1109/WI-IAT.2009.10

  • Golbeck J. (2009). Trust and nuanced profile similarity in online social networks. ACM Transactions on the Web. 3:4. (1-33). Online publication date: 1-Sep-2009.

    https://doi.org/10.1145/1594173.1594174

  • Zhai E, Chen R, Cai Z, Zhang L, Lua E, Sun H, Qing S, Tang L and Cheny Z. (2009). Sorcery: Could we make P2P content sharing systems robust to deceivers? 2009 IEEE Ninth International Conference on Peer-to-Peer Computing (P2P). 10.1109/P2P.2009.5284532. 978-1-4244-5067-1. (11-20).

    https://ieeexplore.ieee.org/document/5284532/

  • Bodine E, Hassibi B and Wierman A. (2009). Generalizing Kronecker graphs in order to model searchable networks 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton). 10.1109/ALLERTON.2009.5394816. 978-1-4244-5870-7. (194-201).

    http://ieeexplore.ieee.org/document/5394816/

  • Liu X, Guan J, Bai G and Lu H. (2009). SWER: small world-based efficient routing for wireless sensor networks with mobile sinks. Frontiers of Computer Science in China. 10.1007/s11704-009-0052-0. 3:3. (427-434). Online publication date: 1-Sep-2009.

    http://link.springer.com/10.1007/s11704-009-0052-0

  • Lifshits Y. Combinatorial Framework for Similarity Search. Proceedings of the 2009 Second International Workshop on Similarity Search and Applications. (11-17).

    https://doi.org/10.1109/SISAP.2009.31

  • Garg A, Bhattacharyya P, Martel C and Wu S. Information Flow and Search in Unstructured Keyword Based Social Networks. Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 04. (1074-1081).

    https://doi.org/10.1109/CSE.2009.92

  • Davis J, Goldman Z, Hilty J, Koch E, Liben-Nowell D, Sharp A, Wexler T and Zhou E. Equilibria and Efficiency Loss in Games on Networks. Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 04. (82-89).

    https://doi.org/10.1109/CSE.2009.45

  • Zhai E, Sun H, Qing S and Chen Z. SpamClean. Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 04. (429-435).

    https://doi.org/10.1109/CSE.2009.154

  • Groh G and Rappel V. Towards Demarcation and Modeling of Small Sub-Communities/Groups in P2P Social Networks. Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 04. (304-311).

    https://doi.org/10.1109/CSE.2009.137

  • Hall C and Carzaniga A. Uniform Sampling for Directed P2P Networks. Proceedings of the 15th International Euro-Par Conference on Parallel Processing. (511-522).

    https://doi.org/10.1007/978-3-642-03869-3_49

  • Meyerson A and Tagiku B. Minimizing Average Shortest Path Distances via Shortcut Edge Addition. Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. (272-285).

    https://doi.org/10.1007/978-3-642-03685-9_21

  • Ke W and Mostafa J. A Referral Approach to Finding Medical Informatics Reviewers. Proceedings of the 2009 International Conference on Network-Based Information Systems. (194-199).

    https://doi.org/10.1109/NBiS.2009.96

  • Dietzfelbinger M and Woelfel P. Brief announcement. Proceedings of the 28th ACM symposium on Principles of distributed computing. (300-301).

    https://doi.org/10.1145/1582716.1582776

  • Fraigniaud P and Giakkoupis G. The effect of power-law degrees on the navigability of small worlds. Proceedings of the 28th ACM symposium on Principles of distributed computing. (240-249).

    https://doi.org/10.1145/1582716.1582755

  • Das Sarma A, Nanongkai D and Pandurangan G. Fast distributed random walks. Proceedings of the 28th ACM symposium on Principles of distributed computing. (161-170).

    https://doi.org/10.1145/1582716.1582745

  • Li D, Chen Z, Liu H, Vasilakos A and Pan Y. (2009). IPBGA. The Journal of Supercomputing. 49:2. (159-189). Online publication date: 1-Aug-2009.

    https://doi.org/10.1007/s11227-008-0226-9

  • Bartal A, Sasson E and Ravid G. Predicting Links in Social Networks Using Text Mining and SNA. Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining. (131-136).

    https://doi.org/10.1109/ASONAM.2009.12

  • Thimbleby H and Oladimeji P. Social network analysis and interactive device design analysis. Proceedings of the 1st ACM SIGCHI symposium on Engineering interactive computing systems. (91-100).

    https://doi.org/10.1145/1570433.1570453

  • Hsiao H, Lin Y and Liao H. (2009). Building Small-World Peer-to-Peer Networks Based on Hierarchical Structures. IEEE Transactions on Parallel and Distributed Systems. 20:7. (1023-1037). Online publication date: 1-Jul-2009.

    https://doi.org/10.1109/TPDS.2008.173

  • Nguyen D, Nguyen B and Vu D. (2009). Improving Freenet's Performance by Adaptive Clustering Cache Replacement 2009 IEEE-RIVF International Conference on Computing and Communication Technologies. 10.1109/RIVF.2009.5174645. 978-1-4244-4566-0. (1-7).

    http://ieeexplore.ieee.org/document/5174645/

  • Nguyen T, Gaudou B, Ho T and Marilleau N. (2009). Application of PAMS Collaboration Platform to Simulation-Based Researches in Soil Science: The Case of the MIcro-ORganism Project 2009 IEEE-RIVF International Conference on Computing and Communication Technologies. 10.1109/RIVF.2009.5174623. 978-1-4244-4566-0. (1-8).

    http://ieeexplore.ieee.org/document/5174623/

  • Rizzo G, Di Gregorio F, Di Nunzio P, Servetti A and De Martin J. (2009). A peer-to-peer architecture for distributed and reliable RDF storage 2009 First International Conference on Networked Digital Technologies (NDT). 10.1109/NDT.2009.5272090. 978-1-4244-4614-8. (94-99).

    http://ieeexplore.ieee.org/document/5272090/

  • Kaufmann M and Zweig K. Modeling and Designing Real---World Networks. Algorithmics of Large and Complex Networks. (359-379).

    https://doi.org/10.1007/978-3-642-02094-0_17

  • Haynes J and Perisic I. Mapping search relevance to social networks. Proceedings of the 3rd Workshop on Social Network Mining and Analysis. (1-7).

    https://doi.org/10.1145/1731011.1731013

  • Zaczek L and Datta A. Mapping Social Networks into P2P Directory Service. Proceedings of the 2009 International Workshop on Social Informatics. (10-15).

    https://doi.org/10.1109/SocInfo.2009.11

  • Lan L and Hongyong Y. Internet network model based on fluid and bandwidth. Proceedings of the 21st annual international conference on Chinese control and decision conference. (4231-4236).

    /doi/10.5555/1714810.1714937

  • Cartledge C and Nelson M. Unsupervised creation of small world networks for the preservation of digital objects. Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries. (349-352).

    https://doi.org/10.1145/1555400.1555458

  • Mostefaoui A, Raynal M and Tredan G. (2009). On the Fly Estimation of the Processes that Are Alive in an Asynchronous Message-Passing System. IEEE Transactions on Parallel and Distributed Systems. 20:6. (778-787). Online publication date: 1-Jun-2009.

    https://doi.org/10.1109/TPDS.2009.12

  • Zhao C, Zhang X and Yi D. A General Framework. Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science. (337-341).

    https://doi.org/10.1109/ICIS.2009.201

  • Xu J and Jin H. (2009). A structured P2P network based on the small world phenomenon. The Journal of Supercomputing. 48:3. (264-285). Online publication date: 1-Jun-2009.

    https://doi.org/10.1007/s11227-008-0219-8

  • Dietzfelbinger M and Woelfel P. Tight lower bounds for greedy routing in uniform small world rings. Proceedings of the forty-first annual ACM symposium on Theory of computing. (591-600).

    https://doi.org/10.1145/1536414.1536494

  • Lattanzi S and Sivakumar D. Affiliation networks. Proceedings of the forty-first annual ACM symposium on Theory of computing. (427-434).

    https://doi.org/10.1145/1536414.1536474

  • Rebollo M. Small world model for agent search. Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2. (1177-1178).

    /doi/10.5555/1558109.1558199

  • Zeng Z and Yu H. (2009). The P2P Network Resources Localization Algorithm Research and Improvement Based on JXTA Platform 2009 International Conference on Networking and Digital Society (ICNDS). 10.1109/ICNDS.2009.36. 978-0-7695-3635-4. (121-124).

    http://ieeexplore.ieee.org/document/5116226/

  • Fraigniaud P, Gavoille C, Kosowski A, Lebhar E and Lotker Z. (2009). Universal augmentation schemes for network navigability. Theoretical Computer Science. 410:21-23. (1970-1981). Online publication date: 1-May-2009.

    https://doi.org/10.1016/j.tcs.2008.12.061

  • Kaiser M and Simonotto J. (2009). Structural and Functional Dynamics in Cortical and Neuronal Networks. Analysis of Complex Networks. 10.1002/9783527627981.ch10. (245-269). Online publication date: 22-Apr-2009.

    https://onlinelibrary.wiley.com/doi/10.1002/9783527627981.ch10

  • Goel S, Muhamad R and Watts D. Social search in "Small-World" experiments. Proceedings of the 18th international conference on World wide web. (701-710).

    https://doi.org/10.1145/1526709.1526804

  • Gianini G and Damiani E. Do neighbor-avoiding walkers walk as if in a small-world network?. Proceedings of the 28th IEEE international conference on Computer Communications Workshops. (248-253).

    /doi/10.5555/1719850.1719892

  • Liu C and Wu J. (2009). Virtual-Force-Based Geometric Routing Protocol in MANETs. IEEE Transactions on Parallel and Distributed Systems. 20:4. (433-445). Online publication date: 1-Apr-2009.

    https://doi.org/10.1109/TPDS.2008.103

  • Gianini G and Damiani E. (2009). Do Neighbor-Avoiding Walkers Walk as if in a Small-World Network? IEEE INFOCOM 2009 - IEEE Conference on Computer Communications Workshops. 10.1109/INFCOMW.2009.5072133. 978-1-4244-3968-3. (1-6).

    http://ieeexplore.ieee.org/document/5072133/

  • Sarkar R, Zhu X and Gao J. (2009). Spatial Distribution in Routing Table Design for Sensor Networks 2009 Proceedings IEEE INFOCOM. 10.1109/INFCOM.2009.5062228. 978-1-4244-3512-8. (2766-2770).

    http://ieeexplore.ieee.org/document/5062228/

  • Mathieu F, Postelnicu G and Reynier J. (2009). The Stable Configuration of Acyclic Preference-Based Systems 2009 Proceedings IEEE INFOCOM. 10.1109/INFCOM.2009.5062060. 978-1-4244-3512-8. (1440-1448).

    http://ieeexplore.ieee.org/document/5062060/

  • Liu H and Vainstein F. (2009). Greedy routing in wireless mesh network: Performance and analysis 2009 International Conference on Networking, Sensing and Control (ICNSC). 10.1109/ICNSC.2009.4919381. 978-1-4244-3491-6. (797-802).

    http://ieeexplore.ieee.org/document/4919381/

  • Gryc W, Helander M, Lawrence R, Liu Y, Perlich C, Reddy C and Rosset S. Looking for Great Ideas. Advances in Web Mining and Web Usage Analysis. (21-39).

    https://doi.org/10.1007/978-3-642-00528-2_2

  • Boukhelef D and Kitagawa H. Dynamic load balancing in RCAN content addressable network. Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication. (98-106).

    https://doi.org/10.1145/1516241.1516259

  • Ruffo G and Schifanella R. (2009). A peer-to-peer recommender system based on spontaneous affinities. ACM Transactions on Internet Technology. 9:1. (1-34). Online publication date: 1-Feb-2009.

    https://doi.org/10.1145/1462159.1462163

  • Zhou X, Xue K, Zhou J, Lu H and Hong P. (2009). HICUS: A quasi-structured P2P system based on hierarchical interest. Journal of Electronics (China). 10.1007/s11767-007-0100-6. 26:2. (198-204). Online publication date: 1-Feb-2009.

    http://link.springer.com/10.1007/s11767-007-0100-6

  • Dagand P, Kostić D and Kuncak V. Opis. Proceedings of the 4th international workshop on Types in language design and implementation. (65-78).

    https://doi.org/10.1145/1481861.1481870

  • Lifshits Y and Zhang S. Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design. Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms. (318-326).

    /doi/10.5555/1496770.1496806

  • SRIPRASERTSUK P and KAMEYAMA W. (2009). Information Distribution Analysis Based on Human's Behavior State Model and the Small-World Network. IEICE Transactions on Information and Systems. 10.1587/transinf.E92.D.608. E92-D:4. (608-619).

    http://joi.jlc.jst.go.jp/JST.JSTAGE/transinf/E92.D.608?from=CrossRef

  • Boguñá M, Krioukov D and Claffy K. (2008). Navigability of complex networks. Nature Physics. 10.1038/nphys1130. 5:1. (74-80). Online publication date: 1-Jan-2009.

    http://www.nature.com/articles/nphys1130

  • Clauset A, Tanner H, Abdallah C and Byrne R. (2009). Controlling Across Complex Networks: Emerging Links Between Networks and Control. Topics in Time Delay Systems. 10.1007/978-3-642-02897-7_28. (329-347).

    http://link.springer.com/10.1007/978-3-642-02897-7_28

  • Bilò V, Caragiannis I, Fanelli A, Flammini M, Kaklamanis C, Monaco G and Moscardelli L. (2009). Game-Theoretic Approaches to Optimization Problems in Communication Networks. Graphs and Algorithms in Communication Networks. 10.1007/978-3-642-02250-0_9. (241-263).

    https://link.springer.com/10.1007/978-3-642-02250-0_9

  • Aoyama K, Saito K, Yamada T and Ueda N. (2009). Fast Similarity Search in Small-World Networks. Complex Networks. 10.1007/978-3-642-01206-8_16. (185-196).

    http://link.springer.com/10.1007/978-3-642-01206-8_16

  • Tian D, Mao T and Xie J. Adaptive Failure Detection Algorithm for Grid Systems. Fuzzy Information and Engineering. 10.1007/978-3-540-88914-4_36. (288-296).

    http://link.springer.com/10.1007/978-3-540-88914-4_36

  • Datta A. (2009). Load Balancing in Peer-to-Peer Overlay Networks. Encyclopedia of Database Systems. 10.1007/978-0-387-39940-9_1043. (1627-1632).

    http://link.springer.com/10.1007/978-0-387-39940-9_1043

  • Li D, Liu H and Vasilakos A. (2009). An Efficient, Scalable and Robust P2P Overlay for Autonomic Communication. Autonomic Communication. 10.1007/978-0-387-09753-4_13. (327-350).

    https://link.springer.com/10.1007/978-0-387-09753-4_13

  • Ghate A and Smith R. (2008). A Hit‐and‐Run approach for generating scale invariant Small World networks. Networks. 10.1002/net.20262. 53:1. (67-78). Online publication date: 1-Jan-2009.

    https://onlinelibrary.wiley.com/doi/10.1002/net.20262

  • Wang C and Harfoush K. (2008). Shortest-path routing in randomized DHT-based Peer-to-Peer systems. Computer Networks: The International Journal of Computer and Telecommunications Networking. 52:18. (3307-3317). Online publication date: 22-Dec-2008.

    https://doi.org/10.1016/j.comnet.2008.07.014

  • Lebhar E and Schabanel N. Graph Augmentation via Metric Embedding. Proceedings of the 12th International Conference on Principles of Distributed Systems. (217-225).

    https://doi.org/10.1007/978-3-540-92221-6_15

  • Goussevskaia O, Kuhn M, Lorenzi M and Wattenhofer R. From Web to Map. Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01. (242-248).

    https://doi.org/10.1109/WIIAT.2008.20

  • Zhuge H and Sun X. (2008). A Virtual Ring Method for Building Small-World Structured P2P Overlays. IEEE Transactions on Knowledge and Data Engineering. 20:12. (1712-1725). Online publication date: 1-Dec-2008.

    https://doi.org/10.1109/TKDE.2008.102

  • Wan Y, Roy S, Wang X, Saberi A, Yang T, Xue M and Malek B. (2008). On the structure of graph edge designs that optimize the algebraic connectivity 2008 47th IEEE Conference on Decision and Control. 10.1109/CDC.2008.4738734. 978-1-4244-3123-6. (805-810).

    http://ieeexplore.ieee.org/document/4738734/

  • Melamed R and Keidar I. (2008). Araneola. Journal of Parallel and Distributed Computing. 68:12. (1539-1560). Online publication date: 1-Dec-2008.

    https://doi.org/10.1016/j.jpdc.2008.07.011

  • Gatani L, De Paola A, Lo Re G and Gaglio S. (2007). An Adaptive Routing Mechanism for P2P Resource Discovery. Journal of Grid Computing. 10.1007/s10723-007-9073-9. 6:4. (367-367). Online publication date: 1-Dec-2008.

    http://link.springer.com/10.1007/s10723-007-9073-9

  • Boldrini C, Conti M and Passarella A. User-Centric Mobility Models for Opportunistic Networking. Bio-Inspired Computing and Communication. (255-267).

    https://doi.org/10.1007/978-3-540-92191-2_23

  • Zheng J, Qin Y, Zhu J and Li X. Constructing Trust Networks Based on Small-World Theories. Proceedings of the 2008 The 9th International Conference for Young Computer Scientists. (1957-1962).

    https://doi.org/10.1109/ICYCS.2008.469

  • Thadakamalla H, Kumara S and Albert R. (2008). Complexity and Large-Scale Networks. Operations Research Methodologies. 10.1201/9781420091830.ch11. (319-351). Online publication date: 12-Nov-2008.

    http://www.crcnetbase.com/doi/10.1201/9781420091830.ch11

  • Boukhelef D and Kitagawa H. Multi-ring Infrastructure for Content Addressable Networks. Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:. (193-211).

    https://doi.org/10.1007/978-3-540-88871-0_15

  • Lange R, Dürr F and Rothermel K. Scalable processing of trajectory-based queries in space-partitioned moving objects databases. Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems. (1-10).

    https://doi.org/10.1145/1463434.1463474

  • Kleinberg J. (2008). The convergence of social and technological networks. Communications of the ACM. 51:11. (66-72). Online publication date: 1-Nov-2008.

    https://doi.org/10.1145/1400214.1400232

  • Crisostomo S, Barros J and Bettstetter C. (2008). Network coding with shortcuts 2008 11th IEEE Singapore International Conference on Communication Systems (ICCS). 10.1109/ICCS.2008.4737366. 978-1-4244-2423-8. (1165-1170).

    http://ieeexplore.ieee.org/document/4737366/

  • Halim F, Wu Y and Yap R. Small World Networks as (Semi)-Structured Overlay Networks. Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops. (214-218).

    https://doi.org/10.1109/SASOW.2008.56

  • Zweig K and Zimmermann K. Wanderer between the Worlds - Self-Organized Network Stability in Attack and Random Failure Scenarios. Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems. (309-318).

    https://doi.org/10.1109/SASO.2008.35

  • Halim F, Wu Y and Yap R. Security Issues in Small World Network Routing. Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems. (493-494).

    https://doi.org/10.1109/SASO.2008.21

  • Guo X, Li X, Qin Y and Chen C. Modeling Small-World Trust Networks. Proceedings of the 2008 International Symposium on Ubiquitous Multimedia Computing. (154-159).

    https://doi.org/10.1109/UMC.2008.38

  • Chelly B and Malouch N. Movement and Connectivity Algorithms for Location-Based Mobile Social Networks. Proceedings of the 2008 IEEE International Conference on Wireless & Mobile Computing, Networking & Communication. (190-195).

    https://doi.org/10.1109/WiMob.2008.48

  • Sandberg O. Neighbor selection and hitting probability in small-world graphs. The Annals of Applied Probability. 10.1214/07-AAP499. 18:5.

    https://projecteuclid.org\journals\annals-of-applied-probability\volume-18\issue-5\Neighbor-selection-and-hitting-probability-in-small-world-graphs\10.1214/07-AAP499.full

  • Sharma G and Mazumdar R. (2008). A case for hybrid sensor networks. IEEE/ACM Transactions on Networking. 16:5. (1121-1132). Online publication date: 1-Oct-2008.

    https://doi.org/10.1109/TNET.2007.910666

  • Lacroix V, Cottret L, Thébault P and Sagot M. (2008). An Introduction to Metabolic Networks and Their Structural Analysis. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 5:4. (594-617). Online publication date: 1-Oct-2008.

    https://doi.org/10.1109/TCBB.2008.79

  • Boldrini C, Conti M and Passarella A. (2008). Fast track article. Pervasive and Mobile Computing. 4:5. (633-657). Online publication date: 1-Oct-2008.

    https://doi.org/10.1016/j.pmcj.2008.04.003

  • Brocco A, Frapolli F and Hirsbrunner B. BlåtAnt. Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence. (275-282).

    https://doi.org/10.1007/978-3-540-87527-7_27

  • Goussevskaia O, Kuhn M and Wattenhofer R. Exploring music collections on mobile devices. Proceedings of the 10th international conference on Human computer interaction with mobile devices and services. (359-362).

    https://doi.org/10.1145/1409240.1409288

  • Şimşek Ö and Jensen D. (2008). Navigating networks by using homophily and degree. Proceedings of the National Academy of Sciences. 10.1073/pnas.0800497105. 105:35. (12758-12762). Online publication date: 2-Sep-2008.

    https://pnas.org/doi/full/10.1073/pnas.0800497105

  • Berners‐Lee T and Kagal L. (2008). The Fractal Nature of the Semantic Web. AI Magazine. 29:3. (29-34). Online publication date: 1-Sep-2008.

    https://doi.org/10.1609/aimag.v29i3.2161

  • Mingxin Yuan , Sun'an Wang and Naijian Chen . (2008). A novel fuzzy clustering method based on chaos small-world algorithm for image edge detection 2008 IEEE Conference on Cybernetics and Intelligent Systems (CIS). 10.1109/ICCIS.2008.4670788. 978-1-4244-1673-8. (1-6).

    http://ieeexplore.ieee.org/document/4670788/

  • Avin C. Distance graphs. Proceedings of the fifth international workshop on Foundations of mobile computing. (71-78).

    https://doi.org/10.1145/1400863.1400878

  • Chaintreau A, Fraigniaud P and Lebhar E. Forget him and keep on moving. Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing. (415-415).

    https://doi.org/10.1145/1400751.1400806

  • Chaintreau A, Fraigniaud P and Lebhar E. Opportunistic spatial gossip over mobile social networks. Proceedings of the first workshop on Online social networks. (73-78).

    https://doi.org/10.1145/1397735.1397752

  • Karamchandani N and Franceschetti M. (2008). Scaling laws for delay-sensitive traffic in Rayleigh fading networks. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 10.1098/rspa.2007.0330. 464:2096. (2187-2205). Online publication date: 8-Aug-2008.

    http://rspa.royalsocietypublishing.org/cgi/doi/10.1098/rspa.2007.0330

  • Li J. Mechanism of a Resource Location Approach in Power-Law Networks. Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 01. (184-187).

    https://doi.org/10.1109/CCCM.2008.157

  • Shiping Chen , Kaihua Rao , Yuan Li , Lei Zhao , Tao Li and Shigang Chen . (2008). Random P2P network with O(d) routing distance 2008 Third International Conference on Communications and Networking in China (CHINACOM). 10.1109/CHINACOM.2008.4685001. 978-1-4244-2373-6. (191-196).

    http://ieeexplore.ieee.org/document/4685001/

  • Meshkova E, Riihijärvi J, Petrova M and Mähönen P. (2008). A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks. Computer Networks: The International Journal of Computer and Telecommunications Networking. 52:11. (2097-2128). Online publication date: 1-Aug-2008.

    https://doi.org/10.1016/j.comnet.2008.03.006

  • Hernández-Goya C, Caballero-Gil P, Delgado-Mohatar O, Molina-Gil J and Caballero-Gil C. Using New Tools for Certificate Repositories Generation in MANETs. Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security. (175-189).

    https://doi.org/10.1007/978-3-540-70567-3_14

  • Meier D, Oswald Y, Schmid S and Wattenhofer R. On the windfall of friendship. Proceedings of the 9th ACM conference on Electronic commerce. (294-301).

    https://doi.org/10.1145/1386790.1386836

  • Chaintreau A, Fraigniaud P and Lebhar E. Networks Become Navigable as Nodes Move and Forget. Proceedings of the 35th international colloquium on Automata, Languages and Programming - Volume Part I. (133-144).

    https://doi.org/10.1007/978-3-540-70575-8_12

  • Inaltekin H, Mung Chiang and Poor H. (2008). Expected message delivery time for small-world networks in the continuum limit 2008 IEEE International Symposium on Information Theory - ISIT. 10.1109/ISIT.2008.4595070. 978-1-4244-2256-2. (667-671).

    http://ieeexplore.ieee.org/document/4595070/

  • Ya-Chu Yang , Chien-Ming Cheng , Pei-Yun Lin and Shiao-Li Tsao . (2008). A real-time road traffic information system based on a peer-to-peer approach 2008 IEEE Symposium on Computers and Communications (ISCC). 10.1109/ISCC.2008.4625720. 978-1-4244-2702-4. (513-518).

    http://ieeexplore.ieee.org/document/4625720/

  • Lesueur F, Me L and Tong V. (2008). A sybilproof distributed identity management for P2P networks 2008 IEEE Symposium on Computers and Communications (ISCC). 10.1109/ISCC.2008.4625694. 978-1-4244-2702-4. (246-253).

    http://ieeexplore.ieee.org/document/4625694/

  • Albano M, Ricci L, Baldanzi M and Baraglia R. (2008). VoRaQue: Range queries on Voronoi overlays 2008 IEEE Symposium on Computers and Communications (ISCC). 10.1109/ISCC.2008.4625648. 978-1-4244-2702-4. (495-500).

    http://ieeexplore.ieee.org/document/4625648/

  • Cami A and Deo N. (2007). Techniques for analyzing dynamic random graph models of web‐like networks: An overview. Networks. 10.1002/net.20215. 51:4. (211-255). Online publication date: 1-Jul-2008.

    https://onlinelibrary.wiley.com/doi/10.1002/net.20215

  • Lesueur F, Mé L and Tong V. A Sybil-Resistant Admission Control Coupling SybilGuard with Distributed Certification. Proceedings of the 2008 IEEE 17th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises. (105-110).

    https://doi.org/10.1109/WETICE.2008.7

  • Zhang C, Li P, Fang Y and Khargonekar P. Decentralized Routing in Nonhomogeneous Poisson Networks. Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems. (478-485).

    https://doi.org/10.1109/ICDCS.2008.83

  • Fraigniaud P, Lebhar E and Lotker Z. Recovering the Long-Range Links in Augmented Graphs. Proceedings of the 15th international colloquium on Structural Information and Communication Complexity. (104-118).

    https://doi.org/10.1007/978-3-540-69355-0_10

  • Teuscher C, Gulbahce N and Rohlf T. Assessing random dynamical network architectures for nanoelectronics. Proceedings of the 2008 IEEE International Symposium on Nanoscale Architectures. (16-23).

    https://doi.org/10.1109/NANOARCH.2008.4585787

  • Jiang C, Chen C, Chang J, Jan R and Chiang T. Construct Small Worlds in Wireless Networks Using Data Mules. Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008). (28-35).

    https://doi.org/10.1109/SUTC.2008.93

  • Friedman R, Kermarrec A and Raynal M. (2008). Modularity. ACM SIGACT News. 39:2. (91-110). Online publication date: 1-Jun-2008.

    https://doi.org/10.1145/1388240.1388258

  • Bilò V, Fanelli A, Flammini M and Moscardelli L. Graphical congestion games with linear latencies. Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures. (194-196).

    https://doi.org/10.1145/1378533.1378571

  • Fernandess Y and Malkhi D. On spreading recommendations via social gossip. Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures. (91-97).

    https://doi.org/10.1145/1378533.1378547

  • Fraigniaud P and Gavoille C. Polylogarithmic network navigability using compact metrics with small stretch. Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures. (62-69).

    https://doi.org/10.1145/1378533.1378542

  • Bar-Yossef Z, Friedman R and Kliot G. (2008). RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks. ACM Transactions on Computer Systems. 26:2. (1-66). Online publication date: 1-Jun-2008.

    https://doi.org/10.1145/1365815.1365817

  • Fengming Liu and Yongsheng Ding . (2008). Social network-based trust computing in P2P environments 2008 7th World Congress on Intelligent Control and Automation. 10.1109/WCICA.2008.4593253. 978-1-4244-2113-8. (2130-2135).

    http://ieeexplore.ieee.org/document/4593253/

  • Chen G, Low C and Yang Z. (2008). Enhancing Search Performance in Unstructured P2P Networks Based on Users' Common Interest. IEEE Transactions on Parallel and Distributed Systems. 19:6. (821-836). Online publication date: 1-Jun-2008.

    https://doi.org/10.1109/TPDS.2008.42

  • Li M, Lee W, Sivasubramaniam A and Zhao J. (2008). SSW. IEEE Transactions on Parallel and Distributed Systems. 19:6. (735-749). Online publication date: 1-Jun-2008.

    https://doi.org/10.1109/TPDS.2007.70757

  • Yu H, Kaminsky M, Gibbons P and Flaxman A. (2008). SybilGuard. IEEE/ACM Transactions on Networking. 16:3. (576-589). Online publication date: 1-Jun-2008.

    https://doi.org/10.1109/TNET.2008.923723

  • Kong J, Bridgewater J and Roychowdhury V. (2008). Resilience of structured P2P systems under churn. Computer Communications. 31:10. (2109-2123). Online publication date: 1-Jun-2008.

    https://doi.org/10.1016/j.comcom.2008.01.051

  • Yu H, Gibbons P, Kaminsky M and Xiao F. SybilLimit. Proceedings of the 2008 IEEE Symposium on Security and Privacy. (3-17).

    https://doi.org/10.1109/SP.2008.13

  • Khemakhem S, Drira K, Khemakhem E and Jmaiel M. (2008). An experimental evaluation of SEC+, an enhanced search engine for component-based software development. ACM SIGSOFT Software Engineering Notes. 33:3. (1-3). Online publication date: 1-May-2008.

    https://doi.org/10.1145/1360602.1360610

  • Borsoi B and Becerra J. (2008). Definition and modeling of process using object orientation. ACM SIGSOFT Software Engineering Notes. 33:3. (1-6). Online publication date: 1-May-2008.

    https://doi.org/10.1145/1360602.1360609

  • Teuscher C and Hansson A. (2008). Non-traditional irregular interconnects for massive scale SoC 2008 IEEE International Symposium on Circuits and Systems - ISCAS 2008. 10.1109/ISCAS.2008.4542035. 978-1-4244-1683-7. (2785-2788).

    http://ieeexplore.ieee.org/document/4542035/

  • Wu J and Yang S. (2008). SmallWorld Model-Based Polylogarithmic Routing Using Mobile Nodes. Journal of Computer Science and Technology. 10.1007/s11390-008-9136-9. 23:3. (327-342). Online publication date: 1-May-2008.

    http://link.springer.com/10.1007/s11390-008-9136-9

  • Gossa J, Janecek A, Hummel K, Gansterer W and Pierson J. Proactive Replica Placement Using Mobility Prediction. Proceedings of the 2008 Ninth International Conference on Mobile Data Management Workshops. (182-189).

    https://doi.org/10.1109/MDMW.2008.21

  • Mei Q, Cai D, Zhang D and Zhai C. Topic modeling with network regularization. Proceedings of the 17th international conference on World Wide Web. (101-110).

    https://doi.org/10.1145/1367497.1367512

  • Shrivastava N, Majumder A and Rastogi R. Mining (Social) Network Graphs to Detect Random Link Attacks. Proceedings of the 2008 IEEE 24th International Conference on Data Engineering. (486-495).

    https://doi.org/10.1109/ICDE.2008.4497457

  • Bordenave C. Navigation on a Poisson point process. The Annals of Applied Probability. 10.1214/07-AAP472. 18:2.

    https://projecteuclid.org\journals\annals-of-applied-probability\volume-18\issue-2\Navigation-on-a-Poisson-point-process\10.1214/07-AAP472.full

  • Xucheng Luo , Zhiguang Qin , Jinsong Han and Hanhua Chen . (2008). DHT-assisted probabilistic exhaustive search in unstructured P2P networks Distributed Processing Symposium (IPDPS). 10.1109/IPDPS.2008.4536254. 978-1-4244-1693-6. (1-9).

    http://ieeexplore.ieee.org/document/4536254/

  • Chiola G and Ribaudo M. (2008). Neighbor-of-neighbor routing over deterministically modulated Chord-like DHTs Distributed Processing Symposium (IPDPS). 10.1109/IPDPS.2008.4536203. 978-1-4244-1693-6. (1-8).

    http://ieeexplore.ieee.org/document/4536203/

  • Bin D, Furong W, Ma J and Jian L. Enhanced Chord-Based Routing Protocol Using Neighbors' Neighbors Links. Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops. (463-466).

    https://doi.org/10.1109/WAINA.2008.53

  • Flammini M, Moscardelli L, Navarra A and Pérennes S. (2008). Asymptotically Optimal Solutions for Small World Graphs. Theory of Computing Systems. 42:4. (632-650). Online publication date: 17-Mar-2008.

    https://doi.org/10.1007/s00224-007-9073-y

  • Ning X, Jin H and Wu H. (2008). RSS. Information Processing and Management: an International Journal. 44:2. (893-909). Online publication date: 1-Mar-2008.

    https://doi.org/10.1016/j.ipm.2007.03.005

  • Kersch P and Szabó R. (2008). DHT routing analysis in a logarithmically transformed space. Peer-to-Peer Networking and Applications. 10.1007/s12083-007-0002-2. 1:1. (64-74). Online publication date: 1-Mar-2008.

    http://link.springer.com/10.1007/s12083-007-0002-2

  • Kersch P, Szabo R, Cheng L, Jean K and Galis A. (2008). Stochastic maintenance of overlays in structured P2P systems. Computer Communications. 31:3. (603-619). Online publication date: 15-Feb-2008.

    https://doi.org/10.1016/j.comcom.2007.08.017

  • Goyal N, Lifshits Y and Schütze H. Disorder inequality. Proceedings of the 2008 International Conference on Web Search and Data Mining. (25-32).

    https://doi.org/10.1145/1341531.1341538

  • Zhuge H, Chen X, Sun X and Yao E. (2008). HRing. IEEE Transactions on Parallel and Distributed Systems. 19:2. (145-158). Online publication date: 1-Feb-2008.

    https://doi.org/10.1109/TPDS.2007.70725

  • Schütt T, Schintke F and Reinefeld A. (2008). Range queries on structured overlay networks. Computer Communications. 31:2. (280-291). Online publication date: 1-Feb-2008.

    https://doi.org/10.1016/j.comcom.2007.08.027

  • Angel O, Benjamini I, Ofek E and Wieder U. (2008). Routing complexity of faulty networks. Random Structures & Algorithms. 32:1. (71-87). Online publication date: 1-Jan-2008.

    /doi/10.5555/1323937.1323938

  • Campuzano J, Bagrow J, ben-Avraham D and McClintock P. (2008). Kleinberg Navigation on Anisotropic Lattices. Physics Research International. 10.1155/2008/346543. 2008:1. Online publication date: 1-Jan-2008.

    https://onlinelibrary.wiley.com/doi/10.1155/2008/346543

  • Kurucz M, Lukács L, Silklói D, Benczúr A, Csalogány K and Lukács A. (2008). Telephone Call Network Data Mining: A Survey with Experiments. Handbook of Large-Scale Random Networks. 10.1007/978-3-540-69395-6_12. (489-530).

    http://link.springer.com/10.1007/978-3-540-69395-6_12

  • Malkhi D. (2008). P2P. Encyclopedia of Algorithms. 10.1007/978-0-387-30162-4_272. (611-616).

    https://link.springer.com/10.1007/978-0-387-30162-4_272

  • Angel O, Benjamini I, Ofek E and Wieder U. (2007). Routing complexity of faulty networks. Random Structures & Algorithms. 10.1002/rsa.20163. 32:1. (71-87). Online publication date: 1-Jan-2008.

    https://onlinelibrary.wiley.com/doi/10.1002/rsa.20163

  • Bonnet F, Kermarrec A and Raynal M. Small-world networks. Proceedings of the 11th international conference on Principles of distributed systems. (372-385).

    /doi/10.5555/1782394.1782421

  • Beaumont O, Kermarrec A and Rivière É. Peer to peer multidimensional overlays. Proceedings of the 11th international conference on Principles of distributed systems. (315-328).

    /doi/10.5555/1782394.1782417

  • Duchon P, Eggemann N and Hanusse N. Non-searchability of random power-law graphs. Proceedings of the 11th international conference on Principles of distributed systems. (274-285).

    /doi/10.5555/1782394.1782414

  • Barbella D, Kachergis G, Liben-Nowell D, Sallstrom A and Sowell B. Depth of field and cautious-greedy routing in social networks. Proceedings of the 18th international conference on Algorithms and computation. (574-586).

    /doi/10.5555/1781574.1781638

  • Gu T, Pung H and Zhang D. A semantic P2P framework for building context-aware applications in multiple smart spaces. Proceedings of the 2007 international conference on Embedded and ubiquitous computing. (553-564).

    /doi/10.5555/1780745.1780806

  • Arcaute E, Chen N, Kumar R, Liben-Nowell D, Mahdian M, Nazerzadeh H and Xu Y. Deterministic decentralized search in random graphs. Proceedings of the 5th international conference on Algorithms and models for the web-graph. (187-194).

    /doi/10.5555/1777879.1777894

  • Mahdian M and Xu Y. Stochastic Kronecker graphs. Proceedings of the 5th international conference on Algorithms and models for the web-graph. (179-186).

    /doi/10.5555/1777879.1777893

  • Young S and Scheinerman E. Random dot product graph models for social networks. Proceedings of the 5th international conference on Algorithms and models for the web-graph. (138-149).

    /doi/10.5555/1777879.1777890

  • Chaintreau A, Mtibaa A, Massoulie L and Diot C. The diameter of opportunistic mobile networks. Proceedings of the 2007 ACM CoNEXT conference. (1-12).

    https://doi.org/10.1145/1364654.1364670

  • Tao Gu , Daqing Zhang and Hung Keng Pung . A two-tier semantic overlay network for P2P search. Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01. (1-8).

    https://doi.org/10.1109/ICPADS.2007.4447754

  • Purandare D and Guha R. (2007). An Alliance Based Peering Scheme for P2P Live Media Streaming. IEEE Transactions on Multimedia. 9:8. (1633-1644). Online publication date: 1-Dec-2007.

    https://doi.org/10.1109/TMM.2007.907453

  • Evans N, GauthierDickey C and Grothoff C. (2007). Routing in the Dark: Pitch Black Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007). 10.1109/ACSAC.2007.7. 0-7695-3060-5. (305-314).

    http://ieeexplore.ieee.org/document/4412998/

  • Borch N, Andersen A and Vognild L. Social topology analyzed. Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I. (226-237).

    /doi/10.5555/1784607.1784628

  • Yang J, Matsuo Y and Ishizuka M. An Augmented Tagging Scheme with Triple Tagging and Collective Filtering. Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence. (35-38).

    https://doi.org/10.1109/WI.2007.16

  • Karamchandani N and Franceschetti M. (2007). Scaling Laws for Delay Sensitive Traffic in Rayleigh Fading Networks IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference. 10.1109/GLOCOM.2007.168. 978-1-4244-1042-2. (870-874).

    http://ieeexplore.ieee.org/document/4411078/

  • Gu T, Pung H and Zhang D. (2007). Information retrieval in schema-based P2P systems using one-dimensional semantic space. Computer Networks: The International Journal of Computer and Telecommunications Networking. 51:16. (4543-4560). Online publication date: 1-Nov-2007.

    https://doi.org/10.1016/j.comnet.2007.06.019

  • Mislove A, Marcon M, Gummadi K, Druschel P and Bhattacharjee B. Measurement and analysis of online social networks. Proceedings of the 7th ACM SIGCOMM conference on Internet measurement. (29-42).

    https://doi.org/10.1145/1298306.1298311

  • Fraigniaud P. Small worlds as navigable augmented networks. Proceedings of the 15th annual European conference on Algorithms. (2-11).

    /doi/10.5555/1778580.1778583

  • Ghodsi A, Haridi S and Weatherspoon H. (2007). Exploiting the synergy between gossiping and structured overlays. ACM SIGOPS Operating Systems Review. 41:5. (61-66). Online publication date: 1-Oct-2007.

    https://doi.org/10.1145/1317379.1317389

  • Ramaswamy V, Hansson A and Eidenbenz S. (2007). COBRA A Multi-path Adaptive Local Load Sensing Routing Protocol for Wireless Sensor Networks Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2007). 10.1109/WIMOB.2007.4390856. 0-7695-2889-9. (62-62).

    http://ieeexplore.ieee.org/document/4390856/

  • Conti M, Delmastro F and Passarella A. (2007). Context-aware File Sharing for Opportunistic Networks 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems. 10.1109/MOBHOC.2007.4428696. 978-1-4244-1454-3. (1-3).

    http://ieeexplore.ieee.org/document/4428696/

  • Wu J and Yang S. (2007). Polylogarithmic Store-Carry-Forward Routing using Mobile Nodes 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems. 10.1109/MOBHOC.2007.4428644. 978-1-4244-1454-3. (1-11).

    http://ieeexplore.ieee.org/document/4428644/

  • Wu X, Sadjadpour H and Garcia-Luna-Aceves J. (2007). Routing Overhead as A Function of Node Mobility: Modeling Framework and Implications on Proactive Routing 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems. 10.1109/MOBHOC.2007.4428595. 978-1-4244-1454-3. (1-9).

    http://ieeexplore.ieee.org/document/4428595/

  • Galuba W and Aberer K. Generic emergent overlays in arbitrary peer identifier spaces. Proceedings of the Second international conference on Self-Organizing Systems. (88-102).

    /doi/10.5555/2393761.2393774

  • Hou Y, Chen C and Jeng B. A key predistribution scheme for wireless sensor networks using the small-world concept. Proceedings of the 1st international conference on Network-based information systems. (137-146).

    /doi/10.5555/1776510.1776528

  • Li J, Zhang S, Zhang Z and Liu S. (2007). Analyzing and Optimizing Skype Peer-to-Peer System 2007 International Conference on Wireless Communications, Networking and Mobile Computing. 10.1109/WICOM.2007.704. 1-4244-1311-7. (2837-2840).

    http://ieeexplore.ieee.org/document/4340479/

  • Cheng C, Tsao S and Chou J. (2007). Unstructured Peer-to-Peer Session Initiation Protocol for Mobile Environment 2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications. 10.1109/PIMRC.2007.4394628. 978-1-4244-1143-6. (1-5).

    http://ieeexplore.ieee.org/document/4394628/

  • Klemm F, Girdzijauskas S, Le Boudec J and Aberer K. (2007). On Routing in Distributed Hash Tables Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007). 10.1109/P2P.2007.38. 0-7695-2986-0. (113-122).

    http://ieeexplore.ieee.org/document/4343471/

  • Dell'Amico M. (2007). Mapping Small Worlds Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007). 10.1109/P2P.2007.29. 0-7695-2986-0. (219-228).

    http://ieeexplore.ieee.org/document/4343483/

  • Sygkouna I, Anagnostou M and Sykas E. (2007). Searching for information in a P2P system. International Journal of Computers and Applications. 29:4. (394-401). Online publication date: 1-Sep-2007.

    https://doi.org/10.1080/1206212X.2007.11441870

  • Helander M, Lawrence R, Liu Y, Perlich C, Reddy C and Rosset S. Looking for great ideas. Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis. (66-73).

    https://doi.org/10.1145/1348549.1348557

  • Davitz J, Yu J, Basu S, Gutelius D and Harris A. iLink. Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. (931-940).

    https://doi.org/10.1145/1281192.1281292

  • Duchon P, Eggemann N and Hanusse N. Non-searchability of random scale-free graphs. Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing. (380-381).

    https://doi.org/10.1145/1281100.1281183

  • Giakkoupis G and Hadzilacos V. On the complexity of greedy routing in ring-based peer-to-peer networks. Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing. (99-108).

    https://doi.org/10.1145/1281100.1281117

  • Naor M and Wieder U. (2007). Novel architectures for P2P applications. ACM Transactions on Algorithms. 3:3. (34-es). Online publication date: 1-Aug-2007.

    https://doi.org/10.1145/1273340.1273350

  • Hota C, Srikanth M, Yla-Jaaski A, Lindqvist J and Kristiina K. (2007). Safeguarding Against Sybil Attacks via Social Networks and Multipath Routing 2007 Second International Conference on Communications and Networking in China. 10.1109/CHINACOM.2007.4469394. 978-1-4244-1008-8. (328-332).

    http://ieeexplore.ieee.org/document/4469394/

  • Zhang B, Shi Y and Xiao X. A peer-to-peer semantic-based service discovery method for pervasive computing environment. Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing. (195-204).

    /doi/10.5555/2391319.2391342

  • Bhattacharya A and Ghosh S. Self-optimizing Peer-to-Peer Networks with Selfish Processes. Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems. (340-343).

    https://doi.org/10.1109/SASO.2007.51

  • Chakrabarti S, Chandrasekhar S, Singhal M and Calvert K. Authenticating DSR using a novel multisignature scheme based on cubic LFSR sequences. Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks. (156-171).

    /doi/10.5555/1784404.1784420

  • Zuo D, Du X and Yang Z. (2007). Hybrid ants-like search algorithms for P2P media streaming distribution in ad hoc networks. Journal of Zhejiang University-SCIENCE A. 10.1631/jzus.2007.A1191. 8:8. (1191-1198). Online publication date: 1-Jul-2007.

    http://link.springer.com/10.1631/jzus.2007.A1191

  • Hota C, Lindqvist J, Karvonen K, Yla-Jaaski A and Mohan C. (2007). Safeguarding Against Sybil Attacks via Social Networks and Multipath Routing 2007 International Conference on Networking, Architecture, and Storage. 10.1109/NAS.2007.47. 0-7695-2927-5. (122-132).

    https://ieeexplore.ieee.org/document/4286417/

  • Prieto A, Stadler R, Kersch P, Szabo R, Nunzi G, Brunner M and Schuetz S. (2007). Distributed Management in Ambient Networks 2007 16th IST Mobile and Wireless Communications Summit. 10.1109/ISTMWC.2007.4299248. 1-4244-1662-0. (1-5).

    http://ieeexplore.ieee.org/document/4299248/

  • Bessa S, Correia M and Brandao P. (2007). Storage and retrieval on P2P networks: A DHT based protocol 2007 IEEE Symposium on Computers and Communications. 10.1109/ISCC.2007.4381593. 978-1-4244-1520-5. (623-629).

    http://ieeexplore.ieee.org/document/4381593/

  • Thadakamalla H, Albert R and Kumara S. (2007). Search in spatial scale-free networks. New Journal of Physics. 10.1088/1367-2630/9/6/190. 9:6. (190-190).

    https://iopscience.iop.org/article/10.1088/1367-2630/9/6/190

  • Kovacs B and Vida R. An Adaptive Approach to Enhance the Performance of Content-Addressable Networks. Proceedings of the Third International Conference on Networking and Services.

    https://doi.org/10.1109/ICNS.2007.27

  • Abraham I, Bartal Y and Neiman O. Local embeddings of metric spaces. Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. (631-640).

    https://doi.org/10.1145/1250790.1250883

  • Fraigniaud P, Gavoille C, Kosowski A, Lebhar E and Lotker Z. Universal augmentation schemes for network navigability. Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures. (1-7).

    https://doi.org/10.1145/1248377.1248379

  • Lu J and Callan J. Content-based peer-to-peer network overlay for full-text federated search. Large Scale Semantic Access to Content (Text, Image, Video, and Sound). (490-509).

    /doi/10.5555/1931390.1931438

  • Kim D, Cho Y, Kim C, Kim S, Park S and Kang T. E-ITRC Protocol with Long & Adjustable Range on Underwater Acoustic Sensor Network. Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02. (665-672).

    https://doi.org/10.1109/AINAW.2007.160

  • Dasgupta P. Building small worlds in unstructured P2P networks using a multiagent Bayesian inference mechanism. Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems. (1-3).

    https://doi.org/10.1145/1329125.1329300

  • Sun X and Chen X. SRing. Proceedings of the 16th international conference on World Wide Web. (1193-1194).

    https://doi.org/10.1145/1242572.1242761

  • Sun X. SCAN. Proceedings of the 16th international conference on World Wide Web. (1191-1192).

    https://doi.org/10.1145/1242572.1242760

  • Wong B, Vigfússon Y and Sirer E. Hyperspaces for object clustering and approximate matching in peer-to-peer overlays. Proceedings of the 11th USENIX workshop on Hot topics in operating systems. (1-6).

    /doi/10.5555/1361397.1361405

  • Bawa M, Gionis A, Garcia-Molina H and Motwani R. (2007). The price of validity in dynamic networks. Journal of Computer and System Sciences. 73:3. (245-264). Online publication date: 1-May-2007.

    https://doi.org/10.1016/j.jcss.2006.10.007

  • Huang X, Zou F and Ma F. (2007). Targeted local immunization in scale-free peer-to-peer networks. Journal of Computer Science and Technology. 22:3. (457-468). Online publication date: 1-May-2007.

    https://doi.org/10.1007/s11390-007-9046-2

  • Danezis G and Laurie B. Private yet abuse resistant open publishing. Proceedings of the 15th international conference on Security protocols. (222-243).

    /doi/10.5555/1939017.1939045

  • Nagaraja S. Privacy amplification with social networks. Proceedings of the 15th international conference on Security protocols. (58-73).

    /doi/10.5555/1939017.1939024

  • Girdzijauskas S, Datta A and Aberer K. (2007). Oscar: A Data-Oriented Overlay For Heterogeneous Environments 2007 IEEE 23rd International Conference on Data Engineering. 10.1109/ICDE.2007.369012. 1-4244-0802-4. (1365-1367).

    http://ieeexplore.ieee.org/document/4221802/

  • Kincaid R, Holroyd M and Gatz C. Understanding the structure of power law networks. Proceedings of the 2007 spring simulation multiconference - Volume 3. (104-111).

    /doi/10.5555/1404803.1404828

  • Slivkins A. (2007). Distance estimation and object location via rings of neighbors. Distributed Computing. 19:4. (313-333). Online publication date: 1-Mar-2007.

    /doi/10.5555/3271139.3271275

  • Beaumont O, Kermarrec A, Marchal L and Riviere E. (2007). VoroNet: A scalable object network based on Voronoi tessellations 2007 IEEE International Parallel and Distributed Processing Symposium. 10.1109/IPDPS.2007.370210. 1-4244-0909-8. (1-10).

    http://ieeexplore.ieee.org/document/4227938/

  • Jeong J and Berman P. (2007). Low-cost search in scale-free networks. Physical Review E. 10.1103/PhysRevE.75.036104. 75:3.

    https://link.aps.org/doi/10.1103/PhysRevE.75.036104

  • Slivkins A. (2006). Distance estimation and object location via rings of neighbors. Distributed Computing. 10.1007/s00446-006-0015-8. 19:4. (313-333). Online publication date: 21-Feb-2007.

    http://link.springer.com/10.1007/s00446-006-0015-8

  • Jin H and Ning X. Improving Search in Peer-to-Peer Literature Sharing Systems via Semantic Small World. Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing. (31-38).

    https://doi.org/10.1109/PDP.2007.50

  • Zhou Y, Xiao Y, Wu K and Yan B. (2007). A Scalable Framework and Prototype for CAS e-Science. Data Science Journal. 10.2481/dsj.6.S385. 6. (S385-S392).

    http://datascience.codata.org/articles/abstract/10.2481/dsj.6.S385/

  • Sakata S. (2007). Emerging Web. IEICE Communications Society Magazine. 10.1587/bplus.2007.1_50. 2007:1. (1_50-1_66).

    http://joi.jlc.jst.go.jp/JST.JSTAGE/bplus/2007.1_50?from=CrossRef

  • Tewari S and Kleinrock L. (2007). Optimal search performance in unstructured peer-to-peer networks with clustered demands. IEEE Journal on Selected Areas in Communications. 25:1. (84-95). Online publication date: 1-Jan-2007.

    https://doi.org/10.1109/JSAC.2007.070109

  • Barbella D, Kachergis G, Liben-Nowell D, Sallstrom A and Sowell B. Depth of Field and Cautious-Greedy Routing in Social Networks. Algorithms and Computation. 10.1007/978-3-540-77120-3_50. (574-586).

    http://link.springer.com/10.1007/978-3-540-77120-3_50

  • Beaumont O, Kermarrec A and Rivière É. Peer to Peer Multidimensional Overlays: Approximating Complex Structures. Principles of Distributed Systems. 10.1007/978-3-540-77096-1_23. (315-328).

    http://link.springer.com/10.1007/978-3-540-77096-1_23

  • Duchon P, Eggemann N and Hanusse N. Non-Searchability of Random Power-Law Graphs. Principles of Distributed Systems. 10.1007/978-3-540-77096-1_20. (274-285).

    http://link.springer.com/10.1007/978-3-540-77096-1_20

  • Gu T, Pung H and Zhang D. A Semantic P2P Framework for Building Context-Aware Applications in Multiple Smart Spaces. Embedded and Ubiquitous Computing. 10.1007/978-3-540-77092-3_48. (553-564).

    http://link.springer.com/10.1007/978-3-540-77092-3_48

  • Arcaute E, Chen N, Kumar R, Liben-Nowell D, Mahdian M, Nazerzadeh H and Xu Y. Deterministic Decentralized Search in Random Graphs. Algorithms and Models for the Web-Graph. 10.1007/978-3-540-77004-6_15. (187-194).

    http://link.springer.com/10.1007/978-3-540-77004-6_15

  • Mahdian M and Xu Y. Stochastic Kronecker Graphs. Algorithms and Models for the Web-Graph. 10.1007/978-3-540-77004-6_14. (179-186).

    http://link.springer.com/10.1007/978-3-540-77004-6_14

  • Young S and Scheinerman E. Random Dot Product Graph Models for Social Networks. Algorithms and Models for the Web-Graph. 10.1007/978-3-540-77004-6_11. (138-149).

    http://link.springer.com/10.1007/978-3-540-77004-6_11

  • Fraigniaud P. Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation. Algorithms – ESA 2007. 10.1007/978-3-540-75520-3_2. (2-11).

    http://link.springer.com/10.1007/978-3-540-75520-3_2

  • Xu J and Jin H. (2007). SW-Uinta: A Small-World P2P Overlay Network. Network and Parallel Computing. 10.1007/978-3-540-74784-0_12. (114-123).

    http://link.springer.com/10.1007/978-3-540-74784-0_12

  • Chakrabarti S, Chandrasekhar S, Singhal M and Calvert K. Authenticating DSR Using a Novel Multisignature Scheme Based on Cubic LFSR Sequences. Security and Privacy in Ad-hoc and Sensor Networks. 10.1007/978-3-540-73275-4_12. (156-171).

    http://link.springer.com/10.1007/978-3-540-73275-4_12

  • Warren R, Wilkinson D and Warnecke M. Empirical Analysis of a Dynamic Social Network Built from PGP Keyrings. Statistical Network Analysis: Models, Issues, and New Directions. 10.1007/978-3-540-73133-7_12. (158-171).

    http://link.springer.com/10.1007/978-3-540-73133-7_12

  • Clauset A, Moore C and Newman M. Structural Inference of Hierarchies in Networks. Statistical Network Analysis: Models, Issues, and New Directions. 10.1007/978-3-540-73133-7_1. (1-13).

    http://link.springer.com/10.1007/978-3-540-73133-7_1

  • Lü S, Wang W and Zhang Y. Bayesian Method Based Trusted Overlay for Information Retrieval over Networks. Advances in Web and Network Technologies, and Information Management. 10.1007/978-3-540-72909-9_15. (168-173).

    http://link.springer.com/10.1007/978-3-540-72909-9_15

  • Li D, Liu H, Chen Z, Zeng Z and Liu J. IPBGA: A Hybrid P2P Based Grid Architecture by Using Information Pool Protocol. Algorithms and Architectures for Parallel Processing. 10.1007/978-3-540-72905-1_32. (356-367).

    http://link.springer.com/10.1007/978-3-540-72905-1_32

  • Bustos-Jiménez J, Caromel D and Piquer J. Load Balancing: Toward the Infinite Network and Beyond. Job Scheduling Strategies for Parallel Processing. 10.1007/978-3-540-71035-6_9. (176-191).

    http://link.springer.com/10.1007/978-3-540-71035-6_9

  • Börner K, Sanyal S and Vespignani A. (2008). Network science. Annual Review of Information Science and Technology. 10.1002/aris.2007.1440410119. 41:1. (537-607). Online publication date: 1-Jan-2007.

    https://asistdl.onlinelibrary.wiley.com/doi/10.1002/aris.2007.1440410119

  • Dasgupta P. A Multi-agent Mechanism for Topology Balancing in Unstructured P2P Networks. Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology. (389-392).

    https://doi.org/10.1109/IAT.2006.16

  • Cordasco G and Gargano L. How much independent should individual contacts be to form a small–world?. Proceedings of the 17th international conference on Algorithms and Computation. (328-338).

    https://doi.org/10.1007/11940128_34

  • Steiner M and Biersack E. Shortcuts in a virtual world. Proceedings of the 2006 ACM CoNEXT conference. (1-9).

    https://doi.org/10.1145/1368436.1368460

  • Chaudhari N, Ong Y and Trivedi V. (2006). Computational Capabilities of Soft-Computing Frameworks: An Overview 2006 9th International Conference on Control, Automation, Robotics and Vision. 10.1109/ICARCV.2006.345433. 1-4244-0341-3. (1-6).

    http://ieeexplore.ieee.org/document/4150380/

  • Flaxman A. Expansion and Lack Thereof in Randomly Perturbed Graphs. Algorithms and Models for the Web-Graph. (24-35).

    https://doi.org/10.1007/978-3-540-78808-9_3

  • Luu T, Klemm F, Podnar I, Rajman M and Aberer K. ALVIS peers. Proceedings of the international workshop on Information retrieval in peer-to-peer networks. (41-48).

    https://doi.org/10.1145/1183579.1183588

  • Liu X, Zhao G, Ma X and Sun M. (2006). WSN13-3: Path Shortening for Delivery Rate Enhancement in Geographical Routing via Channel Listening IEEE Globecom 2006. 10.1109/GLOCOM.2006.966. 1-4244-0357-X. (1-5).

    http://ieeexplore.ieee.org/document/4151596/

  • Liu C and Wu J. (2006). WSN13-1: Position-based Routing using Virtual Small World in MANETs IEEE Globecom 2006. 10.1109/GLOCOM.2006.964. 1-4244-0357-X. (1-5).

    http://ieeexplore.ieee.org/document/4151594/

  • Liu F, Cheng X and An F. (2006). WSN09-2: On the Performance of In-Situ Key Establishment Schemes for Wireless Sensor Networks IEEE Globecom 2006. 10.1109/GLOCOM.2006.513. 1-4244-0357-X. (1-5).

    http://ieeexplore.ieee.org/document/4151143/

  • Liu X and Liu Y. (2006). NGL02-3: Price-Sensitive Application Adaptation in Deadline-Based Networks IEEE Globecom 2006. 10.1109/GLOCOM.2006.251. 1-4244-0357-X. (1-5).

    http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4150881

  • Schmidt R and Aberer K. Efficient peer-to-peer belief propagation. Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I. (516-532).

    https://doi.org/10.1007/11914853_31

  • Feng G, Li C, Gu Q, Lu S and Chen D. SWS. Proceedings of the Fifth International Conference on Grid and Cooperative Computing Workshops. (341-348).

    https://doi.org/10.1109/GCCW.2006.87

  • Hui K, Lui J and Yau D. (2006). Small-world overlay P2P networks. Computer Networks: The International Journal of Computer and Telecommunications Networking. 50:15. (2727-2746). Online publication date: 18-Oct-2006.

    https://doi.org/10.1016/j.comnet.2005.10.010

  • Bin D, Furong W and Jian L. (2006). A Self-Organizing P2P System for VoIP Application 2006 International Conference on Information Technology: Research and Education. 10.1109/ITRE.2006.381563. 1-4244-0858-X. (196-199).

    http://ieeexplore.ieee.org/document/4266324/

  • Kar S and Moura J. (2006). Topology for Global Average Consensus 2006 Fortieth Asilomar Conference on Signals, Systems and Computers. 10.1109/ACSSC.2006.356631. 1-4244-0784-2. (276-280).

    http://ieeexplore.ieee.org/document/4176560/

  • Barrière L, Comellas F and Dalfó C. (2006). Fractality and the small-world effect in Sierpinski graphs. Journal of Physics A: Mathematical and General. 10.1088/0305-4470/39/38/003. 39:38. (11739-11753). Online publication date: 22-Sep-2006.

    http://stacks.iop.org/0305-4470/39/i=38/a=003?key=crossref.16ec3c5904e0643b748ea1a17405b5ee

  • Yu H, Kaminsky M, Gibbons P and Flaxman A. SybilGuard. Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications. (267-278).

    https://doi.org/10.1145/1159913.1159945

  • Kumar R, Liben-Nowell D and Tomkins A. Navigating low-dimensional and hierarchical population networks. Proceedings of the 14th conference on Annual European Symposium - Volume 14. (480-491).

    https://doi.org/10.1007/11841036_44

  • Fraigniaud P, Lebhar E and Lotker Z. A doubling dimension threshold θ(loglogn) for augmented graph navigability. Proceedings of the 14th conference on Annual European Symposium - Volume 14. (376-386).

    https://doi.org/10.1007/11841036_35

  • Hara T, Kido Y and Nishio S. Probabilistic replication based on access frequencies in unstructured peer-to-peer networks. Proceedings of the 17th international conference on Database and Expert Systems Applications. (791-800).

    https://doi.org/10.1007/11827405_77

  • Poe J and Li T. (2006). BASS. ACM SIGARCH Computer Architecture News. 34:4. (26-33). Online publication date: 1-Sep-2006.

    https://doi.org/10.1145/1186736.1186739

  • Citron D, Hurani A and Gnadrey A. (2006). The harmonic or geometric mean. ACM SIGARCH Computer Architecture News. 34:4. (18-25). Online publication date: 1-Sep-2006.

    https://doi.org/10.1145/1186736.1186738

  • Bin D, Furong W and Jian L. (2006). Distributed Internet Telephony System Using a Novel P2P Architecture 2006 International Conference on Wireless Communications, Networking and Mobile Computing. 10.1109/WiCOM.2006.387. 1-4244-0517-3. (1-4).

    http://ieeexplore.ieee.org/document/4149564/

  • Kumar R, Novak J and Tomkins A. Structure and evolution of online social networks. Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. (611-617).

    https://doi.org/10.1145/1150402.1150476

  • Rattigan M, Maier M and Jensen D. Using structure indices for efficient approximation of network properties. Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. (357-366).

    https://doi.org/10.1145/1150402.1150443

  • Wang Y and Wang W. On studying P2P topology based on modified fuzzy adaptive resonance theory. Proceedings of the 2006 international conference on Intelligent computing: Part II. (410-420).

    /doi/10.5555/1882540.1882594

  • Yu H, Kaminsky M, Gibbons P and Flaxman A. (2006). SybilGuard. ACM SIGCOMM Computer Communication Review. 36:4. (267-278). Online publication date: 11-Aug-2006.

    https://doi.org/10.1145/1151659.1159945

  • Kleinberg J. Social networks, incentives, and search. Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval. (210-211).

    https://doi.org/10.1145/1148170.1148172

  • Jiang Y and You J. (2006). A Low Latency Chord Routing Algorithm for DHT 2006 First International Symposium on Pervasive Computing and Applications. 10.1109/SPCA.2006.297539. 1-4244-0325-1. (825-830).

    http://ieeexplore.ieee.org/document/4079110/

  • Duchon P, Hanusse N, Lebhar E and Schabanel N. Towards small world emergence. Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures. (225-232).

    https://doi.org/10.1145/1148109.1148145

  • Klemm F, Le Boudec J and Aberer K. Congestion Control for Distributed Hash Tables. Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications. (189-195).

    https://doi.org/10.1109/NCA.2006.19

  • Abraham I and Gavoille C. Object location using path separators. Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing. (188-197).

    https://doi.org/10.1145/1146381.1146411

  • Kleinberg J. Distributed social systems. Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing. (5-6).

    https://doi.org/10.1145/1146381.1146384

  • Wang C and Harfoush K. RASTER. Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1. (553-560).

    https://doi.org/10.1109/ICPADS.2006.88

  • Pietzuch P, Ledlie J, Mitzenmacher M and Seltzer M. Network-Aware Overlays with Network Coordinates. Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems.

    https://doi.org/10.1109/ICDCSW.2006.76

  • Zhong M and Shen K. (2006). Random walk based node sampling in self-organizing networks. ACM SIGOPS Operating Systems Review. 40:3. (49-55). Online publication date: 1-Jul-2006.

    https://doi.org/10.1145/1151374.1151386

  • Higham D. (2006). Greedy pathlengths and small world graphs. Linear Algebra and its Applications. 10.1016/j.laa.2006.01.001. 416:2-3. (745-758). Online publication date: 1-Jul-2006.

    http://linkinghub.elsevier.com/retrieve/pii/S002437950600005X

  • Jin H, Wu H and Ning X. (2006). Facilitating Service Discovery with Semantic Overlay. Journal of Computer Science and Technology. 10.1007/s11390-006-0582-y. 21:4. (582-591). Online publication date: 1-Jul-2006.

    http://link.springer.com/10.1007/s11390-006-0582-y

  • Zeng J and Hsu W. (2006). Optimal Routing in a Small-World Network. Journal of Computer Science and Technology. 10.1007/s11390-006-0476-z. 21:4. (476-481). Online publication date: 1-Jul-2006.

    http://link.springer.com/10.1007/s11390-006-0476-z

  • Warren R, Wilkinson D and Warnecke M. Empirical analysis of a dynamic social network built from PGP Keyrings. Proceedings of the 2006 conference on Statistical network analysis. (158-171).

    /doi/10.5555/1768341.1768355

  • Clauset A, Moore C and Newman M. Structural inference of hierarchies in networks. Proceedings of the 2006 conference on Statistical network analysis. (1-13).

    /doi/10.5555/1768341.1768343

  • Chakrabarti D and Faloutsos C. (2006). Graph mining. ACM Computing Surveys. 38:1. (2-es). Online publication date: 29-Jun-2006.

    https://doi.org/10.1145/1132952.1132954

  • Bustos-Jiménez J, Caromel D and Piquer J. Load balancing. Proceedings of the 12th international conference on Job scheduling strategies for parallel processing. (176-191).

    /doi/10.5555/1757044.1757053

  • Peserico E and Rudolph L. Robust network connectivity. Proceedings of the joint international conference on Measurement and modeling of computer systems. (299-310).

    https://doi.org/10.1145/1140277.1140312

  • Peserico E and Rudolph L. (2006). Robust network connectivity. ACM SIGMETRICS Performance Evaluation Review. 34:1. (299-310). Online publication date: 26-Jun-2006.

    https://doi.org/10.1145/1140103.1140312

  • Bezáková I, Kalai A and Santhanam R. Graph model selection using maximum likelihood. Proceedings of the 23rd international conference on Machine learning. (105-112).

    https://doi.org/10.1145/1143844.1143858

  • Kong J, Bridgewater J and Roychowdhury V. A General Framework for Scalability and Performance Analysis of DHT Routing Systems. Proceedings of the International Conference on Dependable Systems and Networks. (343-354).

    https://doi.org/10.1109/DSN.2006.4

  • Boyd S, Ghosh A, Prabhakar B and Shah D. (2006). Randomized gossip algorithms. IEEE/ACM Transactions on Networking. 14:SI. (2508-2530). Online publication date: 1-Jun-2006.

    https://doi.org/10.1109/TIT.2006.874516

  • Jin H, Ning X and Chen H. Efficient search for peer-to-peer information retrieval using semantic small world. Proceedings of the 15th international conference on World Wide Web. (1003-1004).

    https://doi.org/10.1145/1135777.1135986

  • Wang H, Du Z, Wu L, Zhu S and Shang E. A market-oriented model for grid service management. Proceedings of the First international conference on Advances in Grid and Pervasive Computing. (137-146).

    https://doi.org/10.1007/11745693_14

  • Datta A, Gradinariu M and Virgillito A. Deterministic \delta -Connected Overlay for Peer-to-Peer Networks. Proceedings of the Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing. (159-168).

    https://doi.org/10.1109/ISORC.2006.30

  • Chao S, Hui L, Feng L and Yan J. Node clustering in the P2P environment. Proceedings of the International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies.

    https://doi.org/10.1109/ICNICONSMCL.2006.155

  • Gossa J, Pierson J and Brunie L. FReDi. Proceedings of the International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies.

    https://doi.org/10.1109/ICNICONSMCL.2006.104

  • Takano Y, Isozaki N and Shinoda Y. Multipath Key Exchange on P2P Networks. Proceedings of the First International Conference on Availability, Reliability and Security. (748-755).

    https://doi.org/10.1109/ARES.2006.87

  • Tie J, Jin H, Li S, Shi X, Chen H and Ning X. Peer-Tree. Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01. (999-1004).

    https://doi.org/10.1109/AINA.2006.263

  • Amrou A, Maly K and Zubair M. Freelib. Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01. (9-14).

    https://doi.org/10.1109/AINA.2006.184

  • Jin S and Bestavros A. (2006). Small-world characteristics of Internet topologies and implications on multicast scaling. Computer Networks: The International Journal of Computer and Telecommunications Networking. 50:5. (648-666). Online publication date: 6-Apr-2006.

    /doi/10.5555/1141112.1648621

  • Annexstein F, Berman K and Jovanović M. (2006). Broadcasting in unstructured peer-to-peer overlay networks. Theoretical Computer Science. 355:1. (25-36). Online publication date: 6-Apr-2006.

    https://doi.org/10.1016/j.tcs.2005.12.013

  • Duchon P, Hanusse N, Lebhar E and Schabanel N. (2006). Could any graph be turned into a small-world?. Theoretical Computer Science. 355:1. (96-103). Online publication date: 6-Apr-2006.

    https://doi.org/10.1016/j.tcs.2005.12.008

  • Karnstedt M, Sattler K, Hauswirth M and Schmidt R. Similarity Queries on Structured Data in Structured Overlays. Proceedings of the 22nd International Conference on Data Engineering Workshops.

    https://doi.org/10.1109/ICDEW.2006.137

  • Nguyen H and Thiran P. (2006). Using End-to-End Data to Infer Lossy Links in Sensor Networks Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications. 10.1109/INFOCOM.2006.271. 1-4244-0221-2. (1-12).

    http://ieeexplore.ieee.org/document/4146924/

  • Nguyen V and Martel C. (2006). Designing Low Cost Networks with Short Routes and Low Congestion Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications. 10.1109/INFOCOM.2006.254. 1-4244-0221-2. (1-12).

    http://ieeexplore.ieee.org/document/4146907/

  • Jin S and Bestavros A. (2006). Small-world characteristics of Internet topologies and implications on multicast scaling. Computer Networks. 10.1016/j.comnet.2005.04.016. 50:5. (648-666). Online publication date: 1-Apr-2006.

    https://linkinghub.elsevier.com/retrieve/pii/S1389128605001982

  • Zhang Z, Rong L and Comellas F. (2006). Evolving small-world networks with geographical attachment preference. Journal of Physics A: Mathematical and General. 10.1088/0305-4470/39/13/005. 39:13. (3253-3261). Online publication date: 31-Mar-2006.

    https://iopscience.iop.org/article/10.1088/0305-4470/39/13/005

  • Sandberg O. Distributed routing in small-world networks. Proceedings of the Meeting on Algorithm Engineering & Expermiments. (144-155).

    /doi/10.5555/2791171.2791185

  • Bordenave C. Navigation on Self-Organized Networks 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks. 10.1109/WIOPT.2006.1666522. 0-7803-9549-2. (1-9).

    http://ieeexplore.ieee.org/document/1666522/

  • Costa R and Barros J. Network Information Flow in Navigable Small-World Networks 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks. 10.1109/WIOPT.2006.1666504. 0-7803-9549-2. (1-6).

    http://ieeexplore.ieee.org/document/1666504/

  • Costa R and Barros J. On the Capacity of Small-World Networks 2006 IEEE Information Theory Workshop. 10.1109/ITW.2006.1633834. 1-4244-0035-X. (302-306).

    http://ieeexplore.ieee.org/document/1633834/

  • Sygkouna I, Anagnostou M and Sykas E. A Proactive Mechanism for Efficient Information Discovery 2006 2nd International Conference on Information & Communication Technologies. 10.1109/ICTTA.2006.1684576. 0-7803-9521-2. (1344-1349).

    http://ieeexplore.ieee.org/document/1684576/

  • Augusto C and de Rezende J. (2006). An Adaptive Approach to Service Discovery in Ad Hoc Networks. Mobile and Wireless Communication Networks. 10.1007/978-0-387-34736-3_4. (61-75).

    http://link.springer.com/10.1007/978-0-387-34736-3_4

  • Du H, Wu X and Zhuang J. (2006). Small-World Optimization Algorithm for Function Optimization. Advances in Natural Computation. 10.1007/11881223_33. (264-273).

    http://link.springer.com/10.1007/11881223_33

  • Lebhar E and Schabanel N. (2005). Close to optimal decentralized routing in long-range contact networks. Theoretical Computer Science. 348:2. (294-310). Online publication date: 8-Dec-2005.

    https://doi.org/10.1016/j.tcs.2005.09.019

  • Chiola G, Cordasco G, Gargano L, Negro A and Scarano V. Overlay networks with class. Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks. (241-247).

    https://doi.org/10.1109/ISPAN.2005.66

  • Zeng J and Hsu W. ReCord. Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies. (16-20).

    https://doi.org/10.1109/PDCAT.2005.196

  • Zeng J and Hsu W. Optimal Routing in a Small-World Network. Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies. (610-614).

    https://doi.org/10.1109/PDCAT.2005.179

  • Faragó A. (2005). On the typical case complexity of graph optimization. Discrete Applied Mathematics. 10.1016/j.dam.2005.05.007. 153:1-3. (73-88). Online publication date: 1-Dec-2005.

    https://linkinghub.elsevier.com/retrieve/pii/S0166218X0500171X

  • Yue G, Li R, Zhou Z and Wu R. An efficient cluster-hierarchy architecture model ECHP2P for p2p networks. Proceedings of the 4th international conference on Grid and Cooperative Computing. (776-786).

    https://doi.org/10.1007/11590354_98

  • Huang X, Li Y, Zhang W and Ma F. Smart search over desirable topologies. Proceedings of the 4th international conference on Grid and Cooperative Computing. (990-995).

    https://doi.org/10.1007/11590354_120

  • Huang X, Chen L, Huang L and Li M. Routing algorithm using skipnet and small-world for peer-to-peer system. Proceedings of the 4th international conference on Grid and Cooperative Computing. (984-989).

    https://doi.org/10.1007/11590354_119

  • Rostami H and Habibi J. A mathematical foundation for topology awareness of p2p overlay networks. Proceedings of the 4th international conference on Grid and Cooperative Computing. (906-918).

    https://doi.org/10.1007/11590354_109

  • Pitkänen E, Rantanen A, Rousu J and Ukkonen E. Finding feasible pathways in metabolic networks. Proceedings of the 10th Panhellenic conference on Advances in Informatics. (123-133).

    https://doi.org/10.1007/11573036_12

  • Witschel H and Böhme T. Evaluating profiling and query expansion methods for P2P information retrieval. Proceedings of the 2005 ACM workshop on Information retrieval in peer-to-peer networks. (1-8).

    https://doi.org/10.1145/1096952.1096954

  • Zeng J, Hsu W and Wang J. Near optimal routing in a small-world network with augmented local awareness. Proceedings of the Third international conference on Parallel and Distributed Processing and Applications. (503-513).

    https://doi.org/10.1007/11576235_52

  • Catral M, Neumann M and Xu J. (2005). Matrix analysis of a Markov chain small-world model. Linear Algebra and its Applications. 10.1016/j.laa.2005.05.002. 409. (126-146). Online publication date: 1-Nov-2005.

    http://linkinghub.elsevier.com/retrieve/pii/S0024379505002545

  • Skobeltsyn G, Hauswirth M and Aberer K. Efficient processing of XPath queries with structured overlay networks. Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, COA, and ODBASE - Volume Part II. (1243-1260).

    https://doi.org/10.1007/11575801_20

  • Fraigniaud P. Greedy routing in tree-decomposed graphs. Proceedings of the 13th annual European conference on Algorithms. (791-802).

    https://doi.org/10.1007/11561071_70

  • Duchon P, Hanusse N, Lebhar E and Schabanel N. Could any graph be turned into a small-world?. Proceedings of the 19th international conference on Distributed Computing. (511-513).

    https://doi.org/10.1007/11561927_46

  • Flammini M, Moscardelli L, Navarra A and Perennes S. Asymptotically optimal solutions for small world graphs. Proceedings of the 19th international conference on Distributed Computing. (414-428).

    https://doi.org/10.1007/11561927_30

  • Tang Y and Zhang L. INFO. Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence. (54-57).

    https://doi.org/10.1109/WI.2005.76

  • Lin M, Yang H and Hong C. The interactive evolutionary computation based on the social distance to extend the keygraph. Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I. (526-532).

    https://doi.org/10.1007/11552413_76

  • Danezis G, Lesniewski-Laas C, Kaashoek M and Anderson R. Sybil-resistant DHT routing. Proceedings of the 10th European conference on Research in Computer Security. (305-318).

    https://doi.org/10.1007/11555827_18

  • Aberer K, Alima L, Ghodsi A, Girdzijauskas S, Haridi S and Hauswirth M. The Essence of P2P. Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing. (11-20).

    https://doi.org/10.1109/P2P.2005.38

  • Sahin O, Agrawal D and El Abbadi A. Techniques for Efficient Routing and Load Balancing in Content-Addressable Networks. Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing. (67-74).

    https://doi.org/10.1109/P2P.2005.37

  • Araújo F and Rodrigues L. Long range contacts in overlay networks. Proceedings of the 11th international Euro-Par conference on Parallel Processing. (1153-1162).

    https://doi.org/10.1007/11549468_126

  • Girdzijauskas S, Datta A and Aberer K. Oscar. Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing. (247-258).

    /doi/10.5555/1783738.1783771

  • Klemm F and Aberer K. Aggregation of a term vocabulary for P2P-IRtest. Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing. (187-194).

    /doi/10.5555/1783738.1783761

  • Xu C, Brodie A, Shen H and Shi W. (2005). Scalable and Secure P2P Overlay Networks. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks. 10.1201/9780203323687.ch46. Online publication date: 8-Aug-2005.

    http://www.crcnetbase.com/doi/10.1201/9780203323687.ch46

  • Xuan D, Wang X and Chellappan S. (2005). Resilience of Structured Peer-to-Peer Systems. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks. 10.1201/9780203323687.ch44. Online publication date: 8-Aug-2005.

    http://www.crcnetbase.com/doi/10.1201/9780203323687.ch44

  • Shah G and Aspnes J. (2005). Distributed Data Structures for Peer-to-Peer Systems. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks. 10.1201/9780203323687.ch40. Online publication date: 8-Aug-2005.

    http://www.crcnetbase.com/doi/10.1201/9780203323687.ch40

  • Wu J and Li X. (2005). Searching Techniques in Peer-to-Peer Networks. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks. 10.1201/9780203323687.ch37. Online publication date: 8-Aug-2005.

    http://www.crcnetbase.com/doi/10.1201/9780203323687.ch37

  • Simsek O and Jensen D. Decentralized search in networks using homophily and degree disparity. Proceedings of the 19th international joint conference on Artificial intelligence. (304-310).

    /doi/10.5555/1642293.1642342

  • Cordasco G and Sala A. 2-Chord Halved. Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems. (72-79).

    https://doi.org/10.1109/HOT-P2P.2005.1

  • Angel O, Benjamini I, Ofek E and Wieder U. Routing complexity of faulty networks. Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing. (209-217).

    https://doi.org/10.1145/1073814.1073854

  • Slivkins A. Distance estimation and object location via rings of neighbors. Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing. (41-50).

    https://doi.org/10.1145/1073814.1073823

  • Gu T, Tan E, Pung H and Zhang D. A Peer-to-Peer Architecture for Context Lookup. Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services. (333-341).

    https://doi.org/10.1109/MOBIQUITOUS.2005.5

  • Sharma G and Mazumdar R. Hybrid sensor networks. Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing. (366-377).

    https://doi.org/10.1145/1062689.1062736

  • Li J, Stribling J, Morris R and Kaashoek M. Bandwidth-efficient management of DHT routing tables. Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2. (99-114).

    /doi/10.5555/1251203.1251211

  • Girdzijauskas S, Datta A and Aberer K. On Small World Graphs in Non-uniformly Distributed Key Spaces. Proceedings of the 21st International Conference on Data Engineering Workshops.

    https://doi.org/10.1109/ICDE.2005.254

  • Lua E, Crowcroft J, Pias M, Sharma R and Lim S. (2005). A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys & Tutorials. 7:2. (72-93). Online publication date: 1-Apr-2005.

    https://doi.org/10.1109/COMST.2005.1610546

  • Aiello W, Kalmanek C, McDaniel P, Sen S, Spatscheck O and Van der Merwe J. Analysis of communities of interest in data networks. Proceedings of the 6th international conference on Passive and Active Network Measurement. (83-96).

    https://doi.org/10.1007/978-3-540-31966-5_7

  • Shahabi C and Banaei-Kashani F. Modelling peer-to-peer data networks under complex system theory. Proceedings of the 4th international conference on Databases in Networked Information Systems. (238-243).

    https://doi.org/10.1007/978-3-540-31970-2_19

  • Qian W, Chen F, Du B and Zhou A. P-Terse. Proceedings of the 2005 joint Chinese-German conference on Cognitive systems. (58-69).

    /doi/10.5555/1762624.1762631

  • Gavoille C and Nehéz M. (2005). Interval routing in reliability networks. Theoretical Computer Science. 333:3. (415-432). Online publication date: 3-Mar-2005.

    https://doi.org/10.1016/j.tcs.2004.12.008

  • Wang S, Xuan D and Zhao W. (2005). Analyzing and enhancing the resilience of structured peer-to-peer systems. Journal of Parallel and Distributed Computing. 65:2. (207-219). Online publication date: 1-Feb-2005.

    https://doi.org/10.1016/j.jpdc.2004.09.009

  • Merugu S, Srinivasan S and Zegura E. (2005). Adding structure to unstructured peer-to-peer networks. Journal of Parallel and Distributed Computing. 65:2. (142-153). Online publication date: 1-Feb-2005.

    https://doi.org/10.1016/j.jpdc.2004.09.004

  • Muthukrishnan S and Pandurangan G. The bin-covering technique for thresholding random geometric graph properties. Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. (989-998).

    /doi/10.5555/1070432.1070575

  • Nguyen V and Martel C. Analyzing and characterizing small-world graphs. Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. (311-320).

    /doi/10.5555/1070432.1070476

  • Nazerzadeh H and Ghodsi M. RAQ. Proceedings of the 31st international conference on Theory and Practice of Computer Science. (269-277).

    https://doi.org/10.1007/978-3-540-30577-4_30

  • Ming Zhong , Kai Shen and Seiferas J. Non-uniform random membership management in peer-to-peer networks Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.. 10.1109/INFCOM.2005.1498342. 0-7803-8968-9. (1151-1161).

    http://ieeexplore.ieee.org/document/1498342/

  • Gu T, Pung H and Zhang D. (2005). A peer-to-peer overlay for context information search Proceedings. 14th International Conference on Computer Communications and Networks. 10.1109/ICCCN.2005.1523895. 0-7803-9428-3. (395-400).

    http://ieeexplore.ieee.org/document/1523895/

  • Hauswirth M and Schmidt R. An Overlay Network for Resource Discovery in Grids 16th International Workshop on Database and Expert Systems Applications (DEXA'05). 10.1109/DEXA.2005.50. 0-7695-2424-9. (343-348).

    http://ieeexplore.ieee.org/document/1508296/

  • Huang X, Zhang W, Ma F and Li Y. (2005). Exploring Small-World-Like Topologies Via SplitProber: Turning Power Laws into an Advantage in Unstructured Overlays. Embedded and Ubiquitous Computing – EUC 2005 Workshops. 10.1007/11596042_75. (724-733).

    http://link.springer.com/10.1007/11596042_75

  • Graupner S, Andrzejak A, Kotov V and Trinks H. (2005). Adaptive Service Placement Algorithms for Autonomous Service Networks. Engineering Self-Organising Systems. 10.1007/11494676_19. (280-297).

    http://link.springer.com/10.1007/11494676_19

  • Zou F, Cheng S, Ma F, Zhang L and Tang J. Using the linking model to understand the performance of DHT routing algorithms. Proceedings of the Second international conference on Parallel and Distributed Processing and Applications. (544-549).

    https://doi.org/10.1007/978-3-540-30566-8_65

  • Zhang H, Goel A and Govindan R. (2004). Using the small-world model to improve Freenet performance. Computer Networks: The International Journal of Computer and Telecommunications Networking. 46:4. (555-574). Online publication date: 15-Nov-2004.

    https://doi.org/10.1016/j.comnet.2004.05.004

  • Banaei-Kashani F and Shahabi C. SWAM. Proceedings of the thirteenth ACM international conference on Information and knowledge management. (304-313).

    https://doi.org/10.1145/1031171.1031236

  • Donato D, Laura L, Leonardi S and Millozzi S. (2004). Simulating the Webgraph. Computing in Science and Engineering. 6:6. (84-89). Online publication date: 1-Nov-2004.

    https://doi.org/10.1109/MCSE.2004.73

  • Zhuge H. (2004). Retrieve images by understanding semantic links and clustering image fragments. Journal of Systems and Software. 73:3. (455-466). Online publication date: 1-Nov-2004.

    https://doi.org/10.1016/j.jss.2003.08.243

  • Jin S. Replication of partitioned media streams in wireless ad hoc networks. Proceedings of the 12th annual ACM international conference on Multimedia. (396-399).

    https://doi.org/10.1145/1027527.1027621

  • Zimmermann R, Pawar M, Desai D, Qin M and Zhu H. (2004). High resolution live streaming with the HYDRA architecture. Computers in Entertainment. 2:4. (16-16). Online publication date: 1-Oct-2004.

    https://doi.org/10.1145/1037851.1037876

  • Haller M, Hanl C and Diephuis J. (2004). Non-photorealistic rendering techniques for motion in computer games. Computers in Entertainment. 2:4. (11-11). Online publication date: 1-Oct-2004.

    https://doi.org/10.1145/1037851.1037869

  • Hauswirth M and Aberer K. (2004). Peer-to-Peer Systems. The Practical Handbook of Internet Computing. 10.1201/9780203507223.ch35. Online publication date: 29-Sep-2004.

    http://www.crcnetbase.com/doi/abs/10.1201/9780203507223.ch35

  • Andersen R, Chung F and Lu L. Drawing power law graphs. Proceedings of the 12th international conference on Graph Drawing. (12-17).

    https://doi.org/10.1007/978-3-540-31843-9_2

  • Hua C, Mao Y, Jinqiang H, Haiqing D and Xiaoming L. Maze. Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference. (290-293).

    https://doi.org/10.1109/CEC-EAST.2004.44

  • Perugini S, Gonçalves M and Fox E. (2004). Recommender Systems Research. Journal of Intelligent Information Systems. 23:2. (107-143). Online publication date: 1-Sep-2004.

    https://doi.org/10.1023/B:JIIS.0000039532.05533.99

  • Bharambe A, Agrawal M and Seshan S. (2004). Mercury. ACM SIGCOMM Computer Communication Review. 34:4. (353-366). Online publication date: 30-Aug-2004.

    https://doi.org/10.1145/1030194.1015507

  • Bharambe A, Agrawal M and Seshan S. Mercury. Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications. (353-366).

    https://doi.org/10.1145/1015467.1015507

  • Datta A, Girdzijauskas S and Aberer K. On de Bruijn Routing in Distributed Hash Tables. Proceedings of the Fourth International Conference on Peer-to-Peer Computing. (159-166).

    /doi/10.5555/1018440.1021945

  • Watts D. (2004). The “New” Science of Networks. Annual Review of Sociology. 10.1146/annurev.soc.30.020404.104342. 30:1. (243-270). Online publication date: 1-Aug-2004.

    http://www.annualreviews.org/doi/10.1146/annurev.soc.30.020404.104342

  • Cordasco G, Gargano L, Hammar M and Scarano V. Brief announcement. Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing. (395-395).

    https://doi.org/10.1145/1011767.1011859

  • Manku G. Balanced binary trees for ID management and load balance in distributed hash tables. Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing. (197-205).

    https://doi.org/10.1145/1011767.1011797

  • Martel C and Nguyen V. Analyzing Kleinberg's (and other) small-world Models. Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing. (179-188).

    https://doi.org/10.1145/1011767.1011794

  • Fraigniaud P, Gavoille C and Paul C. Eclecticism shrinks even small worlds. Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing. (169-178).

    https://doi.org/10.1145/1011767.1011793

  • Abraham I and Malkhi D. Compact routing on euclidian metrics. Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing. (141-149).

    https://doi.org/10.1145/1011767.1011789

  • Bawa M, Gionis A, Garcia-Molina H and Motwani R. The price of validity in dynamic networks. Proceedings of the 2004 ACM SIGMOD international conference on Management of data. (515-526).

    https://doi.org/10.1145/1007568.1007627

  • Manku G, Naor M and Wieder U. Know thy neighbor's neighbor. Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. (54-63).

    https://doi.org/10.1145/1007352.1007368

  • Greco G, Greco S and Zumpano E. (2004). Web Communities. World Wide Web. 7:1. (59-82). Online publication date: 1-Mar-2004.

    https://doi.org/10.1023/B:WWWJ.0000015865.63749.b2

  • Naor M and Wieder U. Know thy neighbor’s neighbor. Proceedings of the Third international conference on Peer-to-Peer Systems. (269-277).

    https://doi.org/10.1007/978-3-540-30183-7_26

  • References. Grid resource management. (507-566).

    /doi/10.5555/976113.976145

  • Hassan A and Holt R. The small world of software reverse engineering 11th Working Conference on Reverse Engineering. 10.1109/WCRE.2004.37. 0-7695-2243-2. (278-283).

    http://ieeexplore.ieee.org/document/1374327/

  • Rezaei B, Sarshar N and Roychowdhury V. Random walks in a dynamic small-world space: robust routing in large-scale sensor networks IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004. 10.1109/VETECF.2004.1404970. 0-7803-8521-7. (4640-4644).

    http://ieeexplore.ieee.org/document/1404970/

  • Spognardi A, Di Pietro R and Mancini L. BaRT, Balanced Randomized Tree: A Scalable and Distributed Protocol for Lookup in Peer-to-Peer Networks 2004 International Workshop on Hot Topics in Peer-to-Peer Systems. 10.1109/PTPSYS.2004.4. 0-7695-2269-6. (22-29).

    http://ieeexplore.ieee.org/document/1376612/

  • Cordasco G, Gargano L, Hammar M, Negro A and Scarano V. Non-Uniform Deterministic Routing on F-Chord (α) 2004 International Workshop on Hot Topics in Peer-to-Peer Systems. 10.1109/PTPSYS.2004.13. 0-7695-2269-6. (16-21).

    http://ieeexplore.ieee.org/document/1376611/

  • Datta A, Girdzijauskas S and Aberer K. On de Bruijn routing in distributed hash tables: there and back again Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings.. 10.1109/PTP.2004.1334943. 0-7695-2156-8. (159-166).

    http://ieeexplore.ieee.org/document/1334943/

  • Dolev S and Kat R. Hypertree for self-stabilizing peer-to-peer systems Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings.. 10.1109/NCA.2004.1347757. 0-7695-2242-4. (25-32).

    http://ieeexplore.ieee.org/document/1347757/

  • Melamed R and Keidar I. Araneola: a scalable reliable multicast system for dynamic environments Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings.. 10.1109/NCA.2004.1347755. 0-7695-2242-4. (5-14).

    http://ieeexplore.ieee.org/document/1347755/

  • Hui K, Lui J and Yau D. Small world overlay P2P networks Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.. 10.1109/IWQOS.2004.1309383. 0-7803-8277-3. (201-210).

    http://ieeexplore.ieee.org/document/1309383/

  • Mei Li , Wang-Chien Lee and Sivasubramaniam A. Semantic small world: an overlay network for peer-to-peer search Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004.. 10.1109/ICNP.2004.1348113. 0-7695-2161-4. (228-238).

    http://ieeexplore.ieee.org/document/1348113/

  • Hao Yang , Haiyun Luo , Yi Yang , Songwu Lu and Lixia Zhang . (2004). HOURS: achieving DoS resilience in an open service hierarchy International Conference on Dependable Systems and Networks, 2004. 10.1109/DSN.2004.1311879. 0-7695-2052-9. (83-92).

    http://ieeexplore.ieee.org/document/1311879/

  • Fahrenholtz D and Turau V. (2004). A tree-based DHT Approach to scalable weakly consistent peer-to-peer data management Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004.. 10.1109/DEXA.2004.1333607. 0-7695-2195-9. (991-998).

    http://ieeexplore.ieee.org/document/1333607/

  • Chung F and Lu L. (2004). The Small World Phenomenonin Hybrid Power Law Graphs. Complex Networks. 10.1007/978-3-540-44485-5_4. (89-104).

    http://link.springer.com/10.1007/978-3-540-44485-5_4

  • Buchmann E and Böhm K. (2004). FairNet – How to Counter Free Riding in Peer-to-Peer Data Structures. On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE. 10.1007/978-3-540-30468-5_22. (337-354).

    http://link.springer.com/10.1007/978-3-540-30468-5_22

  • Andersen R, Chung F and Lu L. (2004). Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract). Algorithms and Models for the Web-Graph. 10.1007/978-3-540-30216-2_2. (19-30).

    http://link.springer.com/10.1007/978-3-540-30216-2_2

  • Zou F, Li Y, Zhang L, Ma F and Li M. (2004). A Novel Approach for Constructing Small World in Structured P2P Systems. Grid and Cooperative Computing - GCC 2004. 10.1007/978-3-540-30208-7_110. (807-810).

    http://link.springer.com/10.1007/978-3-540-30208-7_110

  • Jiang Q, Reeves D and Ning P. (2004). Certificate Recommendations to Improve the Robustness of Web of Trust. Information Security. 10.1007/978-3-540-30144-8_25. (292-303).

    http://link.springer.com/10.1007/978-3-540-30144-8_25

  • Ohtsubo A, Takemoto D, Tagashira S and Fujita S. (2004). The Power of Shortcuts in Greedy Routing in Content Addressable Networks. Embedded and Ubiquitous Computing. 10.1007/978-3-540-30121-9_95. (994-1003).

    http://link.springer.com/10.1007/978-3-540-30121-9_95

  • Lebhar E and Schabanel N. (2004). Almost Optimal Decentralized Routing in Long-Range Contact Networks. Automata, Languages and Programming. 10.1007/978-3-540-27836-8_75. (894-905).

    http://link.springer.com/10.1007/978-3-540-27836-8_75

  • Zou F, Li Y, Zhang L and Ma F. (2004). CCAN: Cache-Based CAN Using the Small World Model. Advances in Web-Age Information Management. 10.1007/978-3-540-27772-9_18. (167-175).

    http://link.springer.com/10.1007/978-3-540-27772-9_18

  • Efstathiou E and Polyzos G. (2004). Trustworthy Accounting for Wireless LAN Sharing Communities. Public Key Infrastructure. 10.1007/978-3-540-25980-0_21. (260-273).

    http://link.springer.com/10.1007/978-3-540-25980-0_21

  • Banaei-Kashani F and Shahabi C. (2004). Searchable Querical Data Networks. Databases, Information Systems, and Peer-to-Peer Computing. 10.1007/978-3-540-24629-9_3. (17-32).

    http://link.springer.com/10.1007/978-3-540-24629-9_3

  • Bawa M, Cooper B, Crespo A, Daswani N, Ganesan P, Garcia-Molina H, Kamvar S, Marti S, Schlosser M, Sun Q, Vinograd P and Yang B. (2003). Peer-to-peer research at Stanford. ACM SIGMOD Record. 32:3. (23-28). Online publication date: 1-Sep-2003.

    https://doi.org/10.1145/945721.945728

  • Gummadi K, Gummadi R, Gribble S, Ratnasamy S, Shenker S and Stoica I. The impact of DHT routing geometry on resilience and proximity. Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications. (381-394).

    https://doi.org/10.1145/863955.863998

  • Clark D, Partridge C, Ramming J and Wroclawski J. A knowledge plane for the internet. Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications. (3-10).

    https://doi.org/10.1145/863955.863957

  • Bawa M, Manku G and Raghavan P. SETS. Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval. (306-313).

    https://doi.org/10.1145/860435.860491

  • Yu B and Singh M. Searching social networks. Proceedings of the second international joint conference on Autonomous agents and multiagent systems. (65-72).

    https://doi.org/10.1145/860575.860587

  • Manku G. Routing networks for distributed hash tables. Proceedings of the twenty-second annual symposium on Principles of distributed computing. (133-142).

    https://doi.org/10.1145/872035.872054

  • Scharnhorst A. (2006). Complex Networks and the Web: Insights From Nonlinear Physics. Journal of Computer-Mediated Communication. 10.1111/j.1083-6101.2003.tb00222.x. 8:4. (0-0).

    https://academic.oup.com/jcmc/article/4584287

  • Naor M and Wieder U. Novel architectures for P2P applications. Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures. (50-59).

    https://doi.org/10.1145/777412.777421

  • Gray E, Seigneur J, Chen Y and Jensen C. Trust propagation in small worlds. Proceedings of the 1st international conference on Trust management. (239-254).

    /doi/10.5555/1759008.1759025

  • Mirza B, Keller B and Ramakrishnan N. (2003). Studying Recommendation Algorithms by Graph Analysis. Journal of Intelligent Information Systems. 20:2. (131-160). Online publication date: 1-Mar-2003.

    https://doi.org/10.1023/A:1021819901281

  • Takagi K and Kawakami M. (2003). Study on Information Disclosure of the Master Plan through the Internet by Municipalitiesインターネットを活用した市町村都市マスタープランの公開に関する研究. Journal of the City Planning Institute of Japan. 10.11361/journalcpij.38.3.823. 38.3:0. (823-828).

    https://www.jstage.jst.go.jp/article/journalcpij/38.3/0/38.3_823/_article/-char/ja/

  • Jin S and Bestavros A. Small-world characteristics of the Internet and multicast scaling 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems - MASCOTS. 10.1109/MASCOT.2003.1240670. 0-7695-2039-1. (260-268).

    http://ieeexplore.ieee.org/document/1240670/

  • Abraham I, Awerbuch B, Azar Y, Bartal Y, Malkhi D and Pavlov E. A generic scheme for building overlay networks in adversarial scenarios International Parallel and Distributed Processing Symposium (IPDPS 2003). 10.1109/IPDPS.2003.1213125. 0-7695-1926-1. (9).

    http://ieeexplore.ieee.org/document/1213125/

  • Auber D, Chiricota Y, Jourdan F and Melancon G. (2003). Multiscale visualization of small world networks IEEE Symposium on Information Visualization 2003. 10.1109/INFVIS.2003.1249011. 0-7803-8154-8. (75-81).

    http://ieeexplore.ieee.org/document/1249011/

  • Shenyquan Wang , Dong Xuan and Wei Zhao . On resilience of structured peer-to-peer systems GLOBECOM '03. IEEE Global Telecommunications Conference. 10.1109/GLOCOM.2003.1258952. 0-7803-7974-8. (3851-3856).

    http://ieeexplore.ieee.org/document/1258952/

  • Mutschke P. (2003). Mining Networks and Central Entities in Digital Libraries. A Graph Theoretic Approach Applied to Co-author Networks. Advances in Intelligent Data Analysis V. 10.1007/978-3-540-45231-7_15. (155-166).

    http://link.springer.com/10.1007/978-3-540-45231-7_15

  • Bordag S, Heyer G and Quasthoff U. (2003). Small Worlds of Concepts and Other Principles of Semantic Search. Innovative Internet Community Systems. 10.1007/978-3-540-39884-4_2. (10-19).

    http://link.springer.com/10.1007/978-3-540-39884-4_2

  • Merugu S, Srinivasan S and Zegura E. (2003). Adding Structure to Unstructured Peer-to-Peer Networks: The Role of Overlay Topology. Group Communications and Charges. Technology and Business Models. 10.1007/978-3-540-39405-1_8. (83-94).

    http://link.springer.com/10.1007/978-3-540-39405-1_8

  • Bordag S and Bordag D. (2003). Advances in Automatic Speech Recognition by Imitating Spreading Activation. Text, Speech and Dialogue. 10.1007/978-3-540-39398-6_23. (158-164).

    http://link.springer.com/10.1007/978-3-540-39398-6_23

  • Gray E, Seigneur J, Chen Y and Jensen C. (2003). Trust Propagation in Small Worlds. Trust Management. 10.1007/3-540-44875-6_17. (239-254).

    http://link.springer.com/10.1007/3-540-44875-6_17

  • Malkhi D. (2003). Dynamic Lookup Networks. Future Directions in Distributed Computing. 10.1007/3-540-37795-6_17. (93-96).

    http://link.springer.com/10.1007/3-540-37795-6_17

  • Coppersmith D, Gamarnik D and Sviridenko M. (2002). The diameter of a long‐range percolation graph. Random Structures & Algorithms. 10.1002/rsa.10042. 21:1. (1-13). Online publication date: 1-Aug-2002.

    https://onlinelibrary.wiley.com/doi/10.1002/rsa.10042

  • Malkhi D, Naor M and Ratajczak D. Viceroy. Proceedings of the twenty-first annual symposium on Principles of distributed computing. (183-192).

    https://doi.org/10.1145/571825.571857

  • Greco G, Greco S and Zumpano E. A stochastic approach for modeling and computing Web communities WISE 2002. of the Third International Conference on Web Information Systems Engineering. 10.1109/WISE.2002.1181642. 0-7695-1766-8. (43-52).

    http://ieeexplore.ieee.org/document/1181642/

  • Kempe D and Kleinberg J. Protocols and impossibility results for gossip-based communication mechanisms 43rd Annual IEEE Symposium on Foundations of Computer Science. 10.1109/SFCS.2002.1181971. 0-7695-1822-2. (471-480).

    http://ieeexplore.ieee.org/document/1181971/

  • Hui Zhang , Goel A and Govindan R. Using the small-world model to improve Freenet performance IEEE Information Communications Conference (INFOCOM 2002). 10.1109/INFCOM.2002.1019373. 0-7803-7476-2. (1228-1237).

    http://ieeexplore.ieee.org/document/1019373/

  • Blažević L, Giordano S and Le Boudec J. (2002). Anchored Path Discovery in Terminode Routing. NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications. 10.1007/3-540-47906-6_11. (141-153).

    http://link.springer.com/10.1007/3-540-47906-6_11

  • Li Y, Li J, Yu K, Wang K, Li S and Zhang Y. (2002). A Peer-to-Peer Communication System. Advances in Multimedia Information Processing — PCM 2002. 10.1007/3-540-36228-2_108. (873-879).

    http://link.springer.com/10.1007/3-540-36228-2_108

  • Matsuo Y, Ohsawa Y and Ishizuka M. (2001). A Document as a Small World. New Frontiers in Artificial Intelligence. 10.1007/3-540-45548-5_60. (444-448).

    http://link.springer.com/10.1007/3-540-45548-5_60

  • Barriére L, Fraigniaud P, Kranakis E and Krizanc D. (2001). Efficient Routing in Networks with Long Range Contacts. Distributed Computing. 10.1007/3-540-45414-4_19. (270-284).

    http://link.springer.com/10.1007/3-540-45414-4_19

  • Mutschke P. (2001). Enhancing Information Retrieval in Federated Bibliographic Data Sources Using Author Network Based Stratagems. Research and Advanced Technology for Digital Libraries. 10.1007/3-540-44796-2_25. (287-299).

    http://link.springer.com/10.1007/3-540-44796-2_25

  • Douence R and Fradet P. (1998). A systematic study of functional language implementations. ACM Transactions on Programming Languages and Systems. 20:2. (344-387). Online publication date: 1-Mar-1998.

    https://doi.org/10.1145/276393.276397

  • Jackson D, Jha S and Damon C. (1998). Isomorph-free model enumeration. ACM Transactions on Programming Languages and Systems. 20:2. (302-343). Online publication date: 1-Mar-1998.

    https://doi.org/10.1145/276393.276396

  • Corbató F. (1991). On building systems that will fail. Communications of the ACM. 34:9. (72-81). Online publication date: 1-Sep-1991.

    https://doi.org/10.1145/114669.114686

  • Allard J and Hawkinson L. (1991). Real-time programming in Common Lisp. Communications of the ACM. 34:9. (64-69). Online publication date: 1-Sep-1991.

    https://doi.org/10.1145/114669.114679

  • Layer D and Richardson C. (1991). Lisp systems in the 1990s. Communications of the ACM. 34:9. (48-57). Online publication date: 1-Sep-1991.

    https://doi.org/10.1145/114669.114674

  • Lin E. (1991). The role of the activity adjacency matrix in the critical path method. ACM SIGAPL APL Quote Quad. 21:3. (14-19). Online publication date: 1-Mar-1991.

    https://doi.org/10.1145/122442.122452

  • Ashenhurst R. (1985). ACM forum. Communications of the ACM. 28:1. (3-4). Online publication date: 2-Jan-1985.

    https://doi.org/10.1145/2465.314908

  • Berry R and Meekings B. (1985). A style analysis of C programs. Communications of the ACM. 28:1. (80-88). Online publication date: 2-Jan-1985.

    https://doi.org/10.1145/2465.2469

  • Gurd J, Kirkham C and Watson I. (1985). The Manchester prototype dataflow computer. Communications of the ACM. 28:1. (34-52). Online publication date: 2-Jan-1985.

    https://doi.org/10.1145/2465.2468

  • Seitz C. (1985). The cosmic cube. Communications of the ACM. 28:1. (22-33). Online publication date: 2-Jan-1985.

    https://doi.org/10.1145/2465.2467

  • Patterson D. (1985). Reduced instruction set computers. Communications of the ACM. 28:1. (8-21). Online publication date: 2-Jan-1985.

    https://doi.org/10.1145/2465.214917

  • Subratie K, Aditya S and Figueiredo R. Edgevpn: Self-Organizing Layer-2 Virtual Edge Networks. SSRN Electronic Journal. 10.2139/ssrn.4121945.

    https://www.ssrn.com/abstract=4121945

  • Jackson M, Rogers B and Zenou Y. The Economic Consequences of Social Network Structure. SSRN Electronic Journal. 10.2139/ssrn.2467812.

    http://www.ssrn.com/abstract=2467812

  • Yang S, Mo S and Zhu X. An Empirical Study of the Financial Community Network on Twitter. SSRN Electronic Journal. 10.2139/ssrn.2358679.

    http://www.ssrn.com/abstract=2358679