Anusch Taraz

728 total citations
36 papers, 306 citations indexed

About

Anusch Taraz is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Anusch Taraz has authored 36 papers receiving a total of 306 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Discrete Mathematics and Combinatorics, 28 papers in Computational Theory and Mathematics and 14 papers in Geometry and Topology. Recurrent topics in Anusch Taraz's work include Limits and Structures in Graph Theory (29 papers), Advanced Graph Theory Research (26 papers) and Graph theory and applications (10 papers). Anusch Taraz is often cited by papers focused on Limits and Structures in Graph Theory (29 papers), Advanced Graph Theory Research (26 papers) and Graph theory and applications (10 papers). Anusch Taraz collaborates with scholars based in Germany, United Kingdom and Brazil. Anusch Taraz's co-authors include Deryk Osthus, Julia Böttcher, Mathias Schacht, Hans Jürgen Prömel, Angelika Steger, Michael Behrisch, Klaas P. Pruessmann, Amin Coja‐Oghlan, Daniela Kühn and Yoshiharu Kohayakawa and has published in prestigious journals such as Theoretical Computer Science, Mathematische Annalen and Proceedings of the London Mathematical Society.

In The Last Decade

Anusch Taraz

35 papers receiving 288 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Anusch Taraz Germany	11	215	202	80	51	43	36	306
Joseph E. Bonin United States	10	228 1.1×	257 1.3×	87 1.1×	44 0.9×	97 2.3×	45	359
Gregory A. Freiman Israel	12	145 0.7×	266 1.3×	143 1.8×	75 1.5×	80 1.9×	51	448
Wen-Ching Winnie Li United States	8	94 0.4×	84 0.4×	108 1.4×	57 1.1×	30 0.7×	22	259
Martin Kochol Slovakia	13	395 1.8×	225 1.1×	87 1.1×	35 0.7×	115 2.7×	55	448
Mihyun Kang Austria	11	168 0.8×	171 0.8×	90 1.1×	152 3.0×	12 0.3×	67	347
Po‐Shen Loh United States	11	281 1.3×	269 1.3×	158 2.0×	28 0.5×	44 1.0×	36	358
Yufei Zhao United States	9	126 0.6×	161 0.8×	111 1.4×	24 0.5×	26 0.6×	47	235
Glenn Hurlbert United States	11	233 1.1×	161 0.8×	98 1.2×	15 0.3×	87 2.0×	45	322
Guillem Perarnau Spain	7	89 0.4×	65 0.3×	46 0.6×	27 0.5×	20 0.5×	35	166
Jorge L. Ramírez Alfonsín France	7	213 1.0×	77 0.4×	175 2.2×	32 0.6×	39 0.9×	28	348

Countries citing papers authored by Anusch Taraz

Since Specialization

Citations

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

Fields of papers citing papers by Anusch Taraz

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Anusch Taraz

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

Kohayakawa, Yoshiharu, et al.. (2017). Counting results for sparse pseudorandom hypergraphs I. European Journal of Combinatorics. 65. 276–287. 1 indexed citations

Kohayakawa, Yoshiharu, et al.. (2017). Counting results for sparse pseudorandom hypergraphs II. European Journal of Combinatorics. 65. 288–301. 1 indexed citations

Sárközy, Gábor N., et al.. (2015). Ramsey numbers for bipartite graphs with small bandwidth. European Journal of Combinatorics. 48. 165–176. 3 indexed citations

Böttcher, Julia, et al.. (2015). An Extension of the Blow-up Lemma to Arrangeable Graphs. SIAM Journal on Discrete Mathematics. 29(2). 962–1001. 6 indexed citations

Fernandes, Cristina G., et al.. (2015). Approximating Minimum k -Section in Trees with Linear Diameter. Electronic Notes in Discrete Mathematics. 50. 71–76. 2 indexed citations

Παναγιώτου, Κωνσταντίνος, et al.. (2014). Coloring $$d$$ d -Embeddable $$k$$ k -Uniform Hypergraphs. Discrete & Computational Geometry. 52(4). 663–679. 2 indexed citations

Kölbel, Tilo, et al.. (2013). How to calculate the main aortic graft-diameter for a chimney-graft.. PubMed. 57(1). 7 indexed citations

Böttcher, Julia, et al.. (2009). Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. European Journal of Combinatorics. 31(5). 1217–1227. 26 indexed citations

Behrisch, Michael, et al.. (2009). Coloring Random Intersection Graphs and Complex Networks. SIAM Journal on Discrete Mathematics. 23(1). 288–299. 6 indexed citations

10.

Böttcher, Julia, Yoshiharu Kohayakawa, & Anusch Taraz. (2009). Almost spanning subgraphs of random graphs after adversarial edge removal. Electronic Notes in Discrete Mathematics. 35. 335–340. 9 indexed citations

11.

Böttcher, Julia, Mathias Schacht, & Anusch Taraz. (2008). Spanning 3-colourable subgraphs of small bandwidth in dense graphs. Journal of Combinatorial Theory Series B. 98(4). 752–777. 13 indexed citations

12.

Kohayakawa, Yoshiharu, et al.. (2007). Essentially infinite colourings of hypergraphs. Proceedings of the London Mathematical Society. 95(3). 709–734. 2 indexed citations

13.

Behrisch, Michael & Anusch Taraz. (2006). Efficiently covering complex networks with cliques of similar vertices. Theoretical Computer Science. 355(1). 37–47. 15 indexed citations

14.

Kühn, Daniela, Deryk Osthus, & Anusch Taraz. (2005). Large planar subgraphs in dense graphs. Journal of Combinatorial Theory Series B. 95(2). 263–282. 16 indexed citations

15.

Coja‐Oghlan, Amin & Anusch Taraz. (2004). Exact and approximative algorithms for coloring G(n,p). Random Structures and Algorithms. 24(3). 259–278. 9 indexed citations

16.

Osthus, Deryk, Hans Jürgen Prömel, & Anusch Taraz. (2003). On random planar graphs, the number of planar graphs and their triangulations. Journal of Combinatorial Theory Series B. 88(1). 119–134. 26 indexed citations

17.

Prömel, Hans Jürgen, Angelika Steger, & Anusch Taraz. (2001). Phase Transitions in the Evolution of Partial Orders. Journal of Combinatorial Theory Series A. 94(2). 230–275. 6 indexed citations

18.

Prömel, Hans Jürgen, Angelika Steger, & Anusch Taraz. (2001). Asymptotic enumeration, global structure, and constrained evolution. Discrete Mathematics. 229(1-3). 213–233. 12 indexed citations

19.

Osthus, Deryk, Hans Jürgen Prömel, & Anusch Taraz. (2001). Almost all graphs with high girth and suitable density have high chromatic number. Journal of Graph Theory. 37(4). 220–226.

20.

Rödl, V., Andrzej Ruciński, & Anusch Taraz. (1999). Hypergraph Packing and Graph Embedding. Combinatorics Probability Computing. 8(4). 363–376. 14 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