Result 21 to 40 of 204 total
Combinatorial optimization algorithms in resource allocation problems (English)
Encyclopedia of Optimization, 382-387 (2009).
21
A proof of the molecular conjecture (English)
Symposium on Computational Geometry, 296-305 (2009).
22
On the infinitesimal rigidity of bar-and-slider frameworks (English)
ISAAC, 524-533 (2009).
23
A proof of the molecular conjecture (English)
ISAAC, 2-3 (2009).
24
A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (English)
ISAAC, 802-811 (2009).
25
Arc-disjoint in-trees in directed graphs. (English)
Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20‒22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 518-526 (2008).
26
The minimum weight in-tree cover problem. (English)
Le Thi, Hoai An (ed.) et al., Modelling, computation and optimization in information systems and management sciences. Second international conference MCO 2008, Metz, France - Luxembourg, September 8‒10, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87476-8/pbk). Communications in Computer and Information Science 14, 155-164 (2008).
27
Fast enumeration algorithms for non-crossing geometric graphs. (English)
Proceedings of the twenty-fourth annual symposium on computational geometry 2008 (SCG’08), College Park, MD, USA, June 09‒11, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-071-5). 328-337 (2008).
28
Covering directed graphs by in-trees. (English)
Comput. Res. Repos. 2008, Article No. 0802.2755 (2008).
29
Computational geometry and graph theory. International conference, KyotoCGGT 2007, Kyoto, Japan, June 11‒15, 2007. Revised selected papers. (English)
Lecture Notes in Computer Science 4535. Berlin: Springer (ISBN 978-3-540-89549-7/pbk). xii, 237~p. \$~64.95 (2008).
30
Voronoi diagrams with respect to criteria on vision information. (English)
Japan J. Ind. Appl. Math. 25, No. 2, 149-164 (2008).
31
Enumerating constrained non-crossing minimally rigid frameworks. (English)
Discrete Comput. Geom. 40, No. 1, 31-46 (2008).
32
Covering directed graphs by in-trees. (English)
Hu, Xiaodong (ed.) et al., Computing and combinatorics. 14th annual international conference, COCOON 2008, Dalian, China, June 27‒29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69732-9/pbk). Lecture Notes in Computer Science 5092, 444-457 (2008).
33
Geometric spanner of objects under $L _{1}$ distance. (English)
Hu, Xiaodong (ed.) et al., Computing and combinatorics. 14th annual international conference, COCOON 2008, Dalian, China, June 27‒29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69732-9/pbk). Lecture Notes in Computer Science 5092, 395-404 (2008).
34
Enumerating constrained non-crossing minimally rigid frameworks (English)
Discrete & Computational Geometry 40, No. 1, 31-46 (2008).
35
Arc-disjoint in-trees in directed graphs (English)
SODA, 518-526 (2008).
36
Fast enumeration algorithms for non-crossing geometric graphs (English)
Symposium on Computational Geometry, 328-337 (2008).
37
Covering directed graphs by in-trees (English)
COCOON, 444-457 (2008).
38
Geometric spanner of objects under L1 distance (English)
COCOON, 395-404 (2008).
39
The minimum weight in-tree cover problem (English)
MCO, 155-164 (2008).
40
Result 21 to 40 of 204 total
Start
Contact
Print
General Help
