The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1993, volume: 114, number: 1-3


  1. Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:1-2 [Journal]
  2. Noga Alon, Yair Caro, Ilia Krasikov
    Bisection of trees and sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:3-7 [Journal]
  3. D. Amar
    Irregularity strength of regular graphs of large degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:9-17 [Journal]
  4. Krystyna T. Balinska, Louis V. Quintas
    The sequential generation of random f-graphs. distributions and predominant types of edge maximal f-graphs with f>;4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:19-22 [Journal]
  5. Alexander Belfer, Martin Charles Golumbic
    Counting endpoint sequences for interval orders and interval graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:23-39 [Journal]
  6. S. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides
    Grid intersection graphs and boxicity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:41-49 [Journal]
  7. Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat
    Connectivity of kautz networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:51-62 [Journal]
  8. J. Bond, C. Delorme
    A note on partial Cayley graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:63-74 [Journal]
  9. André Bouchet
    Recognizing locally equivalent graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:75-86 [Journal]
  10. Mark Chaimovich
    Fast exact and approximate algorithms for k-partition and scheduling independent tasks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:87-103 [Journal]
  11. Gérard D. Cohen, Gilles Zémor
    Write-isolated memories (WIMs). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:105-113 [Journal]
  12. Charles J. Colbourn, Ehab S. Elmallah
    Reliable assignments of processors to tasks and factoring on matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:115-129 [Journal]
  13. Italo J. Dejter, Walter Cedeño, V. Jauregui
    A note on frucht diagrams, boolean graphs and hamilton cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:131-135 [Journal]
  14. C. Delorme
    Eigenvalues of finite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:137-146 [Journal]
  15. P. Esqué, F. Aguiló, M. A. Fiol
    Double commutative-step digraphs with minimum diameters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:147-157 [Journal]
  16. Philippe Flajolet, Michèle Soria
    General combinatorial schemas: Gaussian limit distributions and exponential tails. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:159-180 [Journal]
  17. Jean-Luc Fouquet, Henri Thuillier
    Decomposition of 3-connected cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:181-198 [Journal]
  18. F. Franek, Vojtech Rödl
    2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:199-203 [Journal]
  19. Gregory Freiman
    New analytical results in subset-sum problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:205-217 [Journal]
  20. J. Gómez, Miguel Angel Fiol, Oriol Serra
    On large (Delta, D)-graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:219-235 [Journal]
  21. Tayuan Huang, Monique Laurent
    (s, r; mu)-nets and alternating forms graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:237-252 [Journal]
  22. François Jaeger
    Plane graphs and link invariants. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:253-264 [Journal]
  23. Leif K. Jørgensen
    Nonexistence of certain cubic graphs with small diameters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:265-273 [Journal]
  24. Mauricio Karchmer, Nathan Linial, Ilan Newman, Michael E. Saks, Avi Wigderson
    Combinatorial characterization of read-once formulae. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:275-282 [Journal]
  25. Carole S. Klein, Steven Minsker
    The super towers of Hanoi problem: large rings on small rings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:283-295 [Journal]
  26. Natalia Kogan, Abraham Berman
    Characterization of completely positive graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:297-304 [Journal]
  27. Ephraim Korach, Zvi Ostfeld
    Recognition of DFS trees: sequential and parallel algorithms with refined verifications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:305-327 [Journal]
  28. Johannes A. La Poutré, Jan van Leeuwen, Mark H. Overmars
    Maintenance of 2- and 3-edge- connected components of graphs I. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:329-359 [Journal]
  29. Rafi Levy, Eli Shamir
    A note on a counting problem arising in percolation theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:361-365 [Journal]
  30. E. Lipkin
    On subset sums of r-sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:367-377 [Journal]
  31. Maurice Nivat, Andreas Podelski
    Another variation on the common subexpression problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:379-401 [Journal]
  32. Uri N. Peled, Murali K. Srinivasan
    Poset matching - a distributive analog of independent matching. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:403-424 [Journal]
  33. Miklos Santha, Umesh V. Vazirani
    Parallel searching of multidimensional cubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:425-433 [Journal]
  34. Ron Shamir
    A fast algorithm for constructing monge sequences in transportation problems with forbidden arcs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:435-444 [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