Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Algorithmica

Algorithmica is a monthly peer reviewed, scientific journal, published by Springer Science+Business Media focused on research and application of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
This paper explores techniques for solving the maximum clique and vertex coloring problems on very large-scale real-life networks… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2013
2013
A suffix array is a data structure that, together with the LCP array, allows solving many string processing problems in a very… Expand
Is this relevant?
Highly Cited
2012
Highly Cited
2012
An optimal BSP for a set S of disjoint line segments in the plane is a BSP for S that produces the minimum number of cuts. We… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Finding shortest paths is a fundamental operator in spatial databases. Recently, terrain datasets have attracted a lot of… Expand
  • figure 1
  • figure 5
  • figure 7
  • figure 8
  • figure 11
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Drift analysis is a powerful tool used to bound the optimization time of evolutionary algorithms (EAs). Various previous works… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The tremendous evolution of programmable graphics hardware has made high-quality real-time volume graphics a reality. In addition… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
1994
1994
Two of the fundamental questions that arise in the manufacturing industry concerning every type of manufacturing process are: (1… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
This thesis presents research done by the author on competitive analysis of on-line problems. An on-line problem is a problem… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We reduce the problem of finding an augmenting path in a general graph to a reachability problem and show that a slight… Expand
Is this relevant?
1990
1990
Virtually all previous methods for the rectilinear Steiner tree problem begin with a minimum spanning tree topology and rearrange… Expand
  • figure I
  • figure 2
  • figure 4
  • figure 5
Is this relevant?