| Publication | Date of Publication | Type |
|---|
| Massively parallel and dynamic algorithms for minimum size clustering | 2024-07-19 | Paper |
| Improved sliding window algorithms for clustering and coverage via bucketing-based sketches | 2024-07-19 | Paper |
| Contextual Bandits with Cross-Learning | 2024-02-27 | Paper |
| Budget-Management Strategies in Repeated Auctions | 2021-07-29 | Paper |
| Response prediction for low-regret agents | 2020-06-30 | Paper |
| Visibility testing and counting for uncertain segments | 2019-06-06 | Paper |
| Limitations of cross-monotonic cost-sharing schemes | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608043 | 2018-03-15 | Paper |
| The Minimum Distance of Turbo-Like Codes | 2017-08-08 | Paper |
| An algorithmic view of voting | 2016-10-20 | Paper |
| Sudoku rectangle completion (extended abstract) | 2016-10-14 | Paper |
| Algorithms on evolving graphs | 2016-10-07 | Paper |
| Designing Markets for Daily Deals | 2015-01-12 | Paper |
| Finding small balanced separators | 2014-11-25 | Paper |
| Marriage, honesty, and stability | 2014-10-13 | Paper |
| Limitations of cross-monotonic cost sharing schemes | 2014-10-13 | Paper |
| Online Optimization with Uncertain Information | 2014-09-09 | Paper |
| Online bipartite matching with random arrivals | 2014-06-05 | Paper |
| The complexity of LSH feasibility | 2014-03-27 | Paper |
| A linear algebraic approach to orthogonal arrays and Latin squares | 2013-06-10 | Paper |
| Ad Auctions with Data | 2013-03-13 | Paper |
| The Multiple Attribution Problem in Pay-Per-Conversion Advertising | 2011-10-28 | Paper |
| Stochastic kronecker graphs | 2011-08-09 | Paper |
| Sorting and selection on dynamic data | 2011-06-07 | Paper |
| Deterministic Decentralized Search in Random Graphs | 2011-02-28 | Paper |
| Advertisement allocation for generalized second-pricing schemes | 2010-12-23 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Secure overlay network design | 2010-03-04 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Clustering-Based Bidding Languages for Sponsored Search | 2009-10-29 | Paper |
| Approximating Matches Made in Heaven | 2009-07-14 | Paper |
| Sort Me If You Can: How to Sort Dynamic Data | 2009-07-14 | Paper |
| Rainbow solutions to the Sidon equation | 2008-09-04 | Paper |
| Minimizing Makespan in No-Wait Job Shops | 2008-05-27 | Paper |
| Stochastic Kronecker Graphs | 2008-04-11 | Paper |
| Deterministic Decentralized Search in Random Graphs | 2008-04-11 | Paper |
| Forced orientation of graphs | 2008-02-22 | Paper |
| Secure Overlay Network Design | 2008-01-04 | Paper |
| Comparing Partial Rankings | 2007-09-06 | Paper |
| Approximation Algorithms for Metric Facility Location Problems | 2007-05-03 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Rainbow Arithmetic Progressions and Anti-Ramsey Results | 2005-03-08 | Paper |
| On the forced matching numbers of bipartite graphs | 2004-08-06 | Paper |
| The facility location problem with general cost functions | 2003-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411290 | 2003-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780788 | 2002-11-21 | Paper |
| Length-constrained path-matchings in graphs | 2002-09-29 | Paper |
| On the computational complexity of strong edge coloring | 2002-06-24 | Paper |
| A characterization of uniquely 2-list colorable graphs | 2001-12-17 | Paper |
| On a conjecture of Keedwell and the cycle double cover conjecture | 2001-11-28 | Paper |
| The strong chromatic index ofC4-free graphs | 2001-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4943284 | 2000-09-05 | Paper |
