 | 2012 |
|---|
| 22 |       | William Klostermeyer,
Christina M. Mynhardt:
Vertex covers and eternal dominating sets.
Discrete Applied Mathematics 160(7-8): 1183-1190 (2012) |
| 2011 |
|---|
| 21 | | William Klostermeyer,
Christina M. Mynhardt:
Graphs with equal eternal vertex cover and eternal domination numbers.
Discrete Mathematics 311(14): 1371-1379 (2011) |
| 2009 |
|---|
| 20 | | John L. Goldwasser,
William Klostermeyer:
Maximum Orbit Weights in the sigma-game and Lit-only sigma-game on Grids and Graphs.
Graphs and Combinatorics 25(3): 309-326 (2009) |
| 2008 |
|---|
| 19 | | John L. Goldwasser,
William Klostermeyer:
Tight bounds for eternal dominating sets in graphs.
Discrete Mathematics 308(12): 2589-2593 (2008) |
| 18 | | William Klostermeyer,
Christina M. Mynhardt:
Secure domination and secure total domination in graphs.
Discussiones Mathematicae Graph Theory 28(2): 267-282 (2008) |
| 2007 |
|---|
| 17 |  | John L. Goldwasser,
William Klostermeyer:
Odd and Even Dominating Sets with Open Neighborhoods.
Ars Comb. 83: (2007) |
| 2005 |
|---|
| 16 | | Yair Caro,
William Klostermeyer,
Raphael Yuster:
Connected odd dominating sets in graphs.
Discussiones Mathematicae Graph Theory 25(3): 225-239 (2005) |
| 2004 |
|---|
| 15 | | William Klostermeyer,
Gary MacGillivray:
Homomorphisms and oriented colorings of equivalence classes of oriented graphs.
Discrete Mathematics 274(1-3): 161-172 (2004) |
| 2003 |
|---|
| 14 | | Elaine M. Eschen,
William Klostermeyer,
R. Sritharan:
Planar domination graphs.
Discrete Mathematics 268(1-3): 129-137 (2003) |
| 13 | | Lisa Jamba-Joyner,
William Klostermeyer:
Predictors for success in a discrete math course.
SIGCSE Bulletin 35(2): 66-69 (2003) |
| 2002 |
|---|
| 12 | | William Klostermeyer,
David R. Musser,
Arturo J. Sánchez-Ruíz:
Complete Traversals as General Iteration Patterns.
Generic Programming 2002: 187-206 |
| 11 | | William Klostermeyer,
Cun-Quan Zhang:
n-Tuple Coloring of Planar Graphs with Large Odd Girth.
Graphs and Combinatorics 18(1): 119-132 (2002) |
| 10 | | John L. Goldwasser,
William Klostermeyer,
Henry Ware:
Fibonacci Polynomials and Parity Domination in Grid Graphs.
Graphs and Combinatorics 18(2): 271-283 (2002) |
| 2000 |
|---|
| 9 | | William Klostermeyer,
Lubomír Soltés:
An extremal connectivity parameter of tournaments.
Discrete Mathematics 223(1-3): 157-173 (2000) |
| 1999 |
|---|
| 8 | | William Klostermeyer:
Pushing Vertices and Orienting Edges.
Ars Comb. 51: (1999) |
| 7 | | William Klostermeyer:
Maximization versus Minimization in Some Optimization Problems.
Bulletin of the EATCS 69: 137-140 (1999) |
| 6 | | John L. Goldwasser,
William Klostermeyer,
Michael Mays,
George Trapp:
The density of ones in Pascal's rhombus.
Discrete Mathematics 204(1-3): 231-236 (1999) |
| 1996 |
|---|
| 5 | | William Klostermeyer,
Maria Muslea:
Techniques for Algorithm Design and Analysis: Case Study of a Greedy Algorithm.
Informatica (Slovenia) 20(2): (1996) |
| 4 | | William Klostermeyer:
Scheduling Two Salesmen in a Network.
Int. J. Found. Comput. Sci. 7(4): 353-358 (1996) |
| 1995 |
|---|
| 3 | | William Klostermeyer,
Kankanahalli Srinivas:
Reducing Disk Power Consumption in a Portable Computer.
Operating Systems Review 29(2): 27-32 (1995) |
| 1993 |
|---|
| 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.
INFOCOM 1993: 994-1003 |
| 1991 |
|---|
| 1 | | Kenneth Luo,
William Klostermeyer,
Yuan-Chieh Chow,
Richard E. Newman-Wolfe:
Optimal Deadlock Resolutions in Edge-Disjoint Reducible Wait-For Graphs.
Inf. Process. Lett. 38(6): 307-313 (1991) |
Data released under the ODC-BY 1.0 license — See also our legal information page