Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 25 matches
- 2022
- Kiran R. Bhutani, Ravi Kalpathy, Hosam M. Mahmoud:
Random networks grown by fusing edges via urns. Netw. Sci. 10(4): 347-360 (2022) - Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand:
Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Netw. Sci. 10(4): 361-380 (2022) - Per Block, James Hollway, Christoph Stadtfeld, Johan H. Koskinen, Tom A. B. Snijders:
Circular specifications and "predicting" with information from the future: Errors in the empirical SAOM-TERGM comparison of Leifeld & Cranmer. Netw. Sci. 10(1): 3-14 (2022) - Jane Carlen, Jaume de Dios Pont, Cassidy Mentus, Shyr-Shea Chang, Stephanie Wang, Mason A. Porter:
Role detection in bicycle-sharing networks using multilayer stochastic block models. Netw. Sci. 10(1): 46-81 (2022) - Henry L. Carscadden, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz:
Techniques for blocking the propagation of two simultaneous contagions over networks using a graph dynamical systems framework. Netw. Sci. 10(3): 234-260 (2022) - Jared F. Edgerton, Skyler J. Cranmer, Victor S. Finomore:
How teams adapt to exogenous shocks: Experimental evidence with node knockouts of central members. Netw. Sci. 10(3): 261-282 (2022) - Frédéric Giroire, Nicolas Nisse, Thibaud Trolliet, Malgorzata Sulkowska:
Preferential attachment hypergraph with high modularity. Netw. Sci. 10(4): 400-429 (2022) - Azwirman Gusrialdi:
Connectivity-preserving distributed algorithms for removing links in directed networks. Netw. Sci. 10(3): 215-233 (2022) - Tadao Hoshino:
A pairwise strategic network formation model with group heterogeneity: With an application to international travel. Netw. Sci. 10(2): 170-189 (2022) - Bogumil Kaminski, Lukasz Krainski, Pawel Pralat, François Théberge:
A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs. Netw. Sci. 10(4): 323-346 (2022) - Vishesh Karwa, Sonja Petrovic, Denis Bajic:
DERGMs: Degeneracy-restricted exponential family random graph models. Netw. Sci. 10(1): 82-110 (2022) - Philip Leifeld, Skyler J. Cranmer:
The stochastic actor-oriented model is a theory as much as it is a method and must be subject to theory tests. Netw. Sci. 10(1): 15-19 (2022) - Philip Leifeld, Skyler J. Cranmer:
A theoretical and empirical comparison of the temporal exponential random graph model and the stochastic actor-oriented model - Corrigendum. Netw. Sci. 10(1): 111 (2022) - Benjamin Leinwand, Vladas Pipiras:
Block dense weighted networks with augmented degree correction. Netw. Sci. 10(3): 301-321 (2022) - Mengzhen Li, Mustafa Coskun, Mehmet Koyutürk:
Consensus embedding for multiple networks: Computation and applications. Netw. Sci. 10(2): 190-206 (2022) - Cassie McMillan:
Strong and weak tie homophily in adolescent friendship networks: An analysis of same-race and same-gender ties. Netw. Sci. 10(3): 283-300 (2022) - Marcell Nagy, Roland Molontay:
Network classification-based structural analysis of real networks and their model-generated counterparts. Netw. Sci. 10(2): 146-169 (2022) - Javier Pardo-Diaz, Philip S. Poole, Mariano Beguerisse-Díaz, Charlotte M. Deane, Gesine Reinert:
Generating weighted and thresholded gene coexpression networks using signed distance correlation. Netw. Sci. 10(2): 131-145 (2022) - Julie Queiros, Célestin Coquidé, François Queyroi:
Toward random walk-based clustering of variable-order networks. Netw. Sci. 10(4): 381-399 (2022) - Neil A. Spencer, Brian W. Junker, Tracy M. Sweet:
Faster MCMC for Gaussian latent position network models. Netw. Sci. 10(1): 20-45 (2022) - Clara Stegehuis:
Bringing network science to primary school. Netw. Sci. 10(2): 207-213 (2022) - Tracy M. Sweet, Samrachana Adhikari:
A hierarchical latent space network model for mediation. Netw. Sci. 10(2): 113-130 (2022) - Stanley Wasserman, Ulrik Brandes:
Editors' Note. Netw. Sci. 10(1): 1-2 (2022) - NWS volume 10 issue 1 Cover and Front matter. Netw. Sci. 10(1): 1- (2022)
- NWS volume 10 issue 2 Cover and Front matter. Netw. Sci. 10(2): 1- (2022)
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-22 13:40 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint