| Publication | Date of Publication | Type |
|---|
An efficient implementation of the Gale and Shapley ``propose-and-reject'' algorithm
Electronic Journal of Graph Theory and Applications | 2021-09-06 | Paper |
On the price of stability of some simple graph-based hedonic games
Theoretical Computer Science | 2021-01-25 | Paper |
Limitations of Deterministic Auction Design for Correlated Bidders
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
| On the approximability of Dodgson and Young elections | 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
Automata, Languages and Programming | 2018-07-04 | Paper |
On network formation games with heterogeneous players and basic network creation games
Theoretical Computer Science | 2018-03-13 | Paper |
Efficient wavelength routing on directed fiber trees
Algorithms — ESA '96 | 2017-12-05 | Paper |
On network formation games with heterogeneous players and basic network creation games
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
The price of stability of simple symmetric fractional hedonic games
Algorithmic Game Theory | 2016-09-29 | Paper |
Socially desirable approximations for dodgson’s voting rule
ACM Transactions on Algorithms | 2015-08-14 | Paper |
Bounding the inefficiency of outcomes in generalized second price auctions
Journal of Economic Theory | 2015-02-13 | Paper |
Bounding the inefficiency of outcomes in generalized second price auctions
Journal of Economic Theory | 2015-02-13 | Paper |
Taxes for linear atomic congestion games
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Limitations of deterministic auction design for correlated bidders
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Tight approximation bounds for combinatorial frugal coverage algorithms
Journal of Combinatorial Optimization | 2013-08-02 | Paper |
Energy-efficient communication in multi-interface wireless networks
Theory of Computing Systems | 2013-04-15 | Paper |
The efficiency of fair division
Theory of Computing Systems | 2012-12-06 | Paper |
On the approximability of Dodgson and Young elections
Artificial Intelligence | 2012-11-15 | Paper |
Revenue guarantees in sponsored search auctions
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Tight bounds for selfish and greedy load balancing
Algorithmica | 2011-11-07 | Paper |
Tight approximation bounds for greedy frugal coverage algorithms
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Fractional path coloring in bounded degree trees with applications
Algorithmica | 2010-09-16 | Paper |
Game-theoretic approaches to optimization problems in communication networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Energy consumption minimization in ad hoc wireless and multi-interface networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
On Low-Envy Truthful Allocations
Algorithmic Decision Theory | 2009-11-17 | Paper |
Energy-Efficient Communication in Multi-interface Wireless Networks
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
An Improved Approximation Bound for Spanning Star Forest and Color Saving
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Analysis of approximation algorithms for k-set cover using factor-revealing linear programs
Theory of Computing Systems | 2009-09-02 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
Information Processing Letters | 2009-03-23 | Paper |
Tight Bounds for Selfish and Greedy Load Balancing
Automata, Languages and Programming | 2009-03-12 | Paper |
Scheduling to Maximize Participation
Trustworthy Global Computing | 2009-03-05 | Paper |
Competitive algorithms and lower bounds for online randomized call control in cellular networks
Networks | 2008-12-17 | Paper |
Scheduling to maximize participation
Theoretical Computer Science | 2008-08-06 | Paper |
Approximation Algorithms for Path Coloring in Trees
Lecture Notes in Computer Science | 2008-03-14 | Paper |
Taxes for Linear Atomic Congestion Games
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
Fundamentals of Computation Theory | 2008-02-26 | Paper |
A tight bound for online colouring of disk graphs
Theoretical Computer Science | 2007-10-02 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
Discrete Applied Mathematics | 2007-02-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Energy-efficient wireless network design
Theory of Computing Systems | 2006-10-16 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Efficient automatic simulation of parallel computation on networks of workstations
Discrete Applied Mathematics | 2006-06-09 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Approximate constrained bipartite edge coloring
Discrete Applied Mathematics | 2004-11-23 | Paper |
Efficient binary and grey level morphological operations on a massively parallel processor
Parallel Algorithms and Applications | 2004-11-11 | Paper |
| scientific article; zbMATH DE number 2090616 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2080907 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2044917 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 1979511 (Why is no real title available?) | 2003-09-14 | Paper |
| scientific article; zbMATH DE number 1862254 (Why is no real title available?) | 2003-01-30 | Paper |
New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
Information Processing Letters | 2003-01-21 | Paper |
Randomized path coloring on binary trees.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1820026 (Why is no real title available?) | 2002-12-10 | Paper |
Efficient on-line frequency allocation and call control in cellular networks
Theory of Computing Systems | 2002-09-25 | Paper |
| scientific article; zbMATH DE number 1754632 (Why is no real title available?) | 2002-06-12 | Paper |
An efficient parallel algorithm for motion estimation in very low bit-rate video coding systems
Concurrency: Practice and Experience | 2002-03-07 | Paper |
Sparse and limited wavelength conversion in all-optical tree networks
Theoretical Computer Science | 2002-03-03 | Paper |
Edge coloring of bipartite graphs with constraints
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1688370 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1670530 (Why is no real title available?) | 2002-01-06 | Paper |
| scientific article; zbMATH DE number 1629974 (Why is no real title available?) | 2001-10-23 | Paper |
| scientific article; zbMATH DE number 1418353 (Why is no real title available?) | 2000-10-08 | Paper |
| scientific article; zbMATH DE number 1303778 (Why is no real title available?) | 2000-03-29 | Paper |
Optimal wavelength routing on directed fiber trees
Theoretical Computer Science | 2000-01-12 | Paper |
| scientific article; zbMATH DE number 1163711 (Why is no real title available?) | 1998-08-04 | Paper |
Branch-and-bound and backtrack search on mesh-connected arrays of processors
Mathematical Systems Theory | 1995-05-14 | Paper |
Tight bounds for oblivious routing in the hypercube
Mathematical Systems Theory | 1991-01-01 | Paper |
