default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 417
Volume 417, February 2012
- Petr Hlinený
, Antonín Kucera:
Preface. 1
- Ivona Bezáková, Adam J. Friedlander:
Counting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time. 2-11 - Davide Bilò, Luciano Gualà, Guido Proietti:
Improved approximability and non-approximability results for graph diameter decreasing problems. 12-22 - Nader H. Bshouty, Hanna Mazzawi:
Toward a deterministic polynomial time algorithm with optimal additive query complexity. 23-35 - Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting classes and the fine structure between NC1 and L. 36-49 - Julien David:
Average complexity of Moore's and Hopcroft's algorithms. 50-65 - Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh:
Improved simulation of nondeterministic Turing machines. 66-73 - Giulio Manzonetto, Paolo Tranquilli:
Strong normalization of MLF via a calculus of coercions. 74-94 - Siamak Tazari:
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs. 95-107
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 2024-11-18 20:33 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:
