Lou Caccetta

According to our database1, Lou Caccetta authored at least 81 papers between 1976 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Hamiltonicity of Connected Domination Critical Graphs.
Ars Comb., 2018

The Non-convex Sparse Problem with Nonnegative Constraint for Signal Reconstruction.
J. Optim. Theory Appl., 2016

Practical exponential set stabilization for switched nonlinear systems with multiple subsystem equilibria.
J. Glob. Optim., 2016

Critical graphs with respect to total domination and connected domination.
Australas. J Comb., 2016

Adaptive Jacobian force/position tracking for space free-flying robots with prescribed transient performance.
Robotics Auton. Syst., 2015

Parameter selection for nonnegative l<sub>1</sub> matrix/tensor sparse decomposition.
Oper. Res. Lett., 2015

Impact of price-adjustments costs on integration of pricing and production planning of multiple-products.
Optim. Lett., 2015

Convergence analysis of a block improvement method for polynomial optimization over unit spheres.
Numer. Linear Algebra Appl., 2015

Equipment Selection for Surface Mining: A Review.
Interfaces, 2014

Optimal Pricing and Production Planning for Multi-product Multi-period Systems with Backorders.
J. Optim. Theory Appl., 2013

A Hybrid Multiobjective Differential Evolution Algorithm and Its Application to the Optimization of Grinding and Classification.
J. Appl. Math., 2013

Extremal solutions for <i>p</i>p-Laplacian differential systems via iterative computation.
Appl. Math. Lett., 2013

Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations.
SIAM J. Optim., 2012

An Alternative Lagrange-Dual Based Algorithm for Sparse Signal Reconstruction.
IEEE Trans. Signal Process., 2011

Equipment selection with heterogeneous fleets for multiple-period schedules.
J. Oper. Res. Soc., 2011

A globally and quadratically convergent method for absolute value equations.
Comput. Optim. Appl., 2011

A Superlinearly Convergent Method for a Class of Complementarity Problems with Non-Lipschitzian Functions.
SIAM J. Optim., 2010

A Characterization of 3-(<i>gamma</i><sub><i>c</i></sub>, 2)-Critical Claw-Free Graphs Which are not 3-<i>gamma</i><sub><i>c</i></sub>-Critical.
Graphs Comb., 2010

Optimal Design of All-Pass Variable Fractional-Delay Digital Filters.
IEEE Trans. Circuits Syst. I Regul. Pap., 2008

The SC.
Oper. Res. Lett., 2008

A characterization of maximal non-k-factor-critical graphs.
Discret. Math., 2007

A unified approach to multistage frequency-response masking filter design using the WLS technique.
IEEE Trans. Signal Process., 2006

Optimal design of complex FIR filters with arbitrary magnitude and group delay responses.
IEEE Trans. Signal Process., 2006

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, 2006

Total minus domination in k-partite graphs.
Discret. Math., 2006

Cubic and quadruple Paley graphs with the n-e.c. property.
Discret. Math., 2006

A weighted least-square-based approach to FIR filter design using the frequency-response masking technique.
IEEE Signal Process. Lett., 2004

Cardinality constrained path covering problems in grid graphs.
Networks, 2004

A positive linear discrete-time model of capacity planning and its controllability properties.
Math. Comput. Model., 2004

An Improved Branch - and - Cut Algorithm for the Capacitated Vehicle Routing Problem.
Transp. Sci., 2003

On vertex critical graphs with prescribed diameter.
J. Graph Theory, 2003

An Application of Branch and Cut to Open Pit Mine Scheduling.
J. Glob. Optim., 2003

Frequency-Response Masking Based Fir Filter Design With Power-Of-Two Coefficients And Suboptimum PWR.
J. Circuits Syst. Comput., 2003

The ambiguity problem arising in multisensor data association.
Australas. J Comb., 2003

An alternating variable approach to FIR filter design with power-of-two coefficients using the frequency-response masking technique.
Proceedings of the 2003 International Symposium on Circuits and Systems, 2003

Numerical Solution of Optimal Control Problems with Discrete-Valued System Parameters.
J. Glob. Optim., 2002

Edge Maximal Non-Bipartite Graphs Without Odd Cycles of Prescribed Lengths.
Graphs Comb., 2002

Frequency-response masking based FIR filter design with power-of-two coefficients and optimum PWR.
Proceedings of the 2002 9th IEEE International Conference on Electronics, 2002

A branch and cut method for the degree-constrained minimum spanning tree problem.
Networks, 2001

A Survey of Reachability and Controllability for Positive Linear Systems.
Ann. Oper. Res., 2000

On the existence of vertex critical regular graphs of given diameter.
Australas. J Comb., 1999

On the vertex arboricity of graphs with prescribed size.
Australas. J Comb., 1999

On a problem concerning ordered colourings.
Discret. Math., 1998

Orthogonal matchings.
Discret. Math., 1998

Binary Labeling of Graphs.
Graphs Comb., 1997

Matching extension and minimum degree.
Discret. Math., 1997

The maximum degree of a critical graph of diameter two.
Australas. J Comb., 1997

On mixed ramsey numbers.
Discret. Math., 1996

Efficient algorithms for reliability of a consecutive 2-out-of-r-from-n: F system.
Australas. J Comb., 1996

Positive binary labelling of graphs.
Australas. J Comb., 1996

Recognizing Diameter Critical Graphs.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

A note on k-extendable graphs and independence number.
Australas. J Comb., 1995

On the existence of almost-regular- graphs without one-factors.
Australas. J Comb., 1994

On minimally k-extendable graphs.
Australas. J Comb., 1994

On constructing graphs with a prescribed adjacency property.
Australas. J Comb., 1994

Computational methods for the diameter restricted minimum weight spanning tree problem.
Australas. J Comb., 1994

On the adjacency properties of paley graphs.
Networks, 1993

On strongly edge-critical graphs of given diameter.
Australas. J Comb., 1993

On graphs satisfying a strong adacency property.
Australas. J Comb., 1993

Addendum: Minimum weight spanning trees with bounded diameter.
Australas. J Comb., 1993

Graphs of maximum diameter.
Discret. Math., 1992

Deficiencies of connected regular triangle free graphs.
Australas. J Comb., 1992

Premature sets of one-factors.
Australas. J Comb., 1992

The characterization of edge-maximal critically k-edge connected graphs.
Australas. J Comb., 1992

On critically k-extendable graphs.
Australas. J Comb., 1992

Graphs with a prescribed adjacency property.
Australas. J Comb., 1992

Minimum weight spanning trees with bounded diameter.
Australas. J Comb., 1992

Maximal cycles in graphs.
Discret. Math., 1991

Long cycles in subgraphs with prescribed minimum degree.
Discret. Math., 1991

Minimal graphs with prescribed vertex independence and clique numbers.
Australas. J Comb., 1991

Deficiencies of r-regular k-edge-connected graphs.
Australas. J Comb., 1991

Regular graphs with prescribed chromatic number.
J. Graph Theory, 1990

Deficiencies and vertex clique covering numbers of a family of trees.
Australas. J Comb., 1990

On maximal sets of one-factors.
Australas. J Comb., 1990

On critically k-edge-connected graphs.
Australas. J Comb., 1990

On the Nordhaus-Gaddum class problems.
Australas. J Comb., 1990

Graphs with unavoidable subgraphs with large degrees.
J. Graph Theory, 1988

An application of discrete mathematics in the design of an open pit mine.
Discret. Appl. Math., 1988

Vulnerability of communication networks.
Networks, 1984

On diameter critical graphs.
Discret. Math., 1979

Extremal graphs of diameter 4.
J. Comb. Theory, Ser. B, 1976