A. Efrat
ABSTRACT
No abstract available.
- R. Cole and A. Siegel. River routing every which way, but loose. In 25th Annual Symposium on Foundations of Computer Science, pages 65--73, Los Angeles, Ca., USA, Oct. 1984. IEEE Computer Society Press.Google Scholar
Digital Library
- C. A. Duncan, A. Efrat, S. G. Kobourov, and C. Wenk. Drawing with fat edges. In 9th Symposium on Graph Drawing (GD'02), pages 162--177, September 2001. Google ScholarDigital Library
- S. Gao, M. Jerrum, M. Kaufmann, K. Mehlhorn, W. Rülling, and C. Storb. On continuous homotopic one layer routing. In Proceedings of the 4th Annual Symposium on Computational Geometry, pages 392--402, New York, 1988. ACM Press. Google ScholarDigital Library
- Hershberger and Snoeyink. Computing minimum length paths of a given homotopy class. CGTA: Computational Geometry: Theory and Applications, 4, 1994. Google ScholarDigital Library
- C. E. Leiserson and F. M. Maley. Algorithms for routing and testing routability of planar VLSI layouts. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pages 67--78, 1985. Google ScholarDigital Library
- C. E. Leiserson and R. Y. Pinter. Optimal placement for river routing. SIAM Journal on Computing, 12(3):447--462, Aug. 1983.Google ScholarCross Ref
Index Terms
- Growing fat graphs
Recommendations
Quantification of liver fat
Fat accumulation in the liver causes metabolic diseases such as obesity, hypertension, diabetes or dyslipidemia by affecting insulin resistance, and increasing the risk of cardiac complications and cardiovascular disease mortality. Fatty liver diseases ...
A method for estimating visceral fat from the elasticity of lumbar subcutaneous fat
Since metabolic syndrome is a cause of lifestyle-related diseases, and its early diagnosis and an evaluation of visceral fat are important, this study proposes a new method of estimating the amount of fat. The goal of this study is to estimate visceral ...
Comparability Graphs Among Cover-Incomparability Graphs
Algorithms and Discrete Applied MathematicsAbstractComparability graphs and cover-incomparability graphs (C-I graphs) are two interesting classes of graphs from posets. Comparability graph of a poset is a graph with vertex set V and two vertices u and v are adjacent in V if u and v are ...
Comments