The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joe Sawada: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Frank Ruskey, Joe Sawada
    Generating Necklaces and Strings with Forbidden Substrings. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:330-339 [Conf]
  2. Gurmeet Singh Manku, Joe Sawada
    A Loopless Gray Code for Minimal Signed-Binary Representations. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:438-447 [Conf]
  3. Frank Ruskey, Joe Sawada
    A fast algorithm to generate unlabeled necklaces. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:256-262 [Conf]
  4. Joe Sawada, Frank Ruskey
    An Efficient Algorithm for Generating Necklaces with Fixed Density. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:752-758 [Conf]
  5. Frank Ruskey, Joe Sawada
    Bent Hamilton Cycles in d-Dimensional Grid Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  6. Joe Sawada, Jeremy Spinrad
    From a simple elimination ordering to a strong elimination ordering in linear time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:6, pp:299-302 [Journal]
  7. Kevin Cattell, Frank Ruskey, Joe Sawada, Micaela Serra, C. Robert Miers
    Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2). [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:267-282 [Journal]
  8. Joe Sawada, Frank Ruskey
    Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2). [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:46, n:1, pp:21-26 [Journal]
  9. Frank Ruskey, Joe Sawada
    An Efficient Algorithm for Generating Necklaces with Fixed Density. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:671-684 [Journal]
  10. Joe Sawada
    Generating Bracelets in Constant Amortized Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:259-268 [Journal]
  11. Frank Ruskey, C. Robert Miers, Joe Sawada
    The Number of Irreducible Polynomials and Lyndon Words with Given Trace. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:2, pp:240-245 [Journal]
  12. Joe Sawada
    A Fast Algorithm for Generating Nonisomorphic Chord Diagrams. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:4, pp:546-561 [Journal]
  13. Joe Sawada
    Generating rooted and free plane trees. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:1, pp:1-13 [Journal]
  14. L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada
    Generating and characterizing the perfect elimination orderings of a chordal graph. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:2, pp:303-317 [Journal]
  15. John Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson
    Euclidean strings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:301, pp:321-340 [Journal]
  16. Joe Sawada
    A fast algorithm to generate necklaces with fixed content. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:301, pp:477-489 [Journal]
  17. Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, J. Sawada, X. Shu
    Deciding k-colourability of P_5-free graphs in polynomial time [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  18. C. T. Hoang, J. Sawada, X. Shu
    k-Colorability of P5-free graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  19. A Certifying Algorithm for 3-Colorability of P5-Free Graphs. [Citation Graph (, )][DBLP]


  20. A Note on k-Colorability of P5-Free Graphs. [Citation Graph (, )][DBLP]


  21. Magic Labelings on Cycles and Wheels. [Citation Graph (, )][DBLP]


  22. Deciding k-Colorability of P5-Free Graphs in Polynomial Time. [Citation Graph (, )][DBLP]


  23. A certifying algorithm for 3-colorability of P5-free graphs [Citation Graph (, )][DBLP]


Search in 0.795secs, Finished in 0.797secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002