Yannis Manoussakis

932 total citations
60 papers, 475 citations indexed

About

Yannis Manoussakis is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Yannis Manoussakis has authored 60 papers receiving a total of 475 indexed citations (citations by other indexed papers that have themselves been cited), including 50 papers in Computational Theory and Mathematics, 24 papers in Electrical and Electronic Engineering and 21 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Yannis Manoussakis's work include Advanced Graph Theory Research (44 papers), Limits and Structures in Graph Theory (21 papers) and graph theory and CDMA systems (20 papers). Yannis Manoussakis is often cited by papers focused on Advanced Graph Theory Research (44 papers), Limits and Structures in Graph Theory (21 papers) and graph theory and CDMA systems (20 papers). Yannis Manoussakis collaborates with scholars based in France, Hungary and India. Yannis Manoussakis's co-authors include Roland Häggkvist, Zs. Tuza, Zsolt Tuza, Jørgen Bang‐Jensen, Źsolt Tuza, Shinya Fujita, W. Fernandez de la Véga, Colton Magnant, Olga Mégalakaki and Kinkar Chandra Das and has published in prestigious journals such as Theoretical Computer Science, Networks and Discrete Applied Mathematics.

In The Last Decade

Yannis Manoussakis

53 papers receiving 439 citations

Peers

Yannis Manoussakis

CTM

DMC

EEE

CNC

GT

Wenan Zang Hong Kong

Charles Payan France

Kristina Vušković United Kingdom

Aleksander Vesel Slovenia

Jochen Harant Germany

Iztok Peterin Slovenia

Luis Goddyn Canada

Herbert Fleischner Austria

Frédéric Havet France

Genghua Fan China

Wenan Zang Hong Kong

Yannis Manoussakis

339 ×0.8

CTM

167 ×1.0

DMC

82 ×0.5

EEE

86 ×0.8

CNC

87 ×0.9

GT

Citations per year, relative to Yannis Manoussakis Yannis Manoussakis (= 1×) peers Wenan Zang

Countries citing papers authored by Yannis Manoussakis

Since Specialization

Citations

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

Fields of papers citing papers by Yannis Manoussakis

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Yannis Manoussakis

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

Manoussakis, Yannis, et al.. (2020). Further Results on Degree sets for Graphs. AKCE International Journal of Graphs and Combinatorics. 77–82. 3 indexed citations

2.

Bujtás, Csilla, Michał Karpiński, Yannis Manoussakis, et al.. (2018). Tropical dominating sets in vertex-coloured graphs. Journal of Discrete Algorithms. 48. 27–41. 3 indexed citations

3.

Cohen, Nathann, Shinya Fujita, Sylvain Legay, et al.. (2017). Safe sets in graphs: Graph classes and structural parameters. Journal of Combinatorial Optimization. 36(4). 1221–1242. 13 indexed citations

4.

Foucaud, Florent, et al.. (2017). The complexity of tropical graph homomorphisms. Discrete Applied Mathematics. 229. 64–81. 4 indexed citations

5.

Fujita, Shinya, et al.. (2011). Proper connection of graphs. Discrete Mathematics. 312(17). 2550–2560. 64 indexed citations

6.

Manoussakis, Yannis, et al.. (2009). Colored Trees in Edge-Colored Graphs.. 115–119. 1 indexed citations

7.

Manoussakis, Yannis, et al.. (2009). Links in edge-colored graphs. European Journal of Combinatorics. 31(2). 442–460. 3 indexed citations

8.

Das, Kinkar Chandra, et al.. (2008). Paths and trails in edge-colored graphs. Theoretical Computer Science. 409(3). 497–510. 26 indexed citations

9.

Manoussakis, Yannis, et al.. (2003). The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle. Discrete Mathematics. 263(1-3). 1–10. 2 indexed citations

10.

Manoussakis, Yannis & Źsolt Tuza. (2001). Ramsey numbers for tournaments. Theoretical Computer Science. 263(1-2). 75–85.

11.

Manoussakis, Yannis & Ioannis Milis. (1999). A sufficient condition for maximum cycles in bipartite digraphs. Discrete Mathematics. 207(1-3). 161–171. 4 indexed citations

12.

Karzanov, Alexander V. & Yannis Manoussakis. (1996). Minimum (2,r)-Metrics and Integer Multiflows. European Journal of Combinatorics. 17(2-3). 223–232. 11 indexed citations

13.

Manoussakis, Yannis & Zsolt Tuza. (1996). The forwarding index of directed networks. Discrete Applied Mathematics. 68(3). 279–291. 17 indexed citations

14.

Manoussakis, Yannis. (1995). Alternating paths in edge-colored complete graphs. Discrete Applied Mathematics. 56(2-3). 297–309. 16 indexed citations

15.

Bang‐Jensen, Jørgen & Yannis Manoussakis. (1995). Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments. Journal of Combinatorial Theory Series B. 63(2). 261–280. 10 indexed citations

16.

Manoussakis, Yannis, et al.. (1994). Paths through fixed vertices in edge-colored graphs. SZTAKI Publication Repository (Hungarian Academy of Sciences). 127. 49–58. 29 indexed citations

17.

Hell, Pavol, Yannis Manoussakis, & Zs. Tuza. (1994). Packing problems in edge-colored graphs. Discrete Applied Mathematics. 52(3). 295–306. 7 indexed citations

18.

Manoussakis, Yannis. (1992). A linear-time algorithm for finding Hamiltonian cycles in tournaments. Discrete Applied Mathematics. 36(2). 199–201. 17 indexed citations

19.

Manoussakis, Yannis, et al.. (1992). Hamiltonian paths and cycles, number of arcs and independence number in digraphs. Discrete Mathematics. 105(1-3). 157–172.

20.

Manoussakis, Yannis, et al.. (1990). Cycles and paths of many lengths in bipartite digraphs. Journal of Combinatorial Theory Series B. 50(2). 254–264. 18 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