- Naoyuki Kamiyama:
Submodular Function Minimization under a Submodular Set Covering Constraint. TAMC 2011: 133-141 - Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil:
Extending Partial Representations of Interval Graphs. TAMC 2011: 276-285 - Alexander Langer, Peter Rossmanith, Somnath Sikdar:
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). TAMC 2011: 505-516 - Ming Lam Leung, Yang Li, Shengyu Zhang:
Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models. TAMC 2011: 403-408 - Angsheng Li, Linqing Tang:
The Complexity and Approximability of Minimum Contamination Problems. TAMC 2011: 298-307 - Andrzej Lingas, Cui Di:
Near Approximation of Maximum Weight Matching through Efficient Weight Reduction. TAMC 2011: 48-57 - Richard J. Lipton:
Quantum Complexity: Some Recent Results, Some Open Problems, Some Thoughts. TAMC 2011: 171 - Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
Grey-Box Steganography. TAMC 2011: 390-402 - Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo, Jianer Chen:
An Improved Kernel for Planar Connected Dominating Set. TAMC 2011: 70-81 - Bodo Manthey:
Deterministic Algorithms for Multi-criteria TSP. TAMC 2011: 264-275 - Arne Meier, Thomas Schneider:
Generalized Satisfiability for the Description Logic ALC - (Extended Abstract). TAMC 2011: 552-562 - Benjamin Hellouin de Menibus, Takeaki Uno:
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. TAMC 2011: 483-494 - Philippe Moser:
On the Polynomial Depth of Various Sets of Random Strings. TAMC 2011: 517-527 - Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno:
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. TAMC 2011: 452-462 - Alexey Pospelov:
Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication. TAMC 2011: 2-13 - Richard Schmied, Claus Viehmann:
Approximating Edge Dominating Set in Dense Graphs. TAMC 2011: 37-47 - Akiyoshi Shioura, Shunya Suzuki:
Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions. TAMC 2011: 142-153 - Karolina Soltys:
The Hardness of Median in the Synchronized Bit Communication Model. TAMC 2011: 409-415 - Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Energy and Fan-In of Threshold Circuits Computing Mod Functions. TAMC 2011: 154-163 - Fengming Wang:
NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth. TAMC 2011: 164-170 - Chee Yap:
A Real Elementary Approach to the Master Recurrence and Generalizations. TAMC 2011: 14-26 - Chunlai Zhou:
Intuitive Probability Logic. TAMC 2011: 240-251 - Ruben van der Zwaan, André Berger, Alexander Grigoriev:
How to Cut a Graph into Many Pieces. TAMC 2011: 184-194 - Mitsunori Ogihara, Jun Tarui:
Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings. Lecture Notes in Computer Science 6648, Springer 2011, ISBN 978-3-642-20876-8 [contents]