| Publication | Date of Publication | Type |
|---|
| Manipulating the outcome of stable marriage and roommates problems | 2024-11-06 | Paper |
| Note on the existence of EFX allocations for negative additive valuations | 2024-09-11 | Paper |
| Envy-free relaxations for goods, chores, and mixed items | 2024-06-03 | Paper |
| Scheduling with non-renewable resources: minimizing the sum of completion times | 2024-05-30 | Paper |
| Hypergraph Horn functions | 2024-05-08 | Paper |
| Weighted exchange distance of basis pairs | 2024-04-02 | Paper |
| Partitioning into common independent sets via relaxing strongly base orderability | 2024-01-29 | Paper |
| Matroid Horn functions | 2024-01-15 | Paper |
| Exchange Distance of Basis Pairs in Split Matroids | 2024-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6087211 | 2023-11-14 | Paper |
| Reconfiguration of basis pairs in regular matroids | 2023-11-13 | Paper |
| A Dual Approach for Dynamic Pricing in Multidemand Markets | 2023-08-11 | Paper |
| Matroid Intersection under Restricted Oracles | 2023-06-27 | Paper |
| On approximating the rank of graph divisors | 2023-06-12 | Paper |
| Newton-type algorithms for inverse optimization II: weighted span objective | 2023-02-26 | Paper |
| On the complexity of packing rainbow spanning trees | 2023-02-21 | Paper |
| Analyzing Residual Random Greedy for monotone submodular maximization | 2023-01-30 | Paper |
| Inverse optimization problems with multiple weight functions | 2023-01-11 | Paper |
| A 3/2-Approximation for the Metric Many-Visits Path TSP | 2022-12-09 | Paper |
| Hypergraph characterization of split matroids | 2022-11-29 | Paper |
| On the complexity of packing rainbow spanning trees | 2022-06-23 | Paper |
| Unique key Horn functions | 2022-06-13 | Paper |
| Rainbow and monochromatic circuits and cocircuits in binary matroids | 2022-04-11 | Paper |
| Approximation by lexicographically maximal solutions in matching and matroid intersection problems | 2022-03-23 | Paper |
| Approximating Minimum Representations of Key Horn Functions | 2022-03-11 | Paper |
| Inverse optimization problems with multiple weight functions | 2022-01-09 | Paper |
| Market Pricing for Matroid Rank Valuations | 2021-12-01 | Paper |
| List Coloring of Two Matroids through Reduction to Partition Matroids | 2021-10-18 | Paper |
| Global and fixed-terminal cuts in digraphs | 2021-07-28 | Paper |
| Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems | 2021-07-21 | Paper |
| Complexity of packing common bases in matroids | 2021-07-02 | Paper |
| Scheduling with non-renewable resources: minimizing the sum of completion times | 2021-02-04 | Paper |
| Generating clause sequences of a CNF formula | 2021-01-19 | Paper |
| A tight \(\sqrt{2} \)-approximation for linear 3-cut | 2020-10-21 | Paper |
| Improving the integrality gap for multiway cut | 2020-08-28 | Paper |
| The Directed Disjoint Shortest Paths Problem | 2020-05-27 | Paper |
| Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings | 2020-03-12 | Paper |
| Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation | 2020-03-12 | Paper |
| Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs | 2020-03-12 | Paper |
| Improving the integrality gap for multiway cut | 2020-02-06 | Paper |
| Beating the 2-approximation factor for global bicut | 2019-08-06 | Paper |
| Arrival time dependent routing policies in public transport | 2018-12-03 | Paper |
| Blocking optimal structures | 2018-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607980 | 2018-03-15 | Paper |
| Making Bipartite Graphs DM-Irreducible | 2018-03-05 | Paper |
| Directed hypergraphs and Horn minimization | 2017-09-19 | Paper |
| An algorithm for identifying cycle-plus-triangles graphs | 2017-06-14 | Paper |
| Packing tree degree sequences | 2017-04-24 | Paper |
| King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments | 2017-04-10 | Paper |
| A note on \({\mathtt V}\)-free 2-matchings | 2016-12-06 | Paper |
| Covering intersecting bi-set families under matroid constraints | 2016-09-09 | Paper |
| Regular graphs are antimagic | 2015-11-02 | Paper |
| An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach | 2012-05-11 | Paper |
| Packing arborescences | 2011-05-16 | 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 |
| Restricted \(b\)-matchings in degree-bounded graphs | 2010-06-22 | Paper |
| Variations for Lovász’ Submodular Ideas | 2009-02-12 | Paper |
| Approximating maximum-size properly colored forests | N/A | Paper |
