| Publication | Date of Publication | Type |
|---|
| On devising Boolean Routing schemes | 2024-02-28 | Paper |
| Building international doctoral schools in computer science in Italy, De Nicola's way | 2024-02-23 | Paper |
| Multi-dimensional Interval Routing Schemes | 2023-12-01 | Paper |
| Deadlock-free interval routing schemes | 2022-11-09 | Paper |
| On Pareto optimality in social distance games | 2022-11-08 | Paper |
| Pricing Problems with Buyer Preselection | 2022-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090386 | 2022-07-18 | Paper |
| Distance hedonic games | 2022-03-24 | Paper |
| Almost envy-free allocations with connected bundles | 2022-02-25 | Paper |
| On the Online Coalition Structure Generation Problem | 2022-02-07 | Paper |
| Strategyproof mechanisms for friends and enemies games | 2021-12-13 | Paper |
| Price of Pareto optimality in hedonic games | 2021-08-16 | Paper |
| On fair price discrimination in multi-unit markets | 2021-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005149 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4999208 | 2021-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4999209 | 2021-07-06 | Paper |
| Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games | 2021-05-25 | Paper |
| Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions | 2021-03-12 | Paper |
| ATM layouts with bounded hop count and congestion | 2020-12-03 | Paper |
| The price of stability for undirected broadcast network design with fair cost allocation is constant | 2020-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111457 | 2020-05-27 | Paper |
| On Non-Cooperativeness in Social Distance Games | 2019-11-26 | Paper |
| On social envy-freeness in multi-unit markets | 2019-08-28 | Paper |
| Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation | 2018-08-14 | Paper |
| A complete characterization of the path layout construction problem for ATM networks with given hop count and load | 2018-07-04 | Paper |
| Strategyproof mechanisms for additively separable hedonic games and fractional hedonic games | 2018-06-22 | Paper |
| Interval routing schemes | 2017-12-04 | Paper |
| On the complexity of the regenerator cost problem in general networks with traffic grooming | 2017-05-17 | Paper |
| Network movement games | 2017-02-22 | Paper |
| Approximating the revenue maximization problem with sharp demands | 2017-01-09 | Paper |
| Stackelberg Strategies for Network Design Games | 2016-05-25 | Paper |
| Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions | 2016-01-08 | Paper |
| The price of envy-freeness in machine scheduling | 2015-12-28 | Paper |
| On the sequential price of anarchy of isolation games | 2015-07-10 | Paper |
| Some anomalies of farsighted strategic behavior | 2015-05-12 | Paper |
| Nash Stability in Fractional Hedonic Games | 2015-01-07 | Paper |
| The Price of Envy-Freeness in Machine Scheduling | 2014-10-14 | Paper |
| On the bicriteria k -server problem | 2014-09-09 | Paper |
| The speed of convergence in congestion games under best-response dynamics | 2014-09-09 | Paper |
| Approximating the Revenue Maximization Problem with Sharp Demands | 2014-09-02 | Paper |
| Social context congestion games | 2013-12-11 | Paper |
| Some Anomalies of Farsighted Strategic Behavior | 2013-09-13 | Paper |
| On the Sequential Price of Anarchy of Isolation Games | 2013-06-11 | Paper |
| Approximating the traffic grooming problem in tree and star networks | 2012-07-26 | Paper |
| Optimizing regenerator cost in traffic grooming | 2012-01-04 | Paper |
| On the performances of Nash equilibria in isolation games | 2011-12-15 | Paper |
| Performance of one-round walks in linear congestion games | 2011-11-23 | Paper |
| Tight bounds for selfish and greedy load balancing | 2011-11-07 | Paper |
| Graphical congestion games | 2011-09-20 | Paper |
| Extending the notion of rationality of selfish agents: second order Nash equilibria | 2011-05-10 | Paper |
| Minimizing total busy time in parallel scheduling with application to optical networks | 2010-10-11 | Paper |
| Designing fast converging cost sharing methods for multicast transmissions | 2010-10-06 | Paper |
| The complexity of interval routing on random graphs | 2010-06-17 | Paper |
| On minimizing the number of ADMs in a general topology optical network | 2010-04-28 | Paper |
| On the convergence of multicast games in directed networks | 2010-03-23 | Paper |
| Traffic Grooming: Combinatorial Results and Practical Resolutions | 2010-02-09 | Paper |
| Game-Theoretic Approaches to Optimization Problems in Communication Networks | 2010-02-09 | Paper |
| Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks | 2010-02-09 | Paper |
| When ignorance helps: graphical multicast cost sharing games | 2010-02-05 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Performances of One-Round Walks in Linear Congestion Games | 2009-12-01 | Paper |
| On the Performances of Nash Equilibria in Isolation Games | 2009-07-23 | Paper |
| Approximating the traffic grooming problem | 2009-05-13 | Paper |
| Tight Bounds for Selfish and Greedy Load Balancing | 2009-03-12 | Paper |
| Layouts for mobility management in wireless ATM networks | 2009-03-04 | Paper |
| When Ignorance Helps: Graphical Multicast Cost Sharing Games | 2009-02-03 | Paper |
| Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria | 2008-09-17 | Paper |
| On Minimizing the Number of ADMs in a General Topology Optical Network | 2008-09-09 | Paper |
| Approximating the Traffic Grooming Problem in Tree and Star Networks | 2008-09-04 | Paper |
| The Speed of Convergence in Congestion Games under Best-Response Dynamics | 2008-08-28 | Paper |
| Selfishness, collusion and power of local search for the ADMs minimization problem | 2008-06-25 | Paper |
| The “real” approximation factor of the MST heuristic for the minimum energy broadcasting | 2008-06-20 | Paper |
| Asymptotically optimal solutions for small world graphs | 2008-06-06 | Paper |
| On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing | 2008-04-17 | Paper |
| Improved approximation results for the minimum energy broadcasting problem | 2008-02-18 | Paper |
| An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks | 2007-11-28 | Paper |
| Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves | 2007-09-05 | Paper |
| On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing | 2007-04-26 | Paper |
| Sharing the cost of multicast transmissions in wireless networks | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications | 2006-10-31 | Paper |
| Competitive algorithms for the bicriteria \(k\)-server problem | 2006-10-30 | Paper |
| Pareto approximations for the bicriteria scheduling problem | 2006-05-22 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| On routing of wavebands for all-to-all communications in all-optical paths and cycles | 2005-04-06 | Paper |
| Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols | 2005-02-28 | Paper |
| Lower bounds on systolic gossip | 2005-02-22 | Paper |
| Experimental analysis of online algorithms for the bicriteria scheduling problem | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813134 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426343 | 2003-09-16 | Paper |
| Deadlock prevention by acyclic orientations | 2003-07-30 | Paper |
| Characterization results of all shortest paths interval routing schemes | 2003-06-26 | Paper |
| Compact-port routing models and applications to distance-hereditary graphs | 2002-12-02 | Paper |
| On the upper chromatic number of \((v_3,b_2)\)-configurations | 2002-08-29 | Paper |
| Static and dynamic low-congested interval routing schemes | 2002-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753935 | 2001-11-11 | Paper |
| On the Optimality of General Lower Bounds for Broadcasting and Gossiping | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4262694 | 2001-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520243 | 2000-12-12 | Paper |
| How to survive while visiting a graph | 2000-07-13 | Paper |
| Simple, efficient routing schemes for all-optical networks | 1999-06-29 | Paper |
| The Complexity of Interval Routing on Random Graphs | 1999-01-25 | Paper |
| Multidimensional interval routing schemes | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373669 | 1998-09-27 | Paper |
| On devising Boolean Routing Schemes | 1998-06-30 | Paper |
| Interval routing schemes | 1997-01-29 | Paper |
| On the learnability of monotone \(k\mu\)-DNF formulae under product distributions | 1994-11-20 | Paper |
