Lou Caccetta

Ars Comb., 2018

2016

The Non-convex Sparse Problem with Nonnegative Constraint for Signal Reconstruction.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2016

Practical exponential set stabilization for switched nonlinear systems with multiple subsystem equilibria.

[BibT_eX]

[DOI]

J. Glob. Optim., 2016

Critical graphs with respect to total domination and connected domination.

[BibT_eX]

[DOI]

Pawaton Kaemawichanurat

Australas. J Comb., 2016

2015

Adaptive Jacobian force/position tracking for space free-flying robots with prescribed transient performance.

[BibT_eX]

[DOI]

Robotics Auton. Syst., 2015

Parameter selection for nonnegative l1 matrix/tensor sparse decomposition.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2015

Impact of price-adjustments costs on integration of pricing and production planning of multiple-products.

[BibT_eX]

[DOI]

Elham Mardaneh

Optim. Lett., 2015

Convergence analysis of a block improvement method for polynomial optimization over unit spheres.

[BibT_eX]

[DOI]

Yiju Wang

Guanglu Zhou

Numer. Linear Algebra Appl., 2015

2014

Equipment Selection for Surface Mining: A Review.

[BibT_eX]

[DOI]

Christina N. Burt

Interfaces, 2014

2013

Optimal Pricing and Production Planning for Multi-product Multi-period Systems with Backorders.

[BibT_eX]

[DOI]

Elham Mardaneh

J. Optim. Theory Appl., 2013

A Hybrid Multiobjective Differential Evolution Algorithm and Its Application to the Optimization of Grinding and Classification.

[BibT_eX]

[DOI]

J. Appl. Math., 2013

Extremal solutions for pp-Laplacian differential systems via iterative computation.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2013

2012

Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations.

[BibT_eX]

[DOI]

SIAM J. Optim., 2012

2011

An Alternative Lagrange-Dual Based Algorithm for Sparse Signal Reconstruction.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2011

Equipment selection with heterogeneous fleets for multiple-period schedules.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2011

A globally and quadratically convergent method for absolute value equations.

[BibT_eX]

[DOI]

Biao Qu

Guanglu Zhou

Comput. Optim. Appl., 2011

2010

A Superlinearly Convergent Method for a Class of Complementarity Problems with Non-Lipschitzian Functions.

[BibT_eX]

[DOI]

Guanglu Zhou

Kok Lay Teo

SIAM J. Optim., 2010

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

[BibT_eX]

[DOI]

Graphs Comb., 2010

2008

Optimal Design of All-Pass Variable Fractional-Delay Digital Filters.

[BibT_eX]

[DOI]

Wei Rong Lee

Volker Rehbock

IEEE Trans. Circuits Syst. I Regul. Pap., 2008

The SC.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

2007

A characterization of maximal non-k-factor-critical graphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

2006

A unified approach to multistage frequency-response masking filter design using the WLS technique.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2006

Optimal design of complex FIR filters with arbitrary magnitude and group delay responses.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2006

A weighted least squares approach to the design of FIR filters synthesized using the modified frequency response masking structure.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. II Express Briefs, 2006

Total minus domination in k-partite graphs.

[BibT_eX]

[DOI]

Liying Kang

Erfang Shan

Discret. Math., 2006

Cubic and quadruple Paley graphs with the n-e.c. property.

[BibT_eX]

[DOI]

Discret. Math., 2006

2004

A weighted least-square-based approach to FIR filter design using the frequency-response masking technique.

[BibT_eX]

[DOI]

IEEE Signal Process. Lett., 2004

Cardinality constrained path covering problems in grid graphs.

[BibT_eX]

[DOI]

Nicola Apollonio

Bruno Simeone

Networks, 2004

A positive linear discrete-time model of capacity planning and its controllability properties.

[BibT_eX]

[DOI]

Les R. Foulds

Ventsi G. Rumchev

Math. Comput. Model., 2004

2003

An Improved Branch - and - Cut Algorithm for the Capacitated Vehicle Routing Problem.

[BibT_eX]

[DOI]

Stephen P. Hill

Transp. Sci., 2003

On vertex critical graphs with prescribed diameter.

[BibT_eX]

[DOI]

Samy El-Batanouny

J. Huang

J. Graph Theory, 2003

An Application of Branch and Cut to Open Pit Mine Scheduling.

[BibT_eX]

[DOI]

Stephen P. Hill

J. Glob. Optim., 2003

Frequency-Response Masking Based Fir Filter Design With Power-Of-Two Coefficients And Suboptimum PWR.

[BibT_eX]

[DOI]

J. Circuits Syst. Comput., 2003

The ambiguity problem arising in multisensor data association.

[BibT_eX]

[DOI]

Sharlene M. Andrijich

Australas. J Comb., 2003

An alternating variable approach to FIR filter design with power-of-two coefficients using the frequency-response masking technique.

[BibT_eX]

[DOI]

Proceedings of the 2003 International Symposium on Circuits and Systems, 2003

2002

Numerical Solution of Optimal Control Problems with Discrete-Valued System Parameters.

[BibT_eX]

[DOI]

J. Glob. Optim., 2002

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

[BibT_eX]

[DOI]

Graphs Comb., 2002

Frequency-response masking based FIR filter design with power-of-two coefficients and optimum PWR.

[BibT_eX]

[DOI]

Proceedings of the 2002 9th IEEE International Conference on Electronics, 2002

Monomial decomposition of reachable and controllable positive linear systems.

[BibT_eX]

[DOI]

R. Bru

Ventsi G. Rumchev

Proceedings of the American Control Conference, 2002

2001

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

[BibT_eX]

[DOI]

Stephen P. Hill

Networks, 2001

2000

A Survey of Reachability and Controllability for Positive Linear Systems.

[BibT_eX]

[DOI]

Ventsi G. Rumchev

Ann. Oper. Res., 2000

1999

On the existence of vertex critical regular graphs of given diameter.

[BibT_eX]

[DOI]

Samy El-Batanouny

Australas. J Comb., 1999

On the vertex arboricity of graphs with prescribed size.

[BibT_eX]

[DOI]

Nirmala Achuthan

Australas. J Comb., 1999

1998

On a problem concerning ordered colourings.

[BibT_eX]

[DOI]

Discret. Math., 1998

Orthogonal matchings.

[BibT_eX]

[DOI]

Richard P. Anstee

Discret. Math., 1998

1997

Binary Labeling of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1997

Matching extension and minimum degree.

[BibT_eX]

[DOI]

Discret. Math., 1997

The maximum degree of a critical graph of diameter two.

[BibT_eX]

[DOI]

Jing Huang

Australas. J Comb., 1997

1996

On mixed ramsey numbers.

[BibT_eX]

[DOI]

Nirmala Achuthan

Discret. Math., 1996

Efficient algorithms for reliability of a consecutive 2-out-of-r-from-n: F system.

[BibT_eX]

[DOI]

Yoichi Higashiyama

Miro Kraetzl

Australas. J Comb., 1996

Positive binary labelling of graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 1996

Recognizing Diameter Critical Graphs.

[BibT_eX]

Richard P. Anstee

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.

[BibT_eX]

[DOI]

Australas. J Comb., 1995

1994

On the existence of almost-regular- graphs without one-factors.

[BibT_eX]

[DOI]

S. Mardiyono

Australas. J Comb., 1994

On minimally k-extendable graphs.

[BibT_eX]

[DOI]

N. Anunchuen

Australas. J Comb., 1994

On constructing graphs with a prescribed adjacency property.

[BibT_eX]

[DOI]

Australas. J Comb., 1994

Computational methods for the diameter restricted minimum weight spanning tree problem.

[BibT_eX]

[DOI]

Australas. J Comb., 1994

1993

On the adjacency properties of paley graphs.

[BibT_eX]

[DOI]

Networks, 1993

On strongly edge-critical graphs of given diameter.

[BibT_eX]

[DOI]

N. Anunchuen

Australas. J Comb., 1993

On graphs satisfying a strong adacency property.

[BibT_eX]

[DOI]

Australas. J Comb., 1993

Addendum: Minimum weight spanning trees with bounded diameter.

[BibT_eX]

[DOI]

Australas. J Comb., 1993

1992

Graphs of maximum diameter.

[BibT_eX]

[DOI]

W. F. Smyth

Discret. Math., 1992

Deficiencies of connected regular triangle free graphs.

[BibT_eX]

[DOI]

Purwanto

Australas. J Comb., 1992

Premature sets of one-factors.

[BibT_eX]

[DOI]

S. Mardiyono

Australas. J Comb., 1992

The characterization of edge-maximal critically k-edge connected graphs.

[BibT_eX]

[DOI]

K. Budayasa

Australas. J Comb., 1992

On critically k-extendable graphs.

[BibT_eX]

[DOI]

N. Anunchuen

Australas. J Comb., 1992

Graphs with a prescribed adjacency property.

[BibT_eX]

[DOI]

Australas. J Comb., 1992

Minimum weight spanning trees with bounded diameter.

[BibT_eX]

[DOI]

Australas. J Comb., 1992

1991

Maximal cycles in graphs.

[BibT_eX]

[DOI]

Discret. Math., 1991

Long cycles in subgraphs with prescribed minimum degree.

[BibT_eX]

[DOI]

Discret. Math., 1991

Minimal graphs with prescribed vertex independence and clique numbers.

[BibT_eX]

[DOI]

Australas. J Comb., 1991

Deficiencies of r-regular k-edge-connected graphs.

[BibT_eX]

[DOI]

Purwanto

Australas. J Comb., 1991

1990

Regular graphs with prescribed chromatic number.

[BibT_eX]

[DOI]

Norman J. Pullman

J. Graph Theory, 1990

Deficiencies and vertex clique covering numbers of a family of trees.

[BibT_eX]

[DOI]

Purwanto

Australas. J Comb., 1990

On maximal sets of one-factors.

[BibT_eX]

[DOI]

S. Mardiyono

Australas. J Comb., 1990

On critically k-edge-connected graphs.

[BibT_eX]

[DOI]

K. Budayasa

Australas. J Comb., 1990

On the Nordhaus-Gaddum class problems.

[BibT_eX]

[DOI]

Nirmala Achuthan

Australas. J Comb., 1990

1988

Graphs with unavoidable subgraphs with large degrees.

[BibT_eX]

[DOI]

Paul Erdös

J. Graph Theory, 1988

An application of discrete mathematics in the design of an open pit mine.

[BibT_eX]

[DOI]

L. M. Giannini

Discret. Appl. Math., 1988

1984

Vulnerability of communication networks.

[BibT_eX]

[DOI]

Networks, 1984

1979

On diameter critical graphs.

[BibT_eX]

[DOI]

Roland Häggkvist

Discret. Math., 1979

1976

Extremal graphs of diameter 4.

[BibT_eX]

[DOI]