| Publication | Date of Publication | Type |
|---|
| EFX allocations for indivisible chores: matching-based approach | 2025-01-08 | Paper |
| Rerouting planar curves and disjoint paths | 2024-11-14 | Paper |
| Hardness of finding combinatorial shortest paths on graph associahedra | 2024-11-14 | Paper |
| Reconfiguration of colorings in triangulations of the sphere | 2024-10-16 | Paper |
| One-face shortest disjoint paths with a deviation terminal | 2024-09-11 | Paper |
| Proportional allocation of indivisible goods up to the least valued good on average | 2024-09-11 | Paper |
| Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams | 2024-07-19 | Paper |
| Envy-free relaxations for goods, chores, and mixed items | 2024-06-03 | Paper |
| EFX allocations for indivisible chores: matching-based approach | 2024-05-29 | Paper |
| Reconfiguration of spanning trees with degree constraint or diameter constraint | 2024-04-23 | Paper |
| Reconfiguration of time-respecting arborescences | 2024-01-16 | Paper |
| Algorithmic theory of qubit routing | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6087211 | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6089660 | 2023-11-13 | Paper |
| Optimal general factor problem and jump system intersection | 2023-11-09 | Paper |
| Finding a Maximum Restricted $t$-Matching via Boolean Edge-CSP | 2023-10-31 | Paper |
| Feedback vertex set reconfiguration in planar graphs | 2023-10-26 | 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 |
| Reconfiguration of spanning trees with degree constraints or diameter constraints | 2023-09-27 | Paper |
| Fixed-parameter algorithms for graph constraint logic | 2023-05-12 | Paper |
| Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra | 2023-04-28 | Paper |
| Reconfiguration of the Union of Arborescences | 2023-04-25 | Paper |
| APPROXIMATION ALGORITHM FOR STEINER TREE PROBLEM WITH NEIGHBOR-INDUCED COST | 2023-04-21 | Paper |
| An FPT Algorithm for Minimum Additive Spanner Problem. | 2023-02-07 | Paper |
| Shortest Reconfiguration of Colorings Under Kempe Changes | 2023-02-07 | Paper |
| Reconfiguration of Spanning Trees with Many or Few Leaves | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875545 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875556 | 2023-02-03 | Paper |
| Trade-offs among degree, diameter, and number of paths | 2023-01-11 | Paper |
| Linear-time recognition of double-threshold graphs | 2022-12-21 | Paper |
| Reconfiguration of colorings in triangulations of the sphere | 2022-10-31 | Paper |
| Rerouting Planar Curves and Disjoint Paths | 2022-10-21 | Paper |
| Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles | 2022-10-14 | Paper |
| Parameterized Complexity of $$(A,\ell )$$-Path Packing | 2022-10-13 | Paper |
| The Steiner Problem for Count Matroids | 2022-10-13 | Paper |
| An additive approximation scheme for the Nash social welfare maximization with identical additive valuations | 2022-08-30 | Paper |
| A parameterized view to the robust recoverable base problem of matroids under structural uncertainty | 2022-07-22 | Paper |
| The Perfect Matching Reconfiguration Problem | 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 |
| An improved deterministic parameterized algorithm for cactus vertex deletion | 2022-05-09 | Paper |
| Parameterized complexity of \((A,\ell)\)-path packing | 2022-03-22 | Paper |
| Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles | 2022-03-22 | Paper |
| Linear-time recognition of double-threshold graphs | 2022-03-22 | Paper |
| Tight Approximation for Unconstrained XOS Maximization | 2022-02-08 | Paper |
| Market Pricing for Matroid Rank Valuations | 2021-12-01 | Paper |
| Improved analysis of highest-degree branching for feedback vertex set | 2021-07-26 | Paper |
| Algorithms for gerrymandering over graphs | 2021-05-10 | Paper |
| Computing the largest bond and the maximum connected cut of a graph | 2021-04-19 | Paper |
| Finding a maximum minimal separator: graph classes and fixed-parameter tractability | 2021-04-08 | Paper |
| A Weighted Linear Matroid Parity Algorithm | 2021-02-08 | Paper |
| Complexity of the multi-service center problem | 2020-11-25 | Paper |
| Subgraph isomorphism on graph classes that exclude a substructure | 2020-11-11 | Paper |
| Complexity of the multi-service center problem | 2020-10-12 | Paper |
| Diameter of colorings under Kempe changes | 2020-09-01 | Paper |
| A strongly polynomial time algorithm for the maximum supply rate problem on trees | 2020-07-07 | Paper |
| On the number of edges in a graph with many two-hop disjoint paths | 2020-06-29 | Paper |
| The Directed Disjoint Shortest Paths Problem | 2020-05-27 | Paper |
| Finding a path with two labels forbidden in group-labeled graphs | 2020-04-22 | Paper |
| An improved fixed-parameter algorithm for max-cut parameterized by crossing number | 2020-02-25 | Paper |
| Diameter of colorings under Kempe changes | 2020-02-24 | Paper |
| Two disjoint shortest paths problem with non-negative edge length | 2020-02-10 | Paper |
| A strongly polynomial time algorithm for the maximum supply rate problem on trees | 2020-01-16 | Paper |
| Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor | 2020-01-15 | Paper |
| Linear-Time Recognition of Double-Threshold Graphs | 2019-09-20 | Paper |
| Randomized Strategies for Cardinality Robustness in the Knapsack Problem | 2019-09-17 | Paper |
| The Generalized Terminal Backup Problem | 2019-06-20 | Paper |
| Reconfiguration of maximum-weight \(b\)-matchings in a graph | 2019-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743513 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743487 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633929 | 2019-05-06 | Paper |
| Minimum-cost \(b\)-edge dominating sets on trees | 2019-01-11 | Paper |
| An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two | 2018-11-05 | Paper |
| The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions | 2018-09-28 | Paper |
| NP-hardness and fixed-parameter tractability of the minimum spanner problem | 2018-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376371 | 2018-09-17 | Paper |
| All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs | 2018-08-03 | Paper |
| Selecting vertex disjoint paths in plane graphs | 2018-05-23 | Paper |
| The parity Hamiltonian cycle problem | 2018-01-19 | Paper |
| Randomized strategies for cardinality robustness in the knapsack problem | 2017-11-03 | Paper |
| Reconfiguration of maximum weight \(b\)-matchings in a graph | 2017-10-23 | Paper |
| A weighted linear matroid parity algorithm | 2017-08-17 | Paper |
| An algorithm for identifying cycle-plus-triangles graphs | 2017-06-14 | 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 |
| Finding a shortest non-zero path in group-labeled graphs via permanent computation | 2017-05-02 | Paper |
| The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs | 2017-03-31 | Paper |
| Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network | 2016-10-07 | Paper |
| Covering intersecting bi-set families under matroid constraints | 2016-09-09 | Paper |
| Edge-disjoint odd cycles in 4-edge-connected graphs | 2016-04-21 | Paper |
| Routing algorithms under mutual interference constraints | 2016-03-16 | Paper |
| Finding a path with two labels forbidden in group-labeled graphs | 2015-10-27 | Paper |
| The Generalized Terminal Backup Problem | 2015-09-23 | Paper |
| Minimum-Cost $$b$$-Edge Dominating Sets on Trees | 2015-09-11 | Paper |
| Fence patrolling by mobile agents with distinct speeds | 2015-07-08 | Paper |
| An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem | 2015-06-26 | Paper |
| An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs | 2014-12-05 | Paper |
| Triangle-free 2-matchings and M-concave functions on jump systems | 2014-08-26 | Paper |
| Breaking o(n 1/2 )-approximation algorithms for the edge-disjoint paths problem with congestion two | 2014-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417629 | 2014-05-22 | Paper |
| Robust matchings and matroid intersections | 2014-01-21 | Paper |
| Fence patrolling by mobile agents with distinct speeds | 2013-03-21 | Paper |
| Cone superadditivity of discrete convex functions | 2012-10-15 | Paper |
| Algorithms for finding a maximum non-\(k\)-linked graph | 2012-09-12 | Paper |
| An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs | 2012-09-11 | Paper |
| Linear min-max relation between the treewidth of \(H\)-minor-free graphs and its largest grid | 2012-08-23 | Paper |
| Edge-disjoint odd cycles in 4-edge-connected graphs | 2012-08-23 | Paper |
| A proof of Cunningham's conjecture on restricted subgraphs and jump systems | 2012-08-14 | Paper |
| Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem | 2012-08-14 | Paper |
| Testing the \((s,t)\) connectivity of graphs and digraphs | 2012-06-25 | Paper |
| On shortest disjoint paths in planar graphs | 2012-06-20 | Paper |
| A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs | 2012-06-20 | Paper |
| The complexity of the node capacitated in-tree packing problem | 2012-06-18 | Paper |
| A linear time algorithm for the induced disjoint paths problem in planar graphs | 2012-05-11 | Paper |
| An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach | 2012-05-11 | Paper |
| The disjoint paths problem in quadratic time | 2012-05-04 | Paper |
| An Improved Algorithm for the Half-Disjoint Paths Problem | 2012-03-15 | Paper |
| Algorithms for finding an induced cycle in planar graphs | 2011-12-19 | Paper |
| Algorithms for Finding a Maximum Non-k-linked Graph | 2011-09-16 | Paper |
| An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs | 2010-09-10 | Paper |
| Improved Algorithm for the Half-Disjoint Paths Problem | 2010-09-10 | Paper |
| Robust Matchings and Matroid Intersections | 2010-09-06 | Paper |
| Induced disjoint paths problem in a planar digraph | 2010-04-28 | Paper |
| An algorithm for minimum cost arc-connectivity orientations | 2010-02-23 | Paper |
| On Shortest Disjoint Paths in Planar Graphs | 2009-12-17 | Paper |
| Even factors, jump systems, and discrete convexity | 2009-01-21 | Paper |
| The Induced Disjoint Paths Problem | 2008-06-10 | Paper |
| Operations on M‐Convex Functions on Jump Systems | 2008-03-28 | Paper |
| Induction of M-convex functions by linking systems | 2007-07-19 | Paper |
