Dan Pritikin

Reza Akhtar, Anthony B. Evans, Dan Pritikin: Representation numbers of complete multipartite graphs. Discrete Mathematics 312(6): 1158-1165 (2012)

Tao Jiang, Manley Perkel, Dan Pritikin: Arrangements of k-sets with intersection constraints. Eur. J. Comb. 33(8): 1882-1899 (2012)

Tao Jiang, Zevi Miller, Dan Pritikin: Near Optimal Bounds for Steiner Trees in the Hypercube. SIAM J. Comput. 40(5): 1340-1360 (2011)

Reza Akhtar, Megan Boggess, Tiffany Jackson-Henderson, Isidora Jiménez, Rachel Karpman, Amanda Kinzel, Dan Pritikin: On the Unitary Cayley Graph of a Finite Ring. Electr. J. Comb. 16(1) (2009)

David Craft, Zevi Miller, Dan Pritikin: A solitaire game played on 2-colored graphs. Discrete Mathematics 309(1): 188-201 (2009)

Tao Jiang, Zevi Miller, Dan Pritikin: Separation numbers of trees. Theor. Comput. Sci. 410(38-40): 3769-3781 (2009)

Eugen J. Ionascu, Dan Pritikin, Stephen E. Wright: k-Dependence and Domination in Kings Graphs. The American Mathematical Monthly 115(9): 820-836 (2008)

Reza Akhtar, Tao Jiang, Dan Pritikin: Edge-Bandwidth of the Triangular Grid. Electr. J. Comb. 14(1) (2007)

Zevi Miller, Dan Pritikin, Manley Perkel, Ivan Hal Sudborough: The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem. Networks 45(3): 143-164 (2005)

Y.-B. Lin, Zevi Miller, Manley Perkel, Dan Pritikin, Ivan Hal Sudborough: Expansion of layouts of complete binary trees into grids. Discrete Applied Mathematics 131(3): 611-642 (2003)

Odile Favaron, Gerd Fricke, Dan Pritikin, Joël Puech: Irredundance and domination in kings graphs. Discrete Mathematics 262(1-3): 131-147 (2003)

Noga Alon, Tao Jiang, Zevi Miller, Dan Pritikin: Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. Random Struct. Algorithms 23(4): 409-433 (2003)

Y.-B. Lin, Ivan Hal Sudborough, Zevi Miller, Dan Pritikin, Manley Perkel: On Mapping Complete Binary Trees into Grids and Extended Grids. ISPAN 1999: 242-247

Dan Pritikin: All Unit-Distance Graphs of Order 6197 Are 6-Colorable. J. Comb. Theory, Ser. B 73(2): 159-163 (1998)

Zevi Miller, Dan Pritikin: On randomized greedy matchings. Random Struct. Algorithms 10(3): 353-383 (1997)

Zevi Miller, Dan Pritikin, Ivan Hal Sudborough: Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group. Mathematical Systems Theory 29(6): 551-572 (1996)

Linda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough: Embedding hypercubes into pancake, cycle prefix and substring reversal networks. HICSS (2) 1995: 537-545

Zevi Miller, Dan Pritikin: Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube. Discrete Mathematics 131(1-3): 183-194 (1994)

Zevi Miller, Dan Pritikin, Ivan Hal Sudborough: Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group. IEEE Trans. Computers 43(1): 13-22 (1994)

Zevi Miller, Dan Pritikin: The harmonious coloring number of a graph. Discrete Mathematics 93(2-3): 211-228 (1991)

Zevi Miller, Dan Pritikin: On the separation number of a graph. Networks 19(6): 651-666 (1989)