David Adjiashvili

32 papers A* 3A 1B 2Journal 21Unranked 5

Year	Rank	Type	Title / Venue / Authors
2022	—	`conf`	Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. SWAT David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2022	J	`jnl`	Flexible Graph Connectivity. Math. Program. David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
2021	J	`jnl`	An Optimization Framework for Power Infrastructure Planning. CoRR Nina Wiedemann, David Adjiashvili
2020	J	`jnl`	Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults. CoRR David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2020	B	`conf`	Flexible Graph Connectivity. IPCO David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
2019	J	`jnl`	Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs. ACM Trans. Algorithms David Adjiashvili
2019	J	`jnl`	Firefighting on Trees Beyond Integrality Gaps. ACM Trans. Algorithms David Adjiashvili, Andrea Baggio, Rico Zenklusen
2019	J	`jnl`	Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity. CoRR David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
2017	A*	`conf`	Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs. SODA David Adjiashvili
2017	A*	`conf`	Firefighting on Trees Beyond Integrality Gaps. SODA David Adjiashvili, Andrea Baggio, Rico Zenklusen
2017	J	`jnl`	Robust Assignments with Vulnerable Nodes. CoRR David Adjiashvili, Viktor Bindewald, Dennis Michaels
2016	J	`jnl`	Firefighting on Trees Beyond Integrality Gaps. CoRR David Adjiashvili, Andrea Baggio, Rico Zenklusen
2016	J	`jnl`	Improved Approximation for Weighted Tree Augmentation with Bounded Costs. CoRR David Adjiashvili
2016	A*	`conf`	Robust Assignments via Ear Decompositions and Randomized Rounding. ICALP David Adjiashvili, Viktor Bindewald, Dennis Michaels
2016	J	`jnl`	Robust Assignments via Ear Decompositions and Randomized Rounding. CoRR David Adjiashvili, Viktor Bindewald, Dennis Michaels
2015	J	`jnl`	A Polyhedral Frobenius Theorem with Applications to Integer Optimization. SIAM J. Discret. Math. David Adjiashvili, Timm Oertel, Robert Weismantel
2015	J	`jnl`	Bulk-Robust combinatorial optimization. Math. Program. David Adjiashvili, Sebastian Stiller, Rico Zenklusen
2015	J	`jnl`	Exact and Approximation Algorithms for Optimal Equipment Selection in Deploying In-Building Distributed Antenna Systems. IEEE Trans. Mob. Comput. David Adjiashvili, Sandro Bosio, Yuan Li, Di Yuan
2015	J	`jnl`	Minimizing the number of switch instances on a flexible machine in polynomial time. Oper. Res. Lett. David Adjiashvili, Sandro Bosio, Kevin Zemmer
2015	J	`jnl`	Model-Driven Automatic Tiling with Cache Associativity Lattices. CoRR David Adjiashvili, Utz-Uwe Haus, Adrian Tate
2015	—	`conf`	Non-Uniform Robust Network Design in Planar Graphs. APPROX-RANDOM David Adjiashvili
2015	J	`jnl`	Non-Uniform Robust Network Design in Planar Graphs. CoRR David Adjiashvili
2014	—	`conf`	Labeling Schemes for Bounded Degree Graphs. ICALP (2) David Adjiashvili, Noy Rotbart
2014	J	`jnl`	Labeling Schemes for Bounded Degree Graphs. CoRR David Adjiashvili, Noy Rotbart
2014	—	`conf`	Time-Expanded Packings. ICALP (1) David Adjiashvili, Sandro Bosio, Robert Weismantel, Rico Zenklusen
2013	J	`jnl`	Fault-Tolerant Shortest Paths - Beyond the Uniform Failure Model CoRR David Adjiashvili
2013	A	`conf`	The Online Replacement Path Problem. ESA David Adjiashvili, Gianpaolo Oriolo, Marco Senatore
2012	J	`jnl`	The Online Replacement Path Problem CoRR David Adjiashvili, Marco Senatore
2011	J	`jnl`	An s-t connection problem with adaptability. Discret. Appl. Math. David Adjiashvili, Rico Zenklusen
2010	J	`jnl`	Equal-area locus-based convex polygon decomposition. Theor. Comput. Sci. David Adjiashvili, David Peleg
2010	—	`conf`	Removing Redundant Quadratic Constraints. ICMS David Adjiashvili, Michel Baes, Philipp Rostalski
2008	B	`conf`	Equal-Area Locus-Based Convex Polygon Decomposition. SIROCCO David Adjiashvili, David Peleg