| Publication | Date of Publication | Type |
|---|
| Algorithmic theory of qubit routing | 2024-01-16 | Paper |
| Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space | 2024-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6087211 | 2023-11-14 | Paper |
| On reachable assignments under dichotomous preferences | 2023-10-26 | Paper |
| Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams | 2023-10-23 | Paper |
| Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra | 2023-04-28 | Paper |
| Rerouting Planar Curves and Disjoint Paths | 2022-10-21 | Paper |
| A parameterized view to the robust recoverable base problem of matroids under structural uncertainty | 2022-07-22 | Paper |
| Spectral aspects of symmetric matrix signings | 2022-07-21 | Paper |
| Reforming an Envy-Free Matching | 2022-07-06 | Paper |
| Submodular reassignment problem for reallocating agents to tasks with synergy effects | 2022-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075806 | 2022-05-11 | Paper |
| Shortest Reconfiguration of Perfect Matchings via Alternating Cycles | 2022-05-10 | Paper |
| Multi-pass streaming algorithms for monotone submodular function maximization | 2022-02-14 | Paper |
| Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model | 2022-02-09 | Paper |
| Market Pricing for Matroid Rank Valuations | 2021-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005108 | 2021-08-04 | Paper |
| Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint | 2021-07-28 | Paper |
| Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint | 2021-04-08 | Paper |
| Complexity of the multi-service center problem | 2020-11-25 | Paper |
| Complexity of the multi-service center problem | 2020-10-12 | Paper |
| Spectral aspects of symmetric matrix signings | 2020-07-30 | Paper |
| The \(b\)-branching problem in digraphs | 2020-06-29 | Paper |
| Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint | 2020-02-28 | Paper |
| Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint | 2020-01-16 | Paper |
| Online Spectral Approximation in Random Order Streams | 2019-11-20 | Paper |
| Exact and approximation algorithms for weighted matroid intersection | 2019-08-06 | Paper |
| Reconfiguration of maximum-weight \(b\)-matchings in a graph | 2019-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743513 | 2019-05-10 | Paper |
| Total dual integrality of the linear complementarity problem | 2019-03-06 | Paper |
| Minimum-cost \(b\)-edge dominating sets on trees | 2019-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376371 | 2018-09-17 | Paper |
| Exact and Approximation Algorithms for Weighted Matroid Intersection | 2018-07-16 | Paper |
| The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs | 2018-05-09 | Paper |
| The $b$-branching problem in digraphs | 2018-02-07 | Paper |
| Reconfiguration of maximum weight \(b\)-matchings in a graph | 2017-10-23 | Paper |
| Parameterized complexity of sparse linear complementarity problems | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363788 | 2017-09-29 | Paper |
| Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs | 2017-05-24 | Paper |
| Efficient stabilization of cooperative matching games | 2017-05-15 | Paper |
| Coloring immersion-free graphs | 2016-10-12 | Paper |
| The Linear Complementarity Problems with a Few Variables per Constraint | 2016-01-29 | Paper |
| Minimum-Cost $$b$$-Edge Dominating Sets on Trees | 2015-09-11 | Paper |
| Fixed-parameter tractability for subset feedback set problems with parity constraints | 2015-05-18 | Paper |
| Half-integral packing of odd cycles through prescribed vertices | 2015-03-03 | Paper |
| Matching Problems with Delta-Matroid Constraints | 2014-09-26 | Paper |
| Robust Independence Systems | 2014-01-21 | Paper |
| Sparse Linear Complementarity Problems | 2013-06-07 | Paper |
| On the number of matrices to generate a matrix \(\ast\)-algebra over the real field | 2013-01-16 | Paper |
| Packing Directed Circuits through Prescribed Vertices Bounded Fractionally | 2013-01-04 | Paper |
| Computing knapsack solutions with cardinality robustness | 2012-12-28 | Paper |
| Packing cycles through prescribed vertices under modularity constraints | 2012-08-14 | Paper |
| Computing Knapsack Solutions with Cardinality Robustness | 2011-12-16 | Paper |
| Packing cycles through prescribed vertices | 2011-08-10 | Paper |
| Robust Independence Systems | 2011-07-06 | Paper |
| Set Covering with Ordered Replacement: Additive and Multiplicative Gaps | 2011-06-24 | Paper |
| Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem | 2010-11-05 | Paper |
| A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices | 2010-06-25 | Paper |
| Sign-solvable linear complementarity problems | 2008-06-17 | Paper |
| Solving linear programs from sign patterns | 2008-06-04 | Paper |
| Sign-Solvable Linear Complementarity Problems | 2007-11-29 | Paper |
| Computing the Inertia from Sign Patterns | 2007-08-30 | Paper |
| Computing the inertia from sign patterns | 2007-04-19 | Paper |
