default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Adjiashvili
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]David Adjiashvili, Felix Hommelsheim
, Moritz Mühlenthaler:
Flexible Graph Connectivity. Math. Program. 192(1): 409-441 (2022)- [c11]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. SWAT 2022: 5:1-5:19 - 2021
- [i12]Nina Wiedemann, David Adjiashvili:
An Optimization Framework for Power Infrastructure Planning. CoRR abs/2101.03388 (2021) - 2020
- [c10]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler:
Flexible Graph Connectivity. IPCO 2020: 13-26 - [i11]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults. CoRR abs/2009.05382 (2020)
2010 – 2019
- 2019
- [j8]David Adjiashvili:
Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs. ACM Trans. Algorithms 15(2): 19:1-19:26 (2019) - [j7]David Adjiashvili, Andrea Baggio, Rico Zenklusen:
Firefighting on Trees Beyond Integrality Gaps. ACM Trans. Algorithms 15(2): 20:1-20:33 (2019) - [i10]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler:
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity. CoRR abs/1910.13297 (2019) - 2017
- [c9]David Adjiashvili, Andrea Baggio, Rico Zenklusen:
Firefighting on Trees Beyond Integrality Gaps. SODA 2017: 2364-2383 - [c8]David Adjiashvili:
Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs. SODA 2017: 2384-2399 - [i9]David Adjiashvili, Viktor Bindewald, Dennis Michaels:
Robust Assignments with Vulnerable Nodes. CoRR abs/1703.06074 (2017) - 2016
- [c7]David Adjiashvili, Viktor Bindewald, Dennis Michaels:
Robust Assignments via Ear Decompositions and Randomized Rounding. ICALP 2016: 71:1-71:14 - [i8]David Adjiashvili, Andrea Baggio, Rico Zenklusen:
Firefighting on Trees Beyond Integrality Gaps. CoRR abs/1601.00271 (2016) - [i7]David Adjiashvili, Viktor Bindewald, Dennis Michaels:
Robust Assignments via Ear Decompositions and Randomized Rounding. CoRR abs/1607.02437 (2016) - [i6]David Adjiashvili:
Improved Approximation for Weighted Tree Augmentation with Bounded Costs. CoRR abs/1607.03791 (2016) - 2015
- [j6]David Adjiashvili, Sebastian Stiller, Rico Zenklusen:
Bulk-Robust combinatorial optimization. Math. Program. 149(1-2): 361-390 (2015) - [j5]David Adjiashvili, Sandro Bosio, Kevin Zemmer:
Minimizing the number of switch instances on a flexible machine in polynomial time. Oper. Res. Lett. 43(3): 317-322 (2015) - [j4]David Adjiashvili, Timm Oertel, Robert Weismantel:
A Polyhedral Frobenius Theorem with Applications to Integer Optimization. SIAM J. Discret. Math. 29(3): 1287-1302 (2015) - [j3]David Adjiashvili, Sandro Bosio, Yuan Li, Di Yuan:
Exact and Approximation Algorithms for Optimal Equipment Selection in Deploying In-Building Distributed Antenna Systems. IEEE Trans. Mob. Comput. 14(4): 702-713 (2015) - [c6]David Adjiashvili:
Non-Uniform Robust Network Design in Planar Graphs. APPROX-RANDOM 2015: 61-77 - [i5]David Adjiashvili:
Non-Uniform Robust Network Design in Planar Graphs. CoRR abs/1504.05009 (2015) - [i4]David Adjiashvili, Utz-Uwe Haus, Adrian Tate:
Model-Driven Automatic Tiling with Cache Associativity Lattices. CoRR abs/1511.05585 (2015) - 2014
- [c5]David Adjiashvili, Sandro Bosio, Robert Weismantel, Rico Zenklusen:
Time-Expanded Packings. ICALP (1) 2014: 64-76 - [c4]David Adjiashvili, Noy Rotbart:
Labeling Schemes for Bounded Degree Graphs. ICALP (2) 2014: 375-386 - [i3]David Adjiashvili, Noy Rotbart:
Labeling Schemes for Bounded Degree Graphs. CoRR abs/1404.0588 (2014) - 2013
- [c3]David Adjiashvili, Gianpaolo Oriolo, Marco Senatore:
The Online Replacement Path Problem. ESA 2013: 1-12 - [i2]David Adjiashvili:
Fault-Tolerant Shortest Paths - Beyond the Uniform Failure Model. CoRR abs/1301.6299 (2013) - 2012
- [i1]David Adjiashvili, Marco Senatore:
The Online Replacement Path Problem. CoRR abs/1206.5959 (2012) - 2011
- [j2]David Adjiashvili, Rico Zenklusen:
An s-t connection problem with adaptability. Discret. Appl. Math. 159(8): 695-705 (2011) - 2010
- [j1]David Adjiashvili, David Peleg:
Equal-area locus-based convex polygon decomposition. Theor. Comput. Sci. 411(14-15): 1648-1667 (2010) - [c2]David Adjiashvili, Michel Baes, Philipp Rostalski:
Removing Redundant Quadratic Constraints. ICMS 2010: 270-281
2000 – 2009
- 2008
- [c1]David Adjiashvili, David Peleg:
Equal-Area Locus-Based Convex Polygon Decomposition. SIROCCO 2008: 141-155
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
