Capítulos de livros

1. G. Calinescu and C.G. Fernandes, Maximum Planar Subgraph, Chapter R43 in Approximation Algorithms and Metaheuristics, Teofilo F. Gonzalez (Ed.), Francis and Taylor, 1 ed. Boca Raton: Chapman and Hall/CRC Press, 2007, v. 10, p. 1-1434.
2. R. D. de Castro, R. Dahab e A.J. Devegili, Introdução à segurança demonstrável. In: Luci Pirmez; Flavia C. Delicato. (Org.). Minicursos do SBSeg, 2007.
3. R. Dahab e J.C.L. Hernadez, Técnicas Criptográficas Modernas - Algoritmos e Protocolos.In: Tomasz Kowaltowski; Karin Breitman. (Org.). Atualizações em Informática 2007. Rio de Janeiro: Editora PUC-Rio, 2007, v. , p. 115-170.
4. B. M. Junior, M. Lemos and T. R. B. Melo, Non-separating circuits and cocircuits in matroids. In: Combinatorics, Complexity, and Chance: a Tribute to Dominic Welsh (G. Grimmett and C. McDiarmid, editors), Oxford University Press, 2007, 162-171.
5. L.B. Oliveira, D. Aranha, E. Morais, F. Daguano, J.C. Lopez and R. Dahab, On the Identity-Based Encryption for Sensor Networks, Handbook of Wireless Mesh and Sensor Networking. McGraw- Hill International, NY, to appear.

Publicações em periódicos

1. N. Alon, Y. Kohayakawa, C. Mauduit, C.G. Moreira, and V. Rödl, Measures of pseudorandomness for finite sequences: typical values. Proceedings of the London Mathematical Society, v. 95, p. 778-812, 2007.
2. B. Bollobás, Y. Kohayakawa, V. Rödl, M. Schacht and A. Taraz, Essentially infinite colourings of hypergraphs, Proceedings of the London Mathematical Society, v. 95, p. 709-734, 2007.
3. C.N. Campos and C.P. de Mello, A result on the total colouring of powers of cycles, Discrete Appl. Math. 155 (2007), no. 5, 585--597.
4. R. Carmo, T. Feder, Y. Kohayakawa, E.S. Laber, R. Motwani, L. Ocallaghan, R. Panigrahy and D. Thomas, Querying Priced Information in Databases: the Conjunctive Case. ACM Transactions on Algorithms, v. 3, p. 9, 2007.
5. M.H. Carvalho and C.H.C. Little, Vector spaces and the Petersen graph, The Electronic Journal of Combinatorics, v. 15, R9, 2008.
6. M.H. Carvalho and C.H.C. Little, Ear decompositions in combed graphs, The Electronic Journal of Combinatorics, v. 15, R19, 2008.
7. V.F. Cavalcante, C.C. de Souza and A. Lucena, A relax-and-cut algorithm to the set partitioning problem. Computers and Operations Research, 35 (2008), 1963-1981.
8. F. Chataigner, L.R.B. Salgado and Y. Wakabayashi, Approximability and inapproximability of problems on balanced connected partitions of graphs, Discrete Mathematics and Theoretical Computer Science (DMTCS) (electronic), vol.9, 2007, 177-192.
9. G. Cintra, F.K. Miyazawa, Y. Wakabayashi and E.C. Xavier, A note on the approximability of cutting stock problems. European Journal on Operational Research, Volume 183, Issue 3 (2007), Pages 1328-1332; DOI:http://dx.doi.org/10.1016/j.ejor.2005.09.053
10. G. Cintra, F. K. Miyazawa, Y. Wakabayashi and E.C. Xavier. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming, European Journal on Operational Research, to appear; DOI: http://dx.doi.org/10.1016/j.ejor.2007.08.007
11. R. Cordovil, B. M. Junior and M. Lemos, The 3-connected binary matroids with circumference 6 or 7, European Journal of Combinatorics, to appear.
12. R. Cordovil, B. M. Junior and M. Lemos, Removing circuits in 3-connected binary matroids, Discrete Mathematics, to appear.
13. R. Cordovil, M. Lemos, e C. Linhares-Sales, Dirac's theorem on simplicial matroids, Annals of Combinatorics, to appear.
14. J. Donadelli, Números de Betti e cotas inferiores para complexidade de algoritmos. Matemática Universitária , to appear.
15. P. Feofiloff, C.G. Fernandes, C.E. Ferreira and J.C. de Pina, A Note on Johnson, Minkoff and Phillips' Algorithm for the Prize-Collecting Steiner Tree Problem, Information Processing Letters , 103 (2007), no. 5, 195--202.
16. C.G. Fernandes, O. Lee, and Y. Wakabayashi, Minimum cycle cover and the Chinese postman problems on mixed graphs with bounded tree width, Discrete Applied Mathematics, to appear.
17. R.M.V. Figueiredo, V.C. Barbosa, N. Maculan Filho and C.C. de Souza, Acyclic orientations with path constraints, RAIRO, Operations Research, to appear.
18. A. Fujita, J.R. Sato, H.M. Garay-Malpartida, P.A. Morettin, M.C. Sogayar and C.E. Ferreira, Time-varying modeling of gene expression regulatory networks using the wavelet dynamic vector autoregressive method, Bioinformatics, v. 23 (2007), 1623-1630.
19. A. Fujita, J.R. Sato, C.E. Ferreira and M.C. Sogayar, GEDI: an user-friendly toolbox for analysis of large-scale gene expression data, BMC Bioinformatics, v. 8 (2007), 457.
20. A. Fujita, J.R. Sato, H.M. Garay-Malpartida, R. Yamaguchi, S. Miyano, M.C. Sogayar and C.E. Ferreira, Modeling gene expression regulatory networks with the sparse vector autoregressive model, BMC Systems Biology, v. 1 (2007), 39.
21. S. Gerke, Y. Kohayakawa, V. Rödl and A. Steger, Small subsets inherit sparse \epsilon-regularity, Journal of Combinatorial Theory, Series B, v. 97, p. 34-56, 2007.
22. M. Juliato, G.C.S. Araújo, J.C.L. Hernandez and R. Dahab, A custom instruction approach for hardware and software implementations of finite field arithmetic over F^263 using Gaussian normal bases. Journal of VLSI Signal Processing, v. 47,  n. 1, p. 59-76. Springer, 2007.
23. K. Kawarabayashi, O. Lee, B. Reed and P. Wollan, A weaker version of Lovász' path removal conjecture, Journal of Combinatorial Theory, Series B, to appear.
24. Y. Kohayakawa, V. Rödl, M. Schacht, P. Sissokho and J. Skokan, Turán's Theorem for pseudorandom graphs, J. Combin. Th. Series A 114(4), 2007, pp. 631-657.
25. M. Lemos, On the number of triangles in 3-connected matroids, European Journal of Combinatorics 28 (2007), 931-941.
26. M. Lemos, Relations between the circumference and $e$-circumference of a matroid, Graphs and Combinatorics, to appear.
27. M. Lemos and T.R.B. Melo, Non-separating cocircuits in matroids, Discrete Applied Mathematics, 156 (2008), 1019-1024.
28. M. Lemos, T. J. Reid, B. Williams and H. Wu, Pairs of largest circuits in 3-connected matroids, Linear Algebra and its Applications 427 (2007), 313-316.
29. A. Lima, C.C de Souza, G. Araujo and N.B. Moreano, The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation, ACM Journal on Experimental Algorithms, Volume 10 (2005), Issue 2, 1-16.
30. G. Manic and Y. Wakabayashi, Packing triangles in low degree graphs and indifference graphs, Discrete Mathematics, Volume 308 (2008) Issue 8, 1455-1471; DOI:http://dx.doi.org/10.1016/j.disc.2007.07.100.
31. F.V. Martinez, J.C. de Pina, and J.A.R. Soares. Algorithms for terminal Steiner trees. Theoretical Computer Science, v. 389, p. 133-142, 2007.
32. F.K. Miyazawa and Y. Wakabayashi, Two- and three-dimensional parametric packing problems, Computers and Operations Research,(Elsevier Science) (34): 2589-2603, 2007;DOI: http://dx.doi.org/10.1016/j.cor.2005.10.001
33. L.B.E. Oliveira, W. Chi, A.A.F. Loureiro and R. Dahab, On the Design of Secure Protocols for Hierarchical Sensor Networks. International Journal of Security and Networks, v. 2, p. 216-227, 2007.
34. Leonardo B. Oliveira, Adrian Ferreira, Marco Vilaca, Hao Chi Wong, Marshall Bern, R. Dahab and Antonio A.F. Loureiro, SecLEACH - On the Security of Clustered Sensor Networks, Signal Processing, v. 87, p. 2882-2895, 2007.
35. E.M. Rodrigues, M.-F. Sagot and Y. Wakabayashi, The maximum agreement forest problem: approximation algorithms and computational experiments, Theoretical Computer Science, 374 (2007) 91--110.
36. J. Soares and M.A. Stefanes, Algorithms for Maximum Independent Set in Convex Bipartite Graphs, Algorithmica, 2007;DOI: http://dx.doi.org//10.1007/s00453-007-9006-9.
37. Sóstenes Lins, Combinatorial Dehn-Lickorish twists and framed link presentations of 3-manifolds, Journal of Knot Theory and its Ramifications, Volume 16 (2007), Number 10, 1383-1392.
38. M.J. Stein, Forcing highly connected subgraphs. J. Graph Theory 54 (2007), no. 4, 331-349. [Stein: posdoc].
39. R. Cordovil, B. M. Junior, e M. Lemos, The 3-connected binary matroids with circumference 6 or 7, European Journal of Combinatorics, to appear.
40. Z. Stivanin and A.L.P. Guedes, Traçado automático de hipergrafos direcionados para gerência de projetos. Espaço Energia, v. 6, p. 1-12, 2007.
41. E.C. Xavier and F.K. Miyazawa, A One-Dimensional Bin Packing Problem with Shelf Divisions, Discrete Applied Mathematics, 156 (2008) 1083-1096; DOI: http://dx.doi.org/10.1016/j.dam.2007.05.053
42. E.C. Xavier and F.K. Miyazawa, The Class Constrained Bin Packing Problem with Applications to Video-on-Demand. Theoretical Computer Science, 393 (2008) 240--259 DOI: http://dx.doi.org/10.1016/j.tcs.2008.01.001

Publicações em conferências internacionais

1. S.S. Adi, M.D.V. Braga, C.G. Fernandes, C.E. Ferreira, F.H.V. Martinez, M.-F Sagot, M.A. Stefanes, C. Tjandraatmadja and Y. Wakabayashi, Repetition-free longest common subsequence, Electronic Notes in Discrete Mathematics, Volume 30, February 2008, Pages 243-248, IV Latin-American Algorithms, Graphs, and Optimization Symposium; DOI: http://dx.doi.org/10.1016/j.endm.2008.01.042
2. D.M. Batista, N.L.S. da Fonseca and F.K. Miyazawa. A set of schedulers for grid networks. 22nd ACM Symposium on Applied Computing (ACM-SAC 2007), pp. 209-213, 2007.
3. V.F. Cavalcante and C.C. de Souza, Lagrangian relaxation and cutting planes for the vertex separator problem. Proceedings of the First International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), Hangzhou, China, April 2007. Lecture Notes in Computer Science, vol. 4614, 471-482.
4. A. Chastel, C.J.M. Viana, S.S. Adi, M. Nakazaki, A.A. Tamura, L.Y. Hiratsuka and L. Brazil, Mapping Contigs onto Reference Genomes, VI Brazilian Symposium on Bioinformatics, 2007, Angra dos Reis, Lecture Notes in Computer Science, 4643 (2007), 153-157.
5. F. Chataigner, G. Manic, Y. Wakabayashi and R. Yuster, Approximation algorithms and hardness results for the clique packing problem, Eurocomb 2007, European Conference on Combinatorics, Graph Theory and Applications, Electronic Notes in Discrete Mathematics Volume 29, Pages 397-401, 2007; URL of ENDM http://www.sciencedirect.com/science/journal/1571065
6. J.R. Correa, C.G. Fernandes, M. Matamala and Y. Wakabayashi, A 5/3-approximation for finding spanning trees with many leaves in cubic graphs, WAOA 2007 (5th Workshop on Approximation and Online Algorithms). Lecture Notes in Computer Science, v. 4927 (2008), p. 184-192.
7. M.C. Couto, C.C. de Souza and P.J. de Rezende, An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem. Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007), Belo Horizonte, Brazil, October 2007, pages 87-94, IEEE Computer Society. DOI: http://doi.ieeecomputersociety.org/10.1109/SIBGRAPI.2007.7
8. M.C. Couto, C.C. de Souza and P.J. de Rezende, Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem, Proceedings of the 7th International Workshop on Experimental Algorithms, May 30-June 2, 2008, Provincetown, Cape Cod, Massachusetts, USA. To appearin a volume of Lecture Notes in Computer Science.
9. R.D. De Castro and R. Dahab, Two Notes on the Security of Certificateless Signatures. In: The First International Conference of Provable Security, 2007, Wollongong, Australia. Proceedings of ProvSec2007. Heidelberg : Springer-Verlag, 2007. v. 4784. p. 85-102.
10. D. Dellamonica Jr, Y. Kohayakawa, V. Rödl and A. Rucinski, Universality of random graphs, Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms, (SODA), 2008, to appear.
11. A.J. Devegili, M. Scott and R. Dahab, Implementing Cryptographic Pairings over Barreto-Naehrig Curves. In: The First International Conference on Pairing-based Cryptography (Pairing 2007) , 2007, Tóquio. LNCS, 2007.
12. C.G. Fernandes, C.E. Ferreira, C. Tjandraatmadja and Y. Wakabayashi, A polyhedral investigation of the LCS problem and a repetition-free variant. In: 8th Latin American Theoretical Informatics Symposium, 2008, Armação de Buzios, Lecture Notes in Computer Science, Berlin Heidelberg : Springer Verlag, v. 4957 (2008), 329-338.
13. A.L.P. Guedes, L. Markenzon and L. Farias, Flow Hypergraph Reducibility (Extended Abstract). In: IV Latin-American Algorithms, Graphs and Optimization Symposium, 2007, Electronic Notes in Discrete Mathematics Volume 30, 20 February 2008, Pages 255-260. DOI: http://dx.doi.org/10.1016/j.endm.2008.01.044
14. L.A.A. Meira and F.K. Miyazawa. A continuous facility location problem and its application to a clustering problem. 23rd ACM Symposium on Applied Computing (ACM-SAC 2008), pp. 1830--1835, 2008.
15. A.A.A. Miranda and C.L. Lucchesi, A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs. In: IV Latin-American Algorithms, Graphs and Algorithms (LAGOS 2007), Electronic Notes in Discrete Mathematics, Volume 30, February 2008, Pages 171-176 The IV Latin-American Algorithms, Graphs, and Optimization Symposium,
16. L.B.E. Oliveira, R. Dahab, J. Lopez, F. Daguano and A.A.F. Loureiro, Identity-based Encryption for Sensor Networks. In: 3rd IEEE PerCom Workshop on Pervasive Wireless Networking (PerSeNS'07), 2007, White Plains, NY, EUA. Proceedings of IEEE PerCom , 2007, 2007.
17. L.B.E. Oliveira, D. Freitas, E. Morais, F. Daguano, J.C. Lopez and R. Dahab, TinyTate: Computing the Tate pairing in resource-constrained nodes. In: 6th IEEE International Symposium on Network Computing and Applications (NCA'07), 2007, Cambridge, MA. Proceedings of 6th IEEE International Symposium on Network Computing and Applications (NCA'07), 2007.
18. L.B.E. Oliveira, A.A.F. Loureiro and R. Dahab, SOS: Secure Overlay Sensornets. In: Third IEEE PerCom Workshop on Pervasive Wireless Networking (PWN'07), 2007, White Plains, NY. Proceedings of IEEE PerCom 2007, 2007.
19. D. Piguet and M. Stein, An approximate version of the Loebl-Komlós-Sós conjecture, Proceedings of the European Conference on Combinatorics, Graph Theory and Applications, Eurocomb 2007, Volume 29, 249-253, 2007.
20. C.N. da Silva and C.L. Lucchesi, Flow Critical Graphs. In: IV Latin-American Algorithms, Graphs and Algorithms (LAGOS 2007), Electronic Notes in Discrete Mathematics, Volume 30, February 2008, Pages 165-170, IV Latin-American Algorithms, Graphs, and Optimization Symposium,
21. Michael Scott, Julio Lopez and Ricardo Dahab, TinyPBC: Pairings for Authenticated Identity-Based Non-Interactive Key Distribution in Sensor Networks. 5th International Conference on Networked Sensing Systems (INSS'08). June 2008, Kanazawa/Japan (to appear). 
22. P. Szczechowiak, Leonardo B. Oliveira, M. Scott, M. Collier and R. Dahab, NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks. In: European conference on Wireless Sensor Networks (EWSN'08), 2008, Bologna, Italia. LNCS - Proceedings of EWSN 2008. Heidelberg : Springer-Verlag, 2008. v. 4913. p. 305-320.

Trabalhos de editoração

1. Paulo Feofiloff, Celina M. Herrera de Figueiredo and Yoshiko Wakabayashi, editors of Volume 156, Issue 7, Discrete Mathematics, pages 985-1180 (1 April 2008), especial volume dedicated to GRACO 2005 - 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics.

Trabalhos submetidos

1. S.S. Adi, and C.E. Ferreira, A dynamic programming based heuristic for the gene prediction problem.
2. D. Batista, N.L.S. da Fonseca, F.K. Miyazawa and F. Granelli. Self-Adjustment of Resource Allocation for Grid Applications
3. F. Chataigner, G. Manic, Y. Wakabayashi and R. Yuster, Approximation algorithms and hardness results for the clique packing problem, 2007.
4. R. Cordovil and M. Lemos, The 3-connected matroids with circumference 6.
5. J. R. Correa, C.G. Fernandes and Y. Wakabayashi, Approximating a class of combinatorial problems with rational objective function.
6. A. Fujita, J.R. Sato, M.C. Sogayar and C.E. Ferreira, Non parametric regression and canonical correlation analysis in tumor classification.
7. Edna A. Hoshino and Cid C. de Souza, Column Generation Algorithms for the Capacitated m-Ring-Star Problem.
8. K. Kawarabayashi, B. Reed and O. Lee, Removable cycles in nonbipartite graphs.
9. Y. Kohayakawa, B. Nagle, V. Rödl and M. Schacht, Weak hypergraph regularity and linear hypergraphs
10. M. Lemos, A characterization of graphic matroids using non-separating cocircuits.
11. L.A.A. Meira and F.K. Miyazawa, Semidefinite Programming Based Algorithms for the Sparsest Cut Problem.
12. F.K. Miyazawa and Y. Wakabayashi, Three-dimensional Packings with Rotations.
13. Arnaldo V. Moura, Romulo A. Pereira and Cid C. de Souza, Scheduling Activities at Oil Wells with Resource Displacement.
14. Arnaldo V. Moura, Cid C. de Souza, Andre A. Cire and Tony M.T. Lopes, Heuristics and Constraint Programming Hybridizations for a Real Pipeline Planning and Scheduling Problem.
15. E.C. Xavier and F.K. Miyazawa, A Note on Dual Approximation Algorithms for Class Constrained Bin Packing Problems.