The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

William Klostermeyer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. William Klostermeyer
    Pushing Vertices and Orienting Edges. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:51, n:, pp:- [Journal]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]

  15. Odd and Even Dominating Sets with Open Neighborhoods. [Citation Graph (, )][DBLP]


  16. Tight bounds for eternal dominating sets in graphs. [Citation Graph (, )][DBLP]


Search in 0.080secs, Finished in 0.082secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002