Algorithmica

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

Topic mentions per year

Topic mentions per year

1987-2017
0102019872017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Given a DNF formula f on n variables, the two natural size measures are the number of terms or size s(f) and the maximum width of… (More)
Is this relevant?
2010
2010
This paper makes three main contributions to the theory of communication complexity and stream computation. First, we present new… (More)
Is this relevant?
2008
2008
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(n'~ where co is the exponent of the… (More)
  • figure 2
Is this relevant?
2006
2006
(1 + 1) [1636, 1637, 2320, 2205]. (1 + ) [1067]. (1 + λ) [2458]. (2− c 1 √ N ) [1357]. (2t+ 1) [799]. (k − 1) [1177]. (s, t) [446… (More)
Is this relevant?
2006
2006
Consider the dynamic program h(n)=min 1≤j≤n a(n,j), where a(n,j) is some formula that may (online) or may not (offline) depend on… (More)
  • figure 1
  • figure 2
Is this relevant?
2000
2000
We consider the problem of planning sensor control strategies that enable a sensor to be automatically conngured for robot tasks… (More)
  • figure 5
  • figure 17
Is this relevant?
1995
1995
  • T Let
  • 1995
NI 90] H. Nagamochi and T. Ibaraki, \Linear time algorithms for nding k-edge-connected and k-node-connected spanning subgraphs… (More)
Is this relevant?
1992
1992
We present an algorithm for maintaining the biconnected components of a graph during a sequence of edge insertions and deletions… (More)
Is this relevant?