| Publication | Date of Publication | Type |
|---|
| Filling crosswords is very hard | 2024-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147538 | 2024-01-15 | Paper |
| The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet * | 2023-07-24 | Paper |
| Project games | 2023-04-20 | Paper |
| On fairness via picking sequences in allocation of indivisible goods | 2023-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091070 | 2022-07-21 | Paper |
| In memory of Jérôme Monnot | 2022-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4999211 | 2021-07-06 | Paper |
| Project games | 2020-02-06 | Paper |
| On a simple hedonic game with graph-restricted communication | 2020-02-04 | Paper |
| Agreeable sets with matroidal constraints | 2019-06-25 | Paper |
| Subset sum problems with digraph constraints | 2018-12-06 | Paper |
| On maximin share allocations in matroids | 2018-12-04 | Paper |
| Strategic voting in a social context: considerate equilibria | 2018-07-12 | Paper |
| Approximate Maximin Share Allocations in Matroids | 2017-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5282999 | 2017-07-18 | Paper |
| The price of optimum: complexity and approximation for a matching game | 2017-04-12 | Paper |
| Selfish Transportation Games | 2017-04-04 | Paper |
| Bi-objective matchings with the triangle inequality | 2017-03-16 | Paper |
| Conference Program Design with Single-Peaked and Single-Crossing Preferences | 2017-02-10 | Paper |
| Strategic Scheduling Games: Equilibria and Efficiency | 2017-02-03 | Paper |
| Congestion games with capacitated resources | 2016-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3457236 | 2015-12-11 | Paper |
| Profitable Deviation Strong Equilibria | 2015-11-04 | Paper |
| The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles | 2015-09-25 | Paper |
| Approximating the optimal sequence of acquisitions and sales with a capped budget | 2015-06-15 | Paper |
| Worst case compromises in matroids with applications to the allocation of indivisible goods | 2015-06-01 | Paper |
| Approximate tradeoffs on weighted labeled matroids | 2015-04-28 | Paper |
| A Protocol for Cutting Matroids Like Cakes | 2015-01-12 | Paper |
| The Lazy Matroid Problem | 2014-09-15 | Paper |
| Approximation with a fixed number of solutions of some multiobjective maximization problems | 2014-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403027 | 2014-03-25 | Paper |
| Possible Winners in Approval Voting | 2013-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2865888 | 2013-12-11 | Paper |
| Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games | 2013-10-23 | Paper |
| The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design | 2013-08-16 | Paper |
| On s-t paths and trails in edge-colored graphs | 2013-07-19 | Paper |
| Single approximation for the biobjective Max TSP | 2013-06-06 | Paper |
| Labeled traveling salesman problems: complexity and approximation | 2013-05-31 | Paper |
| Complexity of trails, paths and circuits in arc-colored digraphs | 2013-04-18 | Paper |
| Congestion Games with Capacitated Resources | 2013-03-13 | Paper |
| Strategic Coloring of a Graph | 2013-02-15 | Paper |
| Single Approximation for Biobjective Max TSP | 2012-07-16 | Paper |
| Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems | 2012-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3109944 | 2012-01-26 | Paper |
| The Price of Optimum in a Matching Game | 2011-10-28 | Paper |
| Strategy-Proof Mechanisms for Facility Location Games with Many Facilities | 2011-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3059324 | 2010-12-08 | Paper |
| The minimum reload \(s-t\) path, trail and walk problems | 2010-08-13 | Paper |
| Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs | 2010-06-17 | Paper |
| The Max k-Cut Game and Its Strong Equilibria | 2010-06-17 | Paper |
| On the Impact of Local Taxes in a Set Cover Game | 2010-06-17 | Paper |
| Strategic Coloring of a Graph | 2010-05-28 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation | 2010-03-18 | Paper |
| Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs | 2010-02-26 | Paper |
| Fair cost-sharing methods for the minimum spanning tree game | 2010-01-29 | Paper |
| On a Labeled Vehicle Routing Problem | 2010-01-28 | Paper |
| Approximation results for a bicriteria job scheduling problem on a single machine without preemption | 2009-12-04 | Paper |
| On the minimum hitting set of bundles problem | 2009-11-04 | Paper |
| Scheduling Selfish Tasks: About the Performance of Truthful Algorithms | 2009-03-06 | Paper |
| Cooperation in Multiorganization Matching | 2009-02-12 | Paper |
| The Minimum Reload s-t Path/Trail/Walk Problems | 2009-02-03 | Paper |
| On Labeled Traveling Salesman Problems | 2009-01-29 | Paper |
| On the Minimum Hitting Set of Bundles Problem | 2008-07-10 | Paper |
| Complexity and Approximation Results for the Connected Vertex Cover Problem | 2008-07-01 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Approximation algorithms for the bi-criteria weighted MAX-CUT problem | 2006-08-14 | Paper |
| Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817407 | 2004-09-22 | Paper |
