Остановите войну!
for scientists:
default search action
S. Louis Hakimi
- > Home > Persons > S. Louis Hakimi
Publications
- 2009
- [j74]Douglas Bauer, S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel:
Sufficient degree conditions for k-edge-connectedness of a graph. Networks 54(2): 95-98 (2009) - 2004
- [j73]S. Louis Hakimi, Edward F. Schmeichel:
Improved bounds for the chromatic number of a graph. J. Graph Theory 47(3): 217-225 (2004) - 2003
- [j72]William C. Coffman, S. Louis Hakimi, Edward F. Schmeichel:
Bounds for the chromatic number of graphs with partial information. Discret. Math. 263(1-3): 47-59 (2003) - 2002
- [i1]S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young:
Orienting Graphs to Optimize Reachability. CoRR cs.DS/0205042 (2002) - 2000
- [j71]Jerrold R. Griggs, Michael Woltermann, B. Borchers, David Callan, Robin J. Chapman, J. Chilcott, Paul Cull, A. Ferguson, K. Martin, G. G. Gagola, Solomon W. Golomb, J. Guilford, S. Louis Hakimi, Edward F. Schmeichel, J. K. Haugland, C. H. Jepson, R. Johnsonbaugh, André Kündgen, S. Levandosky, J. T. Lewis, John H. Lindsey II, O. P. Lossers, Reiner Martin, R. Morris, Gerald Myerson, José Heber Nieto, E. Rykken, J. Sorensen, J. Schlosberg, W. Seaman, J. T. Ward, Z. Zeuge:
Tiling Rectangles with Trominoes: 10641. Am. Math. Mon. 107(2): 179 (2000) - 1999
- [j70]S. Louis Hakimi, Edward F. Schmeichel:
Improved bounds for the chromatic index of graphs and multigraphs. J. Graph Theory 32(4): 311-326 (1999) - [j69]S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel:
Locations on time-varying networks. Networks 34(4): 250-257 (1999) - 1998
- [j68]S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Short Proofs of Theorems of Nash-Williams and Tutte. Ars Comb. 50 (1998) - 1997
- [j67]S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young:
Orienting Graphs to Optimize Reachability. Inf. Process. Lett. 63(5): 229-235 (1997) - [j65]S. Louis Hakimi, Edward F. Schmeichel:
Locating replicas of a database on a network. Networks 30(1): 31-36 (1997) - 1996
- [j63]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Gossiping with Multiple Sends and Receives. Discret. Appl. Math. 64(2): 105-116 (1996) - [j62]S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Star arboricity of graphs. Discret. Math. 149(1-3): 93-98 (1996) - [j61]Martine Labbé, Edward F. Schmeichel, S. Louis Hakimi:
Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126]. Oper. Res. Lett. 18(4): 205 (1996) - 1995
- [j60]S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Degree-bounded coloring of graphs: Variations on a theme by brooks. J. Graph Theory 20(2): 177-194 (1995) - 1994
- [j58]Martine Labbé, Edward F. Schmeichel, S. Louis Hakimi:
Approximation algorithms for the capacitated plant allocation problem. Oper. Res. Lett. 15(3): 115-126 (1994) - [j57]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Parallel Information Dissemination by Packets. SIAM J. Comput. 23(2): 355-372 (1994) - [c5]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Gossiping with Multiple Sends and Receives. IPPS 1994: 757-761 - 1993
- [j55]S. Louis Hakimi, Edward F. Schmeichel, Martine Labbé:
On locating path- or tree-shaped facilities on networks. Networks 23(6): 543-555 (1993) - [j54]S. Ueno, Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel:
On Minimum Fault-Tolerant Networks. SIAM J. Discret. Math. 6(4): 565-574 (1993) - [j53]Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel:
Gossigping in a Distributed Network. IEEE Trans. Computers 42(2): 253-256 (1993) - 1992
- [j52]S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel:
The Voronoi Partition of a Network and Its Implications in Location Theory. INFORMS J. Comput. 4(4): 412-417 (1992) - [j51]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Sequential information dissemination by packets. Networks 22(4): 317-333 (1992) - 1991
- [j49]S. Louis Hakimi, Edward F. Schmeichel:
Fitting polygonal functions to a set of points in the plane. CVGIP Graph. Model. Image Process. 53(2): 132-136 (1991) - [c3]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Parallel algorithms for information dissemination by packets. SPDP 1991: 274-281 - 1990
- [j47]Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel:
Recognizing tough graphs is NP-hard. Discret. Appl. Math. 28(3): 191-195 (1990) - [j46]Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Parallel Algorithms for Gossiping by Mail. Inf. Process. Lett. 34(4): 197-202 (1990) - [j45]Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan:
A Parallel Fault Identification Algorithm. J. Algorithms 11(2): 231-241 (1990) - 1989
- [j43]S. Louis Hakimi, Edward F. Schmeichel:
A Note on the Vertex Arboricity of a Graph. SIAM J. Discret. Math. 2(1): 64-67 (1989) - 1988
- [j39]Edward F. Schmeichel, S. Louis Hakimi:
A cycle structure theorem for hamiltonian graphs. J. Comb. Theory, Ser. B 45(1): 99-107 (1988) - [j38]S. Louis Hakimi, Edward F. Schmeichel:
Chromatic factorizations of a graph. J. Graph Theory 12(2): 177-182 (1988) - [c2]Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan:
On minimizing testing rounds for fault identification. FTCS 1988: 266-271 - 1984
- [j30]S. Louis Hakimi, Edward F. Schmeichel:
An Adaptive Algorithm for System Level Diagnosis. J. Algorithms 5(4): 526-530 (1984) - 1979
- [j19]Seifollah Louis Hakimi, Edward F. Schmeichel:
On the number of cycles of length k in a maximal planar graph. J. Graph Theory 3(1): 69-86 (1979) - [j18]Seifollah Louis Hakimi, Edward F. Schmeichel, Carsten Thomassen:
On the number of hamiltonian cycles in a maximal planar graph. J. Graph Theory 3(4): 365-370 (1979) - 1978
- [j16]Seifollah Louis Hakimi, Edward F. Schmeichel:
On the connectivity of maximal planar graphs. J. Graph Theory 2(4): 307-314 (1978)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-27 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint