Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichele Flammini
Person information
- affiliation: Gran Sasso Science Institute of L'Aquila, Italy
- affiliation (former): University of L'Aquila, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2023
[j82]Linh T. Duong
, Phuong T. Nguyen, Ludovico Iovino, Michele Flammini:
Automatic detection of Covid-19 from chest X-ray and lung computed tomography images using deep neural networks and transfer learning. Appl. Soft Comput. 132: 109851 (2023)- 2022
- [j81]Michele Flammini, Bojana Kodric, Giovanna Varricchio:
Strategyproof mechanisms for Friends and Enemies Games. Artif. Intell. 302: 103610 (2022) - [j80]Alkida Balliu, Michele Flammini, Giovanna Melideo, Dennis Olivetti:
On Pareto optimality in social distance games. Artif. Intell. 312: 103768 (2022) - [j79]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost envy-free allocations with connected bundles. Games Econ. Behav. 131: 197-221 (2022) - [j78]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Pricing Problems with Buyer Preselection. J. Artif. Intell. Res. 74: 1791-1822 (2022) - 2021
- [j77]Michele Flammini, Manuel Mauro, Matteo Tonelli:
On fair price discrimination in multi-unit markets. Artif. Intell. 290: 103388 (2021) - [j76]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
On Nash Equilibria in Non-Cooperative All-Optical Networks. Algorithms 14(1): 15 (2021) - [j75]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation. Algorithms 14(5): 151 (2021) - [j74]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions. Distributed Comput. 34(1): 1-14 (2021) - [j73]Michele Flammini, Bojana Kodric, Gianpiero Monaco, Qiang Zhang:
Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games. J. Artif. Intell. Res. 70: 1253-1279 (2021) - [j72]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Online Coalition Structure Generation Problem. J. Artif. Intell. Res. 72: 1215-1250 (2021) - [j71]Ludovico Iovino, Phuong Thanh Nguyen, Amleto Di Salle, Francesco Gallo, Michele Flammini:
Unavailable Transit Feed Specification: Making It Available With Recurrent Neural Networks. IEEE Trans. Intell. Transp. Syst. 22(4): 2111-2122 (2021) - 2020
- [j70]Edith Elkind, Angelo Fanelli, Michele Flammini:
Price of Pareto Optimality in hedonic games. Artif. Intell. 288: 103357 (2020) - [j69]Vittorio Bilò, Michele Flammini, Vasco Gallotti, Cosimo Vinci:
On Multidimensional Congestion Games. Algorithms 13(10): 261 (2020) - [j68]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
The price of stability for undirected broadcast network design with fair cost allocation is constant. Games Econ. Behav. 123: 359-376 (2020) - 2019
- [j67]Michele Flammini, Manuel Mauro, Matteo Tonelli:
On social envy-freeness in multi-unit markets. Artif. Intell. 269: 1-26 (2019) - [j66]Alkida Balliu, Michele Flammini, Giovanna Melideo, Dennis Olivetti:
On Non-Cooperativeness in Social Distance Games. J. Artif. Intell. Res. 66: 625-653 (2019) - [j65]Vittorio Bilò, Michele Flammini:
Guest Editorial: Special Issue on Algorithmic Game Theory. Theory Comput. Syst. 63(7): 1449-1450 (2019) - 2018
- [j64]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation. J. Artif. Intell. Res. 62: 315-371 (2018) - 2017
- [j63]Vittorio Bilò, Michele Flammini, Gianpiero Monaco:
Approximating the revenue maximization problem with sharp demands. Theor. Comput. Sci. 662: 9-30 (2017) - [j62]Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco, Luca Moscardelli:
Network Movement Games. Theor. Comput. Sci. 667: 101-118 (2017) - 2016
- [j61]Michele Flammini, Giuseppe Persiano:
Report on 1st GSSI Summer Meeting on Algorithms. Bull. EATCS 120 (2016) - [j60]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
The price of envy-freeness in machine scheduling. Theor. Comput. Sci. 613: 65-78 (2016) - 2015
- [j59]Anna Angelucci, Vittorio Bilò, Michele Flammini, Luca Moscardelli:
On the sequential price of anarchy of isolation games. J. Comb. Optim. 29(1): 165-181 (2015) - [j58]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Some Anomalies of Farsighted Strategic Behavior. Theory Comput. Syst. 56(1): 156-180 (2015) - 2014
- [j57]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. Algorithmica 68(3): 671-691 (2014) - 2013
- [j56]Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Stackelberg Strategies for Network Design Games. Internet Math. 9(4): 336-359 (2013) - [j55]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
The price of stability of fair undirected broadcast games is constant. SIGecom Exch. 12(2): 42-45 (2013) - [j54]Vittorio Bilò, Alessandro Celi, Michele Flammini, Vasco Gallotti:
Social context congestion games. Theor. Comput. Sci. 514: 21-35 (2013) - [j53]Ioannis Caragiannis, Michele Flammini, Luca Moscardelli:
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. IEEE/ACM Trans. Netw. 21(4): 1322-1331 (2013) - 2012
- [j52]Angelo Fanelli, Michele Flammini, Luca Moscardelli:
The speed of convergence in congestion games under best-response dynamics. ACM Trans. Algorithms 8(3): 25:1-25:15 (2012) - 2011
- [j51]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Graphical Congestion Games. Algorithmica 61(2): 274-297 (2011) - [j50]Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli:
Tight Bounds for Selfish and Greedy Load Balancing. Algorithmica 61(3): 606-637 (2011) - [j49]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the performances of Nash equilibria in isolation games. J. Comb. Optim. 22(3): 378-391 (2011) - [j48]Angelo Fanelli, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli:
Experimental Evaluations of Algorithms for IP Table Minimization. J. Interconnect. Networks 12(4): 299-318 (2011) - [j47]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Performance of One-Round Walks in Linear Congestion Games. Theory Comput. Syst. 49(1): 24-45 (2011) - [j46]Vittorio Bilò, Michele Flammini:
Extending the notion of rationality of selfish agents: Second Order Nash equilibria. Theor. Comput. Sci. 412(22): 2296-2311 (2011) - [j45]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Optimizing regenerator cost in traffic grooming. Theor. Comput. Sci. 412(52): 7109-7121 (2011) - [j44]Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks:
On the complexity of the regenerator placement problem in optical networks. IEEE/ACM Trans. Netw. 19(2): 498-511 (2011) - 2010
- [j43]Angelo Fanelli, Michele Flammini, Luca Moscardelli:
On the Convergence of Multicast Games in Directed Networks. Algorithmica 57(2): 301-324 (2010) - [j42]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli:
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions. Theory Comput. Syst. 47(2): 507-530 (2010) - [j41]Michele Flammini, Gaia Nicosia:
On the bicriteria k-server problem. ACM Trans. Algorithms 7(1): 6:1-6:19 (2010) - [j40]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
When ignorance helps: Graphical multicast cost sharing games. Theor. Comput. Sci. 411(3): 660-671 (2010) - [j39]Michele 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. Theor. Comput. Sci. 411(40-42): 3553-3562 (2010) - 2009
- [j38]Michele Flammini, Alfredo Navarra:
Layouts for mobility management in wireless ATM networks. Discret. Appl. Math. 157(1): 98-111 (2009) - [j37]Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On minimizing the number of ADMs in a general topology optical network. Discret. Appl. Math. 157(12): 2701-2717 (2009) - 2008
- [j36]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Selfishness, collusion and power of local search for the ADMs minimization problem. Comput. Networks 52(9): 1721-1731 (2008) - [j35]Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the traffic grooming problem. J. Discrete Algorithms 6(3): 472-479 (2008) - [j34]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the traffic grooming problem in tree and star networks. J. Parallel Distributed Comput. 68(7): 939-948 (2008) - [j33]Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes:
Asymptotically Optimal Solutions for Small World Graphs. Theory Comput. Syst. 42(4): 632-650 (2008) - [j32]Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli:
On Nash equilibria for multicast transmissions in ad-hoc wireless networks. Wirel. Networks 14(2): 147-157 (2008) - [j31]Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes:
Tightening the upper bound for the minimum energy broadcasting. Wirel. Networks 14(5): 659-669 (2008) - 2007
- [j30]Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes:
Improved Approximation Results for the Minimum Energy Broadcasting Problem. Algorithmica 49(4): 318-336 (2007) - [j29]Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. J. Parallel Distributed Comput. 67(4): 448-455 (2007) - 2006
- [j28]Michele Flammini, Gaia Nicosia:
Competitive algorithms for the bicriteria k-server problem. Discret. Appl. Math. 154(15): 2117-2127 (2006) - [j27]Michele Flammini, Alfredo Navarra, Gaia Nicosia:
Efficient offline algorithms for the bicriteria k-server problem and online applications. J. Discrete Algorithms 4(3): 414-432 (2006) - [j26]Michele Flammini, Alfredo Navarra, Stephane Perennes:
The "real" approximation factor of the MST heuristic for the minimum energy broadcasting. ACM J. Exp. Algorithmics 11 (2006) - [j25]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
Pareto approximations for the bicriteria scheduling problem. J. Parallel Distributed Comput. 66(3): 393-402 (2006) - [j24]Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli, Alfredo Navarra:
Sharing the cost of multicast transmissions in wireless networks. Theor. Comput. Sci. 369(1-3): 269-284 (2006) - 2005
- [j23]Michele Flammini, Stéphane Pérennes:
Lower bounds on systolic gossip. Inf. Comput. 196(2): 71-94 (2005) - [j22]Michele Flammini, Giorgio Gambosi, Alfredo Navarra:
Wireless ATM Layouts for Chain Networks. Mob. Networks Appl. 10(1-2): 35-45 (2005) - [j21]Michele Flammini, Alfredo Navarra, Andrzej Proskurowski:
On routing of wavebands for all-to-all communications in all-optical paths and cycles. Theor. Comput. Sci. 333(3): 401-413 (2005) - 2004
- [j20]Vittorio Bilò, Michele Flammini, Roberto Giovannelli:
Experimental analysis of online algorithms for the bicriteria scheduling problem. J. Parallel Distributed Comput. 64(9): 1086-1100 (2004) - [j19]Michele Flammini, Stéphane Pérennes:
Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols. SIAM J. Discret. Math. 17(4): 521-540 (2004) - 2003
- [j18]Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes:
Deadlock Prevention by Acyclic Orientations. Discret. Appl. Math. 129(1): 31-47 (2003) - 2002
- [j17]Claudio Arbib, Michele Flammini:
On the upper chromatic number of (v3, b2)-configurations. Discret. Appl. Math. 120(1-3): 3-12 (2002) - [j16]Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Static and dynamic low-congested interval routing schemes. Theor. Comput. Sci. 276(1-2): 315-354 (2002) - 2001
- [j15]Michele Flammini, Enrico Nardelli, Guido Proietti:
ATM layouts with bounded hop count and congestion. Distributed Comput. 14(2): 65-73 (2001) - [j14]Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. J. Parallel Distributed Comput. 61(10): 1472-1488 (2001) - [j13]Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Characterization results of all shortest paths interval routing schemes. Networks 37(4): 225-232 (2001) - [j12]Michele Flammini, Stephane Perennes:
On the Optimality of General Lower Bounds for Broadcasting and Gossiping. SIAM J. Discret. Math. 14(2): 267-282 (2001) - 2000
- [j11]Claudio Arbib, Michele Flammini, Enrico Nardelli:
How to Survive While Visiting a Graph. Discret. Appl. Math. 99(1-3): 279-293 (2000) - [j10]Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Low-congested interval routing schemes for hypercubelike networks. Networks 36(3): 191-201 (2000) - 1999
- [j9]Michele Flammini, Christian Scheideler:
Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput. Syst. 32(3): 387-420 (1999) - [j8]Michele Flammini:
Deadlock-free interval routing schemes. Networks 34(1): 47-60 (1999) - 1998
- [j7]Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela:
The Complexity of Interval Routing on Random Graphs. Comput. J. 41(1): 16-25 (1998) - [j6]Tamar Eilam, Michele Flammini, Shmuel Zaks:
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load. Parallel Process. Lett. 8(2): 207-220 (1998) - [j5]Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Multidimensional Interval Routing Schemes. Theor. Comput. Sci. 205(1-2): 115-133 (1998) - 1997
- [j4]Michele Flammini:
On the Hardness of Devising Interval Routing Schemes. Parallel Process. Lett. 7(1): 39-47 (1997) - [j3]Michele Flammini, Giorgio Gambosi:
On Devising Boolean Routing Schemes. Theor. Comput. Sci. 186(1-2): 171-198 (1997) - 1996
- [j2]Michele Flammini, Giorgio Gambosi, Sandro Salomone:
Interval Routing Schemes. Algorithmica 16(6): 549-568 (1996) - 1994
- [j1]Michele Flammini:
On the Learnability of Monotone k \mu-DNF Formulae Under Product Distributions. Inf. Process. Lett. 52(3): 167-173 (1994)
Conference and Workshop Papers
- 2024
- [c101]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
On Green Sustainability of Resource Selection Games with Equitable Cost-Sharing. AAMAS 2024: 207-215 - [c100]Alessandro Aloisio, Vittorio Bilò, Antonio Mario Caruso, Michele Flammini, Cosimo Vinci:
Approximately Fair Allocation of Indivisible Items with Random Valuations. AAMAS 2024: 2120-2122 - [c99]Alessandro Aloisio, Michele Flammini, Cosimo Vinci:
Generalized Distance Polymatrix Games. SOFSEM 2024: 25-39 - 2023
- [c98]Simone Fioravanti, Michele Flammini, Bojana Kodric, Giovanna Varricchio:
PAC Learning and Stabilizing Hedonic Games: Towards a Unifying Approach. AAAI 2023: 5641-5648 - [c97]Alessandro Aloisio, Michele Flammini, Bojana Kodric, Cosimo Vinci:
Distance Polymatrix Coordination Games (short paper). IPS-RCRA-SPIRIT@AI*IA 2023 - [c96]Simone Fioravanti, Michele Flammini, Bojana Kodric, Giovanna Varricchio:
ε-fractional core stability in Hedonic Games. NeurIPS 2023 - 2022
- [c95]Michele Flammini, Giovanna Varricchio:
Approximate Strategyproof Mechanisms for the Additively Separable Group Activity Selection Problem. IJCAI 2022: 300-306 - [c94]Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco:
Digraph k-Coloring Games: From Theory to Practice. SEA 2022: 20:1-20:18 - 2021
- [c93]Alessandro Aloisio, Michele Flammini, Bojana Kodric, Cosimo Vinci:
Distance Polymatrix Coordination Games. IJCAI 2021: 3-9 - [c92]Michele Flammini, Bojana Kodric, Martin Olsen, Giovanna Varricchio:
Distance Hedonic Games. SOFSEM 2021: 159-174 - 2020
- [c91]Alessandro Aloisio, Michele Flammini, Cosimo Vinci:
The Impact of Selfishness in Hypergraph Hedonic Games. AAAI 2020: 1766-1773 - [c90]Michele Flammini, Bojana Kodric, Giovanna Varricchio:
Strategyproof Mechanisms for Friends and Enemies Games. AAAI 2020: 1950-1957 - [c89]Michele Flammini, Bojana Kodric, Martin Olsen, Giovanna Varricchio:
Distance Hedonic Games. AAMAS 2020: 1846-1848 - [c88]Vittorio Bilò, Michele Flammini, Cosimo Vinci:
The Quality of Content Publishing in the Digital Era. ECAI 2020: 35-42 - [c87]Michele Flammini, Manuel Mauro, Matteo Tonelli, Cosimo Vinci:
Inequity Aversion Pricing in Multi-Unit Markets. ECAI 2020: 91-98 - [c86]Michele Flammini, Hugo Gilbert:
Parameterized Complexity of Manipulating Sequential Allocation. ECAI 2020: 99-106 - 2019
- [c85]Luca Aceto, Gianlorenzo D'Angelo, Michele Flammini, Omar Inverso, Ludovico Iovino, Catia Trubiani:
Building International Doctoral Schools in Computer Science in Italy, De Nicola's Way. Models, Languages, and Tools for Concurrent and Distributed Programming 2019: 7-12 - [c84]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems. IJCAI 2019: 102-108 - [c83]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost Envy-Free Allocations with Connected Bundles. ITCS 2019: 14:1-14:21 - 2018
- [c82]Michele Flammini, Manuel Mauro, Matteo Tonelli:
On Social Envy-Freeness in Multi-Unit Markets. AAAI 2018: 1031-1038 - [c81]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Online Coalition Structure Generation in Graph Games. AAMAS 2018: 1353-1361 - [c80]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the Impact of Buyers Preselection in Pricing Problems. AAMAS 2018: 1871-1873 - [c79]Michele Flammini, Manuel Mauro, Matteo Tonelli:
On Fair Price Discrimination in Multi-Unit Markets. IJCAI 2018: 247-253 - [c78]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Pricing Problems with Buyer Preselection. MFCS 2018: 47:1-47:16 - 2017
- [c77]Alkida Balliu, Michele Flammini, Giovanna Melideo, Dennis Olivetti:
Nash Stability in Social Distance Games. AAAI 2017: 342-348 - [c76]Alkida Balliu, Michele Flammini, Dennis Olivetti:
On Pareto Optimality in Social Distance Games. AAAI 2017: 349-355 - [c75]Raffaello Carosi, Michele Flammini, Gianpiero Monaco:
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games. AAMAS 2017: 911-919 - [c74]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Gianpiero Monaco:
Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems. ICALP 2017: 125:1-125:13 - [c73]Michele Flammini, Gianpiero Monaco, Qiang Zhang:
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games. WAOA 2017: 301-316 - 2016
- [c72]Edith Elkind, Angelo Fanelli, Michele Flammini:
Price of Pareto Optimality in Hedonic Games. AAAI 2016: 475-481 - 2015
- [c71]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the Price of Stability of Fractional Hedonic Games. AAMAS 2015: 1239-1247 - [c70]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions. WINE 2015: 118-131 - 2014
- [c69]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
The Price of Envy-Freeness in Machine Scheduling. MFCS (2) 2014: 106-117 - [c68]Vittorio Bilò, Michele Flammini, Gianpiero Monaco:
Approximating the Revenue Maximization Problem with Sharp Demands. SWAT 2014: 74-85 - [c67]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Nash Stability in Fractional Hedonic Games. WINE 2014: 486-491 - 2013
- [c66]Anna Angelucci, Vittorio Bilò, Michele Flammini, Luca Moscardelli:
On the Sequential Price of Anarchy of Isolation Games. COCOON 2013: 17-28 - [c65]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant. FOCS 2013: 638-647 - 2012
- [c64]Vittorio Bilò, Michele Flammini, Vasco Gallotti:
On Bidimensional Congestion Games. SIROCCO 2012: 147-158 - [c63]Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco, Luca Moscardelli:
Mobile Network Creation Games. SIROCCO 2012: 159-170 - [c62]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Some Anomalies of Farsighted Strategic Behavior. WAOA 2012: 229-241 - 2011
- [c61]Gianni Amati, Alessandro Celi, Cesidio Di Nicola, Michele Flammini, Daniela Pavone:
Improved Stable Retrieval in Noisy Collections. ICTIR 2011: 342-345 - [c60]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. OPODIS 2011: 96-111 - [c59]Vittorio Bilò, Alessandro Celi, Michele Flammini, Vasco Gallotti:
Social Context Congestion Games. SIROCCO 2011: 282-293 - [c58]Gianni Amati, Giuseppe Amodeo, Marco Bianchi, Giuseppe Marcone, Fondazione Ugo Bordoni, Carlo Gaibisso, Giorgio Gambosi, Alessandro Celi, Cesidio Di Nicola, Michele Flammini:
FUB, IASI-CNR, UNIVAQ at TREC 2011 Microblog Track. TREC 2011 - 2010
- [c57]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). OPODIS 2010: 443-458 - [c56]Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Stackelberg Strategies for Network Design Games. WINE 2010: 222-233 - 2009
- [c55]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the Performances of Nash Equilibria in Isolation Games. COCOON 2009: 17-26 - [c54]Michele 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. IPDPS 2009: 1-12 - [c53]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Performances of One-Round Walks in Linear Congestion Games. SAGT 2009: 311-322 - [c52]Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks:
On the complexity of the regenerator placement problem in optical networks. SPAA 2009: 154-162 - 2008
- [c51]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. Euro-Par 2008: 920-929 - [c50]Angelo Fanelli, Michele Flammini, Luca Moscardelli:
The Speed of Convergence in Congestion Games under Best-Response Dynamics. ICALP (1) 2008: 796-807 - [c49]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
When Ignorance Helps: Graphical Multicast Cost Sharing Games. MFCS 2008: 108-119 - [c48]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Graphical congestion games with linear latencies. SPAA 2008: 194-196 - [c47]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Graphical Congestion Games. WINE 2008: 70-81 - 2007
- [c46]Ioannis Caragiannis, Michele Flammini, Luca Moscardelli:
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. ICALP 2007: 447-458 - [c45]Vittorio Bilò, Michele Flammini:
Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria. MFCS 2007: 621-632 - [c44]Angelo Fanelli, Michele Flammini, Luca Moscardelli:
On the convergence of multicast games in directed networks. SPAA 2007: 330-338 - [c43]Angelo Fanelli, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli:
Experimental Evaluations of Algorithms for IP Table Minimization. WEA 2007: 324-337 - [c42]Stefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. WINE 2007: 404-411 - 2006
- [c41]Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. CAAN 2006: 72-85 - [c40]Marco Autili, Michele Flammini, Paola Inverardi, Alfredo Navarra, Massimo Tivoli:
Synthesis of Concurrent and Distributed Adaptors for Component-Based Systems. EWSA 2006: 17-32 - [c39]Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli:
Tight Bounds for Selfish and Greedy Load Balancing. ICALP (1) 2006: 311-322 - [c38]Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli:
Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves. MFCS 2006: 363-374 - [c37]Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On Minimizing the Number of ADMs in a General Topology Optical Network. DISC 2006: 459-473 - [c36]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem in Tree and Star Networks. WG 2006: 147-158 - 2005
- [c35]Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem. ISAAC 2005: 915-924 - [c34]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
On Nash Equilibria in Non-cooperative All-Optical Networks. STACS 2005: 448-459 - [c33]Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes:
Asymptotically Optimal Solutions for Small World Graphs. DISC 2005: 414-428 - [c32]Michele Flammini, Alfredo Navarra, Stéphane Pérennes:
The "Real" Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting. WEA 2005: 22-31 - 2004
- [c31]Michele Flammini, Alfredo Navarra, Ralf Klasing, Stéphane Pérennes:
Improved approximation results for the minimum energy broadcasting problem. DIALM-POMC 2004: 85-91 - [c30]Vittorio Bilò, Michele Flammini:
On the IP Routing Tables Minimization with Addresses Reassignment. IPDPS 2004 - [c29]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
Pareto Approximations for the Bicriteria Scheduling Problem. IPDPS 2004 - [c28]Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli:
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks. ISAAC 2004: 172-183 - [c27]Vittorio Bilò, Chiara Di Francescomarino, Michele Flammini, Giovanna Melideo:
Sharing the cost of multicast transmissions in wireless networks. SPAA 2004: 180-187 - 2003
- [c26]Michele Flammini, Giorgio Gambosi, Alessandro Gasparini, Alfredo Navarra:
Dynamic Layouts for Wireless ATM. Euro-Par 2003: 1056-1063 - [c25]Michele Flammini, Giorgio Gambosi, Alfredo Navarra:
Wireless ATM Layouts for Chain Networks. IPDPS 2003: 220 - [c24]Vittorio Bilò, Adriano Di Pasquale, Fabio Fioravanti, Michele Flammini, Luca Forlizzi, Francesco Lo Presti, Giovanna Melideo, Enrico Nardelli, Alfredo Navarra, Guido Proietti:
Quality of Service in Wireless Networks. IPDPS 2003: 224 - [c23]Michele Flammini, Alfredo Navarra, Andrzej Proskurowski:
On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles. SIROCCO 2003: 133-145 - [c22]Vittorio Bilò, Michele Flammini, Roberto Giovannelli:
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem. WEA 2003: 33-46 - [c21]Claudio Arbib, Michele Flammini, Fabrizio Marinelli:
Minimum Flow Time Graph Ordering. WG 2003: 23-33 - 2002
- [c20]Michele Flammini, Bruce M. Maggs, Jop F. Sibeyn, Berthold Vöcking:
Routing and Communication in Interconnection Networks. Euro-Par 2002: 735 - [c19]Adriano Di Pasquale, Michele Flammini, Enrico Nardelli:
Allocation Problems in Scalable Distributed Data Structures. WDAS 2002: 133-142 - 2000
- [c18]Michele Flammini, Gaia Nicosia:
On Multicriteria Online Problems. ESA 2000: 191-201 - 1999
- [c17]Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. SIROCCO 1999: 62-77 - 1998
- [c16]Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Static and Dynamic Low-Congested Interval Routing Schemes. ICALP 1998: 592-603 - [c15]Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Characterization results of all shortest paths interval routing schemes. SIROCCO 1998: 201-213 - 1997
- [c14]Tamar Eilam, Michele Flammini, Shmuel Zaks:
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract). ICALP 1997: 527-537 - [c13]Michele Flammini, Stephane Perennes:
Lower Bounds on Systolic Gossip. IPPS 1997: 517-521 - [c12]Michele Flammini, Christian Scheideler:
Simple, Efficient Routing Schemes for All-Optical Networks. SPAA 1997: 170-179 - [c11]Michele Flammini:
Deadlock-Free Interval Routing Schemes. STACS 1997: 351-362 - [c10]Michele Flammini, Enrico Nardelli, Guido Proietti:
ATM Layouts with Bounded Hop Count and Congestion. WDAG 1997: 52-65 - [c9]Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes:
Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). WG 1997: 52-64 - 1995
- [c8]Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela:
The Complexity of Interval Routing on Random Graphs. MFCS 1995: 37-49 - [c7]Miriam Di Ianni, Michele Flammini, Rossella Flammini, Sandro Salomone:
Systolic Acyclic Orientations for Deadlock Prevention. SIROCCO 1995: 1-12 - [c6]Michele Flammini, Giorgio Gambosi, Sandro Salomone:
Interval Routing Schemes. STACS 1995: 279-290 - [c5]Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Multi-Dimensional Interval Routing Schemes. WDAG 1995: 131-144 - [c4]Michele Flammini, Giorgio Gambosi, Sandro Salomone:
On Devising Boolean Routing Schemes. WG 1995: 222-236 - 1994
- [c3]Michele Flammini, Giorgio Gambosi, Sandro Salomone:
Interval Labeling Scheme for Chordal Rings. SIROCCO 1994: 111-124 - 1993
- [c2]Michele Flammini, Giorgio Gambosi, Sandro Salomone:
Boolean Routing. WDAG 1993: 219-233 - 1992
- [c1]Michele Flammini, Alberto Marchetti-Spaccamela, Ludek Kucera:
Learning DNF Formulae Under Classes of Probability Distributions. COLT 1992: 85-92
Parts in Books or Collections
- 2010
- [p3]Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Xavier Muñoz, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Traffic Grooming: Combinatorial Results and Practical Resolutions. Graphs and Algorithms in Communication Networks 2010: 63-94 - [p2]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Christos Kaklamanis, Gianpiero Monaco, Luca Moscardelli:
Game-Theoretic Approaches to Optimization Problems in Communication Networks. Graphs and Algorithms in Communication Networks 2010: 241-263 - [p1]Alfredo Navarra, Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Ralf Klasing:
Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks. Graphs and Algorithms in Communication Networks 2010: 335-355
Editorship
- 2019
- [e3]Keren Censor-Hillel, Michele Flammini:
Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings. Lecture Notes in Computer Science 11639, Springer 2019, ISBN 978-3-030-24921-2 [contents] - 2017
- [e2]Vittorio Bilò, Michele Flammini:
Algorithmic Game Theory - 10th International Symposium, SAGT 2017, L'Aquila, Italy, September 12-14, 2017, Proceedings. Lecture Notes in Computer Science 10504, Springer 2017, ISBN 978-3-319-66699-0 [contents] - 2000
- [e1]Michele Flammini, Enrico Nardelli, Guido Proietti, Paul G. Spirakis:
SIROCCO 7, Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, Laquila, Italy, June 20-22, 2000. Carleton Scientific 2000 [contents]
Informal and Other Publications
- 2023
- [i6]Simone Fioravanti, Michele Flammini, Bojana Kodric, Giovanna Varricchio:
PAC learning and stabilizing Hedonic Games: towards a unifying approach. CoRR abs/2301.13756 (2023) - [i5]Simone Fioravanti, Michele Flammini, Bojana Kodric, Giovanna Varricchio:
ε-fractional Core Stability in Hedonic Games. CoRR abs/2311.11101 (2023) - 2021
- [i4]Ludovico Iovino, Phuong Thanh Nguyen, Amleto Di Salle, Francesco Gallo, Michele Flammini:
Unavailable Transit Feed Specification: Making it Available with Recurrent Neural Networks. CoRR abs/2102.10323 (2021) - 2018
- [i3]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost Envy-Free Allocations with Connected Bundles. CoRR abs/1808.09406 (2018) - 2017
- [i2]Michele Flammini, Gianpiero Monaco, Qiang Zhang:
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games. CoRR abs/1706.09007 (2017) - 2013
- [i1]Vittorio Bilò, Michele Flammini, Gianpiero Monaco:
Approximating the Revenue Maximization Problem with Sharp Demands. CoRR abs/1312.3892 (2013)
Coauthor Index
[j79] [j78] [j76] [j74] [j69] [j68] [j65] [j64] [j63] [j60] [j59] [j58] [j55] [j54] [j51] [j49] [j47] [j46] [j42] [j40] [j32] [j25] [j24] [j20] [c101] [c100] [c88] [c84] [c83] [c80] [c78] [c74] [c71] [c70] [c69] [c68] [c67] [c66] [c65] [c64] [c62] [c59] [c55] [c53] [c49] [c48] [c47] [c45] [c34] [c30] [c29] [c28] [c27] [c24] [c22] [p2] [e2] [i3] [i1]
[j78] [j76] [j75] [j74] [j72] [j68] [j64] [j62] [j60] [j59] [j58] [j57] [j56] [j55] [j53] [j52] [j51] [j50] [j49] [j48] [j47] [j45] [j44] [j43] [j42] [j40] [j39] [j36] [j35] [j34] [j33] [j32] [j25] [j24] [c101] [c84] [c81] [c80] [c78] [c71] [c70] [c69] [c67] [c66] [c65] [c63] [c62] [c60] [c57] [c56] [c55] [c54] [c53] [c52] [c51] [c50] [c49] [c48] [c47] [c46] [c44] [c43] [c42] [c39] [c38] [c36] [c35] [c34] [c33] [c29] [c28] [p3] [p2]
Stéphane Pérennes
aka: Stephane Perennes
aka: Stephane Perennes
a service of 
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-07-09 05:24 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:
