Jayme | Publicações em Periódicos

Produção Bibliográfica

Artigos em Periódicos

2015

[133] LIN, Min C ; MOYANO, V. ; Rautenbach, D ; Szwarcfiter, J. L. . The Maximum Number of Dominating Induced Matchings. Journal of Graph Theory (Print), v. 78, p. 258-268, 2015.

[132] BENTO, L. M. S. ; SA, V. G. ; SZWARCFITER, J. L. . Some illustrative examples on the use of hash tables. Pesquisa Operacional (Impresso), v. 35, p. 01-15, 2015.

[131] CAMPOS, V. ; SAMPAIO, R. ; SILVA, A. ; SZWARCFITER, J. L. . Graphs with few P4s under the convexity of paths of order three. Discrete Applied Mathematics, v. 192, p. 28-39, 2015.

[130] BONOMO, Flavia, FIGUEIREDO, Celina M H ; DURAN, Guillermo ; GRIPPO, L. ; SAFE, Martin D ; Szwarcfiter, Jayme L. . On probe co-bipartite and probe diamond-free graphs. Discrete Mathematics and Theoretical Computer Science (Online), v. 17, p. 187-200, 2015.

2014

[129] COELHO, E. M. M. ; Dourado, Mitre C. ; Rautenbach, D ; Szwarcfiter, Jayme L. . The Carathéodory Number of the P3 Convexity of Chordal Graphs. Discrete Applied Mathematics, v. 172, p. 104-108, 2014.

[128] RAMOS, I. F. ; SANTOS, V. F. ; Szwarcfiter, Jayme L. . Complexity aspects of the computation of the rank of a graph. Discrete Mathematics and Theoretical Computer Science (Online), v. 16, p. 73-86, 2014.

[127] DOURADO, M. C. ; PROTTI, F. ; SZWARCFITER, J. L. . On Helly hypergraphs with variable intersection sizes. Ars Combinatoria, v. 114, p. 185-191, 2014.

[126] DOURADO, M. C. ; RODRIGUES, R. F. ; SZWARCFITER, J. L. . Scheduling problem with multi-purpose parallel machines. Discrete Applied Mathematics, v. 164, p. 313-319, 2014.

[125] BONOMO, Flavia ; Szwarcfiter, Jayme L. . Characterization of classical graph classes by weighted clique graphs. Discrete Applied Mathematics, v. 165, p. 83-95, 2014.

[124] DOURADO, M. C. ; FARIA, L. ; PIZAÑA, Miguel Angel ; Rautenbach, D ; Szwarcfiter, J. L. . On defensive alliances and strong global offensive alliences. Discrete Applied Mathematics, v. 163, p. 136-141, 2014.

[123] JOOS, F. ; LOWENSTEIN, C. ; OLIVEIRA, F. S. ; Rautenbach, D ; Szwarcfiter, J. L. . Graphs of Interval Count Two with a Given Partition. Information Processing Letters (Print), v. 114, p. 542-546, 2014.

[122] LIN, Min C ; MIZRAHI, M. ; Jayme L. Szwarcfiter . Fast algorithms for some dominating induced matching problems. Information Processing Letters (Print), v. 114, p. 524-528, 2014.

[121] CERIOLI, Márcia R ; OLIVEIRA, F. S. ; SZWARCFITER, J. L. . Interval count of generalizations of threshold graphs. Matematica Contemporanea, v. 42, p. 9-16, 2014.

2013

[120] FIGUEIREDO, A. P. ; HABIB, M. ; KLEIN, Sulamita ; SZWARCFITER, J. L. . The Arboreal Jump Number of an Order. Order (Dordrecht), v. 30, p. 339-350, 2013.

[119] BONDY, Adrian ; SZWARCFITER, J. L. . Induced Decompositions of Graphs. Journal of Graph Theory (Print), v. 72, p. 462-477, 2013.

[118] ALVES, Carlos e R ; CÁCERES, E. N. ; CASTRO JR., A. A. ; SONG, Siang W ; SZWARCFITER, J. L. . Parallel transitive closure algorithm. Journal of the Brazilian Computer Society (Impresso), v. 19, p. 161-166, 2013.

[117] DOURADO, Mitre C ; Rautenbach, D ; SA, V. G. ; SZWARCFITER, J. L. . On the geodetic Radon number of grids. Discrete Mathematics, v. 313, p. 111-121, 2013.

[116] LIN, Min C ; SOULIGNAC, F. ; SZWARCFITER, J. L. . Normal Helly Circular-Arc Graphs and its Subclasses. Discrete Applied Mathematics, v. 161, p. 1037-1059, 2013.

[115] ARTIGAS, D. ; DANTAS, S. ; DOURADO, Mitre C ; SZWARCFITER, J. L. ; YAMAGUCHI, S. . On the contour of graphs. Discrete Applied Mathematics, v. 161, p. 1356-1362, 2013.

[114] Dourado, Mitre C. ; Rautenbach, D ; SANTOS, V. F. ; SCHAEFER, P. ; Szwarcfiter, Jayme L. ; TOMAN, A. . Algorithmic and Structural Aspects of the $P_3$-Radon Number. Annals of Operation Research, v. 206, p. 75-91, 2013.

[113] CURTISS, A. R. ; LIN, Min C ; McConnell, R. M. ; NUSSBAUM, Y. ; SOULIGNAC, F. ; SPINRAD, J. ; SZWARCFITER, J. L. . Isomorphism of graph classes related to the circular-ones property. Discrete Mathematics and Theoretical Computer Science (Online), v. 15, p. 157-182, 2013.

[112] Rautenbach, Dieter ; Szwarcfiter, Jayme L. . Unit Interval Graphs of Open and Closed Intervals. Journal of Graph Theory (Print), v. 72, p. 418-429, 2013.

[111] Dourado, Mitre C. ; Rautenbach, Dieter ; DOS SANTOS, VINÍCIUS FERNANDES ; Schäfer, Philipp M. ; Szwarcfiter, Jayme L. . On the Carathéodory number of interval and graph convexities. Theoretical Computer Science, v. 510, p. 127-135, 2013.

2012

[110] Dourado, Mitre C. ; PROTTI, Fábio ; Rautenbach, Dieter ; SZWARCFITER, J. L. . On the Convexity Number of Graphs. Graphs and Combinatorics, v. 28, p. 333-345, 2012.

[109] BARBOSA, R. M. ; COELHO, E. M. M. ; DOURADO, M. C. ; SZWARCFITER, J. L. . The Colorful Helly Theorem and General Hypergraphs. European Journal of Combinatorics (Print), v. 33, p. 743-749, 2012.

[108] CERIOLI, M. R. ; OLIVEIRA, F. S. ; SZWARCFITER, J. L. . The interval count of interval graphs and orders: a short survey. Journal of the Brazilian Computer Society (Impresso), v. 18, p. 103-112, 2012.

[107] BARBOSA, R. M. ; COELHO, E. M. M. ; DOURADO, M. C. ; Rautenbach, D ; SZWARCFITER, J. L. . On the Caratheodory Number for the Convexity of Paths of Order Three. SIAM Journal on Discrete Mathematics (Print), v. 26, p. 929-939, 2012.

[106] LIN, Min C ; SOULIGNAC, F. ; SZWARCFITER, J. L. . Arboricity, h-Index, and dynamic algorithms. Theoretical Computer Science, v. 426=27, p. 75-90, 2012.

[105] Rautenbach, D ; SZWARCFITER, J. L. . Unit and single point interval graphs. Discrete Applied Mathematics, v. 160, p. 1601-1609, 2012.

[104] PINTO, Paulo e D ; PROTTI, F. ; SZWARCFITER, J. L. . Exact and approximation algorithms for error-detecting even codes. Theoretical Computer Science, v. 440, p. 60-72, 2012.

