| Publication | Date of Publication | Type |
|---|
Reachability of fair allocations via sequential exchanges
Algorithmica | 2024-12-03 | Paper |
Hardness of finding combinatorial shortest paths on graph associahedra
| 2024-11-14 | Paper |
On connectedness of solutions to integer linear systems
| 2024-09-16 | Paper |
A note on robust subsets of transversal matroids
Journal of the Operations Research Society of Japan | 2024-08-13 | 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 |
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 |
Lexicographically optimal earliest arrival flows
Networks | 2023-11-13 | Paper |
On reachable assignments under dichotomous preferences
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 |
scientific article; zbMATH DE number 7720021 (Why is no real title available?)
| 2023-07-28 | Paper |
On optimization problems in acyclic hypergraphs
Information Processing Letters | 2023-06-05 | Paper |
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra
| 2023-04-28 | Paper |
Pareto efficient matchings with pairwise preferences
Theoretical Computer Science | 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
Operations Research Letters | 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
SIAM Journal on Discrete Mathematics | 2022-06-23 | 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 |
Envy-free matchings with one-sided preferences and matroid constraints
Operations Research Letters | 2021-12-13 | Paper |
On the complexity of fair house allocation
Operations Research Letters | 2021-12-13 | Paper |
The envy-free matching problem with pairwise preferences
Information Processing Letters | 2021-10-19 | Paper |
scientific article; zbMATH DE number 7378329 (Why is no real title available?)
| 2021-08-04 | Paper |
Algorithms for gerrymandering over graphs
Theoretical Computer Science | 2021-05-10 | Paper |
On dynamic patrolling security games
| 2020-11-12 | Paper |
The \(b\)-branching problem in digraphs
Discrete Applied Mathematics | 2020-06-29 | Paper |
The distance-constrained matroid median problem
Algorithmica | 2020-05-21 | Paper |
Popular matchings with two-sided preference lists and matroid constraints
Theoretical Computer Science | 2020-01-29 | Paper |
An improved algorithm for testing substitutability of weak preferences
Mathematical Social Sciences | 2019-11-08 | Paper |
Discrete Newton methods for the evacuation problem
Theoretical Computer Science | 2019-10-18 | Paper |
Pareto stable matchings under one-sided matroid constraints
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Exact and approximation algorithms for weighted matroid intersection
Mathematical Programming. Series A. Series B | 2019-08-06 | Paper |
Reconfiguration of maximum-weight \(b\)-matchings in a graph
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
A matroid approach to stable matchings with lower quotas
| 2019-05-10 | Paper |
A note on balanced flows in equality networks
Information Processing Letters | 2019-03-11 | Paper |
Strategic issues in college admissions with score-limits
Operations Research Letters | 2019-02-22 | Paper |
Minimum-cost \(b\)-edge dominating sets on trees
Algorithmica | 2019-01-11 | Paper |
The mixed evacuation problem
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
The nucleolus of arborescence games in directed acyclic graphs
Operations Research Letters | 2018-09-28 | Paper |
A note on submodular function minimization with covering type linear constraints
Algorithmica | 2018-07-26 | Paper |
Exact and approximation algorithms for weighted matroid intersection
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 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
Journal of the Operations Research Society of Japan | 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
SIAM Journal on Discrete Mathematics | 2017-08-31 | Paper |
Efficient stabilization of cooperative matching games
Theoretical Computer Science | 2017-05-15 | Paper |
The mixed evacuation problem
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
A note on the submodular vertex cover problem with submodular penalties
Theoretical Computer Science | 2016-12-23 | Paper |
Many-to-many stable matchings with ties in trees
Journal of the Operations Research Society of Japan | 2016-12-16 | Paper |
The popular matching and condensation problems under matroid constraints
Journal of Combinatorial Optimization | 2016-11-29 | Paper |
Extended formulations for sparsity matroids
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
An inductive construction of minimally rigid body-hinge simple graphs
Theoretical Computer Science | 2016-06-27 | Paper |
A matroid approach to stable matchings with lower quotas
Mathematics of Operations Research | 2016-05-19 | Paper |
Stable matchings with ties, master preference lists, and matroid constraints
Algorithmic Game Theory | 2015-11-04 | Paper |
Minimum-cost \(b\)-edge dominating sets on trees
Algorithms and Computation | 2015-09-11 | Paper |
The popular matching and condensation problems under matroid constraints
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
A new approach to the Pareto stable matching problem
Mathematics of Operations Research | 2015-03-31 | Paper |
A note on the quasi-additive bound for Boolean functions
| 2014-12-30 | Paper |
On packing arborescences in temporal networks
Information Processing Letters | 2014-12-09 | Paper |
The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
Discrete Applied Mathematics | 2014-09-12 | Paper |
Arborescence problems in directed graphs: theorems and algorithms
Interdisciplinary Information Sciences | 2014-05-21 | Paper |
A note on the serial dictatorship with project closures
Operations Research Letters | 2014-05-15 | Paper |
MATROID INTERSECTION WITH PRIORITY CONSTRAINTS
Journal of the Operations Research Society of Japan | 2014-03-19 | Paper |
An inductive construction of minimally rigid body-hinge simple graphs
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
On total unimodularity of edge-edge adjacency matrices
Algorithmica | 2013-11-11 | Paper |
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
Information Processing Letters | 2013-03-28 | Paper |
Independent arborescences in directed graphs
Discrete Mathematics | 2013-03-01 | Paper |
Robustness of minimum cost arborescences
Japan Journal of Industrial and Applied Mathematics | 2012-12-28 | Paper |
The root location problem for arc-disjoint arborescences
Discrete Applied Mathematics | 2012-08-10 | Paper |
Robustness of minimum cost arborescences
Algorithms and Computation | 2011-12-16 | Paper |
On totally unimodularity of edge-edge adjacency matrices
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Submodular function minimization under a submodular set covering constraint
Lecture Notes in Computer Science | 2011-07-01 | Paper |
scientific article; zbMATH DE number 5870351 (Why is no real title available?)
| 2011-03-25 | Paper |
Covering directed graphs by in-trees
Journal of Combinatorial Optimization | 2011-02-18 | Paper |
The prize-collecting edge dominating set problem in trees
Mathematical Foundations of Computer Science 2010 | 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
Information Processing Letters | 2010-09-02 | Paper |
Arc-disjoint in-trees in directed graphs
Combinatorica | 2010-08-13 | Paper |
scientific article; zbMATH DE number 5764894 (Why is no real title available?)
| 2010-08-06 | Paper |
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
Discrete Applied Mathematics | 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
Algorithms and Computation | 2009-12-17 | Paper |
The Minimum Weight In-Tree Cover Problem
Communications in Computer and Information Science | 2009-05-13 | Paper |
Covering Directed Graphs by In-Trees
Lecture Notes in Computer Science | 2008-07-10 | Paper |
An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
