Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
SyLinda Littlejohn
Rui Cui
Bijan Vosoughi-Vahdat
Hsiu-Ping Yueh
Paulo Novais
Mohamed Yousri Mahmoud
Setu Gupta
Charlene Mae P. Canja
Hsi-Che Liu
Keith Dures
Home
/
Author
/
Y MANOUSSAKIS
Author Info
Open Visualization
Name
Affiliation
Papers
Y MANOUSSAKIS
L.R.I., Université Paris-XI, Bât. 490, 91405 Orsay Cedex, France
19
Collaborators
Citations
PageRank
24
106
22.62
Referers
Referees
References
153
70
59
Search Limit
100
153
Publications (19 rows)
Collaborators (24 rows)
Referers (100 rows)
Referees (70 rows)
Title
Citations
PageRank
Year
Maximum colored trees in edge-colored graphs
1
0.36
2019
Links in edge-colored graphs
1
0.36
2010
Longest Cycles in 3-connected Graphs with Given Independence Number
3
0.62
2009
Upper bounds for the forwarding indices of communication networks
2
0.42
2004
Bipartite Graphs and their Degree Sets
1
0.48
2003
The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle
2
0.46
2003
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors
2
0.37
1999
A sufficient condition for maximum cycles in bipartite digraphs
3
0.51
1999
Minimal colorings for properly colored subgraphs
17
5.71
1996
Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments
9
0.85
1995
Alternating paths in edge-colored complete graphs
16
2.68
1995
Grids in random graphs
2
0.57
1994
Packing problems in edge-colored graphs
5
1.92
1994
Computation Of The Forwarding Index Via Flows - A Note
3
0.54
1994
The forwarding index of communication networks with given connectivity
8
1.15
1992
A linear-time algorithm for finding Hamiltonian cycles in tournaments
11
0.95
1992
k-Linked and k-cyclic digraphs
1
0.36
1990
Polynomial algorithms for finding cycles and paths in bipartite tournaments
12
3.71
1990
k-linked and k-cyclic digraphs
7
0.60
1990
1