Skip to search formSkip to main contentSkip to account menu

Algorithmica

Algorithmica is a monthly peer reviewed, scientific journal, published by Springer Science+Business Media focused on research and application of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

43 relations
ACM Transactions on AlgorithmsAlgorithmsAnna KarlinApex graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
This paper explores techniques for solving the maximum clique and vertex coloring problems on very large-scale real-life networks… 
2013
2013
External Memory Generalized Suffix and LCP Arrays Construction
A suffix array is a data structure that, together with the LCP array, allows solving many string processing problems in a very… 
Highly Cited
2011
Highly Cited
2011
Bin Repacking Scheduling in Virtualized Datacenters
A datacenter can be viewed as a dynamic bin packing system where servers host applications with varying resource requirements and… 
2008
2008
Elementary approximation algorithms for prize collecting Steiner tree problems
2005
2005
Shortest monotone descent path problem in polyhedral terrain
2003
2003
Bit-parallel approximate string matching algorithms with transposition
2002
2002
Knots : mathematics with a twist
Preface 1. Atoms and Knots Lord Kelvin -- 1860 2. Braided Knots Alexander -- 1923 3. Planar Diagrams of Knots Reidemeister… 
1998
1998
On the union of κ-curved objects
A (not necessarily convex) object C in the plane is -curved for some constant 0<< 1, if it has constant description complexity… 
Highly Cited
1994
Highly Cited
1994
Sensor based planning and nonsmooth analysis
  • H. ChosetJ. Burdick
  • Proceedings of the IEEE International Conference…
  • 1994
  • Corpus ID: 18761845
This paper describes some initial steps towards sensor based path planning in an unknown static environment. The method is a… 
Highly Cited
1990
Highly Cited
1990
A new class of Steiner tree heuristics with good performance: the iterated 1-Steiner approach
  • A. KahngG. Robins
  • IEEE International Conference on Computer-Aided…
  • 1990
  • Corpus ID: 791944
Virtually all previous methods for the rectilinear Steiner tree problem begin with a minimum spanning tree topology and rearrange… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)