| Publication | Date of Publication | Type |
|---|
| An efficient implementation of the Gale and Shapley “propose-and-reject” algorithm | 2021-09-06 | Paper |
| On the price of stability of some simple graph-based hedonic games | 2021-01-25 | Paper |
| Limitations of Deterministic Auction Design for Correlated Bidders | 2019-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633920 | 2019-05-06 | Paper |
| On the price of stability of social distance games | 2018-11-08 | Paper |
| Constrained bipartite edge coloring with applications to wavelength routing | 2018-07-04 | Paper |
| On network formation games with heterogeneous players and basic network creation games | 2018-03-13 | Paper |
| Efficient wavelength routing on directed fiber trees | 2017-12-05 | Paper |
| On Network Formation Games with Heterogeneous Players and Basic Network Creation Games | 2016-11-09 | Paper |
| The Price of Stability of Simple Symmetric Fractional Hedonic Games | 2016-09-29 | Paper |
| Socially desirable approximations for dodgson’s voting rule | 2015-08-14 | Paper |
| Bounding the inefficiency of outcomes in generalized second price auctions | 2015-02-13 | Paper |
| Taxes for linear atomic congestion games | 2014-09-09 | Paper |
| Limitations of Deterministic Auction Design for Correlated Bidders | 2013-09-17 | Paper |
| Tight approximation bounds for combinatorial frugal coverage algorithms | 2013-08-02 | Paper |
| Energy-efficient communication in multi-interface wireless networks | 2013-04-15 | Paper |
| The efficiency of fair division | 2012-12-06 | Paper |
| On the approximability of Dodgson and Young elections | 2012-11-15 | Paper |
| Revenue Guarantees in Sponsored Search Auctions | 2012-09-25 | Paper |
| Tight bounds for selfish and greedy load balancing | 2011-11-07 | Paper |
| Tight Approximation Bounds for Greedy Frugal Coverage Algorithms | 2011-06-03 | Paper |
| Fractional path coloring in bounded degree trees with applications | 2010-09-16 | 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 |
| On Low-Envy Truthful Allocations | 2009-11-17 | Paper |
| An Improved Approximation Bound for Spanning Star Forest and Color Saving | 2009-10-16 | Paper |
| Energy-Efficient Communication in Multi-interface Wireless Networks | 2009-10-16 | Paper |
| Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs | 2009-09-02 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem | 2009-03-23 | Paper |
| Tight Bounds for Selfish and Greedy Load Balancing | 2009-03-12 | Paper |
| Scheduling to Maximize Participation | 2009-03-05 | Paper |
| Competitive algorithms and lower bounds for online randomized call control in cellular networks | 2008-12-17 | Paper |
| Scheduling to maximize participation | 2008-08-06 | Paper |
| Approximation Algorithms for Path Coloring in Trees | 2008-03-14 | Paper |
| Taxes for Linear Atomic Congestion Games | 2008-03-11 | Paper |
| Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs | 2008-02-26 | Paper |
| A tight bound for online colouring of disk graphs | 2007-10-02 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs | 2007-02-19 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Energy-efficient wireless network design | 2006-10-16 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Efficient automatic simulation of parallel computation on networks of workstations | 2006-06-09 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Approximate constrained bipartite edge coloring | 2004-11-23 | Paper |
| Efficient binary and grey level morphological operations on a massively parallel processor | 2004-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813070 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473972 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448743 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427855 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791663 | 2003-01-30 | Paper |
| New bounds on the size of the minimum feedback vertex set in meshes and butterflies. | 2003-01-21 | Paper |
| Randomized path coloring on binary trees. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152809 | 2002-12-10 | Paper |
| Efficient on-line frequency allocation and call control in cellular networks | 2002-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535060 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2777813 | 2002-03-07 | Paper |
| Edge coloring of bipartite graphs with constraints | 2002-03-03 | Paper |
| Sparse and limited wavelength conversion in all-optical tree networks | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762511 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753727 | 2002-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729093 | 2001-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941916 | 2000-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250414 | 2000-03-29 | Paper |
| Optimal wavelength routing on directed fiber trees | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395324 | 1998-08-04 | Paper |
| Branch-and-bound and backtrack search on mesh-connected arrays of processors | 1995-05-14 | Paper |
| Tight bounds for oblivious routing in the hypercube | 1991-01-01 | Paper |