[103] Dourado, Mitre C. ; Rautenbach, Dieter ; SANTOS, V. F. ; SZWARCFITER, J. L. ; Schäfer, Philipp M. ; Toman, Alexandre . An upper bound on the -Radon number. Discrete Mathematics, v. 312, p. 2433-2437, 2012.

[102] Dourado, Mitre C. ; Rautenbach, Dieter ; DOS SANTOS, VINÍCIUS FERNANDES ; Szwarcfiter, Jayme L. . Characterization and recognition of Radon-independent sets in split graphs. Information Processing Letters (Print), v. 112, p. 948-952, 2012.

[101] Dourado, Mitre C. ; PENSO, LUCIA DRAQUE ; Rautenbach, Dieter ; Szwarcfiter, Jayme L. . Reversible iterative graph processes. Theoretical Computer Science, v. 460, p. 16-25, 2012.

2011

[100] JOERIS, B. ; LIN, M. C. ; McConnell, R. M. ; Spinrad, J. ; SZWARCFITER, J. L. . Linear-time recognition of Helly circular-arc models and graphs. Algorithmica, v. 59, p. 215-239, 2011.

[99] Penso, L D ; Rautenbach, D ; SZWARCFITER, J. L. . Connectivity and Diameter in Distance Graphs. Networks (New York, N.Y. Print), v. 57, p. 310-315, 2011.

[98] LIN, Min C ; Rautenbach, D ; SOULIGNAC, F. ; SZWARCFITER, J. L. . Powers of Cycles, Powers of Paths, and Distance Graphs. Discrete Applied Mathematics, v. 159, p. 621-627, 2011.

[97] CERIOLI, M. R. ; OLIVEIRA, F. S. ; SZWARCFITER, J. L. . On Counting Interval Lengths of Interval Graphs. Discrete Applied Mathematics, v. 159, p. 532-543, 2011.

[96] Rautenbach, D ; SANTOS, V. F. ; SCHAEFER, P. ; SZWARCFITER, J. L. . Characterization and Representation Problems for Intersection Betweennesses. Discrete Applied Mathematics, v. 159, p. 389-395, 2011.

[95] Centeno, C. C. ; DOURADO, M. C. ; Penso, L D ; Rautenbach, D ; SZWARCFITER, J. L. . Irreversible Conversion of Graphs. Theoretical Computer Science, v. 412, p. 3693-3700, 2011.

[94] ARTIGAS, D. ; DANTAS, S. ; DOURADO, M. C. ; SZWARCFITER, J. L. . Partitioning a Graph into Convex Sets. Discrete Mathematics, v. 311, p. 1968-1977, 2011.

[93] GROSHAUS, Marina ; SZWARCFITER, J. L. . Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs. RAIRO. Recherche Opérationnelle, v. 45, p. 209-222, 2011.

[92] Rautenbach, D ; SANTOS, V. F. ; SCHAEFER, P. ; SZWARCFITER, J. L. . On subbetweennesses of trees: hardness, algorithms, and characterizations. Computers & Mathematics with Applications (1987), v. 62, p. 4674-4681, 2011.

2010

[91] DOURADO, M. C. ; PROTTI, F. ; Rautenbach, D ; SZWARCFITER, J. L. . Some remarks on the geodetic number of a graph. Discrete Mathematics, v. 310, p. 832-837, 2010.

[90] DOURADO, M. C. ; PROTTI, F. ; Rautenbach, D ; SZWARCFITER, J. L. . On the hull number of triangle free graphs. SIAM Journal on Discrete Mathematics, v. 23, p. 2163-2172, 2010.

[89] GROSHAUS, Marina ; SZWARCFITER, J. L. . Biclique graphs and biclique matrices. Journal of Graph Theory (Print), v. 63, p. 1-16, 2010.

[88] CERIOLI, M. R. ; OLIVEIRA, F. S. ; SZWARCFITER, J. L. . Extreme cliques in interval graphs. Ars Combinatoria, v. 94, p. 103-114, 2010.

