Removing Redundant Quadratic Constraints. - David Adjiashvili; Michel Baes; Philipp Rostalski (ICMS, 2010)

Equal-area locus-based convex polygon decomposition. - David Adjiashvili; David Peleg (Theor. Comput. Sci., 2010)

An s-t connection problem with adaptability. - David Adjiashvili; Rico Zenklusen (Discret. Appl. Math., 2011)

The Online Replacement Path Problem - David Adjiashvili; Marco Senatore (CoRR, 2012)

The Online Replacement Path Problem. - David Adjiashvili; Gianpaolo Oriolo; Marco Senatore (ESA, 2013)

Fault-Tolerant Shortest Paths - Beyond the Uniform Failure Model - David Adjiashvili (CoRR, 2013)

Time-Expanded Packings. - David Adjiashvili; Sandro Bosio; Robert Weismantel; Rico Zenklusen (ICALP (1), 2014)

Labeling Schemes for Bounded Degree Graphs. - David Adjiashvili; Noy Rotbart (ICALP (2), 2014)

Non-Uniform Robust Network Design in Planar Graphs. - David Adjiashvili (APPROX-RANDOM, 2015)

Model-Driven Automatic Tiling with Cache Associativity Lattices. - David Adjiashvili; Utz-Uwe Haus; Adrian Tate (CoRR, 2015)

Bulk-Robust combinatorial optimization. - David Adjiashvili; Sebastian Stiller; Rico Zenklusen (Math. Program., 2015)

Minimizing the number of switch instances on a flexible machine in polynomial time. - David Adjiashvili; Sandro Bosio; Kevin Zemmer (Oper. Res. Lett., 2015)

A Polyhedral Frobenius Theorem with Applications to Integer Optimization. - David Adjiashvili; Timm Oertel; Robert Weismantel (SIAM J. Discret. Math., 2015)

Exact and Approximation Algorithms for Optimal Equipment Selection in Deploying In-Building Distributed Antenna Systems. - David Adjiashvili; Sandro Bosio; Yuan Li 011; Di Yuan 001 (IEEE Trans. Mob. Comput., 2015)

Robust Assignments via Ear Decompositions and Randomized Rounding. - David Adjiashvili; Viktor Bindewald; Dennis Michaels (ICALP, 2016)

Improved Approximation for Weighted Tree Augmentation with Bounded Costs. - David Adjiashvili (CoRR, 2016)

Robust Assignments with Vulnerable Nodes. - David Adjiashvili; Viktor Bindewald; Dennis Michaels (CoRR, 2017)

Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity. - David Adjiashvili; Felix Hommelsheim; Moritz Mühlenthaler (CoRR, 2019)

Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs. - David Adjiashvili (ACM Trans. Algorithms, 2019)

Firefighting on Trees Beyond Integrality Gaps. - David Adjiashvili; Andrea Baggio; Rico Zenklusen (ACM Trans. Algorithms, 2019)

Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults. - David Adjiashvili; Felix Hommelsheim; Moritz Mühlenthaler; Oliver Schaudt (CoRR, 2020)

An Optimization Framework for Power Infrastructure Planning. - Nina Wiedemann; David Adjiashvili (CoRR, 2021)

Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. - David Adjiashvili; Felix Hommelsheim; Moritz Mühlenthaler; Oliver Schaudt (SWAT, 2022)

Flexible Graph Connectivity. - David Adjiashvili; Felix Hommelsheim; Moritz Mühlenthaler (Math. Program., 2022)