Volume 420, February 2012

• 
  Samuele Giraudo: Intervals of balanced binary trees in the Tamari lattice. 1-27
• 
  Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Induced packing of odd cycles in planar graphs. 28-35
• 
  Teturo Kamae: Behavior of various complexity functions. 36-47
• 
  Telikepalli Kavitha: Properties of Gomory-Hu co-cycle bases. 48-55
• 
  Daniel Kirsten: Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring. 56-63
• 
  Dana Ron, Gilad Tsur: Testing computability by width-two OBDDs. 64-79
• 
  T. K. Subrahmonian Moothathu: Eulerian entropy and non-repetitive subword complexity. 80-88
• 
  Weiwei Wu, Minming Li, Wanyong Tian, Chun Jason Xue, Enhong Chen: Single and multiple device DSA problems, complexities and online algorithms. 89-98

last updated on Sat May 18 06:42:45 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page