[87] CÁCERES, E. N. ; SONG, Siang W ; SZWARCFITER, J. L. . Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search. Informatique Théorique et Applications (Imprimé), v. 44, p. 293-312, 2010.

[86] LIN, M. C. ; SOULIGNAC, F. ; SZWARCFITER, J. L. . The clique operator on circular-arc graphs. Discrete Applied Mathematics, v. 158, p. 1259-1267, 2010.

[85] DOURADO, M. C. ; PROTTI, F. ; SZWARCFITER, J. L. . Complexity results related to monophonic convexity. Discrete Applied Mathematics, v. 158, p. 1268-1274, 2010.

[84] Penso, L D ; Rautenbach, D ; SZWARCFITER, J. L. . Long cycles and paths in distance graphs. Discrete Mathematics, v. 310, p. 3417-3420, 2010.

[83] Centeno, C. C. ; DANTAS, S. ; DOURADO, M. C. ; Rautenbach, D ; SZWARCFITER, J. L. . Convex Partitions of Graphs induced by Paths of Order Three. Discrete Mathematics and Theoretical Computer Science (Online), v. 12, p. 175-184, 2010.

[82] CERIOLI, M. R. ; OLIVEIRA, F. S. ; SZWARCFITER, J. L. . On representing interval graphs using the minimum number of interval lengths. Matematica Contemporanea, v. 39, p. 59-68, 2010.

[81] BONOMO, Flavia ; Szwarcfiter, Jayme L. . On weighted clique graphs. Matematica Contemporanea, v. 39, p. 09-22, 2010.

[80] ARTIGAS, D. ; DANTAS, S. ; DOURADO, Mitre C ; Jayme L. Szwarcfiter . Convex covers of graphs. Matematica Contemporanea, v. 39, p. 31-38, 2010.

2009

[79] LIN, Min C ; SZWARCFITER, J. L. . Characterizations and recognition of circular-arc graphs and subclasses: a survey. Discrete Mathematics, v. 309, p. 5618-5635, 2009.

[78] DOURADO, M. C. ; GIMBEL, J. ; KRATOCHVIL, J. ; PROTTI, F. ; SZWARCFITER, J. L. . On the computation of the hull number of a graph. Discrete Mathematics, v. 309, p. 5668-5674, 2009.

[77] PROTTI, Fábio ; SILVA, M. D. ; SZWARCFITER, J. L. . Applying Modular Decomposition to Parameterized Cluster Editing Problems. Theory of Computing Systems, v. 44, p. 91-104, 2009.

[76] DOURADO, M. C. ; RODRIGUES, R. F. ; SZWARCFITER, J. L. . Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs. Annals of Operations Research, v. 169, p. 81-91, 2009.

[75] DOURADO, M. C. ; PROTTI, F. ; SZWARCFITER, J. L. . Complexity Aspects of the Helly Property: Graphs and Hypergraphs. The Electronic Journal of Combinatorics, v. DS-17, p. 1-53, 2009.

2008

[74] LIN, M. C. ; SZWARCFITER, J. L. . Unit circular-arc graph representations and feasible circulations. SIAM Journal on Discrete Mathematics, v. 22, p. 409-423, 2008.

[73] DURÁN, Guillermo ; LIN, Min C ; MERA, Sérgio ; SZWARCFITER, J. L. . Algorithms for finding clique transversals of graphs. Annals of Operations Research, v. 157, p. 37-45, 2008.

[72] DOURADO, M. C. ; PROTTI, F. ; SZWARCFITER, J. L. . On the strong p-Helly property. Discrete Applied Mathematics, v. 156, p. 1053-1057, 2008.

[71] GROSHAUS, Marina ; SZWARCFITER, J. L. . On hereditary Helly classes of graphs. Discrete Mathematics and Theoretical Computer Science (Online), v. 10, p. 71-78, 2008.

