David Adjiashvili

Available identifiers

Publication	Date of Publication	Type
Fault-tolerant edge-disjoint \(s\)-\(t\) paths -- beyond uniform faults	2024-05-27	Paper
Flexible Graph Connectivity	2022-10-14	Paper
Flexible graph connectivity	2022-03-22	Paper
Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs	2019-03-28	Paper
Firefighting on Trees Beyond Integrality Gaps	2019-03-28	Paper
Minimizing the number of switch instances on a flexible machine in polynomial time	2018-09-28	Paper
Firefighting on Trees Beyond Integrality Gaps	2018-07-16	Paper
Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs	2018-07-16	Paper
Robust Assignments via Ear Decompositions and Randomized Rounding	2017-12-19	Paper
Non-Uniform Robust Network Design in Planar Graphs	2017-08-31	Paper
A Polyhedral Frobenius Theorem with Applications to Integer Optimization	2015-07-31	Paper
Bulk-robust combinatorial optimization	2015-02-09	Paper
Labeling Schemes for Bounded Degree Graphs	2014-07-01	Paper
Time-Expanded Packings	2014-07-01	Paper
The Online Replacement Path Problem	2013-09-17	Paper
An \(s\)-\(t\) connection problem with adaptability	2011-05-17	Paper
Removing redundant quadratic constraints	2010-09-14	Paper
Equal-area locus-based convex polygon decomposition	2010-04-06	Paper
Equal-Area Locus-Based Convex Polygon Decomposition	2008-07-10	Paper

This page was built for person: David Adjiashvili