default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYannis Manoussakis
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j62]Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham
:
Tropical paths in vertex-colored graphs. J. Comb. Optim. 42(3): 476-498 (2021)
2010 – 2019
- 2019
- [j61]Valentin Borozan, Wenceslas Fernandez de la Vega, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Hong Phong Pham, Rachid Saad:
Maximum colored trees in edge-colored graphs. Eur. J. Comb. 80: 296-310 (2019) - [j60]Yandong Bai, Yannis Manoussakis:
On the Number of Vertex-Disjoint Cycles in Digraphs. SIAM J. Discret. Math. 33(4): 2444-2451 (2019) - 2018
- [j59]Yannis Manoussakis, Hong Phong Pham:
Maximum colorful independent sets in vertex-colored graphs. Electron. Notes Discret. Math. 68: 251-256 (2018) - [j58]Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe sets in graphs: Graph classes and structural parameters. J. Comb. Optim. 36(4): 1221-1242 (2018) - [j57]Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Abdelhakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
Tropical dominating sets in vertex-coloured graphs. J. Discrete Algorithms 48: 27-41 (2018) - [j56]Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza:
Safe sets, network majority on weighted trees. Networks 71(1): 81-92 (2018) - [c14]Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Maximum Colorful Cliques in Vertex-Colored Graphs. COCOON 2018: 480-491 - [c13]Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Maximum Colorful Cycles in Vertex-Colored Graphs. CSR 2018: 106-117 - 2017
- [j55]Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr:
The complexity of tropical graph homomorphisms. Discret. Appl. Math. 229: 64-81 (2017) - [j54]Raquel Águeda, Valentin Borozan, Raquel Díaz, Yannis Manoussakis, Leandro Montero:
Proper Hamiltonian cycles in edge-colored multigraphs. Discret. Math. 340(8): 1897-1902 (2017) - [j53]Johanne Cohen, Yannis Manoussakis, Hong Phong Pham, Zsolt Tuza:
Tropical matchings in vertex-colored graphs. Electron. Notes Discret. Math. 62: 219-224 (2017) - [j52]Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero:
Proper Hamiltonian Paths in Edge-Coloured Multigraphs. Graphs Comb. 33(4): 617-633 (2017) - [c12]Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Tropical Paths in Vertex-Colored Graphs. COCOA (2) 2017: 291-305 - 2016
- [j51]Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, Yannis Manoussakis:
Connected Tropical Subgraphs in Vertex-Colored Graphs. Discret. Math. Theor. Comput. Sci. 17(3) (2016) - [j50]Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza:
Network Majority on Tree Topological Network. Electron. Notes Discret. Math. 54: 79-84 (2016) - [j49]Valentin Borozan, Michael Ferrara, Shinya Fujita, Michitaka Furuya, Yannis Manoussakis, Narayanan Narayanan, Derrick Stolee:
Partitioning a Graph into Highly Connected Subgraphs. J. Graph Theory 82(3): 322-333 (2016) - [c11]Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe Sets in Graphs: Graph Classes and Structural Parameters. COCOA 2016: 241-253 - [c10]Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, Narayanan Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
Tropical Dominating Sets in Vertex-Coloured Graphs. WALCOM 2016: 17-27 - [i4]Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr:
The complexity of tropical graph homomorphisms. CoRR abs/1607.04777 (2016) - 2015
- [j48]Abdelhakim El Maftouhi, Ararat Harutyunyan, Yannis Manoussakis:
Weak Balance in Random Signed Graphs. Internet Math. 11(2): 143-154 (2015) - [i3]Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
Tropical Dominating Sets in Vertex-Coloured Graphs. CoRR abs/1503.01008 (2015) - 2014
- [j47]Yannis Manoussakis, H. P. Patil:
On degree sets and the minimum orders in bipartite graphs. Discuss. Math. Graph Theory 34(2): 383-390 (2014) - [i2]Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero:
Proper Hamiltonian Paths in Edge-Coloured Multigraphs. CoRR abs/1406.5376 (2014) - [i1]Raquel Águeda, Valentin Borozan, Raquel Díaz, Yannis Manoussakis, Leandro Montero:
Proper Hamiltonian Cycles in Edge-Colored Multigraphs. CoRR abs/1411.5240 (2014) - 2012
- [j46]Hao Li, Yannis Manoussakis:
Preface. Discret. Math. 312(17): 2531 (2012) - [j45]Valentin Borozan, Shinya Fujita, Aydin Gerek, Colton Magnant, Yannis Manoussakis, Leandro Montero, Zsolt Tuza:
Proper connection of graphs. Discret. Math. 312(17): 2550-2560 (2012) - [j44]Raquel Águeda, Valentin Borozan, Yannis Manoussakis, Gervais Mendy, Rahul Muthu:
Sufficient conditions for the existence of spanning colored trees in edge-colored graphs. Discret. Math. 312(17): 2694-2699 (2012) - [j43]Abdelhakim El Maftouhi, Yannis Manoussakis, O. Megalakaki:
Balance in Random Signed Graphs. Internet Math. 8(4): 364-380 (2012) - 2011
- [j42]Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero:
Proper Hamiltonian Paths in Edge-Colored Multigraphs. Electron. Notes Discret. Math. 38: 5-10 (2011) - 2010
- [j41]Yannis Manoussakis:
Preface. Eur. J. Comb. 31(2): 419-422 (2010) - [j40]J. M. Becu, M. Dah, Yannis Manoussakis, Gervais Mendy:
Links in edge-colored graphs. Eur. J. Comb. 31(2): 442-460 (2010) - [j39]Abdelfattah Abouelaoualim, Kinkar Chandra Das, Wenceslas Fernandez de la Vega, Marek Karpinski, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad:
Cycles and paths in edge-colored graphs with given degrees. J. Graph Theory 64(1): 63-86 (2010)
2000 – 2009
- 2009
- [j38]Yannis Manoussakis:
Longest Cycles in 3-connected Graphs with Given Independence Number. Graphs Comb. 25(3): 377-384 (2009) - [c9]Abdelfattah Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Rachid Saad:
Colored Trees in Edge-Colored Graphs. CTW 2009: 115-119 - 2008
- [j37]Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad:
Paths and trails in edge-colored graphs. Theor. Comput. Sci. 409(3): 497-510 (2008) - [c8]Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad:
Paths and Trails in Edge-Colored Graphs. LATIN 2008: 723-735 - 2004
- [j36]Mohamed El Haddad, Yannis Manoussakis, Rachid Saad:
Upper bounds for the forwarding indices of communication networks. Discret. Math. 286(3): 233-240 (2004) - 2003
- [j35]A. Benkouar, Yannis Manoussakis, Rachid Saad:
The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle. Discret. Math. 263(1-3): 1-10 (2003) - [j34]Yannis Manoussakis, H. P. Patil:
Bipartite Graphs and their Degree Sets. Electron. Notes Discret. Math. 15: 125 (2003) - 2002
- [j33]Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis:
Scheduling Independent Multiprocessor Tasks. Algorithmica 32(2): 247-261 (2002) - [j32]Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi:
On max cut in cubic graphs. Parallel Algorithms Appl. 17(3): 165-183 (2002) - 2001
- [j31]Gerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert:
Preface. Theor. Comput. Sci. 263(1-2): 1 (2001) - [j30]Yannis Manoussakis, Zsolt Tuza:
Ramsey numbers for tournaments. Theor. Comput. Sci. 263(1-2): 75-85 (2001) - 2000
- [j29]Evripidis Bampis, Aristotelis Giannakos, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis:
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases. RAIRO Theor. Informatics Appl. 34(2): 87-98 (2000)
1990 – 1999
- 1999
- [j28]Yannis Manoussakis, Ioannis Milis:
A sufficient condition for maximum cycles in bipartite digraphs. Discret. Math. 207(1-3): 161-171 (1999) - [j27]Abdel Krim Amoura, Evripidis Bampis, Yannis Manoussakis, Zsolt Tuza:
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors. Parallel Comput. 25(1): 49-61 (1999) - [j26]Evripidis Bampis, Yannis Manoussakis, Ioannis Milis:
On the parallel complexity of the alternating Hamiltonian cycle problem. RAIRO Oper. Res. 33(4): 421-437 (1999) - [c7]Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi:
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. ASIAN 1999: 27-36 - 1998
- [j25]Evripidis Bampis, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis:
A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph. Parallel Process. Lett. 8(3): 399-405 (1998) - 1997
- [j24]Jørgen Bang-Jensen, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka:
Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs. Algorithmica 17(1): 67-87 (1997) - [c6]Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis:
Scheduling Independent Multiprocessor Tasks. ESA 1997: 1-12 - 1996
- [j23]Yannis Manoussakis, Zsolt Tuza:
The Forwarding Index of Directed Networks. Discret. Appl. Math. 68(3): 279-291 (1996) - [j22]Alexander V. Karzanov, Yannis Manoussakis:
Minimum (2, r)-Metrics and Integer Multiflows. Eur. J. Comb. 17(2-3): 223-232 (1996) - [j21]Yannis Manoussakis, Michael Spyratos, Zsolt Tuza, Margit Voigt:
Minimal colorings for properly colored subgraphs. Graphs Comb. 12(1): 345-360 (1996) - [j20]Yannis Manoussakis, Michael Spyratos, Zsolt Tuza:
Cycles of given color patterns. J. Graph Theory 21(2): 153-162 (1996) - [j19]Yannis Manoussakis, Zsolt Tuza:
Optimal routings in communication networks with linearly bounded forwarding index. Networks 28(4): 177-180 (1996) - [e1]Michel Deza, Reinhardt Euler, Yannis Manoussakis:
Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers. Lecture Notes in Computer Science 1120, Springer 1996, ISBN 3-540-61576-8 [contents] - 1995
- [j18]Yannis Manoussakis:
Alternating Paths in Edge-colored Complete Graphs. Discret. Appl. Math. 56(2-3): 297-309 (1995) - [j17]Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha:
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. J. Algorithms 19(3): 432-440 (1995) - [j16]Jørgen Bang-Jensen, Yannis Manoussakis:
Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments. J. Comb. Theory B 63(2): 261-280 (1995) - [c5]Evripidis Bampis, Pavol Hell, Yannis Manoussakis, Moshe Rosenfeld:
Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament. Combinatorics and Computer Science 1995: 67-73 - [c4]Evripidis Bampis, Yannis Manoussakis, Ioannis Milis:
On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem. Combinatorics and Computer Science 1995: 367-377 - 1994
- [j15]Jørgen Bang-Jensen, Yannis Manoussakis:
Cycles Through k Vertices in Bipartite Tournaments. Comb. 14(2): 243-246 (1994) - [j14]Pavol Hell, Yannis Manoussakis, Zsolt Tuza:
Packing Problems in Edge-colored Graphs. Discret. Appl. Math. 52(3): 295-306 (1994) - [j13]Ke Min Zhang, Yannis Manoussakis, Zeng Min Song:
Complementary cycles containing a fixed arc in diregular bipartite tournaments. Discret. Math. 133(1-3): 325-328 (1994) - [j12]Wenceslas Fernandez de la Vega, Yannis Manoussakis:
Computation of the forwarding index via flows: A note. Networks 24(5): 273-276 (1994) - [j11]Wenceslas Fernandez de la Vega, Yannis Manoussakis:
Grids in Random Graphs. Random Struct. Algorithms 5(2): 329-336 (1994) - [c3]Evripidis Bampis, Yannis Manoussakis, Ioannis Milis:
NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract). WG 1994: 387-394 - 1993
- [c2]Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha:
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. PARLE 1993: 553-560 - 1992
- [j10]Yannis Manoussakis:
A linear-time algorithm for finding Hamiltonian cycles in tournaments. Discret. Appl. Math. 36(2): 199-201 (1992) - [j9]Wenceslas Fernandez de la Vega, Yannis Manoussakis:
The Forwarding Index of Communication Networks with Given Connectivity. Discret. Appl. Math. 37/38: 147-155 (1992) - [j8]Yannis Manoussakis, Denise Amar:
Hamiltonian paths and cycles, number of arcs and independence number in digraphs. Discret. Math. 105(1-3): 157-172 (1992) - [j7]Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen:
A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. J. Algorithms 13(1): 114-127 (1992) - [j6]Yannis Manoussakis:
Directed hamiltonian graphs. J. Graph Theory 16(1): 51-59 (1992) - 1991
- [c1]A. Benkouar, Yannis Manoussakis, Vangelis Th. Paschos, Rachid Saad:
On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs. ISA 1991: 190-198 - 1990
- [j5]Yannis Manoussakis:
k-Linked and k-cyclic digraphs. J. Comb. Theory B 48(2): 216-226 (1990) - [j4]Denise Amar, Yannis Manoussakis:
Cycles and paths of many lengths in bipartite digraphs. J. Comb. Theory B 50(2): 254-264 (1990) - [j3]Yannis Manoussakis, Zsolt Tuza:
Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments. SIAM J. Discret. Math. 3(4): 537-543 (1990)
1980 – 1989
- 1989
- [j2]Roland Häggkvist, Yannis Manoussakis:
Cicles and paths in bipartite tournaments with spanning configurations. Comb. 9(1): 33-38 (1989) - [j1]Manoussakis Manolis, Yannis Manoussakis:
The number of bipartite tournaments with a unique given factor. J. Graph Theory 13(3): 359-368 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
