default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLou Caccetta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j78]Pawaton Kaemawichanurat, Lou Caccetta:
Hamiltonicity of Connected Domination Critical Graphs. Ars Comb. 136: 127-151 (2018)- 2016
- [j77]Pawaton Kaemawichanurat, Lou Caccetta, Nawarat Ananchuen:
Critical graphs with respect to total domination and connected domination. Australas. J Comb. 65: 1-13 (2016) - [j76]Honglei Xu, Yi Zhang, Jin Yang, Guanglu Zhou, Louis Caccetta:
Practical exponential set stabilization for switched nonlinear systems with multiple subsystem equilibria. J. Glob. Optim. 65(1): 109-118 (2016) - [j75]Yong Wang, Guanglu Zhou, Xin Zhang, Wanquan Liu
, Louis Caccetta:
The Non-convex Sparse Problem with Nonnegative Constraint for Signal Reconstruction. J. Optim. Theory Appl. 170(3): 1009-1025 (2016) - 2015
- [j74]Yiju Wang, Louis Caccetta, Guanglu Zhou:
Convergence analysis of a block improvement method for polynomial optimization over unit spheres. Numer. Linear Algebra Appl. 22(6): 1059-1076 (2015) - [j73]Elham Mardaneh, Louis Caccetta:
Impact of price-adjustments costs on integration of pricing and production planning of multiple-products. Optim. Lett. 9(1): 119-142 (2015) - [j72]Yiju Wang, Wanquan Liu, Louis Caccetta, Guanglu Zhou:
Parameter selection for nonnegative l1 matrix/tensor sparse decomposition. Oper. Res. Lett. 43(4): 423-426 (2015) - [j71]Canghua Jiang, Kok Lay Teo, Honglei Xu, Louis Caccetta, Guang-Ren Duan:
Adaptive Jacobian force/position tracking for space free-flying robots with prescribed transient performance. Robotics Auton. Syst. 72: 235-247 (2015) - 2014
- [j70]Christina N. Burt, Lou Caccetta:
Equipment Selection for Surface Mining: A Review. Interfaces 44(2): 143-162 (2014) - 2013
- [j69]Shunjie Li, Xinguang Zhang, Yonghong Wu, Lou Caccetta:
Extremal solutions for pp-Laplacian differential systems via iterative computation. Appl. Math. Lett. 26(12): 1151-1158 (2013) - [j68]Yalin Wang, Xiaofang Chen, Weihua Gui, Chunhua Yang, Lou Caccetta, Honglei Xu:
A Hybrid Multiobjective Differential Evolution Algorithm and Its Application to the Optimization of Grinding and Classification. J. Appl. Math. 2013: 841780:1-841780:15 (2013) - [j67]Elham Mardaneh, Louis Caccetta:
Optimal Pricing and Production Planning for Multi-product Multi-period Systems with Backorders. J. Optim. Theory Appl. 158(3): 896-917 (2013) - 2012
- [j66]Guanglu Zhou, Louis Caccetta, Kok Lay Teo, Soon-Yi Wu:
Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations. SIAM J. Optim. 22(3): 987-1008 (2012) - 2011
- [j65]Louis Caccetta, Biao Qu, Guanglu Zhou:
A globally and quadratically convergent method for absolute value equations. Comput. Optim. Appl. 48(1): 45-58 (2011) - [j64]Christina N. Burt, Lou Caccetta, P. Welgama, L. Fouché:
Equipment selection with heterogeneous fleets for multiple-period schedules. J. Oper. Res. Soc. 62(8): 1498-1509 (2011) - [j63]Yiju Wang, Guanglu Zhou, Louis Caccetta, Wanquan Liu:
An Alternative Lagrange-Dual Based Algorithm for Sparse Signal Reconstruction. IEEE Trans. Signal Process. 59(4): 1895-1901 (2011) - 2010
- [j62]Watcharaphong Ananchuen, Nawarat Ananchuen, Louis Caccetta:
A Characterization of 3-(gammac, 2)-Critical Claw-Free Graphs Which are not 3-gammac-Critical. Graphs Comb. 26(3): 315-328 (2010) - [j61]Guanglu Zhou, Louis Caccetta, Kok Lay Teo:
A Superlinearly Convergent Method for a Class of Complementarity Problems with Non-Lipschitzian Functions. SIAM J. Optim. 20(4): 1811-1827 (2010)
2000 – 2009
- 2008
- [j60]Chen Ling, Liqun Qi, Guanglu Zhou, Louis Caccetta:
The SC. Oper. Res. Lett. 36(4): 456-460 (2008) - [j59]Wei Rong Lee, Lou Caccetta, Volker Rehbock:
Optimal Design of All-Pass Variable Fractional-Delay Digital Filters. IEEE Trans. Circuits Syst. I Regul. Pap. 55-I(5): 1248-1256 (2008) - 2007
- [j58]Nawarat Ananchuen, Lou Caccetta, Watcharaphong Ananchuen:
A characterization of maximal non-k-factor-critical graphs. Discret. Math. 307(1): 108-114 (2007) - 2006
- [j57]Liying Kang, Erfang Shan, Louis Caccetta:
Total minus domination in k-partite graphs. Discret. Math. 306(15): 1771-1775 (2006) - [j56]Watcharaphong Ananchuen, Lou Caccetta:
Cubic and quadruple Paley graphs with the n-e.c. property. Discret. Math. 306(22): 2954-2961 (2006) - [j55]Wei Rong Lee, Lou Caccetta, Kok Lay Teo, Volker Rehbock:
A weighted least squares approach to the design of FIR filters synthesized using the modified frequency response masking structure. IEEE Trans. Circuits Syst. II Express Briefs 53-II(5): 379-383 (2006) - [j54]Wei Rong Lee, Lou Caccetta, Kok Lay Teo, Volker Rehbock:
Optimal design of complex FIR filters with arbitrary magnitude and group delay responses. IEEE Trans. Signal Process. 54(5): 1617-1628 (2006) - [j53]Wei Rong Lee, Lou Caccetta, Kok Lay Teo, Volker Rehbock:
A unified approach to multistage frequency-response masking filter design using the WLS technique. IEEE Trans. Signal Process. 54(9): 3459-3467 (2006) - 2004
- [j52]Louis Caccetta, Les R. Foulds, Ventsi G. Rumchev:
A positive linear discrete-time model of capacity planning and its controllability properties. Math. Comput. Model. 40(1-2): 217-226 (2004) - [j51]Nicola Apollonio, Lou Caccetta, Bruno Simeone:
Cardinality constrained path covering problems in grid graphs. Networks 44(2): 120-131 (2004) - [j50]Wei Rong Lee, Volker Rehbock, Kok Lay Teo, Lou Caccetta:
A weighted least-square-based approach to FIR filter design using the frequency-response masking technique. IEEE Signal Process. Lett. 11(7): 593-596 (2004) - 2003
- [j49]Sharlene M. Andrijich, Louis Caccetta:
The ambiguity problem arising in multisensor data association. Australas. J Comb. 27: 107-128 (2003) - [j48]Wei Rong Lee, Volker Rehbock, Kok Lay Teo, Lou Caccetta:
Frequency-Response Masking Based Fir Filter Design With Power-Of-Two Coefficients And Suboptimum PWR. J. Circuits Syst. Comput. 12(5): 591-599 (2003) - [j47]Louis Caccetta, Stephen P. Hill:
An Application of Branch and Cut to Open Pit Mine Scheduling. J. Glob. Optim. 27(2-3): 349-365 (2003) - [j46]Lou Caccetta, Samy El-Batanouny, J. Huang:
On vertex critical graphs with prescribed diameter. J. Graph Theory 43(2): 117-131 (2003) - [j45]N. R. Achuthan, Lou Caccetta, Stephen P. Hill:
An Improved Branch - and - Cut Algorithm for the Capacitated Vehicle Routing Problem. Transp. Sci. 37(2): 153-169 (2003) - [c4]Wei Rong Lee, Volker Rehbock, Kok Lay Teo, Lou Caccetta:
An alternating variable approach to FIR filter design with power-of-two coefficients using the frequency-response masking technique. ISCAS (3) 2003: 886-889 - 2002
- [j44]Louis Caccetta, Rui-Zhong Jia:
Edge Maximal Non-Bipartite Graphs Without Odd Cycles of Prescribed Lengths. Graphs Comb. 18(1): 75-92 (2002) - [j43]Wei Rong Lee, Volker Rehbock, Lou Caccetta, Kok Lay Teo:
Numerical Solution of Optimal Control Problems with Discrete-Valued System Parameters. J. Glob. Optim. 23(3-4): 233-244 (2002) - [c3]R. Bru, Lou Caccetta, Ventsi G. Rumchev:
Monomial decomposition of reachable and controllable positive linear systems. ACC 2002: 4620-4625 - [c2]Wei Rong Lee, Volker Rehbock, Kok Lay Teo, Lou Caccetta:
Frequency-response masking based FIR filter design with power-of-two coefficients and optimum PWR. ICECS 2002: 1175-1178 - 2001
- [j42]Lou Caccetta, Stephen P. Hill:
A branch and cut method for the degree-constrained minimum spanning tree problem. Networks 37(2): 74-83 (2001) - 2000
- [j41]Lou Caccetta, Ventsi G. Rumchev:
A Survey of Reachability and Controllability for Positive Linear Systems. Ann. Oper. Res. 98(1-4): 101-122 (2000)
1990 – 1999
- 1999
- [j40]Nirmala Achuthan, N. R. Achuthan, Lou Caccetta:
On the vertex arboricity of graphs with prescribed size. Australas. J Comb. 19: 17-36 (1999) - [j39]Louis Caccetta, Samy El-Batanouny:
On the existence of vertex critical regular graphs of given diameter. Australas. J Comb. 20: 145-162 (1999) - 1998
- [j38]Richard P. Anstee, Lou Caccetta:
Orthogonal matchings. Discret. Math. 179(1-3): 37-47 (1998) - [j37]Louis Caccetta, Rui-Zhong Jia:
On a problem concerning ordered colourings. Discret. Math. 190(1-3): 241-245 (1998) - 1997
- [j36]Louis Caccetta, Jing Huang:
The maximum degree of a critical graph of diameter two. Australas. J Comb. 16: 245-258 (1997) - [j35]Nawarat Ananchuen, Lou Caccetta:
Matching extension and minimum degree. Discret. Math. 170(1-3): 1-13 (1997) - [j34]Louis Caccetta, Rui-Zhong Jia:
Binary Labeling of Graphs. Graphs Comb. 13(2): 119-137 (1997) - 1996
- [j33]Yoichi Higashiyama, Miro Kraetzl, Lou Caccetta:
Efficient algorithms for reliability of a consecutive 2-out-of-r-from-n: F system. Australas. J Comb. 14: 31-36 (1996) - [j32]Louis Caccetta, Rui-Zhong Jia:
Positive binary labelling of graphs. Australas. J Comb. 14: 133-148 (1996) - [j31]Nirmala Achuthan, N. R. Achuthan, Lou Caccetta:
On mixed ramsey numbers. Discret. Math. 151(1-3): 3-13 (1996) - [c1]Richard P. Anstee, Lou Caccetta:
Recognizing Diameter Critical Graphs. DMTCS 1996: 105-112 - 1995
- [j30]Nawarat Ananchuen, Lou Caccetta:
A note on k-extendable graphs and independence number. Australas. J Comb. 12: 59-66 (1995) - 1994
- [j29]N. Anunchuen, Lou Caccetta:
On minimally k-extendable graphs. Australas. J Comb. 9: 153-168 (1994) - [j28]Lou Caccetta, S. Mardiyono:
On the existence of almost-regular- graphs without one-factors. Australas. J Comb. 9: 243-260 (1994) - [j27]N. R. Achuthan, Lou Caccetta, P. Caccetta, James F. Geelen:
Computational methods for the diameter restricted minimum weight spanning tree problem. Australas. J Comb. 10: 51-72 (1994) - [j26]Watcharaphong Ananchuen, Lou Caccetta:
On constructing graphs with a prescribed adjacency property. Australas. J Comb. 10: 73-84 (1994) - 1993
- [j25]N. Anunchuen, Lou Caccetta:
On strongly edge-critical graphs of given diameter. Australas. J Comb. 8: 99-122 (1993) - [j24]Watcharaphong Ananchuen, Lou Caccetta:
On graphs satisfying a strong adacency property. Australas. J Comb. 8: 153-168 (1993) - [j23]N. R. Achuthan, Lou Caccetta:
Addendum: Minimum weight spanning trees with bounded diameter. Australas. J Comb. 8: 279- (1993) - [j22]Watcharaphong Ananchuen, Louis Caccetta:
On the adjacency properties of paley graphs. Networks 23(4): 227-236 (1993) - 1992
- [j21]Lou Caccetta, Purwanto:
Deficiencies of connected regular triangle free graphs. Australas. J Comb. 5: 73-86 (1992) - [j20]K. Budayasa, Lou Caccetta, K. Vijayan:
The characterization of edge-maximal critically k-edge connected graphs. Australas. J Comb. 5: 179-208 (1992) - [j19]Lou Caccetta, S. Mardiyono:
Premature sets of one-factors. Australas. J Comb. 5: 229-252 (1992) - [j18]N. R. Achuthan, Lou Caccetta:
Minimum weight spanning trees with bounded diameter. Australas. J Comb. 5: 261-276 (1992) - [j17]N. Anunchuen, Lou Caccetta:
On critically k-extendable graphs. Australas. J Comb. 6: 39-66 (1992) - [j16]Watcharaphong Ananchuen, Lou Caccetta:
Graphs with a prescribed adjacency property. Australas. J Comb. 6: 155-176 (1992) - [j15]Lou Caccetta, W. F. Smyth:
Graphs of maximum diameter. Discret. Math. 102(2): 121-141 (1992) - 1991
- [j14]Lou Caccetta, K. Vijayan:
Minimal graphs with prescribed vertex independence and clique numbers. Australas. J Comb. 3: 15-30 (1991) - [j13]Lou Caccetta, Purwanto:
Deficiencies of r-regular k-edge-connected graphs. Australas. J Comb. 4: 199-228 (1991) - [j12]Lou Caccetta, K. Vijayan:
Long cycles in subgraphs with prescribed minimum degree. Discret. Math. 97(1-3): 69-81 (1991) - [j11]Lou Caccetta, K. Vijayan:
Maximal cycles in graphs. Discret. Math. 98(1): 1-7 (1991) - 1990
- [j10]Lou Caccetta, S. Mardiyono:
On maximal sets of one-factors. Australas. J Comb. 1: 5-14 (1990) - [j9]Lou Caccetta, Purwanto:
Deficiencies and vertex clique covering numbers of a family of trees. Australas. J Comb. 1: 15-28 (1990) - [j8]Nirmala Achuthan, N. R. Achuthan, Lou Caccetta:
On the Nordhaus-Gaddum class problems. Australas. J Comb. 2: 5-28 (1990) - [j7]K. Budayasa, Lou Caccetta:
On critically k-edge-connected graphs. Australas. J Comb. 2: 101-110 (1990) - [j6]Lou Caccetta, Norman J. Pullman:
Regular graphs with prescribed chromatic number. J. Graph Theory 14(1): 65-71 (1990)
1980 – 1989
- 1988
- [j5]Lou Caccetta, L. M. Giannini:
An application of discrete mathematics in the design of an open pit mine. Discret. Appl. Math. 21(1): 1-19 (1988) - [j4]Lou Caccetta, Paul Erdös, K. Vijayan:
Graphs with unavoidable subgraphs with large degrees. J. Graph Theory 12(1): 17-27 (1988) - 1984
- [j3]Louis Caccetta:
Vulnerability of communication networks. Networks 14(1): 141-146 (1984)
1970 – 1979
- 1979
- [j2]Louis Caccetta, Roland Häggkvist:
On diameter critical graphs. Discret. Math. 28(3): 223-229 (1979) - 1976
- [j1]Lou Caccetta:
Extremal graphs of diameter 4. J. Comb. Theory B 21(2): 104-115 (1976)
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-06-10 20:29 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:
