Artigos Publicados em Periódicos Internacionais

(MR# refere-se à citação no Mathematical Reviews)

1.

R. Anderson and J.C. Setubal.
A parallel implementation of the push-relabel algorithm for the maximum flow problem.
J. Parallel Distr. Com., 29(1):17-26, 1995.

2.

C.F. Bornstein and J.L. Szwarcfiter.
On clique convergent graphs.
Graphs and Combinatorics, 11(3):213-220, 1995.
MR#96h:05105.

3.

B. Chandra, G. Das, G. Narasimhan, and J. Soares.
New sparseness results on graph spanners.
Int. J. of Computational Geometry and Applications, 5(1-2):125-144, 1995.
MR#97a:05197.

4.

C.M.H. de Figueiredo, J. Gimbel, C.P. de Mello, and J.L. Szwarcfiter.
Sources and sinks in comparability graphs.
Order, 14(1):75-83, 1997.
MR#1 468 958.

5.

C.M.H. de Figueiredo and S. Klein.
The NP-completeness of multi-partite cutset testing.
Congressus Numerantium, (119):217-222, 1996.
MR#97i:05120.

6.

C.M.H. de Figueiredo, F. Maffray, and O. Porto.
On the structure of bull-free perfect graphs.
Graphs and Combinatorics, 13(1):31-55, 1997.
MR#97m:05093.

7.

C.M.H. de Figueiredo, J. Meidanis, and C.P. de Mello.
A greedy method for edge-colouring odd maximum degree chordal graphs.
Congressus Numerantium, 111:170-176, 1995.
MR#96h:05071.

8.

C.M.H. de Figueiredo, J. Meidanis, and C.P. de Mello.
A linear time algorithm for proper interval graph recognition.
Information Processing Letters, 56(3):179-184, 1995.
MR#96g:05129.

9.

C.M.H. de Figueiredo, J. Meidanis, and C.P. de Mello.
On edge-colouring indifference graphs.
Theoretical Computer Science, 181(1):91-106, 1997.
MR#1 463 531.

10.

C.C. de Souza and M. Laurent.
Some new classes of facets for the equicut polytope. partitioning and decomposition in combinatorial optimization.
Discrete Appl. Math., 62(1-3):167-191, 1995.
MR# 96j:52018.

11.

P. Erdos, A. Gyárfás, and Y. Kohayakawa.
The size of the largest bipartite subgraphs.
Discrete Mathematics, 177(1-3):267-271, 1997.

12.

femr97 H. Everett, C.M.H. de Figueiredo, F. Maffray, and B. Reed.
Path parity and perfection.
Discrete Mathematics, 165/166:233-252, 1997.
MR#98a:05069.

13.

H. Everett, S. Klein, and B. Reed.
An algorithm for finding homogeneous pairs.
Discrete Applied Mathematics, (72):209-218, 1997.
MR#97k:05183.

14.

Carlos E. Ferreira, A. Martin, and R. Weismantel.
Solving multiple knapsack problems by cutting planes.
SIAM Journal on Optimization, 6(3):858-877, 1996.
MR#97e:90063.

15.

C.E. Ferreira, A. Martin, C.C. de Souza, R. Weismantel, and L. A. Wolsey.
Formulations and valid inequalities for the node capacitated graph partitioning problems.
Mathematical Programming A, 74(3):247-266, 1996.
MR#97i:90101.

16.

J.Z. Gonçalves and A. Mandel.
A commutativity theorem for division rings and an extension of a result of Faith.
Results Math., 30(3-4):302-309, 1996.
MR#1 419 945.

17.

M.A.M.C. Gurgel and Y. Wakabayashi.
Adjacency of vertices of the complete pre-order polytope.
Discrete Mathematics, 175(1-3):163-172, 1997.
MR#1 475 845.

18.

P.E. Haxell and Y. Kohayakawa.
On an anti-Ramsey property of Ramanujan graphs.
Random Structures and Algorithms, 6(4):417-431, 1995.
MR#97c:05107.

19.

P.E. Haxell and Y. Kohayakawa.
The size-Ramsey number of trees.
Israel Journal of Mathematics, 89(1-3):261-274, 1995.
MR#96c:05128.

20.

P.E. Haxell and Y. Kohayakawa.
Partitioning by monochromatic trees.
Journal of Combinatorial Theory, Series B, 68(2):218-222, 1996.
MR#97h:05180.

21.

P.E. Haxell, Y. Kohayakawa, and T. uczak.
The induced size-Ramsey number of cycles.
Combinatorics, Probability and Computing, 4(3):217-239, 1995.
MR#96h:05140.

22.

P.E. Haxell, Y. Kohayakawa, and T. uczak.
Turán's extremal problem in random graphs: forbidding even cycles.
Journal of Combinatorial Theory, Series B, 64:273-287, 1995.
MR#96e:05151.

23.

P.E. Haxell, Y. Kohayakawa, and T. uczak.
Turán's extremal problem in random graphs: forbidding odd cycles.
Combinatorica, 16(1):107-122, 1996.
MR#97k:05180.

24.

Y. Kohayakawa and B. Kreuter.
Threshold functions for asymmetric Ramsey properties involving cycles.
Random Structures and Algorithms, 11(3):245-276, 1997.

25.

Y. Kohayakawa and T. uczak.
Sparse anti-Ramsey graphs.
Journal of Combinatorial Theory, Series B, 63:146-152, 1995.
MR#95m:05215.

26.

Y. Kohayakawa, T. uczak, and V. Rödl.
Arithmetic progressions of length three in subsets of a random set.
Acta Arithmetica, LXXV(2):133-163, 1996.
MR#97b:11011.

27.

Y. Kohayakawa, T. uczak, and V. Rödl.
Ramsey-type results for oriented trees.
Journal of Graph Theory, 22(1):1-8, 1996.
MR#97d:05211.

28.

Y. Kohayakawa, T. uczak, and V. Rödl.
On K⁴-free subgraphs of random graphs.
Combinatorica, 17(2):173-213, 1997.
MR#1 479 298.

29.

R.S. Lanzelotte, C.C. Ribeiro, and C.D. Ribeiro.
Query optimization in distributed relational databases.
Journal of Heuristics, 3:5-23, 1997.

30.

F. Maffray, O. Porto, and M. Preissmann.
A generalization of simplicial elimination orderings.
J. Graph Theory, 23(2):203-208, 1996.
MR#1 408 348.

31.

S.L. Martins, C.C. Ribeiro, and N.R. Rodriguez.
Ferramentas de programação paralela em ambientes de memória distribuída.
Investigación Operativa, 5:67-98, 1996.

32.

F.K. Miyazawa and Y. Wakabayashi.
An algorithm for the three-dimensional packing problem with asymptotic performance analysis.
Algorithmica, 18(1):122-144, 1997.
MR#1 432 033.

33.

S.C. Porto and C.C. Ribeiro.
Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints.
Journal of Heuristics, 1:207-223, 1995.

34.

S.C. Porto and C.C. Ribeiro.
A case study on parallel synchronous implementations of tabu search based on neighborhood decomposition.
Investigación Operativa, 5:233-259, 1996.

35.

S.C.S. Porto and C.C. Ribeiro.
A tabu search approach to task-scheduling on heterogeneous processors under precedence constraints.
Int. J. High Speed Com., 7(1):45-71, 1995.

36.

M.G.C. Resende and C.C. Ribeiro.
A GRASP for graph planarization.
Networks, 29(3):173-189, 1997.

37.

J.L. Szwarcfiter.
On edge transitivity of directed graphs.
Discrete Math., 141(1-3):227-235, 1995.
MR#96d:05053.

38.

J.L. Szwarcfiter.
Recognizing clique-helly graphs.
Ars Combinatoria, 45:29-32, 1997.
MR#97m:05226.