Period of time： 2011年1期
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 61,issue 1
Menu
Special Issue: European Symposium on Algorithms, Design and Analysis
Algorithmica,volume 61,issue 1 , Vol. 61, Iss. 1, 2011-09 , pp.
Access to resources
Recommend
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
By Bläser Markus,Hoffmann Christian in (2011)
Algorithmica,volume 61,issue 1 , Vol. 61, Iss. 1, 2011-09 , pp.A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
Algorithmica,volume 61,issue 1 , Vol. 61, Iss. 1, 2011-09 , pp.On Optimally Partitioning a Text to Improve Its Compression
By Ferragina Paolo,Nitto Igor,Venturini Rossano in (2011)
Algorithmica,volume 61,issue 1 , Vol. 61, Iss. 1, 2011-09 , pp.Approximability of Sparse Integer Programs
By Pritchard David,Chakrabarty Deeparnab in (2011)
Algorithmica,volume 61,issue 1 , Vol. 61, Iss. 1, 2011-09 , pp.Piercing Translates and Homothets of a Convex Body
By Dumitrescu Adrian,Jiang Minghui in (2011)
Algorithmica,volume 61,issue 1 , Vol. 61, Iss. 1, 2011-09 , pp.On the Performance of Approximate Equilibria in Congestion Games
By Christodoulou George,Koutsoupias Elias,Spirakis Paul in (2011)
Algorithmica,volume 61,issue 1 , Vol. 61, Iss. 1, 2011-09 , pp.Dynamic vs. Oblivious Routing in Network Design
By Goyal Navin,Olver Neil,Bruce Shepherd F. in (2011)
Algorithmica,volume 61,issue 1 , Vol. 61, Iss. 1, 2011-09 , pp.Maximum Flow in Directed Planar Graphs with Vertex Capacities
By Kaplan Haim,Nussbaum Yahav in (2011)
Algorithmica,volume 61,issue 1 , Vol. 61, Iss. 1, 2011-09 , pp.
Previous
Next