[70] DOURADO, M. C. ; LIN, Min C ; PROTTI, F. ; SZWARCFITER, J. L. . Improved Algorithms for Recognizing p-Helly and Hereditary p-Helly Hypergraps. Information Processing Letters (Print), v. 108, p. 247-250, 2008.

[69] DOURADO, Mitre C ; PROTTI, Fábio ; SZWARCFITER, J. L. . On the complexity of the geodetic and convexity numbers of a graph. Journal of the Ramanujan Mathematical Society, v. 7, p. 101-108, 2008.

2007

[68] DIAS, Vânia M F ; FIGUEIREDO, Celina M H ; SZWARCFITER, J. L. . On the generation of bicliques of a graph. Discrete Applied Mathematics, v. 155, p. 1826-1832, 2007.

[67] DOBSON, Patricia ; GUTIERREZ, Marisa ; HABIB, M. ; SZWARCFITER, J. L. . On transitive orientations with restricted covering graphs. Information Processing Letters, v. 101, p. 119-125, 2007.

[66] LIN, M. C. ; SZWARCFITER, J. L. . Faster recognition of clique-Helly and hereditary clique-Helly graphs. Information Processing Letters, v. 103, p. 40-43, 2007.

[65] DOURADO, M. C. ; PROTTI, F. ; SZWARCFITER, J. L. . Characterization and recognition of generalized clique-Helly graphs. Discrete Applied Mathematics, v. 155, p. 2435-2443, 2007.

[64] GROSHAUS, Marina ; SZWARCFITER, J. L. . Biclique-Helly graphs. Graphs and Combinatorics, v. 23, p. 633-645, 2007.

2006

[63] BONOMO, Flavia ; DURÁN, Guillermo ; LIN, Min Chi ; SZWARCFITER, J. L. . On Balanced Graphs. Mathematical Programming, v. 105, p. 233-250, 2006.

[62] BONOMO, Flávia ; DURÁN, Guillermo ; GROSHAUS, Marina ; SZWARCFITER, J. L. . On Clique-Perfect and K-Perfect Graphs. Ars Combinatoria, v. 80, p. 97-112, 2006.

[61] CERIOLI, Márcia R ; SZWARCFITER, J. L. . Characterizing Intersection Graphs of Substars of a Star. Ars Combinatoria, v. 79, p. 21-31, 2006.

[60] DURAN, Guillermo ; LIN, Min Chi ; MERA, Sérgio ; SZWARCFITER, J. L. . Algorithms for clique-independent sets on subclasses of circular-arc graphs. Discrete Applied Mathematics, v. 154, p. 1783-1790, 2006.

[59] DOURADO, Mitre C ; PROTTI, Fábio ; SZWARCFITER, J. L. . Complexity aspects of generalized Helly hypergraphs. Information Processing Letters, v. 99, p. 13-18, 2006.

[58] DOURADO, Mitre C ; PROTTI, Fábio ; SZWARCFITER, J. L. . Computational aspects of the Helly property: a survey. Journal of the Brazilian Computer Society, v. 12, p. 7-34, 2006.

[57] DOBSON, Patricia ; GUTIERREZ, Marisa ; SZWARCFITER, J. L. . Characterizations of Treelike Comparability Graphs. Congressus Numerantium, v. 182, p. 23-32, 2006.

« Back to top

2005

[56] CORREA, Ricardo ; SZWARCFITER, J. L. . On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets. Discrete Mathematics, v. 295, p. 13-30, 2005.

[55] DOURADO, Mitre C ; PROTTI, Fábio ; SZWARCFITER, J. L. . The Helly Property on Families of Limited Size. Information Processing Letters, v. 93, p. 53-56, 2005.

[54] PINTO, Paulo e D ; PROTTI, Fábio ; SZWARCFITER, J. L. . Parity Codes. RAIRO. Informatique Théorique et Applications, França, v. 39, p. 263-278, 2005.

