David Adjiashvili

According to our database, David Adjiashvili authored at least 24 papers between 2010 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Flexible Graph Connectivity.

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler

Math. Program., 2022

Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults.

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2021

An Optimization Framework for Power Infrastructure Planning.

Nina Wiedemann, David Adjiashvili

CoRR, 2021

2020

Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults.

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt

CoRR, 2020

2019

Firefighting on Trees Beyond Integrality Gaps.

David Adjiashvili, Andrea Baggio, Rico Zenklusen

ACM Trans. Algorithms, 2019

Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs.

David Adjiashvili

ACM Trans. Algorithms, 2019

Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity.

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler

CoRR, 2019

2017

Robust Assignments with Vulnerable Nodes.

David Adjiashvili, Viktor Bindewald, Dennis Michaels

CoRR, 2017

2016

Improved Approximation for Weighted Tree Augmentation with Bounded Costs.

David Adjiashvili

CoRR, 2016

Robust Assignments via Ear Decompositions and Randomized Rounding.

David Adjiashvili, Viktor Bindewald, Dennis Michaels

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Exact and Approximation Algorithms for Optimal Equipment Selection in Deploying In-Building Distributed Antenna Systems.

David Adjiashvili, Sandro Bosio, Yuan Li, Di Yuan

IEEE Trans. Mob. Comput., 2015

A Polyhedral Frobenius Theorem with Applications to Integer Optimization.

David Adjiashvili, Timm Oertel, Robert Weismantel

SIAM J. Discret. Math., 2015

Minimizing the number of switch instances on a flexible machine in polynomial time.

David Adjiashvili, Sandro Bosio, Kevin Zemmer

Oper. Res. Lett., 2015

Bulk-Robust combinatorial optimization.

David Adjiashvili, Sebastian Stiller, Rico Zenklusen

Math. Program., 2015

Model-Driven Automatic Tiling with Cache Associativity Lattices.

David Adjiashvili, Utz-Uwe Haus, Adrian Tate

CoRR, 2015

Non-Uniform Robust Network Design in Planar Graphs.

David Adjiashvili

Proceedings of the Approximation, 2015

2014

Labeling Schemes for Bounded Degree Graphs.

David Adjiashvili, Noy Rotbart

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Time-Expanded Packings.

David Adjiashvili, Sandro Bosio, Robert Weismantel, Rico Zenklusen

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Fault-Tolerant Shortest Paths - Beyond the Uniform Failure Model

David Adjiashvili

CoRR, 2013

The Online Replacement Path Problem.

David Adjiashvili, Gianpaolo Oriolo, Marco Senatore

Proceedings of the Algorithms - ESA 2013, 2013

2012

The Online Replacement Path Problem

David Adjiashvili, Marco Senatore

CoRR, 2012

2011

An s-t connection problem with adaptability.

David Adjiashvili, Rico Zenklusen

Discret. Appl. Math., 2011

2010

Equal-area locus-based convex polygon decomposition.

David Adjiashvili, David Peleg

Theor. Comput. Sci., 2010

Removing Redundant Quadratic Constraints.

David Adjiashvili, Michel Baes, Philipp Rostalski

Proceedings of the Mathematical Software, 2010