| Publication | Date of Publication | Type |
|---|
| A linear time algorithm for the feasibility of pebble motion on trees | 2022-12-09 | Paper |
| Better algorithms for minimum weight vertex-connectivity problems | 2022-11-09 | Paper |
| Belief-invariant and quantum equilibria in games of incomplete information | 2021-11-18 | Paper |
| On the effectiveness of social proof recommendations in markets with multiple products | 2021-07-06 | Paper |
| Strategic monitor placement against malicious flows | 2021-07-06 | Paper |
| Optimal majority dynamics for the diffusion of an opinion when multiple alternatives are available | 2021-05-10 | Paper |
| Contrasting the Spread of Misinformation in Online Social Networks | 2020-12-09 | Paper |
| On the complexity of reasoning about opinion diffusion under majority dynamics | 2020-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743454 | 2019-05-10 | Paper |
| Information Retention in Heterogeneous Majority Dynamics | 2019-01-30 | Paper |
| Metastability of logit dynamics for coordination games | 2019-01-11 | Paper |
| Placing resources in a tree: Dynamic and static algorithms | 2019-01-10 | Paper |
| Routing selfish unsplittable traffic | 2018-11-05 | Paper |
| A new approach to optimal planning of robot motion on a tree with obstacles | 2017-12-05 | Paper |
| Convergence to equilibrium of logit dynamics for strategic games | 2016-11-01 | Paper |
| Mechanisms for scheduling with single-bit private values | 2016-01-13 | Paper |
| Minority Becomes Majority in Social Networks | 2016-01-08 | Paper |
| Logit dynamics with concurrent updates for local interaction potential games | 2015-11-19 | Paper |
| Mixing time and stationary expected social welfare of logit dynamics | 2013-10-21 | Paper |
| Logit Dynamics with Concurrent Updates for Local Interaction Games | 2013-09-17 | Paper |
| Mechanisms for Scheduling with Single-Bit Private Values | 2013-03-13 | Paper |
| Mixing time and stationary expected social welfare of logit dynamics | 2010-10-19 | Paper |
| Private Capacities in Mechanism Design | 2009-10-16 | Paper |
| On designing truthful mechanisms for online scheduling | 2009-08-21 | Paper |
| New Constructions of Mechanisms with Verification | 2009-03-12 | Paper |
| The power of verification for one-parameter agents | 2009-03-02 | Paper |
| Deterministic monotone algorithms for scheduling on related machines | 2008-11-12 | Paper |
| Alternatives to Truthfulness Are Hard to Recognize | 2008-05-02 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Randomized path coloring on binary trees. | 2003-01-21 | Paper |
| Optimal pebble motion on a tree | 2003-01-14 | Paper |
| Sparse and limited wavelength conversion in all-optical tree networks | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753727 | 2002-01-06 | Paper |
| A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph | 2000-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250414 | 2000-03-29 | Paper |
| Multiple templates access of trees in parallel memory systems | 1999-06-29 | Paper |
| A linear-time algorithm for the feasibility of pebble motion on trees | 1999-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4377122 | 1998-07-19 | Paper |
| Dynamic and static algorithms for optimal placement of resources in a tree | 1997-02-27 | Paper |
| Embedding graphs onto the Supercube | 1995-01-01 | Paper |
