Professor
Department of Mathematics
Shanghai University
Email: lastname AT gmail DOT com
Phone: +86-21-6613-4591.
Also at http://cn.linkedin.com/in/prabhumanyem
Click here for GTCO 2011 - Workshop on Graph Theory and Combinatorial Optimization
TRAVEL
February 2011: Indonesia (University of Jember, Institute of Technology at Bandung and the University of Indonesia at Jakarta).
I was on research leave at National Cheng-Kung University, Tainan, Taiwan, from January to July 2009, as a Research Associate Professor.
February-June 2008: Research leave spent at the University of Durham, UK.
July 10-14, 2007: Logic in Computer Science (LICS), Wroclaw, Poland.
December 2006: US
(San Francisco;
Lawrence, Kansas;
Charlotte, NC;
Raleigh/Durham, NC;
Jacksonville, FL;
Columbus, Ohio)
Seminar at NC State University, Raleigh
July 2006: 17th AWOCA (Australasian Workshop on Combinatorial Algorithms), Ayers Rock, Australia.
December 2005: FSTTCS, Hyderabad, India. And a visit to TIFR, Mumbai.
Sept 26-30, 2005: Australian Mathematics Society annual meeting, Perth, Western Australia (organiser for a special session on Mathematics of Computer Science).
August 21-31, 2005: India (Mumbai, Bangalore, Chennai).
July 2-13, 2005: University of Durham, UK, for the Algorithms and Complexity in Durham 2005 workshop, and visits to Kings College London and the University of Leicester.
March 25 to April 10, 2005: Visited Professor Ruey-Lin Sheu, National Cheng Kung University, Tainan, Taiwan.
Click here for the CATS 2009 homepage
CATS
2008 (Computing: The Australasian Theory Symposium), held
at the University of Wollongong, NSW, Australia, January 22-25, 2008.
The
16th Australasian
Workshop on Combinatorial Algorithms (AWOCA) 2005, held in
Ballarat in September'05.
Masters
Indian
Institute of Technology, Kanpur, India 1991
Ph.D.
Operations
Research with Computer Science minor, North
Carolina State University, Raleigh,
NC, USA, 1996
And then..... Research Fellow, School of Maths and Stats, University of South Australia, Adelaide, 1999-2004.
I used to teach Limits
of Computing (undergraduate course in Automata Theory,
Languages and Computability) in the School
of Computer Science at UniSA.
Recent Work:
Special issue of CJTCS, the Chicago Journal of Theoretical Computer Science
devoted to CATS 2009. Guest Editors: Rod Downey and Prabhu Manyem
Book Published: Routing Problems in Multicast Networks (my PhD thesis),
VDM Verlag, 2010;
Available through Amazon
ESO universal Horn formulae: machine level versus structure level
hierarchy
ArXiv version.
Duality Gap, Computational Complexity and NP Completeness: A Survey
ArXiv version.
Lower Bounds on Syntactic Logic Expressions for Optimization
Problems and Duality (using Lagrangian Dual) to characterize optimality
conditions
ArXiv version.
Polynomial Time Maximization Classes: Syntactic Hierarchy (co-authored
with Orestes Bueno), Fundamenta
Informaticae, Volume 84, No.1, pages 111-133, 2008.
Syntactic Characterizations of Polynomial-Time Optimization Classes, Chicago Journal of Theoretical Computer
Science, Volume 2008, No.2, pages 1-23, 2008.
I used to serve
as the editor of E-Newsletters
of CMSA (Combinatorial Mathematics Society of Australasia).
Ubuntu Linux (free)
Avoid Microsoft Office. Use Google
Docs which is free.
For more info, see
my Google site.
Education
Undergraduate
Indian
Institute of Technology, New Delhi, India 1988
Teaching
During 2005-09, I taught the following
subjects at the University of Ballarat, Australia:
Linear Programming and Game Theory, Discrete Mathematics, Calculus,
and Geometry.
Research Interests
Combinatorial (Discrete) Optimisation, Computational
Complexity, Approximability and Approximation Algorithms, Logic, Game
Theory.
Research Students
Grants
Other Interests
Last Update of this page: The stone ages
(If you use the lynx browser,
just press the "=" key to get the date of last update).