| Publication | Date of Publication | Type |
|---|
EFX allocations for indivisible chores: matching-based approach
Theoretical Computer Science | 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
Theoretical Computer Science | 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
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Algorithmic theory of qubit routing
Lecture Notes in Computer Science | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7765397 (Why is no real title available?)
| 2023-11-14 | Paper |
Fixed-parameter algorithms for graph constraint logic
| 2023-11-13 | Paper |
Optimal general factor problem and jump system intersection
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Finding a Maximum Restricted $t$-Matching via Boolean Edge-CSP
| 2023-10-31 | Paper |
On reachable assignments under dichotomous preferences
Theoretical Computer Science | 2023-10-26 | Paper |
Feedback vertex set reconfiguration in planar graphs
Theoretical Computer Science | 2023-10-26 | Paper |
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Reconfiguration of spanning trees with degree constraints or diameter constraints
Algorithmica | 2023-09-27 | Paper |
Fixed-parameter algorithms for graph constraint logic
Theoretical Computer Science | 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
Journal of the Operations Research Society of Japan | 2023-04-21 | Paper |
Reconfiguration of Spanning Trees with Many or Few Leaves
| 2023-02-07 | Paper |
An FPT Algorithm for Minimum Additive Spanner Problem.
| 2023-02-07 | Paper |
Shortest Reconfiguration of Colorings Under Kempe Changes
| 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650221 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650230 (Why is no real title available?)
| 2023-02-03 | Paper |
Trade-offs among degree, diameter, and number of paths
Discrete Applied Mathematics | 2023-01-11 | Paper |
Linear-time recognition of double-threshold graphs
Graph-Theoretic Concepts in Computer Science | 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
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Parameterized Complexity of $$(A,\ell )$$-Path Packing
Lecture Notes in Computer Science | 2022-10-13 | Paper |
The Steiner Problem for Count Matroids
Lecture Notes in Computer Science | 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
Operations Research Letters | 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
Discrete Optimization | 2022-06-09 | Paper |
scientific article; zbMATH DE number 7525498 (Why is no real title available?)
| 2022-05-11 | Paper |
Shortest reconfiguration of perfect matchings via alternating cycles
SIAM Journal on Discrete Mathematics | 2022-05-10 | Paper |
An improved deterministic parameterized algorithm for cactus vertex deletion
Theory of Computing Systems | 2022-05-09 | Paper |
Parameterized complexity of \((A,\ell)\)-path packing
Algorithmica | 2022-03-22 | Paper |
Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Linear-time recognition of double-threshold graphs
Algorithmica | 2022-03-22 | Paper |
Tight approximation for unconstrained XOS maximization
Mathematics of Operations Research | 2022-02-08 | Paper |
Market pricing for matroid rank valuations
SIAM Journal on Discrete Mathematics | 2021-12-01 | Paper |
Improved analysis of highest-degree branching for feedback vertex set
Algorithmica | 2021-07-26 | Paper |
Algorithms for gerrymandering over graphs
Theoretical Computer Science | 2021-05-10 | Paper |
Computing the largest bond and the maximum connected cut of a graph
Algorithmica | 2021-04-19 | Paper |
Finding a maximum minimal separator: graph classes and fixed-parameter tractability
Theoretical Computer Science | 2021-04-08 | Paper |
A weighted linear matroid parity algorithm
SIAM Journal on Computing | 2021-02-08 | Paper |
Complexity of the multi-service center problem
| 2020-11-25 | Paper |
Subgraph isomorphism on graph classes that exclude a substructure
Algorithmica | 2020-11-11 | Paper |
Complexity of the multi-service center problem
Theoretical Computer Science | 2020-10-12 | Paper |
Diameter of colorings under Kempe changes
Theoretical Computer Science | 2020-09-01 | Paper |
A strongly polynomial time algorithm for the maximum supply rate problem on trees
Frontiers in Algorithmics | 2020-07-07 | Paper |
On the number of edges in a graph with many two-hop disjoint paths
Discrete Applied Mathematics | 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
Journal of Combinatorial Theory. Series B | 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
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Two disjoint shortest paths problem with non-negative edge length
Operations Research Letters | 2020-02-10 | Paper |
A strongly polynomial time algorithm for the maximum supply rate problem on trees
Theoretical Computer Science | 2020-01-16 | Paper |
Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
Linear-Time Recognition of Double-Threshold Graphs
| 2019-09-20 | Paper |
Randomized strategies for cardinality robustness in the knapsack problem
2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
The generalized terminal backup problem
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Reconfiguration of maximum-weight \(b\)-matchings in a graph
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
| 2019-05-10 | Paper |
List-coloring graphs without subdivisions and without immersions
| 2019-05-10 | Paper |
scientific article; zbMATH DE number 7051285 (Why is no real title available?)
| 2019-05-06 | Paper |
Minimum-cost \(b\)-edge dominating sets on trees
Algorithmica | 2019-01-11 | Paper |
An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two
ACM Transactions on Algorithms | 2018-11-05 | Paper |
The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions
Operations Research Letters | 2018-09-28 | Paper |
NP-hardness and fixed-parameter tractability of the minimum spanner problem
Theoretical Computer Science | 2018-09-27 | Paper |
Optimal cache placement for an academic backbone network
| 2018-09-17 | Paper |
All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs
SIAM Journal on Computing | 2018-08-03 | Paper |
Selecting vertex disjoint paths in plane graphs
Networks | 2018-05-23 | Paper |
The parity Hamiltonian cycle problem
Discrete Mathematics | 2018-01-19 | Paper |
Randomized strategies for cardinality robustness in the knapsack problem
Theoretical Computer Science | 2017-11-03 | Paper |
Reconfiguration of maximum weight \(b\)-matchings in a graph
| 2017-10-23 | Paper |
A weighted linear matroid parity algorithm
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
An algorithm for identifying cycle-plus-triangles graphs
Discrete Applied Mathematics | 2017-06-14 | Paper |
Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
Efficient stabilization of cooperative matching games
Theoretical Computer Science | 2017-05-15 | Paper |
Finding a shortest non-zero path in group-labeled graphs via permanent computation
Algorithmica | 2017-05-02 | Paper |
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
Combinatorica | 2017-03-31 | Paper |
Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network
European Journal of Operational Research | 2016-10-07 | Paper |
Covering intersecting bi-set families under matroid constraints
SIAM Journal on Discrete Mathematics | 2016-09-09 | Paper |
Edge-disjoint odd cycles in 4-edge-connected graphs
Journal of Combinatorial Theory. Series B | 2016-04-21 | Paper |
Routing algorithms under mutual interference constraints
Journal of the Operations Research Society of Japan | 2016-03-16 | Paper |
Finding a path in group-labeled graphs with two labels forbidden
Lecture Notes in Computer Science | 2015-10-27 | Paper |
The generalized terminal backup problem
SIAM Journal on Discrete Mathematics | 2015-09-23 | Paper |
Minimum-cost \(b\)-edge dominating sets on trees
Algorithms and Computation | 2015-09-11 | Paper |
Fence patrolling by mobile agents with distinct speeds
Distributed Computing | 2015-07-08 | Paper |
An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
An \(O(\log n)\)-approximation algorithm for the edge-disjoint paths problem in Eulerian planar graphs
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Triangle-free 2-matchings and M-concave functions on jump systems
Discrete Applied Mathematics | 2014-08-26 | Paper |
Breaking o(n 1/2 )-approximation algorithms for the edge-disjoint paths problem with congestion two
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
| 2014-05-22 | Paper |
Robust matchings and matroid intersections
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
Fence patrolling by mobile agents with distinct speeds
Lecture Notes in Computer Science | 2013-03-21 | Paper |
Cone superadditivity of discrete convex functions
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
Algorithms for finding a maximum non-\(k\)-linked graph
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs
Discrete Optimization | 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
Journal of Combinatorial Theory. Series B | 2012-08-14 | Paper |
Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
Journal of Combinatorial Theory. Series B | 2012-08-14 | Paper |
Testing the \((s,t)\) connectivity of graphs and digraphs
Theoretical Computer Science | 2012-06-25 | Paper |
On shortest disjoint paths in planar graphs
Discrete Optimization | 2012-06-20 | Paper |
A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs
Discrete Optimization | 2012-06-20 | Paper |
The complexity of the node capacitated in-tree packing problem
Networks | 2012-06-18 | Paper |
A linear time algorithm for the induced disjoint paths problem in planar graphs
Journal of Computer and System Sciences | 2012-05-11 | Paper |
An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
Journal of Combinatorial Theory. Series B | 2012-05-11 | Paper |
The disjoint paths problem in quadratic time
Journal of Combinatorial Theory. Series B | 2012-05-04 | Paper |
An improved algorithm for the half-disjoint paths problem
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Algorithms for finding an induced cycle in planar graphs
Combinatorica | 2011-12-19 | Paper |
Algorithms for finding a maximum non-\(k\)-linked graph
Algorithms – ESA 2011 | 2011-09-16 | Paper |
An \(O(\log n)\)-approximation algorithm for the disjoint paths problem in Eulerian planar graphs and 4-edge-connected planar graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Improved algorithm for the half-disjoint paths problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Robust matchings and matroid intersections
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Induced disjoint paths problem in a planar digraph
Discrete Applied Mathematics | 2010-04-28 | Paper |
An algorithm for minimum cost arc-connectivity orientations
Algorithmica | 2010-02-23 | Paper |
On shortest disjoint paths in planar graphs
Algorithms and Computation | 2009-12-17 | Paper |
Even factors, jump systems, and discrete convexity
Journal of Combinatorial Theory. Series B | 2009-01-21 | Paper |
The Induced Disjoint Paths Problem
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Operations on M‐Convex Functions on Jump Systems
SIAM Journal on Discrete Mathematics | 2008-03-28 | Paper |
Induction of M-convex functions by linking systems
Discrete Applied Mathematics | 2007-07-19 | Paper |
