Professor Shailesh Tipnis
Professor
- Selected Research
Journal Article
A sufficient degree condition for the existence of an anti-directed 2-factor in a directed graph
Shailesh Tipnis, Ajit A Diwan, Josh B Frye, Michael Plantholt.
Discrete Mathematics, 311, 2556-2562, (2011)
Improved sufficient conditions for the existence of anti-directed hamiltonian cycles in digraphs
Shailesh Tipnis, Arthur H Busch, Michael S Jacobson, Timothy Morris, Michael Plantholt.
Graphs and Combinatorics, (2011)
On a well-spread halving of directed multigraphs
Shailesh Tipnis, K Badheka, Michael Plantholt.
Ars Combin., 100, (2011)
The Convex Hull of Degree Sequences of Signed Graphs
Shailesh Tipnis, Heather Jordon, Richard McBride.
Discrete Mathematics, 309, 5841-5848, (2009)
Vertex-oriented Hamilton cycles in directed graphs
Shailesh Tipnis, Michael Plantholt.
The Electronic Journal of Combinatorics, 16, (2009)
Presentations
An approximation algorithm for a constrained forest problem
Shailesh Tipnis.
Discrete Mathematics group, Mumbai, , 2012
A constrained forest problem
Shailesh Tipnis.
Discrete Mathematics seminar, Online, , 2011
Anti-directed Hamilton cycles and 2-factors
Shailesh Tipnis.
25th Midwestern Conference on Combinatorics, Cryptography, and Computing, Las Vegas, October 21, 2011
Regular multigraphs of high degree and even order are 1-factorable
Shailesh Tipnis.
Department of Computer Science, Mumbai, India, June, 2010
Improved sufficient conditions for the existence of anti-directed hamiltonian cycles in
Shailesh Tipnis.
Department of Computer Science, Mumbai, India, , 2009
Directed and Anti-directed Hamilton cycles and 2 factors in digraphs
Shailesh Tipnis.
Discrete Math Group, Normal, IL, April, 2009