| Publication | Date of Publication | Type |
|---|
Finding almost tight witness trees
| 2024-11-14 | Paper |
Stabilization of capacitated matching games
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Node connectivity augmentation via iterative randomized rounding
Mathematical Programming. Series A. Series B | 2023-05-02 | Paper |
Finding Almost Tight Witness Trees
| 2022-11-22 | Paper |
Pivot rules for circuit-augmentation algorithms in linear optimization
SIAM Journal on Optimization | 2022-09-14 | Paper |
On the Simplex method for 0/1 polytopes
| 2021-11-27 | Paper |
scientific article; zbMATH DE number 7378671 (Why is no real title available?)
| 2021-08-04 | Paper |
Stabilizing weighted graphs
| 2021-07-28 | Paper |
Stabilizing weighted graphs
Mathematics of Operations Research | 2021-01-08 | Paper |
An efficient characterization of submodular spanning tree games
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
Single-sink fractionally subadditive network design
| 2020-05-27 | Paper |
Opposite elements in clutters
Mathematics of Operations Research | 2020-03-12 | Paper |
An efficient characterization of submodular spanning tree games
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
On the circuit diameter of some combinatorial polytopes
SIAM Journal on Discrete Mathematics | 2019-01-07 | Paper |
Stabilizing network bargaining games by blocking players
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
On the existence of compact $\varepsilon$-approximated formulations for knapsack in the original space
Operations Research Letters | 2018-09-28 | Paper |
The diameter of the fractional matching polytope and its hardness implications
| 2018-06-08 | Paper |
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem
| 2018-04-19 | Paper |
scientific article; zbMATH DE number 6850362 (Why is no real title available?)
| 2018-03-15 | Paper |
Improved region-growing and combinatorial algorithms for \(k\)-route cut problems (extended abstract)
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
\(0/1\) polytopes with quadratic Chvátal rank
Operations Research | 2017-06-02 | Paper |
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
| 2017-03-22 | Paper |
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
Mathematical Programming. Series A. Series B | 2016-11-25 | Paper |
Stabilizing network bargaining games by blocking players
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Lehman's theorem and the directed Steiner tree problem
SIAM Journal on Discrete Mathematics | 2016-01-15 | Paper |
Finding small stabilizers for unstable graphs
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Approximate Deadline-Scheduling with Precedence Constraints
Algorithms - ESA 2015 | 2015-11-19 | Paper |
The interval constrained 3-coloring problem
Theoretical Computer Science | 2015-10-08 | Paper |
Exponentiality of the exchange algorithm for finding another room-partitioning
Discrete Applied Mathematics | 2015-09-22 | Paper |
The capacitated orienteering problem
Discrete Applied Mathematics | 2015-09-21 | Paper |
An improved LP-based approximation for Steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Finding small stabilizers for unstable graphs
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Network design with a discrete set of traffic matrices
Operations Research Letters | 2014-05-14 | Paper |
Steiner tree approximation via iterative randomized rounding
Journal of the ACM | 2014-02-17 | Paper |
The school bus problem on trees
Algorithmica | 2013-11-11 | Paper |
On finding another room-partitioning of the vertices
| 2013-11-08 | Paper |
Better approximation algorithms for technology diffusion
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Stable routing and unique-max coloring on trees
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
0/1 polytopes with quadratic Chvátal rank
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk
Mathematics of Operations Research | 2012-05-24 | Paper |
The school bus problem on trees
Algorithms and Computation | 2011-12-16 | Paper |
An exact algorithm for robust network design
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
The VPN Problem with Concave Costs
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Stable routing under the Spanning Tree Protocol
Operations Research Letters | 2010-12-20 | Paper |
The interval constrained 3-coloring problem
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
On the Complexity of the Asymmetric VPN Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
The Virtual Private Network Design Problem with Concave Costs (Oberwolfach abstract)
| 2008-12-12 | Paper |
The VPN Tree Routing Conjecture for Outerplanar Networks
| 2007-11-16 | Paper |
Capacitated Network Bargaining Games: Stability and Structure
| N/A | Paper |
On the Number of Degenerate Simplex Pivots
| N/A | Paper |
On the Hardness of Short and Sign-Compatible Circuit Walks
| N/A | Paper |
