The SCEAS System
Navigation Menu

Journals in DBLP

Eur. J. Comb.
2005, volume: 26, number: 5

  1. Masaaki Harada, Masaaki Kitazume, Akihiro Munemasa, Boris Venkov
    On some self-dual codes and unimodular lattices in dimension 48. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:543-557 [Journal]
  2. David J. Grynkiewicz
    Quasi-periodic decompositions and the Kemperman structure theorem. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:559-575 [Journal]
  3. Eugenia O'Reilly Regueiro
    Biplanes with flag-transitive automorphism groups of almost simple type, with alternating or sporadic socle. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:577-584 [Journal]
  4. David Eppstein
    The lattice dimension of a graph. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:585-592 [Journal]
  5. Jin Ho Kwak, Jaeun Lee, Moo Young Sohn
    Bartholdi zeta functions of graph bundles having regular fibers. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:593-605 [Journal]
  6. Béla Bollobás, Oleg Pikhurko
    Integer sets with prescribed pairwise differences being distinct. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:607-616 [Journal]
  7. Yi Wang, Yeong-Nan Yeh
    Proof of a conjecture on unimodality. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:617-627 [Journal]
  8. Koichi Betsumiya, YoungJu Choie
    Codes over F4, Jacobi forms and Hilbert-Siegel modular forms over Q(sqrt(5)). [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:629-650 [Journal]
  9. Valery A. Liskovets, Timothy R. S. Walsh
    Counting unrooted loopless planar maps. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:651-663 [Journal]
  10. Jennifer D. Key, T. P. McDonough, Vassili C. Mavron
    Partial permutation decoding for codes from finite planes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:665-682 [Journal]
  11. Dieter Betten, Rainer Löwen
    Proof of the oval conjecture for proper planar partition surfaces. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:683-692 [Journal]
  12. Andreas M. Hinz, Sandi Klavzar, Uros Milutinovic, Daniele Parisse, Ciril Petr
    Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:693-708 [Journal]
  13. Kris Coolsaet
    A distance regular graph with intersection array (21, 16, 8;1, 4, 14) does not exist. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:709-716 [Journal]
  14. Akira Hiraki
    Applications of the retracing method for distance-regular graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:717-727 [Journal]
  15. Federico Incitti
    Bruhat order on classical Weyl groups: minimal chains and covering relation. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:729-753 [Journal]
  16. António Guedes de Oliveira, Diogo Oliveira e Silva
    Note on the integer geometry of bitwise XOR. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:755-763 [Journal]
  17. Jan Hubicka, Jaroslav Nesetril
    Universal partial order represented by means of oriented trees and other simple graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:765-778 [Journal]
  18. Ivan Izmestiev
    Extension of colorings. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:779-781 [Journal]
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