Period of time： 2011年2期
Publisher： Springer Publishing Company
Founded in： 1986
Total resources： 48
ISSN： 0178-4617
Subject： TP Automation Technology , Computer Technology
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Algorithmica,volume 59,issue 2
Menu
Approximate Range Searching in External Memory
By Streppel Micha,Yi Ke in (2011)
Algorithmica,volume 59,issue 2 , Vol. 59, Iss. 2, 2011-02 , pp.
Access to resources
Recommend
The Stackelberg Minimum Spanning Tree Game
By Cardinal Jean,Demaine Erik,Fiorini Samuel,Joret Gwenaël,Langerman Stefan,Newman Ilan,Weimann Oren in (2011)
Algorithmica,volume 59,issue 2 , Vol. 59, Iss. 2, 2011-02 , pp.Augmenting the Rigidity of a Graph in
By García A.,Tejel J. in (2011)
Algorithmica,volume 59,issue 2 , Vol. 59, Iss. 2, 2011-02 , pp.Exact Algorithms for
By Havet Frédéric,Klazar Martin,Kratochvíl Jan,Kratsch Dieter,Liedloff Mathieu in (2011)
Algorithmica,volume 59,issue 2 , Vol. 59, Iss. 2, 2011-02 , pp.Improved Algorithms for Maximum Agreement and Compatible Supertrees
By Hoang Viet,Sung Wing-Kin in (2011)
Algorithmica,volume 59,issue 2 , Vol. 59, Iss. 2, 2011-02 , pp.Linear-Time Recognition of Helly Circular-Arc Models and Graphs
By Joeris Benson,Lin Min,McConnell Ross,Spinrad Jeremy,Szwarcfiter Jayme in (2011)
Algorithmica,volume 59,issue 2 , Vol. 59, Iss. 2, 2011-02 , pp.35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality
By Kowalik Lukasz,Mucha Marcin in (2011)
Algorithmica,volume 59,issue 2 , Vol. 59, Iss. 2, 2011-02 , pp.Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
By Dürr Christoph,Hurand Mathilde in (2011)
Algorithmica,volume 59,issue 2 , Vol. 59, Iss. 2, 2011-02 , pp.Linear-Time Construction of Two-Dimensional Suffix Trees
By Kim Dong,Na Joong,Sim Jeong,Park Kunsoo in (2011)
Algorithmica,volume 59,issue 2 , Vol. 59, Iss. 2, 2011-02 , pp.