[53] DIAS, Vânia M F ; FIGUEIREDO, Celina M H ; SZWARCFITER, J. L. . Generating Bicliques of a Graph in Lexicographic Order. Theoretical Computer Science, v. 37, p. 240-248, 2005.

2003

[52] DIAS, Vânia M F ; FONSECA, Guilherme D ; FIGUEIREDO, Celina M H ; SZWARCFITER, J. L. . The Stable Marriage Problem with Restricted Pairs. Theoretical Computer Science, v. 306, p. 391-405, 2003.

[51] BONDY, Adrian ; DURAN, Guillermo ; LIN, Min Chi ; SZWARCFITER, J. L. . Self-Clique Graphs and Permutation Matrices. Journal of Graph Theory, v. 44, p. 178-192, 2003.

[50] SZWARCFITER, J. L. ; NAVARRO, Gonzalo ; YATES, Ricardo Baeza ; OLIVEIRA, Joisa S ; CUNTO, Walter ; ZIVIANI, Nívio . Optimal Binary Search Trees with Costs Depending on the Access Paths. Theoretical Computer Science, v. 290, p. 1799-1814, 2003.

[49] KLEIN, Sulamita ; SZWARCFITER, J. L. . A Representation for the Modules of a Graph. Journal of the Brazilian Computer Society, v. 9, p. 9-16, 2003.

[48] DOURADO, M. C. ; PROTTI, Fábio ; SZWARCFITER, J. L. . The (p,q)-Helly Property and its Application to the Cliques of a Graph. Matemática Contemporânea, v. 25, p. 81-90, 2003.

[47] DURAN, Guillermo ; GRAVANO, Agustin ; GROSHAUS, Marina ; PROTTI, Fábio ; SZWARCFITER, J. L. . On a Conjecture Concerning Helly Circle Graphs. Pesquisa Operacional, v. 23, p. 221-229, 2003.

[46] PINTO, Paulo e D ; PROTTI, F. ; SZWARCFITER, J. L. . Data Compression and Error Detection Integration. RAIRO. Informatique Théorique et Applications, Rio de Janeiro, v. 15-B, p. 45-52, 2003.

2002

[45] CERIOLI, M. R. ; SZWARCFITER, J. L. . Edge Clique Graphs of Some Classes of Chordal Graphs. Discrete Mathematics, v. 242, p. 31-39, 2002.

[44] PROTTI, F. ; SZWARCFITER, J. L. . Clique-Inverse Graphs of Bipartite Graphs. Journal Of Combinatorial Mathematics And Combinatorial Computing, v. 40, p. 193-203, 2002.

[43] FIGUEIREDO, C. M. H. ; GIMBEL, J. ; MELLO, C. P. ; SZWARCFITER, J. L. . A Note on Transitive Orientations with Maximun Sets of Sources and Sinks. Discrete Applied Mathematics, v. 120, p. 91-95, 2002.

[42] DURAN, Guillermo ; LIN, M. C. ; SZWARCFITER, J. L. . On Clique-Transversals and Clique-Independent Sets. Annals of Operations Research, v. 116, p. 71-77, 2002.

[41] DOURADO, Mitre C ; PROTTI, Fábio ; SZWARCFITER, J. L. . On the Helly Defect of a Graph. Journal of the Brazilian Computer Society, v. 7, p. 48-52, 2002.

2001

[40] CERIOLI, M. R. ; SZWARCFITER, J. L. . A Characterization of Edge Clique Graphs. Ars Combinatoria, Canada, v. 60, p. 287-292, 2001.

2000

[39] PROTTI, F. ; SZWARCFITER, J. L. . On Clique Graphs with Linear Size. Congressus Numerantium, Canada, v. 143, p. 207-219, 2000.

[38] PROTTI, F. ; SZWARCFITER, J. L. . Clique-Inverse Graphs of K3-free and K4-free Graphs. Journal of Graph Theory, v. 35, p. 257-272, 2000.

