D. H. Younger

1.5k total citations · 1 hit paper
17 papers, 817 citations indexed

About

D. H. Younger is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Electrical and Electronic Engineering. According to data from OpenAlex, D. H. Younger has authored 17 papers receiving a total of 817 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Computational Theory and Mathematics, 3 papers in Artificial Intelligence and 3 papers in Electrical and Electronic Engineering. Recurrent topics in D. H. Younger's work include Advanced Graph Theory Research (7 papers), VLSI and FPGA Design Techniques (2 papers) and Interconnection Networks and Systems (2 papers). D. H. Younger is often cited by papers focused on Advanced Graph Theory Research (7 papers), VLSI and FPGA Design Techniques (2 papers) and Interconnection Networks and Systems (2 papers). D. H. Younger collaborates with scholars based in Canada, United States and Denmark. D. H. Younger's co-authors include Cláudio L. Lucchesi, K. Vidyasankar, W. Mayeda, R. Bruce Richter, Carsten Thomassen, Ben de Lacy Costello, Andrew Adamatzky and S. C. Kitson and has published in prestigious journals such as Proceedings of the IEEE, Annals of the New York Academy of Sciences and SIAM Review.

In The Last Decade

D. H. Younger

15 papers receiving 681 citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Recognition and parsing of context-free languages in time n3

1967 542 citations D. H. Younger Information and Control profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
D. H. Younger Canada	8	493	350	125	94	60	17	817
Moshe Lewenstein Israel	19	604 1.2×	494 1.4×	350 2.8×	188 2.0×	50 0.8×	64	1.0k
Stanley M. Selkow United States	13	245 0.5×	416 1.2×	53 0.4×	134 1.4×	242 4.0×	37	795
Faith E. Fich Canada	15	419 0.8×	373 1.1×	91 0.7×	359 3.8×	19 0.3×	51	802
Martin Dietzfelbinger Germany	13	369 0.7×	259 0.7×	66 0.5×	302 3.2×	24 0.4×	56	629
Hiromu Ariyoshi Japan	4	98 0.2×	268 0.8×	33 0.3×	109 1.2×	57 0.9×	13	436
В. М. Глушков Ukraine	10	286 0.6×	295 0.8×	75 0.6×	90 1.0×	14 0.2×	68	615
Prabhakar Ragde Canada	17	264 0.5×	411 1.2×	48 0.4×	259 2.8×	40 0.7×	37	623
André Arnold France	18	653 1.3×	930 2.7×	50 0.4×	181 1.9×	11 0.2×	63	1.2k
Robert Wilber United States	6	168 0.3×	166 0.5×	50 0.4×	124 1.3×	10 0.2×	11	439
Juris Hartmanis United States	11	255 0.5×	368 1.1×	56 0.4×	61 0.6×	6 0.1×	24	547

Countries citing papers authored by D. H. Younger

Since Specialization

Citations

This map shows the geographic impact of D. H. Younger'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 D. H. Younger with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites D. H. Younger more than expected).

Fields of papers citing papers by D. H. Younger

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by D. H. Younger. 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 D. H. Younger. The network helps show where D. H. Younger may publish in the future.

Co-authorship network of co-authors of D. H. Younger

This figure shows the co-authorship network connecting the top 25 collaborators of D. H. Younger. A scholar is included among the top collaborators of D. H. Younger 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 D. H. Younger. D. H. Younger 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:

17 of 17 papers shown

1.

Richter, R. Bruce, Carsten Thomassen, & D. H. Younger. (2016). Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs. Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU). 7(2–3). 219–232. 3 indexed citations

2.

Younger, D. H.. (2012). William Thomas Tutte. 14 May 1917 — 2 May 2002. Biographical Memoirs of Fellows of the Royal Society. 58. 283–297. 3 indexed citations

3.

Adamatzky, Andrew, et al.. (2011). Computing with liquid crystal fingers: Models of geometric and logical computation. Physical Review E. 84(6). 61702–61702. 2 indexed citations

4.

Younger, D. H., et al.. (1987). Directed cut transversal packing for source-sink connected graphs. COMBINATORICA. 7(3). 255–263. 8 indexed citations

5.

Younger, D. H.. (1983). Integer flows. Journal of Graph Theory. 7(3). 349–357. 27 indexed citations

6.

Younger, D. H.. (1979). FROM SHORTEST PATHS TO DIRECTED CUT TRANSVERSALS. Annals of the New York Academy of Sciences. 319(1). 555–562. 1 indexed citations

7.

Lucchesi, Cláudio L. & D. H. Younger. (1978). A Minimax Theorem for Directed Graphs. Journal of the London Mathematical Society. s2-17(3). 369–374. 111 indexed citations

8.

Vidyasankar, K. & D. H. Younger. (1975). A Minimax Equality Related to the Longest Directed Path in an Acyclic Graph. Canadian Journal of Mathematics. 27(2). 348–351. 3 indexed citations

9.

Younger, D. H., et al.. (1974). Non-hamiltonian cubic planar maps. Discrete Mathematics. 7(1-2). 67–74. 23 indexed citations

10.

Younger, D. H.. (1972). Graph Theory (Frank Harary). SIAM Review. 14(2). 350–351. 2 indexed citations

11.

Younger, D. H., et al.. (1971). Strong Covering of a Bipartite Graph. Journal of the London Mathematical Society. s2-3(1). 86–90. 1 indexed citations

12.

Younger, D. H.. (1967). Recognition and parsing of context-free languages in time n3. Information and Control. 10(2). 189–208. 542 indexed citations breakdown →

13.

Younger, D. H.. (1966). Context-free language processing in time n3. 7–20. 14 indexed citations

14.

Younger, D. H.. (1965). A conjectured minimax theorem for directed graphs. 1 indexed citations

15.

Younger, D. H.. (1963). A simple derivation of Mason's gain formula. Proceedings of the IEEE. 51(7). 1043–1044. 7 indexed citations

16.

Younger, D. H.. (1963). Minimum Feedback Arc Sets for a Directed Graph. IEEE Transactions on Circuit Theory. 10(2). 238–245. 65 indexed citations

17.

Younger, D. H., et al.. (1960). On iterative factorization in network analysis by digital computer. 241–253. 4 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