Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Louis Hakimi
Person information
- affiliation: University of California, Davis, CA, USA
- affiliation: Northwestern University, Evanston, IL, USA
- affiliation (PhD 1959): University of Illinois at Urbana-Champaign, Urbana, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1959
[b1]Seifollah Louis Hakimi:
New Techniques for Realization of Transfer Functions. University of Illinois Urbana-Champaign, USA, 1959
Journal Articles
- 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) - 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) - [j66]S. Louis Hakimi:
Graphs with given odd sets and the least number of vertices. J. Graph Theory 24(1): 81-83 (1997) - [j65]S. Louis Hakimi, Edward F. Schmeichel:
Locating replicas of a database on a network. Networks 30(1): 31-36 (1997) - [j64]Zhengyu Ge, S. Louis Hakimi:
Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs. SIAM J. Comput. 26(1): 79-92 (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
- [j59]Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi:
Edge-disjoint packings of graphs. Discret. Appl. Math. 50(2): 135-148 (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) - [j56]Anindo Bagchi, S. Louis Hakimi:
Information Dissemination in Distributed Systems With Faulty Units. IEEE Trans. Computers 43(6): 698-710 (1994) - 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) - [j50]Anindo Bagchi, S. Louis Hakimi:
Data Transfers in Broadcast Networks. IEEE Trans. Computers 41(7): 842-847 (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) - [j48]Martine Labbé, S. Louis Hakimi:
Market and Locational Equilibrium for Two Competitors. Oper. Res. 39(5): 749-756 (1991) - 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) - [j44]Tai-Ching Tuan, S. Louis Hakimi:
River Routing with a Small Number of Jogs. SIAM J. Discret. Math. 3(4): 585-597 (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
- [j42]Hyeong-Ah Choi, S. Louis Hakimi:
Data Transfers in Networks. Algorithmica 3: 223-245 (1988) - [j41]Abdol-Hossein Esfahanian, S. Louis Hakimi:
On Computing a Conditional Edge-Connectivity of a Graph. Inf. Process. Lett. 27(4): 195-199 (1988) - [j40]Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou:
The complexity of searching a graph. J. ACM 35(1): 18-44 (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) - [j37]Hyeong-Ah Choi, S. Louis Hakimi:
Data transfers in networks with transceivers. Networks 18(3): 223-251 (1988) - [j36]Steven E. Kreutzer, S. Louis Hakimi:
Distributed Diagnosis and the System User. IEEE Trans. Computers 37(1): 71-78 (1988) - 1987
- [j35]Hyeong-Ah Choi, S. Louis Hakimi:
Data transfers in networks with transceivers. Networks 17(4): 393-421 (1987) - [j34]Hyeong-Ah Choi, S. Louis Hakimi:
Scheduling File Transfers for Trees and Odd Cycles. SIAM J. Comput. 16(1): 162-168 (1987) - 1986
- [j33]Steven E. Kreutzer, S. Louis Hakimi:
System-level diagnosis: Analysis of two new models. Inf. Sci. 40(2): 117-130 (1986) - [j32]S. Louis Hakimi, Oded Kariv:
A generalization of edge-coloring in graphs. J. Graph Theory 10(2): 139-154 (1986) - 1985
- [j31]Abdol-Hossein Esfahanian, S. Louis Hakimi:
Fault-Tolerant Routing in DeBruijn Communication Networks. IEEE Trans. Computers 34(9): 777-788 (1985) - 1984
- [j30]S. Louis Hakimi, Edward F. Schmeichel:
An Adaptive Algorithm for System Level Diagnosis. J. Algorithms 5(4): 526-530 (1984) - [j29]Abdol-Hossein Esfahanian, S. Louis Hakimi:
On computing the connectivities of graphs and digraphs. Networks 14(2): 355-366 (1984) - [j28]S. Louis Hakimi, Oded Kariv:
Midwest theory of computation symposium: on a generalization of edge-coloring in graphs. SIGACT News 15(4): 60 (1984) - [j27]S. Louis Hakimi, Oded Kariv:
Midwest theory of computation symposium: on a generalization of edge-coloring in graphs. SIGACT News 16(1): 60 (1984) - [j26]S. Louis Hakimi, Kazuo Nakajima:
On Adaptive System Diagnosis. IEEE Trans. Computers 33(3): 234-240 (1984) - 1982
- [j25]Kazuo Nakajima, S. Louis Hakimi:
Complexity Results for Scheduling Tasks with Discrete Starting Times. J. Algorithms 3(4): 344-361 (1982) - [j24]Katsuto Nakajima, S. Louis Hakimi, Jan Karel Lenstra:
Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines. SIAM J. Comput. 11(3): 512-520 (1982) - 1981
- [j23]Kyung-Yong Chwa, S. Louis Hakimi:
Schemes for Fault-Tolerant Computing: A Comparison of Modularly Redundant and t-Diagnosable Systems. Inf. Control. 49(3): 212-238 (1981) - [j22]Simeon C. Ntafos, S. Louis Hakimi:
On Structured Digraphs and Program Testing. IEEE Trans. Computers 30(1): 67-77 (1981) - [j21]Kyung-Yong Chwa, S. Louis Hakimi:
On Fault Identification in Diagnosable Systems. IEEE Trans. Computers 30(6): 414-422 (1981) - [j20]Simeon C. Ntafos, S. Louis Hakimi:
On the complexity of some coding problems. IEEE Trans. Inf. Theory 27(6): 794-796 (1981) - 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) - [j17]Simeon C. Ntafos, S. Louis Hakimi:
On Path Cover Problems in Digraphs and Applications to Program Testing. IEEE Trans. Software Eng. 5(5): 520-529 (1979) - 1978
- [j16]Seifollah Louis Hakimi, Edward F. Schmeichel:
On the connectivity of maximal planar graphs. J. Graph Theory 2(4): 307-314 (1978) - [j15]Shachindra N. Maheshwari, S. Louis Hakimi:
Corrections and Comments on "On Models for Diagnosable Systems and Probabilistic Fault Diagnosis". IEEE Trans. Computers 27(3): 287 (1978) - 1976
- [j14]A. N. Patrinos, S. Louis Hakimi:
Relations between graphs and integer-pair sequences. Discret. Math. 15(4): 347-358 (1976) - [j13]Shachindra N. Maheshwari, S. Louis Hakimi:
On Models for Diagnosable Systems and Probabilistic Fault Diagnosis. IEEE Trans. Computers 25(3): 228-236 (1976) - 1975
- [j12]S. Louis Hakimi:
The Program, Conclusions and Recommendations. Networks 5(4): 1-6 (1975) - 1974
- [j11]S. Louis Hakimi, Ashok T. Amin:
Characterization of Connection Assignment of Diagnosable Systems. IEEE Trans. Computers 23(1): 86-88 (1974) - 1973
- [j10]S. Louis Hakimi, Ashok T. Amin:
On the design of reliable networks. Networks 3(3): 241-260 (1973) - 1972
- [j9]S. Louis Hakimi, Shachindra N. Maheshwari:
Optimum Locations of Centers in Networks. Oper. Res. 20(5): 967-973 (1972) - 1971
- [j8]S. Louis Hakimi:
Steiner's problem in graphs and its implications. Networks 1(2): 113-133 (1971) - [j7]L. S. Bobrow, S. Louis Hakimi:
Graph theoretic q -ary codes (Corresp.). IEEE Trans. Inf. Theory 17(2): 215-218 (1971) - 1969
- [j6]L. S. Bobrow, S. Louis Hakimi:
Graph Theoretic Prefix Codes and Their Synchronizing Properties. Inf. Control. 15(1): 70-94 (1969) - [j5]J. F. Desler, S. Louis Hakimi:
A Graph-Theoretic Approach to a Class of Integer-Programming Problems. Oper. Res. 17(6): 1017-1033 (1969) - [j4]S. Louis Hakimi, Jon G. Bredeson:
Ternary graph theoretic error-correcting codes (Corresp.). IEEE Trans. Inf. Theory 15(3): 435-436 (1969) - 1968
- [j3]Seifollah Louis Hakimi, Jon G. Bredeson:
Graph theoretic error-correcting codes. IEEE Trans. Inf. Theory 14(4): 584-591 (1968) - 1967
- [j2]Jon G. Bredeson, Seifollah Louis Hakimi:
Decoding of graph theoretic codes (Corresp.). IEEE Trans. Inf. Theory 13(2): 348-349 (1967) - 1965
- [j1]Seifollah Louis Hakimi, H. Frank:
Cut-set matrices and linear codes (Corresp.). IEEE Trans. Inf. Theory 11(3): 457-458 (1965)
Conference and Workshop Papers
- 1994
- [c5]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Gossiping with Multiple Sends and Receives. IPPS 1994: 757-761 - 1991
- [c4]Anindo Bagchi, S. Louis Hakimi:
An Optimal Algorithm for Distributed System Level Diagnosis. FTCS 1991: 214-221 - [c3]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Parallel algorithms for information dissemination by packets. SPDP 1991: 274-281 - 1988
- [c2]Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan:
On minimizing testing rounds for fault identification. FTCS 1988: 266-271 - 1981
- [c1]Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou:
The Complexity of Searching a Graph (Preliminary Version). FOCS 1981: 376-385
Reference Works
- 1999
- [r1]Beth Novick, S. Louis Hakimi, Sunil Chopra, David Simchi-Levi, Salah E. Elmaghraby, Michael Mesterton-Gibbons, Joseph R. Barr:
Discrete Optimization. Handbook of Discrete and Combinatorial Mathematics 1999
Informal and Other Publications
- 2002
- [i1]S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young:
Orienting Graphs to Optimize Reachability. CoRR cs.DS/0205042 (2002)
Coauthor Index
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 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
