Lou Caccetta

56 papers C 1Journal 52Unranked 3
YearRankTypeTitle / Venue / Authors
2018 J jnl
Hamiltonicity of Connected Domination Critical Graphs.
Ars Comb.
Pawaton Kaemawichanurat, Lou Caccetta
2016 J jnl
Critical graphs with respect to total domination and connected domination.
Australas. J Comb.
Pawaton Kaemawichanurat, Lou Caccetta, Nawarat Ananchuen
2014 J jnl
Equipment Selection for Surface Mining: A Review.
Interfaces
Christina N. Burt, Lou Caccetta
2013 J jnl
A Hybrid Multiobjective Differential Evolution Algorithm and Its Application to the Optimization of Grinding and Classification.
J. Appl. Math.
Yalin Wang, Xiaofang Chen, Weihua Gui, Chunhua Yang, Lou Caccetta, Honglei Xu
2013 J jnl
Extremal solutions for
Appl. Math. Lett.
Shunjie Li, Xinguang Zhang, Yonghong Wu, Lou Caccetta
2011 J jnl
Equipment selection with heterogeneous fleets for multiple-period schedules.
J. Oper. Res. Soc.
Christina N. Burt, Lou Caccetta, P. Welgama, L. Fouché
2008 J jnl
Optimal Design of All-Pass Variable Fractional-Delay Digital Filters.
IEEE Trans. Circuits Syst. I Regul. Pap.
Wei Rong Lee, Lou Caccetta, Volker Rehbock
2007 J jnl
A characterization of maximal non-k-factor-critical graphs.
Discret. Math.
Nawarat Ananchuen, Lou Caccetta, Watcharaphong Ananchuen
2006 J jnl
A unified approach to multistage frequency-response masking filter design using the WLS technique.
IEEE Trans. Signal Process.
Wei Rong Lee, Lou Caccetta, Kok Lay Teo, Volker Rehbock
2006 J jnl
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
Wei Rong Lee, Lou Caccetta, Kok Lay Teo, Volker Rehbock
2006 J jnl
Cubic and quadruple Paley graphs with the n-e.c. property.
Discret. Math.
Watcharaphong Ananchuen, Lou Caccetta
2006 J jnl
Optimal design of complex FIR filters with arbitrary magnitude and group delay responses.
IEEE Trans. Signal Process.
Wei Rong Lee, Lou Caccetta, Kok Lay Teo, Volker Rehbock
2004 J jnl
A weighted least-square-based approach to FIR filter design using the frequency-response masking technique.
IEEE Signal Process. Lett.
Wei Rong Lee, Volker Rehbock, Kok Lay Teo, Lou Caccetta
2004 J jnl
Cardinality constrained path covering problems in grid graphs.
Networks
Nicola Apollonio, Lou Caccetta, Bruno Simeone
2003 J jnl
An Improved Branch - and - Cut Algorithm for the Capacitated Vehicle Routing Problem.
Transp. Sci.
N. R. Achuthan, Lou Caccetta, Stephen P. Hill
2003 — conf
An alternating variable approach to FIR filter design with power-of-two coefficients using the frequency-response masking technique.
ISCAS (3)
Wei Rong Lee, Volker Rehbock, Kok Lay Teo, Lou Caccetta
2003 J jnl
Frequency-Response Masking Based Fir Filter Design With Power-Of-Two Coefficients And Suboptimum PWR.
J. Circuits Syst. Comput.
Wei Rong Lee, Volker Rehbock, Kok Lay Teo, Lou Caccetta
2003 J jnl
On vertex critical graphs with prescribed diameter.
J. Graph Theory
Lou Caccetta, Samy El-Batanouny, J. Huang
2002 — conf
Frequency-response masking based FIR filter design with power-of-two coefficients and optimum PWR.
ICECS
Wei Rong Lee, Volker Rehbock, Kok Lay Teo, Lou Caccetta
2002 C conf
Monomial decomposition of reachable and controllable positive linear systems.
ACC
R. Bru, Lou Caccetta, Ventsi G. Rumchev
2002 J jnl
Numerical Solution of Optimal Control Problems with Discrete-Valued System Parameters.
J. Glob. Optim.
Wei Rong Lee, Volker Rehbock, Lou Caccetta, Kok Lay Teo
2001 J jnl
A branch and cut method for the degree-constrained minimum spanning tree problem.
Networks
Lou Caccetta, Stephen P. Hill
2000 J jnl
A Survey of Reachability and Controllability for Positive Linear Systems.
Ann. Oper. Res.
Lou Caccetta, Ventsi G. Rumchev
1999 J jnl
On the vertex arboricity of graphs with prescribed size.
Australas. J Comb.
Nirmala Achuthan, N. R. Achuthan, Lou Caccetta
1998 J jnl
Orthogonal matchings.
Discret. Math.
Richard P. Anstee, Lou Caccetta
1997 J jnl
Matching extension and minimum degree.
Discret. Math.
Nawarat Ananchuen, Lou Caccetta
1996 J jnl
Efficient algorithms for reliability of a consecutive 2-out-of-r-from-n: F system.
Australas. J Comb.
Yoichi Higashiyama, Miro Kraetzl, Lou Caccetta
1996 J jnl
On mixed ramsey numbers.
Discret. Math.
Nirmala Achuthan, N. R. Achuthan, Lou Caccetta
1996 — conf
Recognizing Diameter Critical Graphs.
DMTCS
Richard P. Anstee, Lou Caccetta
1995 J jnl
A note on k-extendable graphs and independence number.
Australas. J Comb.
Nawarat Ananchuen, Lou Caccetta
1994 J jnl
Computational methods for the diameter restricted minimum weight spanning tree problem.
Australas. J Comb.
N. R. Achuthan, Lou Caccetta, P. Caccetta, James F. Geelen
1994 J jnl
On constructing graphs with a prescribed adjacency property.
Australas. J Comb.
Watcharaphong Ananchuen, Lou Caccetta
1994 J jnl
On minimally k-extendable graphs.
Australas. J Comb.
N. Anunchuen, Lou Caccetta
1994 J jnl
On the existence of almost-regular- graphs without one-factors.
Australas. J Comb.
Lou Caccetta, S. Mardiyono
1993 J jnl
Addendum: Minimum weight spanning trees with bounded diameter.
Australas. J Comb.
N. R. Achuthan, Lou Caccetta
1993 J jnl
On graphs satisfying a strong adacency property.
Australas. J Comb.
Watcharaphong Ananchuen, Lou Caccetta
1993 J jnl
On strongly edge-critical graphs of given diameter.
Australas. J Comb.
N. Anunchuen, Lou Caccetta
1992 J jnl
Deficiencies of connected regular triangle free graphs.
Australas. J Comb.
Lou Caccetta, Purwanto
1992 J jnl
Graphs of maximum diameter.
Discret. Math.
Lou Caccetta, W. F. Smyth
1992 J jnl
Graphs with a prescribed adjacency property.
Australas. J Comb.
Watcharaphong Ananchuen, Lou Caccetta
1992 J jnl
Minimum weight spanning trees with bounded diameter.
Australas. J Comb.
N. R. Achuthan, Lou Caccetta
1992 J jnl
On critically k-extendable graphs.
Australas. J Comb.
N. Anunchuen, Lou Caccetta
1992 J jnl
Premature sets of one-factors.
Australas. J Comb.
Lou Caccetta, S. Mardiyono
1992 J jnl
The characterization of edge-maximal critically k-edge connected graphs.
Australas. J Comb.
K. Budayasa, Lou Caccetta, K. Vijayan
1991 J jnl
Deficiencies of r-regular k-edge-connected graphs.
Australas. J Comb.
Lou Caccetta, Purwanto
1991 J jnl
Long cycles in subgraphs with prescribed minimum degree.
Discret. Math.
Lou Caccetta, K. Vijayan
1991 J jnl
Maximal cycles in graphs.
Discret. Math.
Lou Caccetta, K. Vijayan
1991 J jnl
Minimal graphs with prescribed vertex independence and clique numbers.
Australas. J Comb.
Lou Caccetta, K. Vijayan
1990 J jnl
Deficiencies and vertex clique covering numbers of a family of trees.
Australas. J Comb.
Lou Caccetta, Purwanto
1990 J jnl
On critically k-edge-connected graphs.
Australas. J Comb.
K. Budayasa, Lou Caccetta
1990 J jnl
On maximal sets of one-factors.
Australas. J Comb.
Lou Caccetta, S. Mardiyono
1990 J jnl
On the Nordhaus-Gaddum class problems.
Australas. J Comb.
Nirmala Achuthan, N. R. Achuthan, Lou Caccetta
1990 J jnl
Regular graphs with prescribed chromatic number.
J. Graph Theory
Lou Caccetta, Norman J. Pullman
1988 J jnl
An application of discrete mathematics in the design of an open pit mine.
Discret. Appl. Math.
Lou Caccetta, L. M. Giannini
1988 J jnl
Graphs with unavoidable subgraphs with large degrees.
J. Graph Theory
Lou Caccetta, Paul Erdös, K. Vijayan
1976 J jnl
Extremal graphs of diameter 4.
J. Comb. Theory B
Lou Caccetta