| Publication | Date of Publication | Type |
|---|
On devising Boolean Routing schemes
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Building international doctoral schools in computer science in Italy, De Nicola's way
Models, Languages, and Tools for Concurrent and Distributed Programming | 2024-02-23 | Paper |
Multi-dimensional Interval Routing Schemes
Distributed Algorithms | 2023-12-01 | Paper |
Deadlock-free interval routing schemes
Lecture Notes in Computer Science | 2022-11-09 | Paper |
On Pareto optimality in social distance games
Artificial Intelligence | 2022-11-08 | Paper |
Pricing problems with buyer preselection
Journal of Artificial Intelligence Research | 2022-10-06 | Paper |
| Almost envy-free allocations with connected bundles | 2022-07-18 | Paper |
| Distance hedonic games | 2022-03-24 | Paper |
Almost envy-free allocations with connected bundles
Games and Economic Behavior | 2022-02-25 | Paper |
Almost envy-free allocations with connected bundles
Games and Economic Behavior | 2022-02-25 | Paper |
On the online coalition structure generation problem
Journal of Artificial Intelligence Research | 2022-02-07 | Paper |
Strategyproof mechanisms for friends and enemies games
Artificial Intelligence | 2021-12-13 | Paper |
Price of Pareto optimality in hedonic games
Artificial Intelligence | 2021-08-16 | Paper |
On fair price discrimination in multi-unit markets
Artificial Intelligence | 2021-08-16 | Paper |
| Pricing problems with buyer preselection | 2021-08-04 | Paper |
| Inequity aversion pricing in multi-unit markets | 2021-07-06 | Paper |
Parameterized complexity of manipulating sequential allocation
(available as arXiv preprint) | 2021-07-06 | Paper |
Strategyproof mechanisms for additively separable and fractional hedonic games
Journal of Artificial Intelligence Research | 2021-05-25 | Paper |
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
Distributed Computing | 2021-03-12 | Paper |
ATM layouts with bounded hop count and congestion
Distributed Computing | 2020-12-03 | Paper |
The price of stability for undirected broadcast network design with fair cost allocation is constant
Games and Economic Behavior | 2020-10-26 | Paper |
| Simple greedy algorithms for fundamental multidimensional graph problems | 2020-05-27 | Paper |
On non-cooperativeness in social distance games
Journal of Artificial Intelligence Research | 2019-11-26 | Paper |
On social envy-freeness in multi-unit markets
Artificial Intelligence | 2019-08-28 | Paper |
Nash stable outcomes in fractional hedonic games: existence, efficiency and computation
Journal of Artificial Intelligence Research | 2018-08-14 | Paper |
A complete characterization of the path layout construction problem for ATM networks with given hop count and load
Automata, Languages and Programming | 2018-07-04 | Paper |
Strategyproof mechanisms for additively separable hedonic games and fractional hedonic games
(available as arXiv preprint) | 2018-06-22 | Paper |
Interval routing schemes
STACS 95 | 2017-12-04 | Paper |
On the complexity of the regenerator cost problem in general networks with traffic grooming
Algorithmica | 2017-05-17 | Paper |
Network movement games
Theoretical Computer Science | 2017-02-22 | Paper |
Approximating the revenue maximization problem with sharp demands
Theoretical Computer Science | 2017-01-09 | Paper |
Stackelberg strategies for network design games
Internet Mathematics | 2016-05-25 | Paper |
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
Web and Internet Economics | 2016-01-08 | Paper |
The price of envy-freeness in machine scheduling
Theoretical Computer Science | 2015-12-28 | Paper |
On the sequential price of anarchy of isolation games
Journal of Combinatorial Optimization | 2015-07-10 | Paper |
Some anomalies of farsighted strategic behavior
Theory of Computing Systems | 2015-05-12 | Paper |
Nash stability in fractional hedonic games
Web and Internet Economics | 2015-01-07 | Paper |
The price of envy-freeness in machine scheduling
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
The speed of convergence in congestion games under best-response dynamics
ACM Transactions on Algorithms | 2014-09-09 | Paper |
On the bicriteria \(k\)-server problem
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Approximating the revenue maximization problem with sharp demands
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Social context congestion games
Theoretical Computer Science | 2013-12-11 | Paper |
Some anomalies of farsighted strategic behavior
Approximation and Online Algorithms | 2013-09-13 | Paper |
On the sequential price of anarchy of isolation games
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Approximating the traffic grooming problem in tree and star networks
Journal of Parallel and Distributed Computing | 2012-07-26 | Paper |
Optimizing regenerator cost in traffic grooming
Theoretical Computer Science | 2012-01-04 | Paper |
On the performances of Nash equilibria in isolation games
Journal of Combinatorial Optimization | 2011-12-15 | Paper |
Performance of one-round walks in linear congestion games
Theory of Computing Systems | 2011-11-23 | Paper |
Tight bounds for selfish and greedy load balancing
Algorithmica | 2011-11-07 | Paper |
Graphical congestion games
Algorithmica | 2011-09-20 | Paper |
Extending the notion of rationality of selfish agents: second order Nash equilibria
Theoretical Computer Science | 2011-05-10 | Paper |
Minimizing total busy time in parallel scheduling with application to optical networks
Theoretical Computer Science | 2010-10-11 | Paper |
Designing fast converging cost sharing methods for multicast transmissions
Theory of Computing Systems | 2010-10-06 | Paper |
The complexity of interval routing on random graphs
Lecture Notes in Computer Science | 2010-06-17 | Paper |
On minimizing the number of ADMs in a general topology optical network
Discrete Applied Mathematics | 2010-04-28 | Paper |
On the convergence of multicast games in directed networks
Algorithmica | 2010-03-23 | Paper |
Energy consumption minimization in ad hoc wireless and multi-interface networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Traffic Grooming: Combinatorial Results and Practical Resolutions
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Game-theoretic approaches to optimization problems in communication networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
When ignorance helps: graphical multicast cost sharing games
Theoretical Computer Science | 2010-02-05 | Paper |
Minimum flow time graph ordering.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Performances of One-Round Walks in Linear Congestion Games
Algorithmic Game Theory | 2009-12-01 | Paper |
On the Performances of Nash Equilibria in Isolation Games
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Approximating the traffic grooming problem
Journal of Discrete Algorithms | 2009-05-13 | Paper |
Tight Bounds for Selfish and Greedy Load Balancing
Automata, Languages and Programming | 2009-03-12 | Paper |
Layouts for mobility management in wireless ATM networks
Discrete Applied Mathematics | 2009-03-04 | Paper |
When Ignorance Helps: Graphical Multicast Cost Sharing Games
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
On Minimizing the Number of ADMs in a General Topology Optical Network
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Approximating the Traffic Grooming Problem in Tree and Star Networks
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
The Speed of Convergence in Congestion Games under Best-Response Dynamics
Automata, Languages and Programming | 2008-08-28 | Paper |
Selfishness, collusion and power of local search for the ADMs minimization problem
Computer Networks | 2008-06-25 | Paper |
The “real” approximation factor of the MST heuristic for the minimum energy broadcasting
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Asymptotically optimal solutions for small world graphs
Theory of Computing Systems | 2008-06-06 | Paper |
On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing
Combinatorial and Algorithmic Aspects of Networking | 2008-04-17 | Paper |
Improved approximation results for the minimum energy broadcasting problem
Algorithmica | 2008-02-18 | Paper |
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks
Automata, Languages and Programming | 2007-11-28 | Paper |
Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves
Lecture Notes in Computer Science | 2007-09-05 | Paper |
On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing
Journal of Parallel and Distributed Computing | 2007-04-26 | Paper |
Sharing the cost of multicast transmissions in wireless networks
Theoretical Computer Science | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
Journal of Discrete Algorithms | 2006-10-31 | Paper |
Competitive algorithms for the bicriteria \(k\)-server problem
Discrete Applied Mathematics | 2006-10-30 | Paper |
Pareto approximations for the bicriteria scheduling problem
Journal of Parallel and Distributed Computing | 2006-05-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
On routing of wavebands for all-to-all communications in all-optical paths and cycles
Theoretical Computer Science | 2005-04-06 | Paper |
Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Lower bounds on systolic gossip
Information and Computation | 2005-02-22 | Paper |
Experimental analysis of online algorithms for the bicriteria scheduling problem
Journal of Parallel and Distributed Computing | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 2090659 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 1982174 (Why is no real title available?) | 2003-09-16 | Paper |
Deadlock prevention by acyclic orientations
Discrete Applied Mathematics | 2003-07-30 | Paper |
Characterization results of all shortest paths interval routing schemes
Networks | 2003-06-26 | Paper |
Compact-port routing models and applications to distance-hereditary graphs
Journal of Parallel and Distributed Computing | 2002-12-02 | Paper |
On the upper chromatic number of \((v_3,b_2)\)-configurations
Discrete Applied Mathematics | 2002-08-29 | Paper |
Static and dynamic low-congested interval routing schemes
Theoretical Computer Science | 2002-07-15 | Paper |
| scientific article; zbMATH DE number 1670658 (Why is no real title available?) | 2001-11-11 | Paper |
On the optimality of general lower bounds for broadcasting and gossiping
SIAM Journal on Discrete Mathematics | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1340884 (Why is no real title available?) | 2001-05-02 | Paper |
| Low-congested interval routing schemes for hypercubelike networks | 2000-12-12 | Paper |
How to survive while visiting a graph
Discrete Applied Mathematics | 2000-07-13 | Paper |
Simple, efficient routing schemes for all-optical networks
Theory of Computing Systems | 1999-06-29 | Paper |
The Complexity of Interval Routing on Random Graphs
The Computer Journal | 1999-01-25 | Paper |
Multidimensional interval routing schemes
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1107721 (Why is no real title available?) | 1998-09-27 | Paper |
On devising Boolean Routing Schemes
Theoretical Computer Science | 1998-06-30 | Paper |
Interval routing schemes
Algorithmica | 1997-01-29 | Paper |
On the learnability of monotone \(k\mu\)-DNF formulae under product distributions
Information Processing Letters | 1994-11-20 | Paper |
