Manoj K. Chari

According to our database, Manoj K. Chari authored at least 10 papers between 1993 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Introduction: 2025 Franz Edelman Award for Achievement in Advanced Analytics, Operations Research, and Management Science.

Irvin Lustig, Pelin Pekgün, Manoj K. Chari

INFORMS J. Appl. Anal., 2026

2005

Complexes of discrete Morse functions.

Manoj K. Chari, Michael Joswig

Discret. Math., 2005

2000

On discrete Morse functions and combinatorial decompositions.

Manoj K. Chari

Discret. Math., 2000

1997

Counting Problems Associated With Steiner Trees In Graphs.

J. Scott Provan, Manoj K. Chari

SIAM J. Discret. Math., 1997

1996

Calculating <i>K</i>-Connectedness Reliability Using Steiner Bounds.

Manoj K. Chari, J. Scott Provan

Math. Oper. Res., 1996

The Delta-Wye Approximation Procedure for Two-Terminal Reliability.

Manoj K. Chari, Thomas A. Feo, J. Scott Provan

Oper. Res., 1996

Reversible shellings and an inequality for h-vectors.

Manoj K. Chari

Discret. Math., 1996

1995

Matroid inequalities.

Manoj K. Chari

Discret. Math., 1995

1994

On reversible semi-Markov processes.

Manoj K. Chari

Oper. Res. Lett., 1994

1993

Steiner Complexes, Matroid Ports, and Shellability.

Manoj K. Chari

J. Comb. Theory B, 1993