| Publication | Date of Publication | Type |
|---|
| Overcoming probabilistic faults in disoriented linear search | 2024-10-07 | Paper |
| Evacuation from a disk for robots with asymmetric communication | 2024-09-11 | Paper |
| Optimal circle search despite the presence of faulty robots | 2024-04-05 | Paper |
| Bargaining in networks with socially-aware agents | 2024-03-25 | Paper |
| Overcoming probabilistic faults in disoriented linear search | 2024-01-11 | Paper |
| Average case -- worst case tradeoffs for evacuating 2 robots from the disk in the face-to-face model | 2023-10-20 | Paper |
| Algorithms for \(p\)-Faulty Search on a half-line | 2023-08-17 | Paper |
| Search on a Line by Byzantine Robots | 2023-08-15 | Paper |
| Triangle evacuation of 2 agents in the wireless model (extended abstract) | 2023-08-04 | Paper |
| Optimal circle search despite the presence of faulty robots | 2023-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874260 | 2023-02-07 | Paper |
| Evacuating from \(\ell_p\) unit disks in the wireless model | 2023-01-30 | Paper |
| Weighted group search on a line \& implications to the priority evacuation problem | 2022-11-17 | Paper |
| Probabilistically faulty searching on a half-line (extended abstract) | 2022-10-13 | Paper |
| Energy Consumption of Group Search on a Line | 2022-07-21 | Paper |
| Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) | 2022-06-24 | Paper |
| Makespan trade-offs for visiting triangle edges (extended abstract) | 2022-03-22 | Paper |
| The bike sharing problem | 2021-10-04 | Paper |
| The unit acquisition number of binomial random graphs | 2021-08-09 | Paper |
| Weighted group search on a line (extended abstract) | 2021-07-08 | Paper |
| Time-energy tradeoffs for evacuation by two robots in the wireless model | 2021-01-25 | Paper |
| Treasure evacuation with one robot on a disk | 2021-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3386625 | 2021-01-05 | Paper |
| Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits | 2020-10-21 | Paper |
| God save the queen | 2020-08-11 | Paper |
| Time-energy tradeoffs for evacuation by two robots in the wireless model | 2020-03-03 | Paper |
| Priority evacuation from a disk: the case of \(n = 1,2,3\) | 2020-01-16 | Paper |
| Lower Bounds for Shoreline Searching with 2 or More Robots | 2020-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5226842 | 2019-08-01 | Paper |
| Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743446 | 2019-05-10 | Paper |
| Black-box reductions for cost-sharing mechanism design | 2019-03-29 | Paper |
| Symmetric rendezvous with advice: how to rendezvous in a disk | 2019-01-30 | Paper |
| Priority evacuation from a disk using mobile robots (extended abstract) | 2019-01-30 | Paper |
| Search-and-fetch with one robot on a disk (track: wireless and geometry) | 2018-12-07 | Paper |
| Better Balance by Being Biased | 2018-11-05 | Paper |
| Lift-and-project methods for set cover and knapsack | 2018-10-18 | Paper |
| Search on a Line by Byzantine Robots | 2018-04-19 | Paper |
| Evacuation from a disc in the presence of a faulty robot | 2018-04-12 | Paper |
| Know when to persist: deriving value from a stream buffer | 2018-03-13 | Paper |
| Evacuating two robots from multiple unknown exits in a circle | 2017-12-20 | Paper |
| Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) | 2017-04-28 | Paper |
| Stable marriage with general preferences | 2017-02-01 | Paper |
| Know When to Persist: Deriving Value from a Stream Buffer | 2016-11-09 | Paper |
| On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy | 2016-09-16 | Paper |
| The beachcombers' problem: walking and searching with mobile robots | 2015-12-11 | Paper |
| Excuse me! or the courteous theatregoers' problem | 2015-05-26 | Paper |
| Complexity of barrier coverage with relocatable sensors in the plane | 2015-05-18 | Paper |
| Stable Marriage with General Preferences | 2015-01-14 | Paper |
| Social exchange networks with distant bargaining | 2014-10-06 | Paper |
| The Beachcombers’ Problem: Walking and Searching with Mobile Robots | 2014-08-07 | Paper |
| Network Bargaining with General Capacities | 2013-09-17 | Paper |
| Lift-and-Project Methods for Set Cover and Knapsack | 2013-08-12 | Paper |
| On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy | 2013-08-06 | Paper |
| Social Exchange Networks with Distant Bargaining | 2013-06-11 | Paper |
| Complexity of Barrier Coverage with Relocatable Sensors in the Plane | 2013-06-07 | Paper |
| On the tightening of the standard SDP for vertex cover with \(\ell_1\) inequalities | 2012-10-24 | Paper |
| SDP gaps from pairwise independence | 2012-09-27 | Paper |
| Tight gaps for vertex cover in the Sherali-Adams SDP hierarchy | 2012-08-31 | Paper |
| Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods | 2012-04-24 | Paper |
| Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász–Schrijver Hierarchy | 2011-04-04 | Paper |
| Random maximal independent sets and the unfriendly theater seating arrangement problem | 2009-12-15 | Paper |
| Optimal Sherali-Adams Gaps from Pairwise Independence | 2009-10-28 | Paper |
| Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities | 2008-06-10 | Paper |
| Complexity and Algorithms for Well-Structured k-SAT Instances | 2008-05-27 | Paper |