[37] DIAS, V. M. F. ; SZWARCFITER, J. L. . Casamentos Estáveis com Casais Forçados e Casais Proibidos. TEMA. Tendências em Matemática Aplicada e Computacional, v. 1, p. 361-372, 2000.

[36] CERIOLI, M. R. ; SZWARCFITER, J. L. . Uma Caracterização de Grafos Estrelados. TEMA. Tendências em Matemática Aplicada e Computacional, v. 1, p. 345-350, 2000.

1999

[35] PRISNER, E. ; SZWARCFITER, J. L. . Recognizing Clique Graphs of Directed and Rooted Path Graphs. Discrete Applied Mathematics, v. 94, p. 321-328, 1999.

[34] FIGUEIREDO, Celina M H ; GIMBEL, J. ; MELLO, C. P. ; SZWARCFITER, J. L. . Even and Odd Pairs in Comparability and P4-Comparability Graphs. Discrete Applied Mathematics, v. 91, p. 293-297, 1999.

[33] BARBOSA, V. C. ; SZWARCFITER, J. L. . Generating all the Acyclic Orientations of an Undirected Graph. Information Processing Letters, v. 72, p. 71-74, 1999.

1998

[32] BORNSTEIN, C. F. ; SZWARCFITER, J. L. . Iterated Clique Graphs with Increasing Diameters. Journal of Graph Theory, v. 28, p. 147-154, 1998.

[31] LUCCHESI, C. L. ; MELLO, C. P. ; SZWARCFITER, J. L. . On Clique Complete Graphs. Discrete Mathematics, v. 183, p. 247-254, 1998.

[30] ORTIZ, C. ; MACULAN, N. ; SZWARCFITER, J. L. . Characterizing and Edge Colouring Split-Indiference Graphs. Discrete Applied Mathematics, v. 83, p. 177-185, 1998.

[29] MOSCARINI, M. ; PETRESCHI, R. ; SZWARCFITER, J. L. . On Node Searching and Starlike Graphs. Congressus Numerantium, v. 131, p. 75-84, 1998.

1997

[28] FIGUEIREDO, Celina M H ; GIMBEL, J. ; MELLO, C. P. ; SZWARCFITER, J. L. . Sources and Sinks in Comparability Graphs. Order (Dordrecht), v. 14, p. 75-83, 1997.

[27] SZWARCFITER, J. L. . Recognizing Clique Helly Graphs. Ars Combinatoria, v. 45, p. 29-32, 1997.

1995

[26] BORNSTEIN, C. F. ; SZWARCFITER, J. L. . On Clique Convergent Graphs. Graphs and Combinatorics, v. 11, p. 213-220, 1995.

[25] SZWARCFITER, J. L. . On Edge Transitivity of Directed Graphs. Discrete Mathematics, v. 141, p. 227-235, 1995.

1994

[24] SZWARCFITER, J. L. ; BORNSTEIN, C. F. . Clique Graphs of Chordal and Path Graphs. SIAM Journal on Discrete Mathematics, v. 7, p. 331-336, 1994.

[23] SZWARCFITER, J. L. ; CHATY, G. . Enumerating the Kernels of a Directed Graph with no Odd Circuits. Information Processing Letters, v. 51, p. 149-153, 1994.

1993

[22] CÁCERES, Edson N ; DEO, N. ; SASTRY, N. ; SZWARCFITER, J. L. . On Finding Euler Tours in Parallel. Parallel Processing Letters, v. 3, p. 223-231, 1993.

[21] SZWARCFITER, J. L. ; MELLO, C. P. ; FIGUEIREDO, Celina M H . On Transitive Orientations with Prediscribed Sources and Sinks. Congressus Numerantium, v. 98, p. 191-198, 1993.

1992

[20] VILLANUEVA, M. ; SZWARCFITER, J. L. . Triangulated Graphs: a survey. Investigación Operativa, v. 2, p. 245-271, 1992.

1991

