#### Filter Results:

#### Publication Year

1988

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Stephan Olariu, Ivan Stojmenovic
- Proceedings IEEE INFOCOM 2006. 25TH IEEE…
- 2006

— This paper investigates theoretical aspects of the uneven energy depletion phenomenon recently noticed in sink-based wireless sensor networks. We consider uniformly distributed sensors, each sending roughly the same number of reports toward the closest sink. We assume an energy consumption model governed by the relation E = d α +c where d, (d ≤ t x), is… (More)

- Bruno Courcelle, Stephan Olariu
- Discrete Applied Mathematics
- 2000

Hierarchical decompositions of graphs are interesting for algorithmic purposes. Many NP complete problems have linear complexity on graphs with tree-decompositions of bounded width. We investigate alternate hierarchical decompositions that apply to wider classes of graphs and still enjoy good algorithmic properties. These decompositions are motivated and… (More)

- Koji Nakano, Stephan Olariu
- IEEE Trans. Parallel Distrib. Syst.
- 2000

ÐAd hoc networks are self-organizing entities that are deployed on demand in support of various events including collaborative computing, multimedia classroom, disaster-relief, search-and-rescue, interactive mission planning, and law enforcement operations. One of the fundamental tasks that have to be addressed when setting up an ad hoc network (AHN, for… (More)

An independent set of three vertices such that each pair is joined by a path that avoids the neighborhood of the third is called an asteroidal triple. A graph is asteroidal triple-free (AT-free, for short) if it contains no asteroidal triples. The motivation for this investigation was provided, in part, by the fact that the asteroidal triple-free graphs… (More)

- Derek G. Corneil, Hiryoung Kim, Sridhar Natarajan, Stephan Olariu, Alan P. Sprague
- Inf. Process. Lett.
- 1995

We present a linear time algorithm for unit interval graph recognition. The algorithm is simple and based on Breadth-First Search. It is also direct | it does not rst recognize the graph as an interval graph. Given a graph G, the algorithm produces an ordering of the vertices of the graph whenever G is a unit interval graph. This order corresponds to the… (More)

- Ashraf Wadaa, Stephan Olariu, Larry Wilson, Mohamed Eltoweissy, K. Jones
- MONET
- 2005

- Mona E. Rizvi, Stephan Olariu, Hussein M. Abdel-Wahab
- IEEE Trans. Parallel Distrib. Syst.
- 2002

ÐNow that cellular networks are being called upon to support real-time interactive multimedia traffic such as video tele-conferencing, these networks must be able to provide their users with quality-of-service (QoS) guarantees. Although the QoS provisioning problem arises in wireline networks as well, mobility of hosts, scarcity of bandwidth, and channel… (More)

- Mohammad S. Almalag, Stephan Olariu, Michele C. Weigle
- 2012 IEEE International Symposium on a World of…
- 2012

One of the challenges for Vehicular Ad-hoc Networks (VANETs) is the design of the Medium Access Control (MAC) protocol. When exchanging messages between vehicles, there are network issues that must be addressed, including the hidden terminal problem, high density, high node mobility, and data rate limitations. A cluster-based MAC scheme is needed in VANETs… (More)

- Luitpold Babel, Stephan Olariu
- Discrete Applied Mathematics
- 1998

We present new classes of graphs for which the isomorphism problem can be solved in polynomial time. These graphs are characterized by containing { in some local sense { only a small number of induced paths of length three. As it turns out, every such graph has a unique tree representation: the internal nodes correspond to three types of graph operations,… (More)

- Stephan Olariu, Mohamed Eltoweissy, Mohamed F. Younis
- EAI Endorsed Trans. Mobile Communications…
- 2011