Остановите войну!
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 28 matches
- 2015
- John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev:
Dynamics of Profit-Sharing Games. Internet Math. 11(1): 1-22 (2015) - Jonathan W. Berry, Luke A. Fostvedt, Daniel J. Nordman, Cynthia A. Phillips, C. Seshadhri, Alyson G. Wilson:
Why Do Simple Algorithms for Triangle Enumeration Work in the Real World? Internet Math. 11(6): 555-571 (2015) - Mindaugas Bloznelis, Michal Karonski:
Random Intersection Graph Process. Internet Math. 11(4-5): 385-402 (2015) - Anthony Bonato, Pawel Pralat:
Special Issue on Algorithms and Models for the Web-graph. Internet Math. 11(4-5): 307 (2015) - Michael Brautbar, Moez Draief, Sanjeev Khanna:
On the Power of Planned Infections in Networks. Internet Math. 11(4-5): 319-332 (2015) - Xing Shi Cai, Luc Devroye:
The Analysis of Kademlia for Random IDs. Internet Math. 11(6): 572-587 (2015) - Fan Chung, Mark Kempton:
A Local Clustering Algorithm for Connection Graphs. Internet Math. 11(4-5): 333-351 (2015) - Fan Chung, Olivia Simpson:
Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank. Internet Math. 11(4-5): 449-471 (2015) - Colin Cooper, Alan M. Frieze:
Long Paths in Random Apollonian Networks. Internet Math. 11(4-5): 308-318 (2015) - Thang N. Dinh, My T. Thai:
Toward Optimal Community Detection: From Trees to General Weighted Networks. Internet Math. 11(3): 181-200 (2015) - David F. Gleich, Kyle Kloster:
Sublinear Column-wise Actions of the Matrix Exponential on Social Networks. Internet Math. 11(4-5): 352-384 (2015) - Keshav Goel, Rishi Ranjan Singh, Sudarshan Iyengar, Sukrit Gupta:
A Faster Algorithm to Update Betweenness Centrality After Node Alteration. Internet Math. 11(4-5): 403-420 (2015) - Evgeny A. Grechnikov:
The Degree Distribution and the Number of Edges Between Nodes of given Degrees in Directed Scale-Free Graphs. Internet Math. 11(6): 487-527 (2015) - Pim van der Hoorn, Nelly Litvak:
Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees. Internet Math. 11(2): 155-179 (2015) - Jeannette C. M. Janssen, Celeste Vautour:
Finding Safe Strategies for Competitive Diffusion on Trees. Internet Math. 11(3): 232-252 (2015) - Samuel D. Johnson, Raissa M. D'Souza:
Inequality and Network Formation Games. Internet Math. 11(3): 253-276 (2015) - Jérôme Kunegis:
Exploiting The Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory Applications. Internet Math. 11(3): 201-321 (2015) - Richard J. La, Maya Kabkab:
A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter. Internet Math. 11(6): 528-554 (2015) - Aron Laszka, Assane Gueye:
Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity. Internet Math. 11(6): 588-626 (2015) - Yanhua Li, Wei Chen, Yajun Wang, Zhi-Li Zhang:
Voter Model on Signed Social Networks. Internet Math. 11(2): 93-133 (2015) - Shi Li, Gabriel H. Tucci:
Traffic Congestion in Expanders and (p, δ)-Hyperbolic Spaces. Internet Math. 11(2): 134-142 (2015) - Abdelhakim El Maftouhi, Ararat Harutyunyan, Yannis Manoussakis:
Weak Balance in Random Signed Graphs. Internet Math. 11(2): 143-154 (2015) - Akaki Mamageishvili, Matús Mihalák, Dominik Müller:
Tree Nash Equilibria in the Network Creation Game. Internet Math. 11(4-5): 472-486 (2015) - Onuttom Narayan, Iraj Saniee, Gabriel H. Tucci:
Lack of Hyperbolicity in Asymptotic Erdös-Renyi Sparse Random Graphs. Internet Math. 11(3): 277-288 (2015) - Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw Hadish Gebremedhin, Wei-keng Liao, Alok N. Choudhary:
Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection. Internet Math. 11(4-5): 421-448 (2015) - Erik Thörnblad:
Asymptotic Degree Distribution of a Duplication-Deletion Random Graph Model. Internet Math. 11(3): 289-305 (2015) - Maochao Xu, Gaofeng Da, Shouhuai Xu:
Cyber Epidemic Models with Dependences. Internet Math. 11(1): 62-92 (2015) - Shouhuai Xu, Wenlian Lu, Hualun Li:
A Stochastic Model of Active Cyber Defense Dynamics. Internet Math. 11(1): 23-61 (2015)
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 16:44 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