| Publication | Date of Publication | Type |
|---|
| Reconfiguration of time-respecting arborescences | 2024-01-16 | Paper |
| Algorithmic theory of qubit routing | 2024-01-16 | Paper |
| Lexicographically optimal earliest arrival flows | 2023-11-13 | 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 |
| https://portal.mardi4nfdi.de/entity/Q6109651 | 2023-07-28 | Paper |
| On optimization problems in acyclic hypergraphs | 2023-06-05 | Paper |
| Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra | 2023-04-28 | Paper |
| Pareto efficient matchings with pairwise preferences | 2023-02-13 | Paper |
| A Note on Robust Subsets of Transversal Matroids | 2022-10-17 | Paper |
| A parameterized view to the robust recoverable base problem of matroids under structural uncertainty | 2022-07-22 | Paper |
| On the complexity of stable fractional hypergraph matching | 2022-07-21 | Paper |
| Reforming an Envy-Free Matching | 2022-07-06 | Paper |
| A Matroid Generalization of the Super-Stable Matching Problem | 2022-06-23 | 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 |
| Envy-free matchings with one-sided preferences and matroid constraints | 2021-12-13 | Paper |
| On the complexity of fair house allocation | 2021-12-13 | Paper |
| The envy-free matching problem with pairwise preferences | 2021-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005108 | 2021-08-04 | Paper |
| Algorithms for gerrymandering over graphs | 2021-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5132749 | 2020-11-12 | Paper |
| The \(b\)-branching problem in digraphs | 2020-06-29 | Paper |
| The distance-constrained matroid median problem | 2020-05-21 | Paper |
| Popular matchings with two-sided preference lists and matroid constraints | 2020-01-29 | Paper |
| An improved algorithm for testing substitutability of weak preferences | 2019-11-08 | Paper |
| Discrete Newton methods for the evacuation problem | 2019-10-18 | Paper |
| Pareto Stable Matchings under One-Sided Matroid Constraints | 2019-08-29 | 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/Q5743384 | 2019-05-10 | Paper |
| A note on balanced flows in equality networks | 2019-03-11 | Paper |
| Strategic issues in college admissions with score-limits | 2019-02-22 | Paper |
| Minimum-cost \(b\)-edge dominating sets on trees | 2019-01-11 | Paper |
| The mixed evacuation problem | 2018-12-06 | Paper |
| The nucleolus of arborescence games in directed acyclic graphs | 2018-09-28 | Paper |
| A note on submodular function minimization with covering type linear constraints | 2018-07-26 | Paper |
| Exact and Approximation Algorithms for Weighted Matroid Intersection | 2018-07-16 | Paper |
| Submodular function minimization with submodular set covering constraints and precedence constraints | 2018-06-22 | Paper |
| A CHARACTERIZATION OF WEIGHTED POPULAR MATCHINGS UNDER MATROID CONSTRAINTS | 2018-05-18 | Paper |
| The $b$-branching problem in digraphs | 2018-02-07 | Paper |
| Reconfiguration of maximum weight \(b\)-matchings in a graph | 2017-10-23 | Paper |
| Popular Matchings with Ties and Matroid Constraints | 2017-08-31 | Paper |
| Efficient stabilization of cooperative matching games | 2017-05-15 | Paper |
| The Mixed Evacuation Problem | 2017-02-01 | Paper |
| A note on the submodular vertex cover problem with submodular penalties | 2016-12-23 | Paper |
| MANY-TO-MANY STABLE MATCHINGS WITH TIES IN TREES | 2016-12-16 | Paper |
| The popular matching and condensation problems under matroid constraints | 2016-11-29 | Paper |
| Extended formulations for sparsity matroids | 2016-08-25 | Paper |
| An inductive construction of minimally rigid body-hinge simple graphs | 2016-06-27 | Paper |
| A Matroid Approach to Stable Matchings with Lower Quotas | 2016-05-19 | Paper |
| Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints | 2015-11-04 | Paper |
| The Popular Matching and Condensation Problems Under Matroid Constraints | 2015-09-11 | Paper |
| Minimum-Cost $$b$$-Edge Dominating Sets on Trees | 2015-09-11 | Paper |
| A New Approach to the Pareto Stable Matching Problem | 2015-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2935596 | 2014-12-30 | Paper |
| On packing arborescences in temporal networks | 2014-12-09 | Paper |
| The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths | 2014-09-12 | Paper |
| Arborescence Problems in Directed Graphs: Theorems and Algorithms | 2014-05-21 | Paper |
| A note on the serial dictatorship with project closures | 2014-05-15 | Paper |
| MATROID INTERSECTION WITH PRIORITY CONSTRAINTS | 2014-03-19 | Paper |
| An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs | 2013-12-10 | Paper |
| On total unimodularity of edge-edge adjacency matrices | 2013-11-11 | Paper |
| An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem | 2013-03-28 | Paper |
| Independent arborescences in directed graphs | 2013-03-01 | Paper |
| Robustness of minimum cost arborescences | 2012-12-28 | Paper |
| The root location problem for arc-disjoint arborescences | 2012-08-10 | Paper |
| Robustness of Minimum Cost Arborescences | 2011-12-16 | Paper |
| On Totally Unimodularity of Edge-Edge Adjacency Matrices | 2011-08-17 | Paper |
| Submodular Function Minimization under a Submodular Set Covering Constraint | 2011-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3084809 | 2011-03-25 | Paper |
| Covering directed graphs by in-trees | 2011-02-18 | Paper |
| The Prize-Collecting Edge Dominating Set Problem in Trees | 2010-09-03 | Paper |
| A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph | 2010-09-02 | Paper |
| Arc-disjoint in-trees in directed graphs | 2010-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579487 | 2010-08-06 | Paper |
| An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths | 2010-04-28 | Paper |
| A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths | 2009-12-17 | Paper |
| The Minimum Weight In-Tree Cover Problem | 2009-05-13 | Paper |
| Covering Directed Graphs by In-Trees | 2008-07-10 | Paper |
| An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity | 2008-01-04 | Paper |
| An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths | 2008-01-04 | Paper |
