The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jayme Luiz Szwarcfiter: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jayme Luiz Szwarcfiter
    Optimal Binary Search Trees with Costs Depending on the Access Paths. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:2- [Conf]
  2. Jayme Luiz Szwarcfiter
    On the Generation of Extensions of a Partially Ordered Set. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:3- [Conf]
  3. Jayme Luiz Szwarcfiter
    Generating All Forest Extensions of a Partially Ordered Set. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:132-139 [Conf]
  4. Min Chih Lin, Jayme Luiz Szwarcfiter
    Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:73-82 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2004, pp:828-831 [Conf]
  6. Edson Cáceres, Siang W. Song, Jayme Luiz Szwarcfiter
    A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2001, pp:638-647 [Conf]
  7. Fábio Protti, Felipe M. G. França, Jayme Luiz Szwarcfiter
    On Computing All Maximal Cliques Distributedly. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1997, pp:37-48 [Conf]
  8. Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter
    Applying Modular Decomposition to Parameterized Bicluster Editing. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:1-12 [Conf]
  9. Edson Norberto Cáceres, Siang W. Song, Jayme Luiz Szwarcfiter
    A Parallel Algorithm for Transitive Closure. [Citation Graph (0, 0)][DBLP]
    IASTED PDCS, 2002, pp:114-116 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2003, pp:126-133 [Conf]
  11. Min Chih Lin, Jayme Luiz Szwarcfiter
    Efficient construction of unit circular-arc models. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:309-315 [Conf]
  12. Paulo E. D. Pinto, Fábio Protti, Jayme Luiz Szwarcfiter
    A Huffman-Based Error Detecting Code. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:446-457 [Conf]
  13. Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter
    Characterization and Recognition of Generalized Clique-Helly Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:344-354 [Conf]
  14. Jacek Blazewicz, Wieslaw Kubiak, H. Röck, Jayme Luiz Szwarcfiter
    Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1987, v:24, n:5, pp:513-524 [Journal]
  15. Jayme Luiz Szwarcfiter
    Optimal Multiway Search Trees for Variable Size Keys. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1984, v:21, n:, pp:47-60 [Journal]
  16. Márcia R. Cerioli, Jayme Luiz Szwarcfiter
    A Characterization of Edge Clique Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:60, n:, pp:- [Journal]
  17. Jayme Luiz Szwarcfiter
    Recognizing Clique-Helly Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:45, n:, pp:- [Journal]
  18. Jayme Luiz Szwarcfiter, L. B. Wilson
    Some Properties of Ternary Trees. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1978, v:21, n:1, pp:66-72 [Journal]
  19. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:91-95 [Journal]
  20. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:293-297 [Journal]
  21. Carmen Ortiz, Nelson Maculan, Jayme Luiz Szwarcfiter
    Characterizing and Edge-colouring Split-indifference Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:209-217 [Journal]
  22. Erich Prisner, Jayme Luiz Szwarcfiter
    Recognizing Clique Graphs of Directed and Rooted Path Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:321-328 [Journal]
  23. Bruce A. Reed, Siang W. Song, Jayme Luiz Szwarcfiter
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:1- [Journal]
  24. Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter
    Algorithms for clique-independent sets on subclasses of circular-arc graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:13, pp:1783-1790 [Journal]
  25. Márcia R. Cerioli, Jayme Luiz Szwarcfiter
    Edge clique graphs and some classes of chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:242, n:1-3, pp:31-39 [Journal]
  26. Ricardo C. Corrêa, Jayme Luiz Szwarcfiter
    On extensions, linear extensions, upsets and downsets of ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:295, n:1-3, pp:13-30 [Journal]
  27. Valmir C. Barbosa, Jayme Luiz Szwarcfiter
    Generating all the Acyclic Orientations of an Undirected Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:1-2, pp:71-74 [Journal]
  28. Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter
    The Helly property on subfamilies of limited size. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:2, pp:53-56 [Journal]
  29. Donald E. Knuth, Jayme Luiz Szwarcfiter
    A Structured Program to Generate all Topological Sorting Arrangements. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1974, v:2, n:6, pp:153-157 [Journal]
  30. Donald E. Knuth, Jayme Luiz Szwarcfiter
    Erratum: A Structured Program to Generate all Topological Sorting Arrangements. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1974, v:3, n:2, pp:64- [Journal]
  31. Jayme Luiz Szwarcfiter
    Systems of Distinct Representatives for k Families of Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:5, pp:195-196 [Journal]
  32. Jayme Luiz Szwarcfiter
    A Note on the Computation of the k-Closure of a Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:4, pp:279-280 [Journal]
  33. Jayme Luiz Szwarcfiter, Guy Chaty
    Enumerating the Kernels of a Directed Graph with no Odd Circuits. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:3, pp:149-153 [Journal]
  34. Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter
    Complexity aspects of generalized Helly hypergraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:1, pp:13-18 [Journal]
  35. Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter
    On transitive orientations with restricted covering graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:3, pp:119-125 [Journal]
  36. Min Chih Lin, Jayme Luiz Szwarcfiter
    Faster recognition of clique-Helly and hereditary clique-Helly graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:1, pp:40-43 [Journal]
  37. Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter
    On the helly defect of a graph. [Citation Graph (0, 0)][DBLP]
    J. Braz. Comp. Soc., 2001, v:7, n:3, pp:48-52 [Journal]
  38. Sulamita Klein, Jayme Luiz Szwarcfiter
    A Representation for the Modules of a GRaph. [Citation Graph (0, 0)][DBLP]
    J. Braz. Comp. Soc., 2003, v:9, n:1, pp:9-16 [Journal]
  39. Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter
    On Balanced Graphs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:233-250 [Journal]
  40. Edson Cáceres, Narsingh Deo, Shivakumar Sastry, Jayme Luiz Szwarcfiter
    On Finding Euler Tours in Parallel. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:223-231 [Journal]
  41. Alon Itai, Christos H. Papadimitriou, Jayme Luiz Szwarcfiter
    Hamilton Paths in Grid Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:4, pp:676-686 [Journal]
  42. Jayme Luiz Szwarcfiter, Claudson F. Bornstein
    Clique Graphs of Chordal and Path Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:2, pp:331-336 [Journal]
  43. Vânia M. F. Dias, Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter
    The stable marriage problem with restricted pairs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:391-405 [Journal]
  44. Vânia M. F. Dias, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter
    Generating bicliques of a graph in lexicographic order. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:240-248 [Journal]
  45. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1799-1814 [Journal]
  46. Vânia M. F. Dias, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter
    On the generation of bicliques of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:14, pp:1826-1832 [Journal]
  47. Cláudio Leonardo Lucchesi, Célia Picinin de Mello, Jayme Luiz Szwarcfiter
    On clique-complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:183, n:1-3, pp:247-254 [Journal]
  48. Jayme Luiz Szwarcfiter
    On edge transitivity of directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:227-235 [Journal]

  49. A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs. [Citation Graph (, )][DBLP]


  50. Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code. [Citation Graph (, )][DBLP]


  51. Brief Announcement: On Reversible and Irreversible Conversions. [Citation Graph (, )][DBLP]


  52. Proper Helly Circular-Arc Graphs. [Citation Graph (, )][DBLP]


  53. Cycles, Paths, Connectivity and Diameter in Distance Graphs. [Citation Graph (, )][DBLP]


  54. Characterizing Intersection Graphs of Substars of a Star. [Citation Graph (, )][DBLP]


  55. On clique-perfect and K-perfect graphs. [Citation Graph (, )][DBLP]


  56. Arboricity, h-Index, and Dynamic Algorithms [Citation Graph (, )][DBLP]


  57. Characterization and recognition of generalized clique-Helly graphs. [Citation Graph (, )][DBLP]


  58. On the strong p-Helly property. [Citation Graph (, )][DBLP]


  59. Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007. [Citation Graph (, )][DBLP]


  60. Complexity results related to monophonic convexity. [Citation Graph (, )][DBLP]


  61. The clique operator on circular-arc graphs. [Citation Graph (, )][DBLP]


  62. Characterizations and recognition of circular-arc graphs and subclasses: A survey. [Citation Graph (, )][DBLP]


  63. On the computation of the hull number of a graph. [Citation Graph (, )][DBLP]


  64. Some remarks on the geodetic number of a graph. [Citation Graph (, )][DBLP]


  65. On Hereditary Helly Classes of Graphs. [Citation Graph (, )][DBLP]


Search in 0.070secs, Finished in 0.073secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002