Dan Pritikin

444 total citations
24 papers, 263 citations indexed

About

Dan Pritikin is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, Dan Pritikin has authored 24 papers receiving a total of 263 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Computational Theory and Mathematics, 9 papers in Electrical and Electronic Engineering and 8 papers in Computer Networks and Communications. Recurrent topics in Dan Pritikin's work include Advanced Graph Theory Research (17 papers), Graph Labeling and Dimension Problems (9 papers) and Interconnection Networks and Systems (8 papers). Dan Pritikin is often cited by papers focused on Advanced Graph Theory Research (17 papers), Graph Labeling and Dimension Problems (9 papers) and Interconnection Networks and Systems (8 papers). Dan Pritikin collaborates with scholars based in United States, Spain and Israel. Dan Pritikin's co-authors include Zevi Miller, I. Hal Sudborough, Tao Jiang, Noga Alon, Ignacio M. Pelayo, Stephen E. Wright, Anthony B. Evans, Lauren Gardner, Gerd H. Fricke and Odile Favaron and has published in prestigious journals such as IEEE Transactions on Computers, SIAM Journal on Computing and American Mathematical Monthly.

In The Last Decade

Dan Pritikin

22 papers receiving 247 citations

Peers

Dan Pritikin

CTM

DMC

CNC

GT

EEE

Stephen C. Locke United States

Ko‐Wei Lih Taiwan

Michel Mollard France

Simon Špacapan Slovenia

Dingjun Lou China

Yubao Guo Germany

Hian Poh Yap Singapore

Claudine Peyrat France

Tomáš Kaiser Czechia

Pranava K. Jha United States

Stephen C. Locke United States

Dan Pritikin

263 ×1.6

CTM

174 ×1.6

DMC

60 ×0.8

CNC

96 ×1.2

GT

96 ×1.3

EEE

Citations per year, relative to Dan Pritikin Dan Pritikin (= 1×) peers Stephen C. Locke

Countries citing papers authored by Dan Pritikin

Since Specialization

Citations

This map shows the geographic impact of Dan Pritikin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Dan Pritikin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dan Pritikin more than expected).

Fields of papers citing papers by Dan Pritikin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dan Pritikin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Dan Pritikin. The network helps show where Dan Pritikin may publish in the future.

Co-authorship network of co-authors of Dan Pritikin

This figure shows the co-authorship network connecting the top 25 collaborators of Dan Pritikin. A scholar is included among the top collaborators of Dan Pritikin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Dan Pritikin. Dan Pritikin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Jiang, Tao, Zevi Miller, & Dan Pritikin. (2011). Near Optimal Bounds for Steiner Trees in the Hypercube. SIAM Journal on Computing. 40(5). 1340–1360. 1 indexed citations

2.

Evans, Anthony B., et al.. (2011). Representation numbers of complete multipartite graphs. Discrete Mathematics. 312(6). 1158–1165. 2 indexed citations

3.

Pritikin, Dan, et al.. (2009). On the Unitary Cayley Graph of a Finite Ring. The Electronic Journal of Combinatorics. 16(1). 61 indexed citations

4.

Jiang, Tao, Zevi Miller, & Dan Pritikin. (2009). Separation numbers of trees. Theoretical Computer Science. 410(38-40). 3769–3781. 2 indexed citations

5.

Miller, Zevi, et al.. (2008). A solitaire game played on 2-colored graphs. Discrete Mathematics. 309(1). 188–201. 5 indexed citations

6.

Pritikin, Dan, et al.. (2008). κ-Dependence and Domination in Kings Graphs. American Mathematical Monthly. 115(9). 820–836. 5 indexed citations

7.

Jiang, Tao, et al.. (2007). Edge-Bandwidth of the Triangular Grid. The Electronic Journal of Combinatorics. 14(1).

8.

Alon, Noga, Tao Jiang, Zevi Miller, & Dan Pritikin. (2003). Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints. Random Structures and Algorithms. 23(4). 409–433. 44 indexed citations

9.

Favaron, Odile, et al.. (2003). Irredundance and domination in kings graphs. Discrete Mathematics. 262(1-3). 131–147. 4 indexed citations

10.

Pritikin, Dan, et al.. (2003). Expansion of layouts of complete binary trees into grids. Discrete Applied Mathematics. 131(3). 611–642. 9 indexed citations

11.

Gardner, Lauren, et al.. (2002). Embedding hypercubes into pancake, cycle prefix and substring reversal networks. 7. 537–545. 7 indexed citations

12.

Jiang, Tao, Ignacio M. Pelayo, & Dan Pritikin. (2002). Geodesic Convexity and Cartesian Products in Graphs. 10 indexed citations

13.

Gardner, Lauren, et al.. (2001). One-to-Many Embeddings of Hypercubes into Cayley Graphs Generated by Reversals. Theory of Computing Systems. 34(5). 399–431. 2 indexed citations

14.

Pritikin, Dan. (1998). All Unit-Distance Graphs of Order 6197 Are 6-Colorable. Journal of Combinatorial Theory Series B. 73(2). 159–163. 4 indexed citations

15.

Miller, Zevi & Dan Pritikin. (1997). On randomized greedy matchings. Random Structures and Algorithms. 10(3). 353–383. 5 indexed citations

16.

Miller, Zevi & Dan Pritikin. (1997). On randomized greedy matchings. Random Structures and Algorithms. 10(3). 353–383. 1 indexed citations

17.

Miller, Zevi & Dan Pritikin. (1993). Eigenvalues and separation in graphs. Linear Algebra and its Applications. 181. 187–219. 1 indexed citations

18.

Pritikin, Dan, et al.. (1991). The harmonious coloring number of a graph. Discrete Mathematics. 93(2-3). 211–228. 20 indexed citations

19.

Pritikin, Dan. (1986). Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs. Journal of Graph Theory. 10(2). 197–201. 10 indexed citations

20.

Pritikin, Dan. (1985). Bichromaticity of bipartite graphs. Journal of Graph Theory. 9(4). 497–502. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact