List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Fault-tolerant edge-disjoint \(s\)-\(t\) paths -- beyond uniform faults | 2024-05-27 | Paper |
| Flexible Graph Connectivity Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
| Flexible graph connectivity Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
| Beating approximation factor two for weighted tree augmentation with bounded costs ACM Transactions on Algorithms | 2019-03-28 | Paper |
| Firefighting on trees beyond integrality gaps ACM Transactions on Algorithms | 2019-03-28 | Paper |
| Minimizing the number of switch instances on a flexible machine in polynomial time Operations Research Letters | 2018-09-28 | Paper |
| Firefighting on trees beyond integrality gaps Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Robust assignments via ear decompositions and randomized rounding (available as arXiv preprint) | 2017-12-19 | Paper |
| Non-uniform robust network design in planar graphs (available as arXiv preprint) | 2017-08-31 | Paper |
| A Polyhedral Frobenius Theorem with Applications to Integer Optimization SIAM Journal on Discrete Mathematics | 2015-07-31 | Paper |
| Bulk-robust combinatorial optimization Mathematical Programming. Series A. Series B | 2015-02-09 | Paper |
| Labeling schemes for bounded degree graphs Automata, Languages, and Programming | 2014-07-01 | Paper |
| Time-expanded packings Automata, Languages, and Programming | 2014-07-01 | Paper |
| The online replacement path problem Lecture Notes in Computer Science | 2013-09-17 | Paper |
| An \(s\)-\(t\) connection problem with adaptability Discrete Applied Mathematics | 2011-05-17 | Paper |
| Removing redundant quadratic constraints Mathematical Software – ICMS 2010 | 2010-09-14 | Paper |
| Equal-area locus-based convex polygon decomposition Theoretical Computer Science | 2010-04-06 | Paper |
| Equal-Area Locus-Based Convex Polygon Decomposition Structural Information and Communication Complexity | 2008-07-10 | Paper |
Research outcomes over time
This page was built for person: David Adjiashvili
