Secretaria dos Departamentos
- 1.
- C.L.Lucchesi e D.H.Younger,
``An (1, u) Transversal Theorem for Bipartite Graphs'',
Congressus Numerantium,
113, 247-256,
(1996).
- 2.
- C.L.Lucchesi e M.H.de Carvalho,
``Matching Covered Graphs and Subdivisions of K_ 4 and C_ 6'',
Journal of Combinatorial Theory ; series B,
66(2), 263-268,
(1996).
- 3.
- J.Stolfi e L.H.Figueiredo,
``Adaptive enumeration of implicit surfaces with affine arithmetic'',
Computer Graphics Forum,
1, 287-297,
(1996).
- 4.
- J.Stolfi, B.Chazelle, H.Edelsbrunner, L.Guibas e M.Sharir,
``Lines in Space: Combinatorics and Algorithmics'',
Algorithmica ; an International Journal in Computer Science,
15(5), 428-447,
(1996).
- 5.
- C.F.X.Mendonça Neto e P.D.Eades,
``Vertex Splitting and Tension-Free Layout'',
Lecture Notes Computer Sciences,
1, 202-212,
(1996).
- 6.
- C.E.Ferreira, A.Martin, C.C.de Souza, R.Weismantel e L.A.Wolsey,
``The Node Capacitated Graph Partitioning Problem: Formulations and Valid Inequalities'',
Mathematical Programming,
74(3), 247-266,
Serie: Editora: North-Holland,
(1996).
- 7.
- J.Stolfi e L.H.Figueiredo,
``Adaptive enumeration of implicit Surfaces with Affine Arithmetic'',
Computers and Graphics,
15(5), 287-296,
(1996).
3/2/1998