Search Results - "Maheshwari, Anil"

Workplace Well-being From Development of Consciousness Through Purposeful Leadership by Maheshwari, Anil K.

“…This paper constructs a model for enhancing workplace well-being (WB) from development of consciousness (DC), through purpose driven leadership (PL). A morally…”
Get full text

Higher Consciousness Management: Transcendence for Spontaneous Right Action by Maheshwari, Anil K.

“…Business organizations, managers, and all of us need to adapt to a rapidly evolving socio-technical environment and to the climate change and other…”
Get full text

Approximation algorithms for the unit disk cover problem in 2D and 3D by Biniaz, Ahmad, Liu, Paul, Maheshwari, Anil, Smid, Michiel

“…Given a set P of n points in the plane, we consider the problem of covering P with a minimum number of unit disks. This problem is known to be NP-hard. We…”
Get full text

Bounded-Angle Minimum Spanning Trees by Biniaz, Ahmad, Bose, Prosenjit, Lubiw, Anna, Maheshwari, Anil

“…Motivated by the connectivity problem in wireless networks with directional antennas, we study bounded-angle spanning trees. Let P be a set of points in the…”
Get full text

Workplace Well-being: An Experimental Investigation into Benefits of Consciousness-based Architecture by Maheshwari, Anil K., Werd, Margaret Rose Paulsel, Travis, Frederick, Rainforth, Maxwell, Lipman, Jonathan

“…Consciousness is primary and unbounded and can be accessed through multiple modalities, including the qualities of the workplace environment. This research…”
Get full text

Architecture and Creativity: Examining the Impact of Maharishi Vastu on Workplace Creativity by Maheshwari, Anil K., Werd, Margaret Rose P.

“…This paper reports on the effect of architectural design of a workplace on the creativity of its users. A technical services company relocated from a…”
Get full text

Shortest paths among transient obstacles by Maheshwari, Anil, Nouri, Arash, Sack, Jörg-Rüdiger

“…We present an optimal algorithm for determining a time-minimal rectilinear path among transient rectilinear obstacles. An obstacle is transient if it exists…”
Get full text

Quantum Worldviews: How science and spirituality are converging to transform consciousness for meaningful solutions to wicked problems by Laszlo, Chris, Waddock, Sandra, Maheshwari, Anil, Nigri, Giorgia, Storberg-Walker, Julia

“…This article focuses on the concept of worldviews, arguing that a change in managerial worldviews is the key lever for addressing the social and global…”
Get full text

Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs by Abu-Affash, A. Karim, Carmi, Paz, Maheshwari, Anil, Morin, Pat, Smid, Michiel, Smorodinsky, Shakhar

“…We consider a well-studied generalization of the maximum clique problem which is defined as follows. Given a graph G on n vertices and a fixed parameter d ≥ 1…”
Get full text

On the Minimum Consistent Subset Problem by Biniaz, Ahmad, Cabello, Sergio, Carmi, Paz, De Carufel, Jean-Lou, Maheshwari, Anil, Mehrabi, Saeed, Smid, Michiel

“…Let P be a set of n colored points in the d -dimensional Euclidean space. Introduced by Hart (1968), a consistent subset of P , is a set S ⊆ P such that for…”
Get full text

Analysis of farthest point sampling for approximating geodesics in a graph by Kamousi, Pegah, Lazard, Sylvain, Maheshwari, Anil, Wuhrer, Stefanie

“…A standard way to approximate the distance between two vertices p and q in a graph is to compute a shortest path from p to q that goes through one of k…”
Get full text

On the false-positive rate of Bloom filters by Bose, Prosenjit, Guo, Hua, Kranakis, Evangelos, Maheshwari, Anil, Morin, Pat, Morrison, Jason, Smid, Michiel, Tang, Yihui

“…Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called…”
Get full text

I/O-Efficient Algorithms for Graphs of Bounded Treewidth by Maheshwari, Anil, Zeh, Norbert

“…We present an algorithm that takes I/Os (sort( N )= Θ (( N /( DB ))log  M / B ( N / B )) is the number of I/Os it takes to sort N data items) to compute a tree…”
Get full text

Packing Plane Perfect Matchings into a Point Set by Biniaz, Ahmad, Bose, Prosenjit, Maheshwari, Anil, Smid, Michiel

“…Given a set $P$ of $n$ points in the plane, where $n$ is even, we consider the following question: How many plane perfect matchings can be packed into $P$? For…”
Get full text

Succinct and I/O Efficient Data Structures for Traversal in Trees by Dillabaugh, Craig, He, Meng, Maheshwari, Anil

“…We present two results for path traversal in trees, where the traversal is performed in an asymptotically optimal number of I/Os and the tree structure is…”
Get full text

A plane 1.88-spanner for points in convex position by Ahmad Biniaz, Mahdi Amani, Anil Maheshwari, Michiel Smid, Prosenjit Bose, Jean-Lou De Carufel

“…Let $S$ be a set of $n$ points in the plane that is in convex position. For a real number $t>1$, we say that a point $p$ in $S$ is $t$-good if for every point…”
Get full text

On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere by Michiel Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu

“…Let $P$ be a convex polyhedron in $\mathbb{R}^3$. The skeleton of $P$ is the graph whose vertices and edges are the vertices and edges of $P$, respectively. We…”
Get full text

Distance-Preserving Graph Compression Techniques by Madani, Amirali, Maheshwari, Anil

Get full text

Fast approximations for sums of distances, clustering and the Fermat–Weber problem by Bose, Prosenjit, Maheshwari, Anil, Morin, Pat

“…We describe two data structures that preprocess a set S of n points in R d ( d constant) so that the sum of Euclidean distances of points in S to a query point…”
Get full text

Workplace Well-being From Development of Consciousness Through Purposeful Leadership by Maheshwari, Anil K.

“…This paper constructs a model for enhancing workplace well-being (WB) from development of consciousness (DC), through purpose driven leadership (PL). A morally…”
Get full text