default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 420
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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
