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

Search the dblp DataBase

Title:
Author:
Edward F. Schmeichel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
    Gossiping with Multiple Sends and Receives. [Citation Graph (0, 0)][DBLP]
    IPPS, 1994, pp:757-761 [Conf]
  2. E. Gocka, W. Kirchherr, Edward F. Schmeichel
    A Note on the Road-Coloring Conjecture. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:49, n:, pp:- [Journal]
  3. S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
    Short Proofs of Theorems of Nash-Williams and Tutte. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:50, n:, pp:- [Journal]
  4. S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
    Orienting Graphs to Optimize Reachability [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  5. S. Louis Hakimi, Edward F. Schmeichel
    Fitting polygonal functions to a set of points in the plane. [Citation Graph (0, 0)][DBLP]
    CVGIP: Graphical Model and Image Processing, 1991, v:53, n:2, pp:132-136 [Journal]
  6. Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
    Gossiping with Multiple Sends and Receives. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:64, n:2, pp:105-116 [Journal]
  7. Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel
    Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:13-23 [Journal]
  8. Douglas Bauer, Willem-Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel
    The Complexity of Recognizing Tough Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:35-44 [Journal]
  9. Douglas Bauer, Hajo Broersma, N. Kahl, Aurora Morgana, Edward F. Schmeichel, T. Surowiec
    Tutte sets in graphs II: The complexity of finding maximum Tutte sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1336-1343 [Journal]
  10. William C. Coffman, S. Louis Hakimi, Edward F. Schmeichel
    Bounds for the chromatic number of graphs with partial information. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:47-59 [Journal]
  11. Douglas Bauer, Hajo Broersma, Edward F. Schmeichel
    Toughness in Graphs - A Survey. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:1, pp:1-35 [Journal]
  12. Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
    Parallel Algorithms for Gossiping by Mail. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:4, pp:197-202 [Journal]
  13. S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
    Orienting Graphs to Optimize Reachability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:5, pp:229-235 [Journal]
  14. S. Louis Hakimi, Edward F. Schmeichel
    An Adaptive Algorithm for System Level Diagnosis. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:4, pp:526-530 [Journal]
  15. Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, G. Sullivan
    A Parallel Fault Identification Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:2, pp:231-241 [Journal]
  16. Douglas Bauer, Willem-Jan van den Heuvel, Edward F. Schmeichel
    Toughness and Triangle-Free Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:65, n:2, pp:208-221 [Journal]
  17. Douglas Bauer, Edward F. Schmeichel
    Hamiltonian degree conditions which imply a graph is pancyclic. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:48, n:1, pp:111-116 [Journal]
  18. Edward F. Schmeichel, S. Louis Hakimi
    A cycle structure theorem for hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:1, pp:99-107 [Journal]
  19. Edward F. Schmeichel
    The basis number of a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:2, pp:123-129 [Journal]
  20. Edward F. Schmeichel, Gary S. Bloom
    Connectivity, genus, and the number of components in vertex-deleted subgraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:198-201 [Journal]
  21. S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel
    Locations on time-varying networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:4, pp:250-257 [Journal]
  22. S. Louis Hakimi, Edward F. Schmeichel
    Locating replicas of a database on a network. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:30, n:1, pp:31-36 [Journal]
  23. Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
    Parallel Information Dissemination by Packets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:355-372 [Journal]
  24. S. Louis Hakimi, Edward F. Schmeichel
    A Note on the Vertex Arboricity of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:1, pp:64-67 [Journal]
  25. S. Ueno, Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel
    On Minimum Fault-Tolerant Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:4, pp:565-574 [Journal]
  26. Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel
    Gossigping in a Distributed Network. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1993, v:42, n:2, pp:253-256 [Journal]
  27. S. Louis Hakimi, Edward F. Schmeichel
    Improved bounds for the chromatic number of a graph. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:3, pp:217-225 [Journal]
  28. Douglas Bauer, T. Niessen, Edward F. Schmeichel
    Toughness, minimum degree, and spanning cubic subgraphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:2, pp:144- [Journal]
  29. Douglas Bauer, T. Niessen, Edward F. Schmeichel
    Toughness, minimum degree, and spanning cubic subgraphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:45, n:2, pp:119-141 [Journal]
  30. Arthur M. Hobbs, Edward F. Schmeichel
    On the maximum number of independent edges in cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:42, n:2-3, pp:317-320 [Journal]
  31. Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel
    Long cycles in graphs with large degree sums. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:79, n:1, pp:59-70 [Journal]
  32. Douglas Bauer, Aurora Morgana, Edward F. Schmeichel
    A simple proof of a theorem of Jung. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:79, n:2, pp:147-152 [Journal]
  33. Sin-Min Lee, Edward F. Schmeichel, S. C. Shee
    On felicitous graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:93, n:2-3, pp:201-209 [Journal]
  34. S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
    Star arboricity of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:93-98 [Journal]
  35. Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman
    A note on dominating cycles in 2-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:155, n:1-3, pp:13-18 [Journal]
  36. Douglas Bauer, Aurora Morgana, Edward F. Schmeichel
    On the complexity of recognizing tough graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:124, n:1-3, pp:13-17 [Journal]

  37. Parallel algorithms for information dissemination by packets. [Citation Graph (, )][DBLP]


  38. Long Cycles in 2-Connected Triangle-Free Graphs. [Citation Graph (, )][DBLP]


  39. Subdivision of Edges and Matching Size. [Citation Graph (, )][DBLP]


  40. Recognizing tough graphs is NP-hard. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
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