Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Gianpiero Monaco" ( http://dblp.L3S.de/Authors/Gianpiero_Monaco )

  Author page on DBLP  Author page in RDF  Community of Gianpiero Monaco in ASPL-2

Publication years (Num. hits)
2006-2011 (16)
Publication types (Num. hits)
article(6) inproceedings(10)
Venues (Conferences, Journals, ...)
OPODIS(2) Theor. Comput. Sci.(2) COCOON(1) Computer Networks(1) Euro-Par(1) IEEE/ACM Trans. Netw.(1) IPDPS(1) J. Comb. Optim.(1) J. Parallel Distrib. Comput.(1) MFCS(1) SAGT(1) SPAA(1) WG(1) WINE(1)
Authors
Gianpiero Monaco(16) Luca Moscardelli(14) Michele Flammini(14) Shmuel Zaks(12) Mordechai Shalom(10) Vittorio Bilò(3) Alberto Marchetti-Spaccamela(2) Hadas Shachnai(2) Ioannis Caragiannis(2) Tami Tamir(2) Angelo Fanelli(1) Stefania Di Giannantonio(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 20 occurrences of 13 keywords
Results
Found 16 publication records. Showing 16 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli On the performances of Nash equilibria in isolation games. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Optimizing regenerator cost in traffic grooming. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks On the complexity of the regenerator placement problem in optical networks. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. Search on Bibsonomy OPODIS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks Minimizing total busy time in parallel scheduling with application to optical networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). Search on Bibsonomy OPODIS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Gianpiero Monaco Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks Minimizing total busy time in parallel scheduling with application to optical networks. Search on Bibsonomy IPDPS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks On the complexity of the regenerator placement problem in optical networks. Search on Bibsonomy SPAA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithms, complexity, optical networks, wavelength division multiplexing (wdm), regenerators
1Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli On the Performances of Nash Equilibria in Isolation Games. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Approximating the traffic grooming problem in tree and star networks. Search on Bibsonomy J. Parallel Distrib. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Selfishness, collusion and power of local search for the ADMs minimization problem. Search on Bibsonomy Computer Networks The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. Search on Bibsonomy Euro-Par The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Optical Add-Drop Multiplexer(OADM), Path and Ring Networks, Optical Networks, Traffic Grooming, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM)
1Ioannis Caragiannis, Gianpiero Monaco A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Stefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. Search on Bibsonomy WINE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Price of Collusion, Game Theory, Optical Networks, Price of Anarchy, Wavelength Division Multiplexing (WDM), Nash Equilibria, Add-Drop Multiplexer (ADM)
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Approximating the Traffic Grooming Problem in Tree and Star Networks. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Optical Networks, Tree Networks, Traffic Grooming, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM)
Displaying result #1 - #16 of 16 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.