Остановите войну!
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 18 matches
- 2013
- Konstantin Avrachenkov, Paulo Gonçalves, Marina Sokol:
On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods. WAW 2013: 56-67 - Konstantin Avrachenkov, Nelly Litvak, Vasily Medyanikov, Marina Sokol:
Alpha Current Flow Betweenness Centrality. WAW 2013: 106-117 - Mindaugas Bloznelis, Michal Karonski:
Random Intersection Graph Process. WAW 2013: 93-105 - Michael Brautbar, Moez Draief, Sanjeev Khanna:
On the Power of Adversarial Infections in Networks. WAW 2013: 44-55 - Fan Chung, Mark Kempton:
A Local Clustering Algorithm for Connection Graphs. WAW 2013: 26-43 - Fan Chung, Olivia Simpson:
Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank. WAW 2013: 203-219 - Colin Cooper, Tomasz Radzik, Yiannis Siantos:
Fast Low-Cost Estimation of Network Properties Using Random Walks. WAW 2013: 130-143 - Keshav Goel, Rishi Ranjan Singh, Sudarshan Iyengar, Sukrit Gupta:
A Faster Algorithm to Update Betweenness Centrality after Node Alteration. WAW 2013: 170-184 - Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh:
Anarchy Is Free in Network Creation. WAW 2013: 220-231 - Emmanuel Jacob, Peter Mörters:
A Spatial Preferential Attachment Model with Local Clustering. WAW 2013: 14-25 - Jeannette C. M. Janssen, Pawel Pralat, Rory Wilson:
Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model. WAW 2013: 1-13 - Kyle Kloster, David F. Gleich:
A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks. WAW 2013: 68-79 - Damien Lefortier, Liudmila Ostroumova, Egor Samosvat:
Evolution of the Media Web. WAW 2013: 80-92 - Akaki Mamageishvili, Matús Mihalák, Dominik Müller:
Tree Nash Equilibria in the Network Creation Game. WAW 2013: 118-129 - Liudmila Ostroumova, Alexander Ryabchenko, Egor Samosvat:
Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient. WAW 2013: 185-202 - Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw Hadish Gebremedhin, Wei-keng Liao, Alok N. Choudhary:
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs. WAW 2013: 156-169 - Rupei Xu:
An L p Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model. WAW 2013: 144-155 - Anthony Bonato, Michael Mitzenmacher, Pawel Pralat:
Algorithms and Models for the Web Graph - 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings. Lecture Notes in Computer Science 8305, Springer 2013, ISBN 978-3-319-03535-2 [contents]
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-07 15:31 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