Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 514
Volume 514, November 2013
- Camil Demetrescu, Stefano Leonardi, Alberto Marchetti-Spaccamela:
Preface. 1
- Patrizio Angelini
, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani:
Topological morphing of planar graphs. 2-20 - Vittorio Bilò, Alessandro Celi, Michele Flammini, Vasco Gallotti:
Social context congestion games. 21-35 - Gianfranco Bilardi, Francesco Versaci:
Optimal eviction policies for stochastic address traces. 36-60 - Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of maximum weight induced hereditary subgraph problems. 61-74 - Marek Chrobak, Lukasz Jez, Jirí Sgall:
Better bounds for incremental frequency allocation in bipartite graphs. 75-83 - Pilu Crescenzi, Roberto Grossi, Michel Habib, Leonardo Lanzi, Andrea Marino:
On computing the diameter of real-world undirected graphs. 84-95 - David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott:
Category-based routing in social networks: Membership dimension and the small-world phenomenon. 96-104 - Zeev Nutov:
Survivable network activation problems. 105-115
a service of 
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-04-17 21:28 CEST 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:
