Produção Bibliográfica
2015
[87] DOURADO, M. C. ; LIMA, C. V. G. C. ; SZWARCFITER, J. L. . On f-reversible processes in graphs. In: VIII Latin-American Graphs, Algorithms and Optimization Symposium (LAGOS'2015), 2015, Fortaleza. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier, 2015.
[86] DURAN, G. ; GRIPPO, L. OLIVEIRA, F. S. ; SLEZAK, F ; Szwarcfiter, J. L. . On unit interval graphs with integer endpoints. In: VIII Latin-American Graphs, Algorithms and Optimization Symposium (LAGOS'2015), 2015, Fortaleza. Eletronic Notes in Discrete Mathematics. Amsterdam: Elsevier, 2015.
[85] LIN, M. C. ; MIZRAHI, M. ; Szwarcfiter, J. L. . Efficient and Perfect domination on circular-arc graphs. In: VIII Latin-American Algorithms, Graphs and Optimization Symposiem, 2015, Fortaleza. Electronic Notes in Discrete Mathematics. New York: Elsevier, 2015.
[84] BOCCARDO, D. ; MACHADO, R. C. SA, V. G. ; SZWARCFITER, J. L. . Fair fingerprinting protocol for attesting software misuses. In: 10th International Conference on Availability, Reliability and Security (ARES 2015), 2015, Toulouse. Proceedings of the 10th International Conference on Availability, Reliability and Security (ARES 2015), 2015.
2014
[83] BOCCARDO, D. ; MACHADO, R. C. ; SA, V. G. ; SZWARCFITER, J. L. . Protocolo para transferência parcial de conhecimento e sua aplicação à verificação segura de marcas d'água. In: Simpóaio Brasileiro de SEgurança da Informação (SBSeg' 2014), 2014, Belo Horizonte. Simpósio Brasileiro de Segurança da Informação (e de Sistemas Computacionais (SBSeg' 2014). Porto Alegre: Sociedade Brasileira de Computação, 2014. p. 16-29.
[82] BENTO, L. M. S. ; BOCCARDO, D. ; MACHADO, R. C. ; SA, V. G. ; SZWARCFITER, J. L. A randomized graph-based scheme for software watermarking. In: Simpósio Brasileiro de Segurança da Informação (e de Sistemas Computacionais (SBSeg' 2014), 2014, Belo Horizonte. Anais do Simpósio Brasileiro de Segurança da Informação (SBSeg' 2014). Porto Alegre: Sociedade Brasileira de Computação, 2014. v. 1. p. 30-41.
[81] LIN, Min C ; MIZRAHI, M. ; Szwarcfiter, Jayme L. . O(n) time algorithms for dominating induced matching problems. In: Latin-American Theoretical Informatics (LATIN '2014), 2014, Montevideo. Lecture Notes in Computer Science. New York: Springer, 2014. v. 8392. p. 399-408.
[80] CARVALHO JR., M. T. ; DOURADO, Mitre C ; Szwarcfiter, Jayme L. . O número de Helly na convexidade geodética. In: XLVI Simpósio Brasileiro de Pesquisa Operacional, 2014, Salvador. Anais do XLVI Simpósio Brasileiro de Pesquisa Operacional, 2014.
[79] DEMASI, P. ; Szwarcfiter, Jayme L. ; CRUZ, A. . Heuristics search methods based on betting theory. In: XLVI Simpósio Brasileiro de Pesquisa Operacional, 2014, Salvador. Anais do XLVI Simpósio Brasileiro de Pesquisa Operacional, 2014.
2013
[78] ARAUJO, R. ; SAMPAIO, R. ; SZWARCFITER, J. L. . The convexity of induced paths of order three. In: VII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS' 2013), 2013, Playa del Carmen. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier, 2013. v. 44. p. 109-114.
[77] DOURADO, M. C. ; Rautenbach, D ; SA, V. G. ; SZWARCFITER, J. L. . Polynomial time algorithm for the Radon number of grids in the geodetic convexity. In: VII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS' 2013), 2013, Playa del Carmen. Electronic Notes in Discrete Mathematics, 2013. v. 44. p. 371-376.
[76] BARBOSA, R. M. ; Rautenbach, D ; SANTOS, V. F. ; SZWARCFITER, J. L. . On Minimal and Minimum Hull Sets. In: VII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS' 2013), 2013, Playa del Carmen. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier, 2013. v. 44. p. 207-213.
[75] COELHO, E. M. M. ; Dourado, Mitre C. ; Rautenbach, D ; Szwarcfiter, Jayme L. . The Carathéodory Number of the P3 Convexity of Chordal Graphs. In: European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB' 2013), 2013, Pisa. The Seventh European Conference on Combinatorics, Graph Theory and Applications = EuroComb 2013. Pisa: Edizione della Normalle, 2013. p. 209-214.
[74] BENTO, L. M. S. ; BOCCARDO, D. ; MACHADO, R. C. ; SA, V. G. ; SZWARCFITER, J. L. . Towards a provably resilient scheme for graph-based watermarking. In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG' 2013), 2013, Luebeck. Lecture Notes in Computer Science. New York: Springer, 2013. v. 8165. p. 50-63.
[73] BENTO, L. M. S. ; BOCCARDO, D. ; MACHADO, R. C. ; SA, V. G. ; Jayme L. Szwarcfiter . Proteção de software por marcas d'água baseadas em grafos. In: XL Seminário Intergrado de Software e Hardware, 2013, Maceió. Anais do XL Seminário Intergrado de Software e Hardware, 2013.
[72] BENTO, L. M. S. ; COSTA, R. O. ; BOCCARDO, D. ; MACHADO, R. C. ; SA, V. G. ; SZWARCFITER, J. L. . Fingerprinting de software e aplicações em metrologia legal. In: 10th International Congress on Electrical Metrology, 2013, Buenios Aires. Proiceedings of the 10th International Congress on Electrical Metrology, 2013.
[71] DIAS, B. ; RODRIGUES, R. F. ; Szwarcfiter, J. L. . On graph coloring problems with distance constraints. In: Workshop on Distance Geometry and Applcations (DGA' 2013), 2013, Manaus. Workshop on Distance Geometry and Applcations (DGA' 2013). Manaus, 2013. v. 1. p. 109-114.
[70] LIN, Min C ; MIZRAHI, M. ; Szwarcfiter, Jayme L. . An $O^*(1.1939^n)$ time algorithm for minimum weighted dominating induced matching. In: 24th International Symposium on Algorithms and Computation (ISAAC 2013), 2013, Hong Kong. Lecture Notes in Computer Science. New York: Springer, 2013. v. 8283. p. 558-567.
« Back to top2012
[69] DOURADO, M. C. ; Rautenbach, D ; SANTOS, V. F. ; SCHAEFER, P. ; SZWARCFITER, J. L. ; TOMAN, A. . On the Radon Number for P3-Convexity. In: LATIN - Latin American Theoretial Informatics, 2012, Arequipa. Lecture Notes in Computer Science. New York: Springer, 2012. v. 7256. p. 267-278.
[68] BENTO, L. M. S. ; SA, V. G. ; Szwarcfiter, J. L. . Hashing na solução de problemas combinatórios atípicos. In: Congreso Latino-Iberoamericano de Investigacuón Operativa & Simpósio Brasileiro de Pesquisa Operacional, 2012, Rio de Janeiro. Anais do Congreso Latino-Iberoamericano de Investigación Operativa & Simpósio Brasileiro de Pesquisa Operacional, 2012.
2011
[67] BARBOSA, R. M. ; COELHO, E. M. M. ; DOURADO, M. C. ; Rautenbach, D ; SZWARCFITER, J. L. . On the Carathéodory Number for the Convexity of Paths of Order Three. In: European Conference on Combinatorics (EUROCOMB' 2011), 2011, Budapest. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier, 2011. v. 38. p. 105-110.
[66] Rautenbach, D ; SZWARCFITER, J. L. . Unit Interval Graphs - A Story with Open Ends. In: European Conference on Combinatorics (EUROCOMB' 2011), 2011, Budapest. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier, 2011. v. 38. p. 737-742.
[65] DOURADO, M. C. ; Penso, L D ; Rautenbach, D ; SZWARCFITER, J. L. . The south zone: Distributed Algorithms for Alliances. In: 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2011), 2011, Grenoble. Lecture Notes in Computer Science. New York: Springer, 2011. v. 6979. p. 178-192.
[64] FIGUEIREDO, A. P. ; KLEIN, Sulamita ; SZWARCFITER, J. L. . Uma generalização do conceito de saltos em ordens parciais. In: XLIII Simpósio Brasileiro de Pesquisa Operacional, 2011, Natal. Anais do XLIII Simpósio Brasileiro de Pesquisa Operacional, 2011.
[63] BARBOSA, R. M. ; COELHO, E. M. M. ; DOURADO, M. C. ; SZWARCFITER, J. L. . O teorema de Helly colorido e hipergrafos gerais. In: XLIII Simpósio Brasileiro de Pesquisa Operacional, 2011, Natal. Anais do XLIII Simpósio Brasileiro de Pesquisa Operacional, 2011. v. 01. p. 2605-2614.
« Back to top2010
[62] DOURADO, M. C. ; RODRIGUES, R. F. ; SZWARCFITER, J. L. . Scheduling on parallel machines considering job-machine dependency constraints. In: International Symposium on Combinatorial Optimization, 2010, Hammamet. Electronic Notes in Discrete Mathematics, 2010. v. 36. p. 431-438.
[61] DOURADO, M. C. ; RODRIGUES, R. F. ; SZWARCFITER, J. L. . Escalonamento em máquinas paralelas para minimizar a atraso ponderado de tarefas de tempos iguais. In: Simpósio Brasileiro de Pesquisa Operacional, 2010, Bento Gonçalves. Anais do Simpósio Brasileiro de Pesquisa Operacional, 2010.
2009
[60] Centeno, C. C. ; DOURADO, M. C. ; SZWARCFITER, J. L. . On the Convexity of Paths of Length Two in Undirected Graphs. In: Workshop on Algorithmic Graph Theory, 2009, Coventry. Electronic Notes in Discrete Mathematics. v. 32. p. 11-18.
[59] PINTO, Paulo e D ; PROTTI, F. ; SZWARCFITER, J. L. . Exact and experimental algorithms for a Huffman-based error detecting code. In: 6th Annual Conference on Theory and Applications of Models of Computation, 2009, Changsha. Lecture Notes in Computer Science. New York: Springer, 2009. v. 5532. p. 312-324.
[58] BARBOSA, R. M. ; DOURADO, M. C. ; Martins, E M ; SZWARCFITER, J. L. . The Colorful Helly Property for Hypergraphs. In: European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB' 09), 2009, Bordeaux. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier, 2009. v. 34. p. 647-651.
[57] Penso, L D ; Rautenbach, D ; SZWARCFITER, J. L. . Cycles, paths, connectivity and diameter in distance graphs. In: 35th International Workshop on Graph Theoretical Concepts in Computer Science (WG' 2009, 2009, Montpellier. Lecture Notes in Computer Science. New York: Springer, 2009. v. 5911. p. 320-328.
[56] FIGUEIREDO, A. P. ; KLEIN, Sulamita ; SZWARCFITER, J. L. . Número Arbóreo de Saltos de uma Ordem Parcial. In: XLI Simpósio Brasileiro de Pesquisa Operacional, 2009, Salvador. Anais do XLI Simpósio Brasileiro de Pesquisa Operac, 2009. p. 2659-2670.
[55] LIN, M. C. ; SOULIGNAC, F. ; SZWARCFITER, J. L. . Short models for unit interval graphs. In: Latin American Graphs Algorithms and Optimization Symposium, 2009, Gramado. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier, 2009. v. 35. p. 247-255.
[54] DOURADO, M. C. ; RODRIGUES, R. F. ; SZWARCFITER, J. L. . Sobre escalonamento em máquinas paralelas com capacidades. In: Anais do Simpósio Brasileiro de Pesquisa Operacional, 2009, Salvador. Anais do Simpósio Brasileiro de Pesquisa Operacional, 2009. p. 2752-2759.
« Back to top2008
[53] CERIOLI, M. R. ; OLIVEIRA, F. S. ; SZWARCFITER, J. L. . Linear-Interval Dimension and PI Orders. In: IV Latin-American Algorithms, Graphs and Optimization Symposium, 2008, Puerto Varas. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier, 2008. v. 30. p. 111-116.
[52] Gutierrez, M ; SZWARCFITER, J. L. ; Tondato, S. B. . Clique Trees of Chordal Graphs: Leafage and 3-Asteroidals. In: IV Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS' 2007, 2008, Puerto Varas. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier, 2008. v. 30. p. 237-242.
[51] LIN, M. C. ; McConnell, R. M. ; SOULIGNAC, F. ; SZWARCFITER, J. L. . On Cliques of Helly Circular-Arc Graphs. In: IV Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS' 2007, 2008, Puerto Varas. Elecotronic Notes in Discrete Mathematics (Proceedings of the IV Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS' 2007). Amsterdam: Elsevier, 2008. v. 30. p. 117-122.
[50] DOURADO, M. C. ; PROTTI, F. ; SZWARCFITER, J. L. . Algorithmic aspects of monophonic convexity. In: IV Latin American Algorithms, Graphs and Optimization Symposium IV Latin American Algorithms, Graphs and Optimization Symposium), 2008, Puerto Varas. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier, 2008. v. 30. p. 177-182.
[49] LIN, Min C ; SOULIGNAC, F. ; SZWARCFITER, J. L. . A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs. In: 11th Scandinavian Workshop on Algorithm Theory, 2008, Gotenburg. Lecture Notes in Computer Science. New York: Springer, 2008. v. 5124. p. 355-366.
[48] DOURADO, M. C. ; RODRIGUES, R. F. ; SZWARCFITER, J. L. . Algoritmos para Minimização do Número de Tarefas Tardias em um Problema Clássico de Escalonamento. In: XL Simposio Brasileiro de Pesquisa Operacional, 2008. Anais do Simposio Brasileiro de Pesquisa Operacional, 2008.
2007
[47] ARTIGAS, D. ; DOURADO, M. C. ; SZWARCFITER, J. L. . Convex partitions of graphs. In: European Conference on Combinatorics, Graph Theory and Applications - EURO COMB' 2007, 2007, Sevilha, Espanha. Electronic Notes in Discrete Mathematics (Proceedings of the European Conference on Combinatorics, Graph Theory and Applications ). Amsterdam: Elsevier, 2007. v. 29. p. 147-151.
[46] LIN, M. C. ; SOULIGNAC, F. ; SZWARCFITER, J. L. . Proper Helly Circular-Arc Graphs. In: 33rd International Workshop on Graph Theoretical Concepts in Computer Science, 2007, Jena. Lecture Notes in Computer Science. Berlim: Springer, 2007. v. 4769. p. 248-257.
[45] DOURADO, M. C. ; RODRIGUES, R. F. ; SZWARCFITER, J. L. . Um algoritmo para um problema de escalonamento com tarefas de tempos unitários. In: XXXIX Simpoósio Brasileiro de Pesquisa Operacional, 2007, Fortaleza. Anais do XXXIX Simpoósio Brasileiro de Pesquisa Operacional, 2007.
« Back to top2006
[44] LIN, Min C ; SZWARCFITER, J. L. . Efficient Construction of Unit Circular-Arc Models. In: ACM-SIAM Symposium on Discrete Algorithms (SODA' 2006), 2006, Miami, FL. Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms - SODA ' 2006, 2006. p. 309-315.
[43] LIN, Min C ; SZWARCFITER, J. L. . Characterizations and linear time recognition of Helly circular-arc graphs. In: 12th Annual International Computing and Combinatorics Conference - COCOON' 06, 2006, Taipei. Lecture Notes on Computer Science. New York: Springer-Verlag, 2006. v. 4112. p. 73-82.
[42] DANTAS, M. ; PROTTI, Fábio ; SZWARCFITER, J. L. . Applying modular decomposition to parameterized bicluster editing. In: 2nd International Workshop on Parameterized and Exact Computation - IWPEC'06, 2006, Zurique. Lecture Notes on Computer Science. New York: Springer-Verlag, 2006. v. 4169. p. 1-12.
[41] DOURADO, Mitre C ; PROTTI, Fábio ; SZWARCFITER, J. L. . On the computation of some parameters related to convexity of graphs. In: International Conference on Discrete Mathematics, 2006, Banglore. Proceedings of the International Conference on Discrete Mathematics. Bangalore: Indian Institute of Science and Ramanujan Mathematical Socienty, 2006. p. 102-112.
2005
[40] DOURADO, Mitre C ; PROTII, Fábio ; SZWARCFITER, J. L. . The Helly Property on Subhypergraphs. In: 2nd Brazilian Symposium on Graphs Combinatorics and Algorithms, 2005, Angra dos Reis. Electronic Notes on Discrete Mathematics (Proceedings of the 2nd Brazilian Symposium on Graphs Combinatorics and Algorithms). Amsterdam: Elsevier Science, 2005. v. 19. p. 71-77.
[39] Silvia B Tondato ; GUTIERREZ, Marisa ; SZWARCFITER, J. L. . A Forbidden Subgraph Characterization of Path Graphs. In: 2nd Brazilian Symposium on Graphs Combinatorics and Algorithms, 2005, Angra dos Reis. Electronic Notes on Discrete Mathematics (proceedings of the 2nd Brazilian Symposium on Graphs Combinatorics and Algorithms). Amsterdam: Elsevier Science, 2005. v. 19. p. 281-287.
[38] KLEIN, Sulamita ; SANTOS, Noemi C ; SZWARCFITER, J. L. . Uma Representação de Pares Modulares de Grafos P4-Redutíveis. In: XXXVII Simpósio Brasileiro de Pesquisa Operacional, 2005, Gramado, RS. Anais do XXXVII Simpósio Brasileiro de Pesquisa Operacional, 2005.
[37] KLEIN, Sulamita ; SANTOS, Noemi C ; SZWARCFITER, J. L. . A Representation for the Modular Pairs of a P4-Reducible Graph by Modular Decomposition. In: 7ème Colloque International de Théorie des Graphes, 2005, Hire, França. Electronic Notes on Discrete Mathematics (Proceedings of the 7ème Colloque International de Théorie des Graphes). Amsterdam: Elsevier Science, 2005. v. 22.
« Back to top2004
[36] DOURADO, Mitre C ; PROTTI, Fábio ; SZWARCFITER, J. L. . Characterization and Recognition of Generalized Clique-Helly Graphs. In: 30th International Workshop of Graph Theoretic Concepts in Computer Science (WG '2004), 2004, Bad Honnef. Lecture Notes on Computer Science (2005). New York: Springer-Verlag, 2004. v. 3353. p. 344-355.
[35] CÁCERES, Edson N ; DEHNE, Frank ; MONGELLI, Henrique ; SONG, Siang W ; SZWARCFITER, J. L. . A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components. In: Euro-Par, 2004, Pisa. Lecture Notes on Computer Science. New York: Springer-Verlag, 2004. v. 3149. p. 828-831.
[34] ROLÃO, Karina ; CUNHA, Amauri M ; SZWARCFITER, J. L. . Algorithms and Strategies for Electronic Auctions. In: XXXVI Simpósio Brasileiro de Pesquisa Operacional, 2004, Tiradentes. Anais do XXXVI Simpósio Brasileiro de Pesquisa Operacional, 2004.
[33] PINTO, Paulo e D ; PROTTI, Fábio ; SZWARCFITER, J. L. . A Huffman-Based Error Detecting Code. In: International Workshop on Experimental and Efficient Algorithms (WEA '2004), 2004, Angra dos Reis. Lecture Notes on Computer Science. New York: Springer-Verlag, 2004. v. 3059. p. 446-457.
[32] DURÁN, Guillermo ; LIN, Min C ; MERA, Sérgio ; SZWARCFITER, J. L. . Clique-Independent Sets of Helly Circular-Arc Graphs. In: Latin American Conference on Combinatorics, Graphs and Applications, 2004, Santiago. Electronic Notes on Discrete Mathematics (Proceedings of the Latin American Conference on Combinatorics, Graphs and Applications), 2004. v. 18. p. 103-108.
[31] KLEIN, Sulamita ; SANTOS, Noemi C ; SZWARCFITER, J. L. . A Representation for the Modular Pairs of a Cograph by Modular Decomposition. In: Latin American Conference on Combinatorics, Graphs and Applications, 2004, Santiago. Electronic Notes on Discrete Mathematics (Proceedings of the Latin American Conference on Combinatorics, Graphs and Applications), 2004. v. 18. p. 165-169.
[30] DOBSON, Patricia ; GUTIERREZ, Marisa ; SZWARCFITER, J. L. . Treelike Comparability Graphs. In: Latin American Conference on Combinatorics, Graphs and Applications, 2004, Santiago. Electronic Notes on Discrete Mathematics (Proceedings of the Latin American Conference on Combinatorics, Graphs and Applications). Amsterdan: Elsevier, 2004. v. 18. p. 97-102.
[29] PINTO, Paulo e D ; PROTTI, Fábio ; SZWARCFITER, J. L. . A Huffman-like Code with Error Detecting Capability. In: Latin American Conference on Combinatorics, Graphs and Applications, 2004, Santiago. Electronic Notes on Discrete Mathematics (Proceedings of the Latin American Conference on Combinatorics, Graphs and Applications), 2004. v. 18.
[28] DIAS, Vânia M F ; FIGUEIREDO, Celina M H ; SZWARCFITER, J. L. . On the Generation of Bicliques of a Graph. In: CTW Workshop on Graphs and Combinatorial Optimization, 2004, Milão. Proceedings of the CTW Workshop on Graphs and Combinatorial Optimization, 2004. p. 109-113.
« Back to top2003
[27] SZWARCFITER, J. L. ; ALVES, Carlos e R ; CÁCERES, Edson ; C JR, Amaury ; SONG, Siang W ; SZWARCFITER, Jayme L . Efficient Parallel Implementation of Transistive Closure Algorithms. In: 10th European PVM/MPI Conference, 2003, Veneza. Lecture Notes on Computer Science, 2003. v. 2840. p. 126-133.
[26] SZWARCFITER, J. L. . Generating Forest Extensions of a Partially Ordered Set. In: 5th Italian Conference on Algorithms and Complexity (CIAC´2003), 2003, Roma. Lecture Notes on Computer Science, 2003. v. 2653. p. 132-139.
[25] SZWARCFITER, J. L. ; PINTO, Paulo e D ; PROTTI, Fábio ; SZWARCFITER, Jayme L . Compactação de Dados com Correção de Erros. In: XXXV Simpósio Brasileiro de Pesquisa Operacional, 2003, Natal. Anais do XXXV Simpósio Brasileiro de Pesquisa Operacional, 2003. p. 2462-2472.
[24] SZWARCFITER, J. L. ; QUEIROZ, Aquiles B de ; SZWARCFITER, Jayme L . Geração de Extensões Semiordens e Intervalares de uma Ordenação Parcial. In: XXXV Simpósio Brasileiro de Pesquisa Operacional, 2003, Natal. Anais do XXXV Simpósio Brasileiro de Pesquisa Operacional, 2003. p. 2436-2445.
[23] SZWARCFITER, J. L. ; KLEIN, Sulamita ; SANTOS, Noemi C ; SZWARCFITER, Jayme L . Uma Representação para Pares Modulares de um Grafo. In: XXXV Simpósio Brasileiro de Pesquisa Operacional, 2003, Natal. Anais do XXXV Simpósio Brasileiro de Pesquisa Operacional, 2003. p. 2473-2483.
[22] ROLÃO, Karina ; CUNHA, Amauri M ; SZWARCFITER, J. L. . A Proposal of Classification of Electronic Auctions. In: 3rd IFIP Conference on e-Commerce, e-Business and e-Government, 2003, Guarujá. Proceedings of the 3rd IFIP Conference on e-Commerce, e-Business and e-Government, 2003. p. 383-394.
2002
[21] CÁCERES, E. N. ; SONG, Siang W ; SZWARCFITER, J. L. ; SZWARCFITER, Jayme L . A Parallel Algorithm for Transitive Closure. In: IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS´2002), 2002, Massachusets. Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS´2002). Cambridge, 2002. p. 114-116.
« Back to top2001
[20] CÁCERES, E. N. ; SONG, Siang W ; SZWARCFITER, J. L. ; SZWARCFITER, Jayme L . A Course-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs (ICCS´2001). In: International Conference on Computational Sciences, 2001. Lecture Notes in Computer Science, 2001. v. 2074. p. 638-647.
[19] CÁCERES, Edson N ; SONG, Siang W ; SZWARCFITER, J. L. ; SZWARCFITER, Jayme L . A Parallel Unrestricted Depth Search Algorithm. In: International Conference on Parallel and Distributed Processing Techniques and Aplications (PDPTA´2001), 2001, Las Vegas. Proceedings of the 2001 International Conference on Parallel and Distributed Processing Techniques and Aplications, 2001. p. 521-526.
2000
[18] CORREA, Ricardo ; SZWARCFITER, J. L. . On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets. In: 6ème Colloque International de Thèorie des Graphes, 2000, Marseille,. Eletronic Notes in Discrete Mathematics (Proceedings of the 6ème Colloque International de Thèorie des Graphes). Amsterdam: Elsevier, 2000. v. 5. p. 73-76.
1997
[17] PROTTI, F. ; FRANÇA, F. ; SZWARCFITER, J. L. . On Computing all Maximal Cliques Distributedly. In: 4th International Symposium on Solving Irregularly Structured Problems in Parallel, 1997, Paderborn. Proceedings of 4th International Symposium on Solving Irregularly Structured Problems in Parallel (Lecture Notes in Computer Science), 1997. v. 1253. p. 37-48.
1996
[16] BORNSTEIN, C. F. ; SZWARCFITER, J. L. . A Characterization of Clique Graphs of Rooted Path Graphs. In: 8th Quadriennial International Conference on Graph Theory, Combinatorics, Algorithms and Applications, 1999, Kalamazoo, MI. Proceedings of 8th Quadriennial International Conference on Graph Theory, Combinatorics, Algorithms and Applications, 1996. p. 117-122.
[15] BORNSTEIN, C. F. ; SZWARCFITER, J. L. . Iterated Clique Graphs with Increasing Diameters. In: Workshop Internacional de Combinatória - ProComb (Universidade Federal do Rio de Janeiro), 1996, Rio de Janeiro, RJ. Problemas Combinatórios: Teoria, Algoritmos e Aplicações / Estudo e Comunicações do Instituto de Matemática - U.F.R.J.. Rio de Janeiro, RJ: Universidade Federal do Rio de Janeiro. v. 63. p. 36-46.
« Back to top1995
[14] SZWARCFITER, J. L. ; MELLO, C. P. ; FIGUEIREDO, Celina M H . Sources, Sinks, Even and Odd Pairs in Comparability Graphs. In: I Oficina de Trabalho do Projeto de Combinatória (Universidade de São Paulo), 1995, São Paulo, SP. Problemas Combinatórios: Teoria, Algoritmos e Aplicações. São Paulo, SP: Universidade de São Paulo.
1993
[13] CÁCERES, Edson N ; SZWARCFITER, J. L. . Cliques Maximais em Grafos Circulares. In: V Simpósio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho, XIII Congresso da Sociedade Brasileira de Computação, 1993, Florianópolis, SC. Florianópolis, SC: Universidade Federal de Santa Catarina. p. 398-411.
1989
[12] SZWARCFITER, J. L. ; BARROSO, M. A. . Enumerating the Maximal Cliques of a Circle Graph. In: 2nd International Conference on Graph Theory, Combinatorics, Algorithms and Applications, 1991, San Francisco. Proceedings of the 2nd International Conference on Graph Theory, Combinatorics, Algorithms and Applications / Graph Theory, Combinatorics, Algorithms and Applications. Philadelphia, Pa, EUA: SIAM Publications, 1989. p. 511-517.
1987
[11] SZWARCFITER, J. L. . On a Min-Max Conjecture for Reducible Graphs. In: XIII Conferência Latinoamericana de Informática, 1987, Bogotá. p. 25-32.
[10] SZWARCFITER, J. L. . On Minimum Feedback Vertex Disjoint Cycles. In: XVI Colóquio Brasileiro de Matemática - Instituto de Matemática Pura e Aplicada, 1987, Rio de Janeiro, RJ. Atas do XVI Colóquio Brasileiro de Matemática. Rio de Janeiro, RJ: Instituto de Matemática Pura e Aplicada. p. 321-342.
« Back to top1986
[9] TOSCANI, L. V. ; SZWARCFITER, J. L. . Algoritmos Aproximativos: Uma Alternativa para Problemas NP-Completo. In: XII Conferência LatinoAmericana de Informática, 1986, Montevidéo, 1986. p. 155-164.
[8] SZWARCFITER, J. L. . Algoritmos para Scheduling Ótimo de Tarefas em Processamento Paralelo. In: VI Congresso da Sociedade Brasileira de Computação, XII SEMISH, 1986, Recife, PE. Recife, PE: Universidade Federal de Pernambuco. p. 49-53.
1985
[7] SZWARCFITER, J. L. . On the Many Visits Traveling Salesman Problem. In: XV Colóquio Brasileiro de Matemática, 1985, Poços de Caldas, MG. Atas do XV Colóquio Brasileiro de Matemática. p. 179-185.
1983
[6] SZWARCFITER, J. L. . Uma Classe de Condições Suficientes para Ciclos Hamiltonianos em Grafos. In: XIV Colóquio Brasileiro de Matemática, 1983, Poços de Caldas, MG. Atas do XIV Colóquio Brasileiro de Matemática. p. 147-162.
[5] SZWARCFITER, J. L. . Um Problema em Árvores B. In: III Congresso da Sociedade Brasileira de Computação - X SEMISH (Universidade Estadual de Campinas), 1983, Campinas, SP. Campinas, SP: Universidade Estadual de Campinas. p. 425-432.
1981
[4] SZWARCFITER, J. L. . Grafos Direcionados Estruturados em Árvore. In: XIII Colóquio Brasileiro de Matemática, 1981, Poços de Caldas, MG. Atas do XIII Colóquio Brasileiro de Matemática. p. 108-120.
1979
[3] SZWARCFITER, J. L. . Shortest Paths Visiting a Given Subset of Vertices. In: VI Painel de Discussión sobre Tópicos de Computación, 1979, Valparaiso. p. 44-51.
1978
[2] SZWARCFITER, J. L. . Sobre o Problema de Automação do Projeto de Placas de Circuito Impresso. In: V SEMISH: Seminário sobre o Desenvolvimento Integrado de Software e Hardware Nacionais (Universidade Federal do Rio de Janeiro), 1978, Rio de Janeiro, RJ. Rio de Janeiro, RJ: Universidade Federal do Rio de Janeiro. p. 640-657.
1971
[1] SZWARCFITER, J. L. . Sistemas de Automação de Bibliotecas. In: IV Congresso Nacional de Processamento de Dados, 1971, São Paulo, SP. p. 239-252.
