Dan Pritikin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2020

Hamiltonian cycles in k -partite graphsLouis DeBiasio, Robert A. Krueger, Dan Pritikin, Eli Thompson. jgt, 94(1):92-112, 2020. [doi]

2014

Embedding multidimensional grids into optimal hypercubesZevi Miller, Dan Pritikin, Ivan Hal Sudborough. TCS, 552:52-82, 2014. [doi]

2012

Representation numbers of complete multipartite graphsReza Akhtar, Anthony B. Evans, Dan Pritikin. DM, 312(6):1158-1165, 2012. [doi]

Arrangements of k-sets with intersection constraintsTao Jiang, Manley Perkel, Dan Pritikin. ejc, 33(8):1882-1899, 2012. [doi]

2011

Near Optimal Bounds for Steiner Trees in the HypercubeTao Jiang, Zevi Miller, Dan Pritikin. SICOMP, 40(5):1340-1360, 2011. [doi]

2010

Representation Numbers of StarsReza Akhtar, Anthony B. Evans, Dan Pritikin. int, 10, 2010. [doi]

2009

On the Unitary Cayley Graph of a Finite RingReza Akhtar, Megan Boggess, Tiffany Jackson-Henderson, Isidora Jiménez, Rachel Karpman, Amanda Kinzel, Dan Pritikin. combinatorics, 16(1), 2009. [doi]

A solitaire game played on 2-colored graphsDavid Craft, Zevi Miller, Dan Pritikin. DM, 309(1):188-201, 2009. [doi]

Separation numbers of treesTao Jiang, Zevi Miller, Dan Pritikin. TCS, 410(38-40):3769-3781, 2009. [doi]

2008

k-Dependence and Domination in Kings GraphsEugen J. Ionascu, Dan Pritikin, Stephen E. Wright. tamm, 115(9):820-836, 2008. [doi]

2007

Edge-Bandwidth of the Triangular GridReza Akhtar, Tao Jiang, Dan Pritikin. combinatorics, 14(1), 2007. [doi]

2005

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

2003

Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraintsNoga Alon, Tao Jiang, Zevi Miller, Dan Pritikin. rsa, 23(4):409-433, 2003. [doi]

Irredundance and domination in kings graphsOdile Favaron, Gerd Fricke, Dan Pritikin, Joël Puech. DM, 262(1-3):131-147, 2003. [doi]

Expansion of layouts of complete binary trees into gridsY.-B. Lin, Zevi Miller, Manley Perkel, Dan Pritikin, Ivan Hal Sudborough. DAM, 131(3):611-642, 2003. [doi]

1999

On Mapping Complete Binary Trees into Grids and Extended GridsY.-B. Lin, Ivan Hal Sudborough, Zevi Miller, Dan Pritikin, Manley Perkel. ispan 1999: 242-247 [doi]

1998

All Unit-Distance Graphs of Order 6197 Are 6-ColorableDan Pritikin. JCT, 73(2):159-163, 1998. [doi]

1997

On randomized greedy matchingsZevi Miller, Dan Pritikin. rsa, 10(3):353-383, 1997.

1996

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

1995

Embedding hypercubes into pancake, cycle prefix and substring reversal networksLinda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough. hicss 1995: 537-545 [doi]

1994

Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercubeZevi Miller, Dan Pritikin. DM, 131(1-3):183-194, 1994. [doi]

Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric GroupZevi Miller, Dan Pritikin, Ivan Hal Sudborough. TC, 43(1):13-22, 1994.

1991

The harmonious coloring number of a graphZevi Miller, Dan Pritikin. DM, 93(2-3):211-228, 1991. [doi]

1989

On the separation number of a graphZevi Miller, Dan Pritikin. networks, 19(6):651-666, 1989. [doi]

1987

The bichromaticity of cylinder graphs and torus graphsDan Pritikin. jgt, 11(1):101-111, 1987. [doi]

1986

Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphsDan Pritikin. jgt, 10(2):197-201, 1986. [doi]

1985

Bichromaticity of bipartite graphsDan Pritikin. jgt, 9(4):497-502, 1985. [doi]

Sign in or sign up to see more results.

runs on WebDSL