default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristos Kalaitzis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c7]Fabrizio Grandoni
, Christos Kalaitzis, Rico Zenklusen:
Improved approximation for tree augmentation: saving by rewiring. STOC 2018: 632-645- [i6]Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen:
Improved Approximation for Tree Augmentation: Saving by Rewiring. CoRR abs/1804.02242 (2018) - 2017
- [b1]Christos Kalaitzis:
Applications of Strong Convex Relaxations to Allocation Problems. EPFL, Switzerland, 2017 - [j4]Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson:
Combinatorial Algorithm for Restricted Max-Min Fair Allocation. ACM Trans. Algorithms 13(3): 37:1-37:28 (2017) - [c6]Christos Kalaitzis, Ola Svensson, Jakub Tarnawski:
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. SODA 2017: 2654-2669 - 2016
- [j3]Ioannis Caragiannis, Christos Kalaitzis:
Space lower bounds for low-stretch greedy embeddings. Theor. Comput. Sci. 610: 149-157 (2016) - [c5]Christos Kalaitzis:
An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem. SODA 2016: 1048-1066 - [i5]Christos Kalaitzis, Ola Svensson, Jakub Tarnawski:
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. CoRR abs/1607.07631 (2016) - 2015
- [j2]John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis:
Enforcing Efficient Equilibria in Network Design Games via Subsidies. Algorithmica 72(1): 44-82 (2015) - [j1]Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukás Polácek, Ola Svensson:
On the configuration LP for maximum budgeted allocation. Math. Program. 154(1-2): 427-462 (2015) - [c4]Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson:
Combinatorial Algorithm for Restricted Max-Min Fair Allocation. SODA 2015: 1357-1372 - [i4]Christos Kalaitzis:
An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem. CoRR abs/1511.09293 (2015) - 2014
- [c3]Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson:
On the Configuration LP for Maximum Budgeted Allocation. IPCO 2014: 333-344 - [i3]Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson:
On the Configuration LP for Maximum Budgeted Allocation. CoRR abs/1403.7519 (2014) - [i2]Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson:
Combinatorial Algorithm for Restricted Max-Min Fair Allocation. CoRR abs/1409.0607 (2014) - 2012
- [c2]Ioannis Caragiannis, Christos Kalaitzis:
Space Lower Bounds for Low-Stretch Greedy Embeddings. SIROCCO 2012: 1-12 - [c1]John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis:
Enforcing efficient equilibria in network design games via subsidies. SPAA 2012: 277-286 - 2011
- [i1]John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis:
Enforcing efficient equilibria in network design games via subsidies. CoRR abs/1104.4423 (2011)
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 2024-04-25 05:44 CEST 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:
