default search action
Kamyar Khodamoradi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. ICALP 2024: 6:1-6:19 - 2023
- [c12]Joachim Spoerhase
, Kamyar Khodamoradi, Benedikt Riegel, Bruno Ordozgoiti, Aristides Gionis:
A Constant-Factor Approximation Algorithm for Reconciliation k-Median. AISTATS 2023: 1719-1746 - [c11]Fateme Abbasi, Sandip Banerjee
Parameterized Approximation Schemes for Clustering with General Norm Objectives. FOCS 2023: 1377-1399 - [c10]Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase:
Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations. WAOA 2023: 205-218 - [i7]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation Schemes for Clustering with General Norm Objectives. CoRR abs/2304.03146 (2023) - [i6]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces. CoRR abs/2305.07316 (2023) - [i5]Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase:
Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations. CoRR abs/2308.16033 (2023) - 2021
- [c9]Waldo Gálvez
Approximation Algorithms for Demand Strip Packing. APPROX-RANDOM 2021: 20:1-20:24 - [i4]Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi:
Approximation Algorithms for Demand Strip Packing. CoRR abs/2105.08577 (2021)
2010 – 2019
- 2019
- [j2]Zachary Friggstad
Scheduling problems over a network of machines. J. Sched. 22(2): 239-253 (2019) - [j1]Zachary Friggstad, Kamyar Khodamoradi
Approximation Schemes for Clustering with Outliers. ACM Trans. Algorithms 15(2): 26:1-26:26 (2019) - [c8]Zachary Friggstad, Kamyar Khodamoradi
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS. SODA 2019: 2958-2972 - 2018
- [c7]Kamyar Khodamoradi
Consistent Subset Problem with Two Labels. CALDAM 2018: 131-142 - [c6]Zachary Friggstad, Kamyar Khodamoradi
Approximation Schemes for Clustering with Outliers. SODA 2018: 398-414 - [i3]Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour:
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means. CoRR abs/1807.05443 (2018) - 2017
- [c5]Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi
Scheduling Problems over Network of Machines. APPROX-RANDOM 2017: 5:1-5:18 - [i2]Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximation Schemes for Clustering with Outliers. CoRR abs/1707.04295 (2017) - 2016
- [c4]Kamyar Khodamoradi
Prize Collecting Travelling Salesman Problem - Fast Heuristic Separations. ICORES 2016: 380-387 - [i1]Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey, Georgios Stamoulis:
PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions. CoRR abs/1610.00082 (2016) - 2013
- [c3]Kamyar Khodamoradi
PTAS for Ordered Instances of Resource Allocation Problems. FSTTCS 2013: 461-473 - [c2]Petra Berenbrink, Kamyar Khodamoradi
Balls-into-bins with nearly optimal load distribution. SPAA 2013: 326-335
2000 – 2009
- 2008
- [c1]Kamyar Khodamoradi, Jafar Habibi, Ali Kamandi:
Architectural Styles as a Guide for Software Architecture Reconstruction. CSICC 2008: 985-989
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-10-07 21:14 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: