| Publication | Date of Publication | Type |
|---|
| Association testing for binary trees -- a Markov branching process approach | 2024-10-29 | Paper |
| A Unified Analysis of Structured Sonar-Terrain Data Using Bayesian Functional Mixed Models | 2024-10-22 | Paper |
| Improved competitive ratio for edge-weighted online stochastic matching | 2024-09-20 | Paper |
| One quarter each (on average) ensures proportionality | 2024-09-20 | Paper |
| Almost proportional allocations of indivisible chores: computation, approximation and efficiency | 2024-07-03 | Paper |
| Distributed PageRank computation with improved round complexities | 2024-03-13 | Paper |
| Approximate and strategyproof maximin share allocation of chores with ordinal preferences | 2024-02-21 | Paper |
| Approximately EFX allocations for indivisible chores | 2024-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147407 | 2024-01-15 | Paper |
| Well-behaved online load balancing against strategic jobs | 2023-11-14 | Paper |
| Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover | 2023-10-26 | Paper |
| Stackelberg security games with contagious attacks on a network: reallocation to the rescue | 2023-10-23 | Paper |
| Fair division of indivisible goods: recent progress and open questions | 2023-08-28 | Paper |
| Estimating mutation rates in a Markov branching process using approximate Bayesian computation | 2023-07-14 | Paper |
| Upper and lower bounds for fully retroactive graph problems | 2022-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009506 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002758 | 2021-07-28 | Paper |
| Towards a better understanding of randomized greedy matching | 2021-01-19 | Paper |
| Fully Online Matching | 2020-11-11 | Paper |
| Online Submodular Maximization Problem with Vector Packing Constraint. | 2020-05-27 | Paper |
| Online Vertex-Weighted Bipartite Matching | 2019-11-25 | Paper |
| Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model | 2019-10-15 | Paper |
| How to match when all vertices arrive online | 2019-08-22 | Paper |
| Diffusion operator and spectral analysis for directed hypergraph Laplacian | 2019-08-13 | Paper |
| Fast maximum likelihood estimation of mutation rates using a birth-death process | 2019-05-23 | Paper |
| Adaptive-weight burden test for associations between quantitative traits and genotype data with complex correlations | 2018-11-15 | Paper |
| Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity | 2018-11-13 | Paper |
| Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming | 2018-08-21 | Paper |
| On \((1, \epsilon )\)-restricted max-min fair allocation problem | 2018-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636505 | 2018-04-19 | Paper |
| Beating ratio 0.5 for weighted oblivious matching problems | 2018-03-02 | Paper |
| Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs | 2015-09-16 | Paper |
| Perfect Pipelining for Streaming Large File in Peer-to-Peer Networks | 2014-09-15 | Paper |
| Modeling neutral evolution using an infinite-allele Markov branching process | 2013-05-31 | Paper |
| A note on the path to extinction of critical Markov branching processes | 2010-03-01 | Paper |
| DAMAGE SPREADING ON THE HOMO- AND HETERO-CELL LATTICES WITH COMPETING GLAUBER AND KAWASAKI DYNAMICS | 2009-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3516616 | 2008-08-06 | Paper |
| A neural network for solving a class of saddle point problems | 2008-06-03 | Paper |
| DAMAGE SPREADING ON A SET OF HIERARCHICAL TRIVALENT STRUCTURES | 2006-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4488014 | 2000-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4935932 | 2000-01-17 | Paper |
