default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternet Mathematics, Volume 5
Volume 5, Number 1, 2008
- Reid Andersen, Fan R. K. Chung, Kevin J. Lang:
Local Partitioning for Directed Graphs Using PageRank. 3-22 - Reid Andersen, Christian Borgs
, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng:
Local Computation of PageRank Contributions. 23-45 - Konstantin Avrachenkov, Nelly Litvak, Kim Son Pham:
A Singular Perturbation Approach for Choosing the PageRank Damping Factor. 47-69 - John E. Hopcroft, Daniel Sheldon:
Manipulation-Resistant Reputations Using Hitting Time. 71-90 - Stephen J. Young, Edward R. Scheinerman:
Directed Random Dot Product Graphs. 91-111 - Milan Bradonjic, Aric A. Hagberg, Allon G. Percus:
The Structure of Geographical Threshold Graphs. 113-139 - Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu:
Deterministic Decentralized Search in Random Graphs. 141-154 - Nina Mishra, Robert Schreiber, Isabelle Stanton, Robert Endre Tarjan:
Finding Strongly Knit Clusters in Social Networks. 155-174 - William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen, Pawel Pralat:
A Spatial Web Graph Model with Local Influence Regions. 175-196
Volume 5, Number 3, 2008
- Chen Avin:
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs. 195-210 - Hovhannes A. Harutyunyan:
An Efficient Vertex Addition Method for Broadcast Networks. 211-225 - Jan Zich, Yoshiharu Kohayakawa, Vojtech Rödl, V. Sunderam:
JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness. 227-250 - Ilkka Norros, Hannu Reittu:
Attack Resistance of Power-Law Random Graphs in the Finite-Mean, Infinite-Variance Region. 251-266 - Persi Diaconis, Susan P. Holmes, Svante Janson:
Threshold Graph Limits and Random Threshold Graphs. 267-320
Volume 5, Number 4, 2008
- Heiner Ackermann, Alexander Skopalik:
Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. 323-342 - Dimitris Fotakis, Paul G. Spirakis:
Cost-Balancing Tolls for Atomic Network Congestion Games. 343-363 - Haralampos Tsaknakis, Paul G. Spirakis:
An Optimization Approach for Approximate Nash Equilibria. 365-382 - Qizhi Fang, Liang Kong, Jia Zhao:
Core Stability of Vertex Cover Games. 383-394 - Alexander Hall, Evdokia Nikolova, Christos H. Papadimitriou:
Incentive-Compatible Interdomain Routing with Linear Utilities. 395-410 - Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti:
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems. 411-437 - Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
A Unified Approach to Congestion Games and Two-Sided Markets. 439-457 - Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking:
Who Should Pay for Forwarding Packets? 459-475 - Kyle W. Burke, Shang-Hua Teng:
Atropos: A PSPACE-Complete Sperner Triangle Game. 477-492 - David J. Abraham, Ariel Levavi, David F. Manlove, Gregg O'Malley:
The Stable Roommates Problem with Globally Ranked Pairs. 493-515
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.
last updated on 2024-11-20 21:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
