You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
The Nirma University Journal of Business and Management Studies (NUJBMS) is the flagship journal of the Institute of Management, Nirma University. It provides conceptual, empirical, and case-based research tailored to the needs of management scholars and practitioners researching and working in business schools and in industry. ISSN (Print): 2249-5630
All that is great about a country and all that is wrong with it can be summarised by a single wedding, says Indian photographer Mahesh Shantaram (*1977) and member of Agence VU'. In his documentary work, he mostly studies the complex societal system of his home country. Working as a wedding photographer, he had privileged access to a cross-section of celebrations of the Indian upper- and middle-class society. Young adults assume the role of princes and princesses in a Bollywood-like fantasy often choreographed by their parents. On the periphery, a multitude of workers entertain crowds, cater to thousands of guests, and keep the show going on for days. Using images culled from over 150 weddings and created in the course of six years, the photo series Matrimania constructs a fictional narrative--an alternative wedding album--that depicts one long wedding night in India. Matrimania is a personal take on 21st century India's contradictions seen through the prism of its wedding culture.
List of members and subscribers was issued, 1909-11, as a part of the Journal, v. 1-3.
The series Studies on Modern Orient provides an overview of religious, political and social phenomena in modern and contemporary Muslim societies. The volumes do not only take into account Near and Middle Eastern countries, but also explore Islam and Muslim culture in other regions of the world, for example, in Europe and the US. The series Studies on Modern Orient was founded in 2010 by Klaus Schwarz Verlag.
This book constitutes the refereed proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2002, held in Rome, Italy in September 2002. The 20 revised full papers presented were carefully reviewed and selected from 54 submissions. Among the topics addressed are design and analysis of approximation algorithms, inapproximability results, online problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and applications to game theory and other fields.