default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDan Pritikin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j25]Louis DeBiasio
, Robert A. Krueger, Dan Pritikin, Eli Thompson:
Hamiltonian cycles in k -partite graphs. J. Graph Theory 94(1): 92-112 (2020)
2010 – 2019
- 2014
- [j24]Zevi Miller, Dan Pritikin, Ivan Hal Sudborough:
Embedding multidimensional grids into optimal hypercubes. Theor. Comput. Sci. 552: 52-82 (2014) - 2012
- [j23]Reza Akhtar, Anthony B. Evans, Dan Pritikin:
Representation numbers of complete multipartite graphs. Discret. Math. 312(6): 1158-1165 (2012) - [j22]Tao Jiang, Manley Perkel, Dan Pritikin:
Arrangements of k-sets with intersection constraints. Eur. J. Comb. 33(8): 1882-1899 (2012) - 2011
- [j21]Tao Jiang, Zevi Miller, Dan Pritikin:
Near Optimal Bounds for Steiner Trees in the Hypercube. SIAM J. Comput. 40(5): 1340-1360 (2011) - 2010
- [j20]Reza Akhtar, Anthony B. Evans, Dan Pritikin:
Representation Numbers of Stars. Integers 10: A54 (2010)
2000 – 2009
- 2009
- [j19]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. Electron. J. Comb. 16(1) (2009) - [j18]David Craft, Zevi Miller, Dan Pritikin:
A solitaire game played on 2-colored graphs. Discret. Math. 309(1): 188-201 (2009) - [j17]Tao Jiang, Zevi Miller, Dan Pritikin:
Separation numbers of trees. Theor. Comput. Sci. 410(38-40): 3769-3781 (2009) - 2008
- [j16]Eugen J. Ionascu, Dan Pritikin, Stephen E. Wright:
k-Dependence and Domination in Kings Graphs. Am. Math. Mon. 115(9): 820-836 (2008) - 2007
- [j15]Reza Akhtar, Tao Jiang, Dan Pritikin:
Edge-Bandwidth of the Triangular Grid. Electron. J. Comb. 14(1) (2007) - 2005
- [j14]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) - 2003
- [j13]Y.-B. Lin, Zevi Miller, Manley Perkel, Dan Pritikin, Ivan Hal Sudborough:
Expansion of layouts of complete binary trees into grids. Discret. Appl. Math. 131(3): 611-642 (2003) - [j12]Odile Favaron, Gerd Fricke, Dan Pritikin, Joël Puech:
Irredundance and domination in kings graphs. Discret. Math. 262(1-3): 131-147 (2003) - [j11]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)
1990 – 1999
- 1999
- [c2]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 - 1998
- [j10]Dan Pritikin:
All Unit-Distance Graphs of Order 6197 Are 6-Colorable. J. Comb. Theory B 73(2): 159-163 (1998) - 1997
- [j9]Zevi Miller, Dan Pritikin:
On randomized greedy matchings. Random Struct. Algorithms 10(3): 353-383 (1997) - 1996
- [j8]Zevi Miller, Dan Pritikin, Ivan Hal Sudborough:
Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group. Math. Syst. Theory 29(6): 551-572 (1996) - 1995
- [c1]Linda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough:
Embedding hypercubes into pancake, cycle prefix and substring reversal networks. HICSS (2) 1995: 537-545 - 1994
- [j7]Zevi Miller, Dan Pritikin:
Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube. Discret. Math. 131(1-3): 183-194 (1994) - [j6]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) - 1991
- [j5]Zevi Miller, Dan Pritikin:
The harmonious coloring number of a graph. Discret. Math. 93(2-3): 211-228 (1991)
1980 – 1989
- 1989
- [j4]Zevi Miller, Dan Pritikin:
On the separation number of a graph. Networks 19(6): 651-666 (1989) - 1987
- [j3]Dan Pritikin:
The bichromaticity of cylinder graphs and torus graphs. J. Graph Theory 11(1): 101-111 (1987) - 1986
- [j2]Dan Pritikin:
Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs. J. Graph Theory 10(2): 197-201 (1986) - 1985
- [j1]Dan Pritikin:
Bichromaticity of bipartite graphs. J. Graph Theory 9(4): 497-502 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
