@article{Angelini-Cortese-Di_Battista-Patrignani/13,
AUTHOR = {Angelini, Patrizio and Cortese, Pier Francesco and Di Battista, Giuseppe and Patrignani, Maurizio},
TITLE = {Topological morphing of planar graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {514},
PAGES = {2-20},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513006427},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bilo-Celi-Flammini-Gallotti/13,
AUTHOR = {Bil{\`o}, Vittorio and Celi, Alessandro and Flammini, Michele and Gallotti, Vasco},
TITLE = {Social context congestion games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {514},
PAGES = {21-35},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {nash equilibria, price of anarchy, congestion games, social networks, social context games},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512009735},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bilardi-Versaci/13,
AUTHOR = {Bilardi, Gianfranco and Versaci, Francesco},
TITLE = {Optimal eviction policies for stochastic address traces},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {514},
PAGES = {36-60},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {eviction policies, paging, online problems, algorithms and data structures, markov chains, optimal control, multiobjective optimization},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000662},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Boria-Monnot-Paschos/13,
AUTHOR = {Boria, Nicolas and Monnot, J{\'e}r{\^o}me and Paschos, Vangelis Th.},
TITLE = {Reoptimization of maximum weight induced hereditary subgraph problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {514},
PAGES = {61-74},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {reoptimization, graph theory, polynomial approximation, inapproximability, hereditary property},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512009668},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chrobak-Jez-Sgall/13,
AUTHOR = {Chrobak, Marek and Je{\.z}, {\L}ukasz and Sgall, Ji{\v{r}}{\'{i}}},
TITLE = {Better bounds for incremental frequency allocation in bipartite graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {514},
PAGES = {75-83},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, frequency allocation, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512004781},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crescenzi-Grossi-Habib-Lanzi-Marino/13,
AUTHOR = {Crescenzi, Pilu and Grossi, Roberto and Habib, Michel and Lanzi, Leonardo and Marino, Andrea},
TITLE = {On computing the diameter of real-world undirected graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {514},
PAGES = {84-95},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {breadth-first search, diameter, complex network, experimental analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512008687},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Eppstein-Goodrich-Loffler-Strash-Trott/13,
AUTHOR = {Eppstein, David and Goodrich, Michael T. and L{\"o}ffler, Maarten and Strash, Darren and Trott, Lowell},
TITLE = {Category-based routing in social networks: Membership dimension and the small-world phenomenon},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {514},
PAGES = {96-104},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membership dimension, small world, category routing, social network},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513003356},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nutov/13,
AUTHOR = {Nutov, Zeev},
TITLE = {Survivable network activation problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {514},
PAGES = {105-115},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {wireless networks, graph-connectivity, network design, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512009863},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}