Works matching IS 14324350 AND DT 2011 AND VI 49 AND IP 3
Results: 7
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 3, p. 565, doi. 10.1007/s00224-010-9275-6
- By:
- Publication type:
- Article
A Property Tester for Tree-Likeness of Quartet Topologies.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 3, p. 576, doi. 10.1007/s00224-010-9276-5
- By:
- Publication type:
- Article
The Hub Number of Sierpiński-Like Graphs.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 3, p. 588, doi. 10.1007/s00224-010-9286-3
- By:
- Publication type:
- Article
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 3, p. 639, doi. 10.1007/s00224-010-9292-5
- By:
- Publication type:
- Article
Dimension, Halfspaces, and the Density of Hard Sets.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 3, p. 601, doi. 10.1007/s00224-010-9288-1
- By:
- Publication type:
- Article
Generalized Semimagic Squares for Digital Halftoning.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 3, p. 632, doi. 10.1007/s00224-010-9290-7
- By:
- Publication type:
- Article
Approximating the Metric TSP in Linear Time.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 3, p. 615, doi. 10.1007/s00224-010-9289-0
- By:
- Publication type:
- Article