Lou Caccetta

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

2016
The Non-convex Sparse Problem with Nonnegative Constraint for Signal Reconstruction.
J. Optimization Theory and Applications, 2016

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

Critical graphs with respect to total domination and connected domination.
Australasian J. Combinatorics, 2016

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

Parameter selection for nonnegative l1 matrix/tensor sparse decomposition.
Oper. Res. Lett., 2015

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

Convergence analysis of a block improvement method for polynomial optimization over unit spheres.
Numerical Lin. Alg. with Applic., 2015

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

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

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

Extremal solutions for pp-Laplacian differential systems via iterative computation.
Appl. Math. Lett., 2013

2012
Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations.
SIAM Journal on Optimization, 2012

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

Equipment selection with heterogeneous fleets for multiple-period schedules.
JORS, 2011

A globally and quadratically convergent method for absolute value equations.
Comp. Opt. and Appl., 2011

2010
A Superlinearly Convergent Method for a Class of Complementarity Problems with Non-Lipschitzian Functions.
SIAM Journal on Optimization, 2010

A Characterization of 3-(gammac, 2)-Critical Claw-Free Graphs Which are not 3-gammac-Critical.
Graphs and Combinatorics, 2010

2008
Optimal Design of All-Pass Variable Fractional-Delay Digital Filters.
IEEE Trans. on Circuits and Systems, 2008

The SC.
Oper. Res. Lett., 2008

2007
A characterization of maximal non-k-factor-critical graphs.
Discrete Mathematics, 2007

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

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

A weighted least squares approach to the design of FIR filters synthesized using the modified frequency response masking structure.
IEEE Trans. on Circuits and Systems, 2006

Total minus domination in k-partite graphs.
Discrete Mathematics, 2006

Cubic and quadruple Paley graphs with the n-e.c. property.
Discrete Mathematics, 2006

2004
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.
Mathematical and Computer Modelling, 2004

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

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

An Application of Branch and Cut to Open Pit Mine Scheduling.
J. Global Optimization, 2003

Frequency-Response Masking Based Fir Filter Design With Power-Of-Two Coefficients And Suboptimum PWR.
Journal of Circuits, Systems, and Computers, 2003

The ambiguity problem arising in multisensor data association.
Australasian J. Combinatorics, 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

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

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

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

2000
A Survey of Reachability and Controllability for Positive Linear Systems.
Annals OR, 2000

1999
On the existence of vertex critical regular graphs of given diameter.
Australasian J. Combinatorics, 1999

On the vertex arboricity of graphs with prescribed size.
Australasian J. Combinatorics, 1999

1998
On a problem concerning ordered colourings.
Discrete Mathematics, 1998

Orthogonal matchings.
Discrete Mathematics, 1998

1997
Binary Labeling of Graphs.
Graphs and Combinatorics, 1997

Matching extension and minimum degree.
Discrete Mathematics, 1997

The maximum degree of a critical graph of diameter two.
Australasian J. Combinatorics, 1997

1996
On mixed ramsey numbers.
Discrete Mathematics, 1996

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

Positive binary labelling of graphs.
Australasian J. Combinatorics, 1996

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

1995
A note on k-extendable graphs and independence number.
Australasian J. Combinatorics, 1995

1994
On the existence of almost-regular- graphs without one-factors.
Australasian J. Combinatorics, 1994

On minimally k-extendable graphs.
Australasian J. Combinatorics, 1994

On constructing graphs with a prescribed adjacency property.
Australasian J. Combinatorics, 1994

Computational methods for the diameter restricted minimum weight spanning tree problem.
Australasian J. Combinatorics, 1994

1993
On the adjacency properties of paley graphs.
Networks, 1993

On strongly edge-critical graphs of given diameter.
Australasian J. Combinatorics, 1993

On graphs satisfying a strong adacency property.
Australasian J. Combinatorics, 1993

Addendum: Minimum weight spanning trees with bounded diameter.
Australasian J. Combinatorics, 1993

1992
Graphs of maximum diameter.
Discrete Mathematics, 1992

Deficiencies of connected regular triangle free graphs.
Australasian J. Combinatorics, 1992

Premature sets of one-factors.
Australasian J. Combinatorics, 1992

The characterization of edge-maximal critically k-edge connected graphs.
Australasian J. Combinatorics, 1992

On critically k-extendable graphs.
Australasian J. Combinatorics, 1992

Graphs with a prescribed adjacency property.
Australasian J. Combinatorics, 1992

Minimum weight spanning trees with bounded diameter.
Australasian J. Combinatorics, 1992

1991
Maximal cycles in graphs.
Discrete Mathematics, 1991

Long cycles in subgraphs with prescribed minimum degree.
Discrete Mathematics, 1991

Minimal graphs with prescribed vertex independence and clique numbers.
Australasian J. Combinatorics, 1991

Deficiencies of r-regular k-edge-connected graphs.
Australasian J. Combinatorics, 1991

1990
Regular graphs with prescribed chromatic number.
Journal of Graph Theory, 1990

Deficiencies and vertex clique covering numbers of a family of trees.
Australasian J. Combinatorics, 1990

On maximal sets of one-factors.
Australasian J. Combinatorics, 1990

On critically k-edge-connected graphs.
Australasian J. Combinatorics, 1990

On the Nordhaus-Gaddum class problems.
Australasian J. Combinatorics, 1990

1988
Graphs with unavoidable subgraphs with large degrees.
Journal of Graph Theory, 1988

An application of discrete mathematics in the design of an open pit mine.
Discrete Applied Mathematics, 1988

1984
Vulnerability of communication networks.
Networks, 1984

1979
On diameter critical graphs.
Discrete Mathematics, 1979

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


  Loading...