The SCEAS System
| |||||||

## Search the dblp DataBase
William Klostermeyer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- William Klostermeyer, David R. Musser, Arturo J. Sánchez-Ruíz
**Complete Traversals as General Iteration Patterns.**[Citation Graph (0, 0)][DBLP] Generic Programming, 2002, pp:187-206 [Conf] - Kenneth Luo, William Klostermeyer, Yuan-Chieh Chow
**A Distributed Algorithm for Detecting and Resolving Store-and-Forward Deadlocks in Networks with Minimum Exchange Buffers.**[Citation Graph (0, 0)][DBLP] INFOCOM, 1993, pp:994-1003 [Conf] - William Klostermeyer
**Pushing Vertices and Orienting Edges.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:51, n:, pp:- [Journal] - Elaine M. Eschen, William Klostermeyer, R. Sritharan
**Planar domination graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:268, n:1-3, pp:129-137 [Journal] - William Klostermeyer, Gary MacGillivray
**Homomorphisms and oriented colorings of equivalence classes of oriented graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:274, n:1-3, pp:161-172 [Journal] - William Klostermeyer, Lubomír Soltés
**An extremal connectivity parameter of tournaments.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:223, n:1-3, pp:157-173 [Journal] - William Klostermeyer
**Maximization versus Minimization in Some Optimization Problems.**[Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1999, v:69, n:, pp:137-140 [Journal] - John L. Goldwasser, William Klostermeyer, Henry Ware
**Fibonacci Polynomials and Parity Domination in Grid Graphs.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2002, v:18, n:2, pp:271-283 [Journal] - William Klostermeyer, Cun-Quan Zhang
**n-Tuple Coloring of Planar Graphs with Large Odd Girth.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2002, v:18, n:1, pp:119-132 [Journal] - William Klostermeyer
**Scheduling Two Salesmen in a Network.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1996, v:7, n:4, pp:353-358 [Journal] - William Klostermeyer, Maria Muslea
**Techniques for Algorithm Design and Analysis: Case Study of a Greedy Algorithm.**[Citation Graph (0, 0)][DBLP] Informatica (Slovenia), 1996, v:20, n:2, pp:- [Journal] - Kenneth Luo, William Klostermeyer, Yuan-Chieh Chow, Richard E. Newman-Wolfe
**Optimal Deadlock Resolutions in Edge-Disjoint Reducible Wait-For Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1991, v:38, n:6, pp:307-313 [Journal] - William Klostermeyer, Kankanahalli Srinivas
**Reducing Disk Power Consumption in a Portable Computer.**[Citation Graph (0, 0)][DBLP] Operating Systems Review, 1995, v:29, n:2, pp:27-32 [Journal] - John L. Goldwasser, William Klostermeyer, Michael Mays, George Trapp
**The density of ones in Pascal's rhombus.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:204, n:1-3, pp:231-236 [Journal] **Odd and Even Dominating Sets with Open Neighborhoods.**[Citation Graph (, )][DBLP]**Tight bounds for eternal dominating sets in graphs.**[Citation Graph (, )][DBLP]
Search in 0.080secs, Finished in 0.082secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |