• 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.

found 255 matches

• 2020
• 
  Carmine Spagnuolo, Gennaro Cordasco, Przemyslaw Szufel, Pawel Pralat, Vittorio Scarano, Bogumil Kaminski, Alessia Antelmi:
  Analyzing, Exploring, and Visualizing Complex Networks via Hypergraphs using SimpleHypergraphs.jl. Internet Math. 2020 (2020)
• 2019
• 
  Bart de Keijzer, Tomasz Janus:
  On Strong Equilibria and Improvement Dynamics in Network Creation Games. Internet Math. 2019 (2019)
• 
  Daniel Montealegre, Van Vu:
  Spectrum of Complex Networks. Internet Math. 2019 (2019)
• 
  Tommy Reddad, Luc Devroye:
  On the discovery of the seed in uniform attachment trees. Internet Math. 2019 (2019)
• 
  Clara Stegehuis, Ellen Cardinaels, Johan S. H. van Leeuwaarden:
  Finding induced subgraphs in scale-free inhomogeneous random graphs. Internet Math. 2019 (2019)
• 2018
• 
  Megan Dewar, Kirill Ternovsky, Benjamin Reiniger, John Proos, Pawel Pralat, Xavier Pérez-Giménez, John Healy:
  Subhypergraphs in non-uniform random hypergraphs. Internet Math. 2018 (2018)
• 
  Pim van der Hoorn, Dong Yao, Nelly Litvak:
  Average nearest neighbor degrees in scale-free networks. Internet Math. 2018 (2018)
• 
  Yury A. Malyshkin:
  Preferential attachment combined with random number of choices. Internet Math. 2018 (2018)
• 
  Liudmila Ostroumova Prokhorenkova, Egor Samosvat, Aleksandr Dorodnykh:
  Preferential placement for community structure formation. Internet Math. 2018 (2018)
• 
  Sebastian Rosengren:
  A Multi-type Preferential Attachment Tree. Internet Math. 2018 (2018)
• 2017
• 
  Mohammed Amin Abdullah, Nikolaos Fountoulakis, Michel Bode:
  Typical distances in a geometric model for complex networks. Internet Math. 2017 (2017)
• 
  Mindaugas Bloznelis:
  Degree-degree distribution in a power law random intersection graph with clustering. Internet Math. 2017 (2017)
• 
  Van Hao Can:
  Metastability for the contact process on the preferential attachment graph. Internet Math. 2017 (2017)
• 
  Maria Deijfen, Robert Fitzner:
  Birds of a feather or opposites attract - effects in network modelling. Internet Math. 2017 (2017)
• 
  Philippe Deprez, Mario V. Wüthrich:
  Construction of Directed Assortative Configuration Graphs. Internet Math. 2017 (2017)
• 
  Christopher Duffy, Jeannette C. M. Janssen:
  The Spread of Cooperative Strategies on Grids with Random Asynchronous Updating. Internet Math. 2017 (2017)
• 
  Massimo Franceschet, Enrico Bozzo:
  Approximations of the Generalized Inverse of the Graph Laplacian Matrix. Internet Math. 2017 (2017)
• 
  Massimo Franceschet, Enrico Bozzo:
  Arbitrarily regularizable graphs. Internet Math. 2017 (2017)
• 
  Alexander M. Krot, Liudmila Ostroumova Prokhorenkova:
  Local Clustering Coefficient in Generalized Preferential Attachment Models. Internet Math. 2017 (2017)
• 
  Corrado Monti, Paolo Boldi:
  Estimating latent feature-feature interactions in large feature-rich graphs. Internet Math. 2017 (2017)
• 
  Liudmila Ostroumova Prokhorenkova, Alexander M. Krot:
  Assortativity in Generalized Preferential Attachment Models. Internet Math. 2017 (2017)
• 
  (Withdrawn) Mixing Time of Random Walk on Poisson Geometry Small World. Internet Math. 2017 (2017)
• 2016
• 
  Aaron B. Adcock, Blair D. Sullivan, Michael W. Mahoney:
  Tree decompositions and social graphs. Internet Math. 12(5): 315-361 (2016)
• 
  Carme Àlvarez, Maria J. Blesa, Hendrik Molter:
  Firefighting as a Strategic Game. Internet Math. 12(1-2): 101-120 (2016)
• 
  John Augustine, Tejas Kulkarni, Sumathi Sivasubramaniam:
  Leader Election in Sparse Dynamic Networks with Churn. Internet Math. 12(6): 402-418 (2016)
• 
  Elisabetta Bergamini, Henning Meyerhenke:
  Approximating Betweenness Centrality in Fully Dynamic Networks. Internet Math. 12(5): 281-314 (2016)
• 
  Anthony Bonato, Jeannette C. M. Janssen, Elham Roshanbin:
  How to Burn a Graph. Internet Math. 12(1-2): 85-100 (2016)
• 
  Anthony Bonato, Pawel Pralat:
  Special Issue on Algorithms and Models for the Web-Graph. Internet Math. 12(1-2): 1 (2016)
• 
  Laurent Bulteau, Vincent Froese, Nimrod Talmon:
  Multi-Player Diffusion Games on Graph Classes. Internet Math. 12(6): 363-380 (2016)
• 
  Elisabetta Candellero, Nikolaos Fountoulakis:
  Clustering and the Hyperbolic Geometry of Complex Networks. Internet Math. 12(1-2): 2-53 (2016)

skipping 225 more matches