[19] FIGUEIREDO, Celina M H ; KLEIN, Sulamita ; MELLO, C. P. ; SZWARCFITER, J. L. . Ordens Indiferença. Pesquisa Operacional, v. 11, p. 43-47, 1991.

1990

[18] SZWARCFITER, J. L. . Problemas de Roteamento de Veículos com Objetos Repetidos. Journal of the Brazilian Computer Society, v. 5, p. 3-8, 1990.

1989

[17] SZWARCFITER, J. L. . On Minimum Cuts of Cycles and Maximum Disjoint Cycles. Contemporary Mathematics. American Mathematical Society, v. 89, p. 153-166, 1989.

1988

[16] BLAZEWICZ, J. ; KUBIAK, W. ; SZWARCFITER, J. L. . Scheduling Unit Time Tasks on Flow Shops Under Resource Constraints. Annals of Operations Research, v. 16, p. 255-266, 1988.

1987

[15] BLAZEWICZ, J. ; KUBIAK, W. ; ROCK, H. ; SZWARCFITER, J. L. . Minimizing Mean Flow Time with Parallel Processors and Resource Constraints. Acta Informatica, v. 24, p. 513-524, 1987.

[14] SZWARCFITER, J. L. . Job Shop Scheduling with Unit Time Operations Under Resource Constraints and Release Dates. Discrete Applied Mathematics, v. 18, p. 227-233, 1987.

[13] SZWARCFITER, J. L. . A Note on the Computation of the k-Closure of a Graph. Information Processing Letters, v. 24, p. 279-280, 1987.

1985

[12] SZWARCFITER, J. L. . On Digraphs with a Rooted Tree Structure. Networks (New York), v. 15, p. 46-57, 1985.

[11] SZWARCFITER, J. L. ; PERSIANO, R. C. M. ; OLIVEIRA, A. A. F. . Orientations with Single Source and Sink. Discrete Applied Mathematics, v. 10, p. 313-321, 1985.

[10] PINHO, A. A. ; SZWARCFITER, J. L. . Máquinas Paralelas com Velocidades Linearmente Relacionadas. Pesquisa Operacional, v. 5, p. 21-27, 1985.

1984

[9] SZWARCFITER, J. L. . Optimal Multiway Search Trees for Variable Size Keys. Acta Informatica, v. 21, p. 47-60, 1984.

1982

[8] ITAI, A. ; PAPADIMITRIOU, C. H. ; SZWARCFITER, J. L. . Hamilton Paths in Grid Graphs. SIAM Journal on Computing, v. 11, p. 676-686, 1982.

1981

[7] SZWARCFITER, J. L. . Um Caso de Fluxo Máximo em Redes. Journal of the Brazilian Computer Society, v. 1, p. 7-17, 1981.

1979

[6] SZWARCFITER, J. L. . Systems of Distinct Representative for k Families of Sets. Information Processing Letters, v. 9, p. 195-196, 1979.

1978

[5] SZWARCFITER, J. L. ; WILSON, L. B. . Some Properties of Ternary Trees. Computer Journal, v. 21, p. 66-72, 1978.

[4] SZWARCFITER, J. L. . As Árvores da Experiência Humana. Dados e Idéias, v. 5, p. 30-37, 1978.

[3] SZWARCFITER, J. L. ; FRANCO, C. A. S. ; MOREIRA, M. P. F. . Sobre o Problema de Automação do Projeto de Placas de Circuito Impresso. Data News, v. 60, p. 10F-12F, 1978.

1976

[2] SZWARCFITER, J. L. ; LAUER, P. E. . A Search Strategy for the Elementary Cycles of a Directed Graph. BIT (Nordisk Tidskrift for Informationsbehandling), v. 16, p. 192-204, 1976.

1974

[1] KNUTH, D. E. ; SZWARCFITER, J. L. . A Structured Program to Generate All Topological Sorting Arrangements. Information Processing Letters, v. 6, p. 153-157, 1974.

« Voltar ao topo