#### Filter Results:

- Full text PDF available (185)

#### Publication Year

1988

2017

- This year (3)
- Last 5 years (41)
- Last 10 years (148)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

A graph complexity measure that we call clique-width is associated in a natural way with certain graph decompositions, more or less like tree-width is associated with tree-decomposition which are, actually, hierarchical decompositions of graphs. In general, a decomposition of a graph G can be viewed as a nite term, written with appropriate operations on… (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 ≤ tx), is the… (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)

- 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)

- Beverly Jamison, Stephan Olariu
- SIAM J. Discrete Math.
- 1995

In this paper we introduce and investigate the notion of p-connectedness. As it turns out, this concepts leads naturally to a unique tree representation for arbitrary graphs: the leaves of this tree are the p-connected components along with weak vertices, that is, vertices of the graph that belong to no p-connected component. We then show how to refine this… (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) if it contains no asteroidal triples. The motivation for this investigation was provided, in part, by the fact that the AT-free graphs provide a common… (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)

- Mahmoud Abuelela, Stephan Olariu
- MoMM
- 2010

The past decade has witnessed a growing interest in vehicular networking and its myriad potential applications. The initial view of practitioners and researchers was that radio-equipped vehicles could keep the drivers informed about potential safety risks and increase their awareness of road conditions. The view then expanded to include access to the… (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)

- Stephan Olariu
- Inf. Process. Lett.
- 1991

Olariu, S., An opt;mal greedy heuristic to color interval graphs, Information Processing Letters 37 (1991) 21-25. We characterize iilterval graphs in terms of a certain linear order on their vertex set. It turns out that with this linear order, the well-known greedy heuristic “always use the smallest available col&’ yields an exact coloring algorithm for… (More)