2008 | ||
---|---|---|
76 | EE | Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter: A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs. SWAT 2008: 355-366 |
75 | EE | Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter: Algorithms for finding clique-transversals of graphs. Annals OR 157(1): 37-45 (2008) |
74 | EE | Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter: On the strong p-Helly property. Discrete Applied Mathematics 156(7): 1053-1057 (2008) |
73 | EE | Thomas M. Liebling, Jayme Luiz Szwarcfiter, Guillermo Durán, Martín Matamala: Preface. Electronic Notes in Discrete Mathematics 30: 1-2 (2008) |
72 | EE | Márcia R. Cerioli, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter: Linear-Interval Dimension and PI Orders. Electronic Notes in Discrete Mathematics 30: 111-116 (2008) |
71 | EE | Min Chih Lin, Ross M. McConnell, Francisco J. Soulignac, Jayme Luiz Szwarcfiter: On cliques of Helly Circular-arc Graphs. Electronic Notes in Discrete Mathematics 30: 117-122 (2008) |
70 | EE | Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter: Algorithmic Aspects of Monophonic Convexity. Electronic Notes in Discrete Mathematics 30: 177-182 (2008) |
69 | EE | Marisa Gutierrez, Jayme Luiz Szwarcfiter, Silvia B. Tondato: Clique trees of chordal graphs: leafage and 3-asteroidals. Electronic Notes in Discrete Mathematics 30: 237-242 (2008) |
68 | EE | Mitre Costa Dourado, Min Chih Lin, Fábio Protti, Jayme Luiz Szwarcfiter: Improved algorithms for recognizing p. Inf. Process. Lett. 108(4): 247-250 (2008) |
67 | EE | Min Chih Lin, Jayme Luiz Szwarcfiter: Unit Circular-Arc Graph Representations and Feasible Circulations. SIAM J. Discrete Math. 22(1): 409-423 (2008) |
2007 | ||
66 | EE | Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter: Proper Helly Circular-Arc Graphs. WG 2007: 248-257 |
65 | EE | Vânia M. F. Dias, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter: On the generation of bicliques of a graph. Discrete Applied Mathematics 155(14): 1826-1832 (2007) |
64 | EE | Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter: Characterization and recognition of generalized clique-Helly graphs. Discrete Applied Mathematics 155(18): 2435-2443 (2007) |
63 | EE | Danilo Artigas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter: Convex Partitions of Graphs. Electronic Notes in Discrete Mathematics 29: 147-151 (2007) |
62 | EE | Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter: On transitive orientations with restricted covering graphs. Inf. Process. Lett. 101(3): 119-125 (2007) |
61 | EE | Min Chih Lin, Jayme Luiz Szwarcfiter: Faster recognition of clique-Helly and hereditary clique-Helly graphs. Inf. Process. Lett. 103(1): 40-43 (2007) |
2006 | ||
60 | EE | Min Chih Lin, Jayme Luiz Szwarcfiter: Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs. COCOON 2006: 73-82 |
59 | EE | Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter: Applying Modular Decomposition to Parameterized Bicluster Editing. IWPEC 2006: 1-12 |
58 | EE | Min Chih Lin, Jayme Luiz Szwarcfiter: Efficient construction of unit circular-arc models. SODA 2006: 309-315 |
57 | Márcia R. Cerioli, Jayme Luiz Szwarcfiter: Characterizing Intersection Graphs of Substars of a Star. Ars Comb. 79: (2006) | |
56 | Flavia Bonomo, Guillermo Durán, Marina Groshaus, Jayme Luiz Szwarcfiter: On clique-perfect and K-perfect graphs. Ars Comb. 80: (2006) | |
55 | EE | Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter: Algorithms for clique-independent sets on subclasses of circular-arc graphs. Discrete Applied Mathematics 154(13): 1783-1790 (2006) |
54 | EE | Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter: Complexity aspects of generalized Helly hypergraphs. Inf. Process. Lett. 99(1): 13-18 (2006) |
53 | EE | Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter: On Balanced Graphs. Math. Program. 105(2-3): 233-250 (2006) |
2005 | ||
52 | EE | Ricardo C. Corrêa, Jayme Luiz Szwarcfiter: On extensions, linear extensions, upsets and downsets of ordered sets. Discrete Mathematics 295(1-3): 13-30 (2005) |
51 | EE | Silvia B. Tondato, Marisa Gutierrez, Jayme Luiz Szwarcfiter: A forbidden subgraph characterization of path graphs. Electronic Notes in Discrete Mathematics 19: 281-287 (2005) |
50 | EE | Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter: The Helly property on subhypergraphs. Electronic Notes in Discrete Mathematics 19: 71-77 (2005) |
49 | EE | Noemi C. dos Santos, Sulamita Klein, Jayme Luiz Szwarcfiter: A representation for the modular-pairs of a P4-reducible graph by modular decomposition. Electronic Notes in Discrete Mathematics 22: 267-270 (2005) |
48 | EE | Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter: The Helly property on subfamilies of limited size. Inf. Process. Lett. 93(2): 53-56 (2005) |
47 | EE | Vânia M. F. Dias, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter: Generating bicliques of a graph in lexicographic order. Theor. Comput. Sci. 337(1-3): 240-248 (2005) |
2004 | ||
46 | EE | Edson Norberto Cáceres, Frank K. H. A. Dehne, Henrique Mongelli, Siang W. Song, Jayme Luiz Szwarcfiter: A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components. Euro-Par 2004: 828-831 |
45 | EE | Paulo E. D. Pinto, Fábio Protti, Jayme Luiz Szwarcfiter: A Huffman-Based Error Detecting Code. WEA 2004: 446-457 |
44 | EE | Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter: Characterization and Recognition of Generalized Clique-Helly Graphs. WG 2004: 344-354 |
43 | EE | Bruce A. Reed, Siang W. Song, Jayme Luiz Szwarcfiter: Preface. Discrete Applied Mathematics 141(1-3): 1 (2004) |
42 | EE | Vânia M. F. Dias, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter: On the generation of bicliques of a graph. Electronic Notes in Discrete Mathematics 17: 123-127 (2004) |
41 | EE | Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter: Clique-independent sets of Helly circular-arc graphs. Electronic Notes in Discrete Mathematics 18: 103-108 (2004) |
40 | EE | Sulamita Klein, Noemi C. dos Santos, Jayme Luiz Szwarcfiter: A representation for the modular-pairs of a cograph by modular decomposition. Electronic Notes in Discrete Mathematics 18: 165-169 (2004) |
39 | EE | Maria Patricia Dobson, Marisa Gutierrez, Jayme Luiz Szwarcfiter: Treelike Comparability Graphs. Electronic Notes in Discrete Mathematics 18: 97-102 (2004) |
2003 | ||
38 | EE | Jayme Luiz Szwarcfiter: Generating All Forest Extensions of a Partially Ordered Set. CIAC 2003: 132-139 |
37 | EE | Jayme Luiz Szwarcfiter: Optimal Binary Search Trees with Costs Depending on the Access Paths. CIAC 2003: 2 |
36 | EE | Jayme Luiz Szwarcfiter: On the Generation of Extensions of a Partially Ordered Set. CIAC 2003: 3 |
35 | EE | Carlos E. R. Alves, Edson Cáceres, A. A. Castro Jr., Siang W. Song, Jayme Luiz Szwarcfiter: Efficient Parallel Implementation of Transitive Closure of Digraphs. PVM/MPI 2003: 126-133 |
34 | Sulamita Klein, Jayme Luiz Szwarcfiter: A Representation for the Modules of a GRaph. J. Braz. Comp. Soc. 9(1): 9-16 (2003) | |
33 | Jayme Luiz Szwarcfiter, Gonzalo Navarro, Ricardo A. Baeza-Yates, Joísa de S. Oliveira, Walter Cunto, Nivio Ziviani: Optimal binary search trees with costs depending on the access paths. Theor. Comput. Sci. 290(3): 1799-1814 (2003) | |
32 | EE | Vânia M. F. Dias, Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter: The stable marriage problem with restricted pairs. Theor. Comput. Sci. 306(1-3): 391-405 (2003) |
2002 | ||
31 | Edson Norberto Cáceres, Siang W. Song, Jayme Luiz Szwarcfiter: A Parallel Algorithm for Transitive Closure. IASTED PDCS 2002: 114-116 | |
30 | EE | Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter: On Clique-Transversals and Clique-Independent Sets. Annals OR 116(1-4): 71-77 (2002) |
29 | Celina M. Herrera de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter: A note on transitive orientations with maximum sets of sources and sinks. Discrete Applied Mathematics 120(1-3): 91-95 (2002) | |
28 | EE | Márcia R. Cerioli, Jayme Luiz Szwarcfiter: Edge clique graphs and some classes of chordal graphs. Discrete Mathematics 242(1-3): 31-39 (2002) |
2001 | ||
27 | EE | Edson Cáceres, Siang W. Song, Jayme Luiz Szwarcfiter: A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs. International Conference on Computational Science (2) 2001: 638-647 |
26 | Márcia R. Cerioli, Jayme Luiz Szwarcfiter: A Characterization of Edge Clique Graphs. Ars Comb. 60: (2001) | |
25 | EE | Jayme Luiz Szwarcfiter: Preface: Volume 7. Electronic Notes in Discrete Mathematics 7: 1 (2001) |
24 | EE | Vânia M. F. Dias, Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter: Stable marriages with restricted pairs. Electronic Notes in Discrete Mathematics 7: 14-17 (2001) |
23 | EE | Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter: A sufficient condition for self-clique graphs. Electronic Notes in Discrete Mathematics 7: 174-177 (2001) |
22 | Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter: On the helly defect of a graph. J. Braz. Comp. Soc. 7(3): 48-52 (2001) | |
2000 | ||
21 | EE | Ricardo C. Corrêa, Jayme Luiz Szwarcfiter: On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract). Electronic Notes in Discrete Mathematics 5: 71-74 (2000) |
1999 | ||
20 | EE | Celina M. Herrera de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter: Even and Odd Pairs in Comparability and in P4-comparability Graphs. Discrete Applied Mathematics 91(1-3): 293-297 (1999) |
19 | EE | Erich Prisner, Jayme Luiz Szwarcfiter: Recognizing Clique Graphs of Directed and Rooted Path Graphs. Discrete Applied Mathematics 94(1-3): 321-328 (1999) |
18 | EE | Celina M. Herrera de Figueiredo, John Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter: Linear-time Algorithms for Maximum Sets of Sources and sinks. Electronic Notes in Discrete Mathematics 3: 230-234 (1999) |
17 | EE | Valmir C. Barbosa, Jayme Luiz Szwarcfiter: Generating all the Acyclic Orientations of an Undirected Graph. Inf. Process. Lett. 72(1-2): 71-74 (1999) |
1998 | ||
16 | EE | Carmen Ortiz, Nelson Maculan, Jayme Luiz Szwarcfiter: Characterizing and Edge-colouring Split-indifference Graphs. Discrete Applied Mathematics 82(1-3): 209-217 (1998) |
15 | EE | Cláudio Leonardo Lucchesi, Célia Picinin de Mello, Jayme Luiz Szwarcfiter: On clique-complete graphs. Discrete Mathematics 183(1-3): 247-254 (1998) |
1997 | ||
14 | Fábio Protti, Felipe M. G. França, Jayme Luiz Szwarcfiter: On Computing All Maximal Cliques Distributedly. IRREGULAR 1997: 37-48 | |
13 | Jayme Luiz Szwarcfiter: Recognizing Clique-Helly Graphs. Ars Comb. 45: (1997) | |
1995 | ||
12 | EE | Jayme Luiz Szwarcfiter: On edge transitivity of directed graphs. Discrete Mathematics 141(1-3): 227-235 (1995) |
1994 | ||
11 | Jayme Luiz Szwarcfiter, Guy Chaty: Enumerating the Kernels of a Directed Graph with no Odd Circuits. Inf. Process. Lett. 51(3): 149-153 (1994) | |
10 | EE | Jayme Luiz Szwarcfiter, Claudson F. Bornstein: Clique Graphs of Chordal and Path Graphs. SIAM J. Discrete Math. 7(2): 331-336 (1994) |
1993 | ||
9 | Edson Cáceres, Narsingh Deo, Shivakumar Sastry, Jayme Luiz Szwarcfiter: On Finding Euler Tours in Parallel. Parallel Processing Letters 3: 223-231 (1993) | |
1987 | ||
8 | Jacek Blazewicz, Wieslaw Kubiak, H. Röck, Jayme Luiz Szwarcfiter: Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints. Acta Inf. 24(5): 513-524 (1987) | |
7 | Jayme Luiz Szwarcfiter: A Note on the Computation of the k-Closure of a Graph. Inf. Process. Lett. 24(4): 279-280 (1987) | |
1984 | ||
6 | Jayme Luiz Szwarcfiter: Optimal Multiway Search Trees for Variable Size Keys. Acta Inf. 21: 47-60 (1984) | |
1982 | ||
5 | Alon Itai, Christos H. Papadimitriou, Jayme Luiz Szwarcfiter: Hamilton Paths in Grid Graphs. SIAM J. Comput. 11(4): 676-686 (1982) | |
1979 | ||
4 | Jayme Luiz Szwarcfiter: Systems of Distinct Representatives for k Families of Sets. Inf. Process. Lett. 9(5): 195-196 (1979) | |
1978 | ||
3 | Jayme Luiz Szwarcfiter, L. B. Wilson: Some Properties of Ternary Trees. Comput. J. 21(1): 66-72 (1978) | |
1974 | ||
2 | Donald E. Knuth, Jayme Luiz Szwarcfiter: A Structured Program to Generate all Topological Sorting Arrangements. Inf. Process. Lett. 2(6): 153-157 (1974) | |
1 | Donald E. Knuth, Jayme Luiz Szwarcfiter: Erratum: A Structured Program to Generate all Topological Sorting Arrangements. Inf. Process. Lett. 3(2): 64 (1974) |