The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace.
- Published in:
- Theory of Computing Systems, 2010, v. 47, n. 3, p. 655, doi. 10.1007/s00224-009-9188-4
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2010 AND VI 47 AND IP 3
Results: 10
1
2
Quantum Search with Variable Times.
- Published in:
- Theory of Computing Systems, 2010, v. 47, n. 3, p. 786, doi. 10.1007/s00224-009-9219-1
- By:
- Publication type:
- Article
3
Trimmed Moebius Inversion and Graphs of Bounded Degree.
- Published in:
- Theory of Computing Systems, 2010, v. 47, n. 3, p. 637, doi. 10.1007/s00224-009-9185-7
- By:
- Publication type:
- Article
4
Trimming of Graphs, with Application to Point Labeling.
- Published in:
- Theory of Computing Systems, 2010, v. 47, n. 3, p. 613, doi. 10.1007/s00224-009-9184-8
- By:
- Publication type:
- Article
5
Connecting Polygonizations via Stretches and Twangs.
- Published in:
- Theory of Computing Systems, 2010, v. 47, n. 3, p. 674, doi. 10.1007/s00224-009-9192-8
- By:
- Publication type:
- Article
6
Model Checking Games for the Quantitative μ-Calculus.
- Published in:
- Theory of Computing Systems, 2010, v. 47, n. 3, p. 696, doi. 10.1007/s00224-009-9201-y
- By:
- Publication type:
- Article
7
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs.
- Published in:
- Theory of Computing Systems, 2010, v. 47, n. 3, p. 737, doi. 10.1007/s00224-009-9204-8
- By:
- Publication type:
- Article
8
Limit Complexities Revisited.
- Published in:
- Theory of Computing Systems, 2010, v. 47, n. 3, p. 720, doi. 10.1007/s00224-009-9203-9
- By:
- Publication type:
- Article
9
Lexicographic Decomposition of k-Valued Transducers.
- Published in:
- Theory of Computing Systems, 2010, v. 47, n. 3, p. 758, doi. 10.1007/s00224-009-9206-6
- By:
- Publication type:
- Article
10
STACS 2008 Foreword.
- Published in:
- Theory of Computing Systems, 2010, v. 47, n. 3, p. 611, doi. 10.1007/s00224-009-9221-7
- By:
- Publication type:
- Article