| Publication | Date of Publication | Type |
|---|
Deterministic primal-dual algorithms for online \(k\)-way matching with delays
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 |
Deterministic primal-dual algorithms for online \(k\)-way matching with delays
| 2024-08-22 | Paper |
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams
| 2024-07-19 | Paper |
Algorithmic theory of qubit routing
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space
Theoretical Computer Science | 2024-01-02 | Paper |
scientific article; zbMATH DE number 7765397 (Why is no real title available?)
| 2023-11-14 | 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 |
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra
| 2023-04-28 | Paper |
Rerouting Planar Curves and Disjoint Paths
| 2022-10-21 | Paper |
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
Operations Research Letters | 2022-07-22 | Paper |
Spectral aspects of symmetric matrix signings
| 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 |
Multi-pass streaming algorithms for monotone submodular function maximization
Theory of Computing Systems | 2022-02-14 | Paper |
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
SIAM Journal on Discrete Mathematics | 2022-02-09 | Paper |
Market pricing for matroid rank valuations
SIAM Journal on Discrete Mathematics | 2021-12-01 | Paper |
scientific article; zbMATH DE number 7378329 (Why is no real title available?)
| 2021-08-04 | Paper |
Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
| 2021-07-28 | Paper |
Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
Algorithmica | 2021-04-08 | Paper |
Complexity of the multi-service center problem
| 2020-11-25 | Paper |
Complexity of the multi-service center problem
Theoretical Computer Science | 2020-10-12 | Paper |
Spectral aspects of symmetric matrix signings
Discrete Optimization | 2020-07-30 | Paper |
The \(b\)-branching problem in digraphs
Discrete Applied Mathematics | 2020-06-29 | Paper |
Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
Algorithmica | 2020-02-28 | Paper |
Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Online Spectral Approximation in Random Order Streams
| 2019-11-20 | 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 |
Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
| 2019-05-10 | Paper |
Total dual integrality of the linear complementarity problem
Annals of Operations Research | 2019-03-06 | Paper |
Minimum-cost \(b\)-edge dominating sets on trees
Algorithmica | 2019-01-11 | Paper |
Optimal cache placement for an academic backbone network
| 2018-09-17 | 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 |
The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
Journal of Combinatorial Theory. Series B | 2018-05-09 | Paper |
The $b$-branching problem in digraphs
| 2018-02-07 | Paper |
Reconfiguration of maximum weight \(b\)-matchings in a graph
| 2017-10-23 | Paper |
Parameterized complexity of sparse linear complementarity problems
Algorithmica | 2017-10-10 | Paper |
Parameterized complexity of sparse linear complementarity problems
| 2017-09-29 | 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 |
Coloring immersion-free graphs
Journal of Combinatorial Theory. Series B | 2016-10-12 | Paper |
The Linear Complementarity Problems with a Few Variables per Constraint
Mathematics of Operations Research | 2016-01-29 | Paper |
Minimum-cost \(b\)-edge dominating sets on trees
Algorithms and Computation | 2015-09-11 | Paper |
Fixed-parameter tractability for subset feedback set problems with parity constraints
Theoretical Computer Science | 2015-05-18 | Paper |
Half-integral packing of odd cycles through prescribed vertices
Combinatorica | 2015-03-03 | Paper |
Matching problems with delta-matroid constraints
SIAM Journal on Discrete Mathematics | 2014-09-26 | Paper |
Robust independence systems
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
Sparse Linear Complementarity Problems
Lecture Notes in Computer Science | 2013-06-07 | Paper |
On the number of matrices to generate a matrix \(\ast\)-algebra over the real field
Linear Algebra and its Applications | 2013-01-16 | Paper |
Packing directed circuits through prescribed vertices bounded fractionally
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Computing knapsack solutions with cardinality robustness
Japan Journal of Industrial and Applied Mathematics | 2012-12-28 | Paper |
Packing cycles through prescribed vertices under modularity constraints
Advances in Applied Mathematics | 2012-08-14 | Paper |
Computing knapsack solutions with cardinality robustness
Algorithms and Computation | 2011-12-16 | Paper |
Packing cycles through prescribed vertices
Journal of Combinatorial Theory. Series B | 2011-08-10 | Paper |
Robust independence systems
Automata, Languages and Programming | 2011-07-06 | Paper |
Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
Journal of Combinatorial Theory. Series B | 2010-11-05 | Paper |
A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices
Linear Algebra and its Applications | 2010-06-25 | Paper |
Sign-solvable linear complementarity problems
Linear Algebra and its Applications | 2008-06-17 | Paper |
Solving linear programs from sign patterns
Mathematical Programming. Series A. Series B | 2008-06-04 | Paper |
Sign-Solvable Linear Complementarity Problems
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Computing the Inertia from Sign Patterns
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Computing the inertia from sign patterns
Mathematical Programming. Series A. Series B | 2007-04-19 | Paper |
