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

Search the dblp DataBase

Title:
Author:
Alexander Rosa: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ljiljana Brankovic, Peter Horák, Mirka Miller, Alexander Rosa
    Premature partial latin squares. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:63, n:, pp:- [Journal]
  2. Terry S. Griggs, Alexander Rosa
    An invariant for one-factorizations of the complete graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  3. Peter Horák, Alexander Rosa, Jozef Sirán
    Maximal Orthogonal Latin Rectangles. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:47, n:, pp:- [Journal]
  4. Charles J. Colbourn, Jeffrey H. Dinitz, Alexander Rosa
    Bicoloring Steiner Triple Systems. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  5. Charles J. Colbourn, Alexander Rosa, Stefan Znám
    The Spectrum of Maximal Partial Steiner Triple Systems. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1993, v:3, n:3, pp:209-219 [Journal]
  6. F. Franek, Mike J. Grannell, Terry S. Griggs, Alexander Rosa
    On Large Sets of v-1 L-Intersecting Steiner Triple Systems of Order v. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2002, v:26, n:1-3, pp:243-256 [Journal]
  7. F. Franek, Alexander Rosa, Terry S. Griggs
    Large Sets of Mutually Almost Disjoint Steiner Triple Systems Not From Steiner Quadruple Systems. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:12, n:1, pp:59-67 [Journal]
  8. F. Franek, Terry S. Griggs, Charles C. Lindner, Alexander Rosa
    Completing the spectrum of 2-chromatic S(2, 4, v). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:247, n:1-3, pp:225-228 [Journal]
  9. Malcolm Greig, Alexander Rosa
    Maximal arcs in Steiner systems S(2, 4, v). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:267, n:1-3, pp:143-151 [Journal]
  10. Peter Horák, Roman Nedela, Alexander Rosa
    The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:284, n:1-3, pp:181-188 [Journal]
  11. Peter Horák, Alexander Rosa
    Extended Petersen graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:299, n:1-3, pp:129-140 [Journal]
  12. Selda Küçükçifçi, Charles C. Lindner, Alexander Rosa
    The metamorphosis of lambda-fold block designs with block size four into a maximum packing of lambdaKn with 4-cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:278, n:1-3, pp:175-193 [Journal]
  13. Mariusz Meszka, Alexander Rosa
    Embedding Steiner triple systems into Steiner systems S(2, 4, v). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:274, n:1-3, pp:199-212 [Journal]
  14. Dalibor Froncek, Alexander Rosa, Jozef Sirán
    The Existence of Selfcomplementary Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:7, pp:625-628 [Journal]
  15. Charles J. Colbourn, Alexander Rosa
    Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:3, pp:335-345 [Journal]
  16. Dean G. Hoffman, Christopher A. Rodger, Alexander Rosa
    Maximal Sets of 2-Factors and Hamiltonian Cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:57, n:1, pp:69-76 [Journal]
  17. Charles C. Lindner, Alexander Rosa
    A Partial Room Square Can be Embedded in a Room Square. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1977, v:22, n:1, pp:97-102 [Journal]
  18. Alexander Rosa
    On the Falsity of a Conjecture on Orthogonal Steiner Triple Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1974, v:16, n:1, pp:126-128 [Journal]
  19. Alexander Rosa
    A Theorem on the Maximum Number of Disjoint Steiner Triple Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1975, v:18, n:3, pp:305-312 [Journal]
  20. Alexander Rosa, Dean Hoffman
    The number of repeated blocks in twofold triple systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:41, n:1, pp:61-88 [Journal]
  21. Kevin T. Phelps, Alexander Rosa
    Steiner triple systems with rotational automorphisms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:33, n:1, pp:57-66 [Journal]
  22. Alexander Rosa
    Repeated blocks in indecomposable twofold triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:65, n:3, pp:261-276 [Journal]
  23. Charles J. Colbourn, Marlene J. Colbourn, Alexander Rosa
    Completing small partial triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:45, n:2-3, pp:165-179 [Journal]
  24. Katherine Heinrich, Peter Horák, Alexander Rosa
    On Alspach's conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:77, n:1-3, pp:97-121 [Journal]
  25. Rudolf Mathon, Alexander Rosa
    On the (15, 5, lambda)-family of BIBDs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:77, n:1-3, pp:205-216 [Journal]
  26. Charles J. Colbourn, Kevin T. Phelps, Marialuisa J. de Resmini, Alexander Rosa
    Partitioning Steiner triple systems into complete arcs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:89, n:2, pp:149-160 [Journal]
  27. Charles J. Colbourn, Rudolf Mathon, Alexander Rosa, Nabil Shalaby
    The fine structure of threefold triple systems: u = 1 or 3 (mod 6). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:92, n:1-3, pp:49-64 [Journal]
  28. Charles J. Colbourn, Dieter Jungnickel, Alexander Rosa
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:97, n:1-3, pp:1- [Journal]
  29. Pramod K. Das, Alexander Rosa
    Halving Steiner triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:109, n:1-3, pp:59-67 [Journal]
  30. Alexander Rosa, Stefan Znám
    Packing pentagons into complete graphs: how clumsy can you get? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:128, n:1-3, pp:305-316 [Journal]

  31. On a class of completable partial edge-colourings. [Citation Graph (, )][DBLP]


  32. The strong chromatic number of partial triple systems. [Citation Graph (, )][DBLP]


  33. Perfect dexagon triple systems. [Citation Graph (, )][DBLP]


  34. The chromatic number of 5-valent circulants. [Citation Graph (, )][DBLP]


  35. Steiner almost self-complementary graphs and halving near-Steiner triple systems. [Citation Graph (, )][DBLP]


Search in 0.066secs, Finished in 0.069secs
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