default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSelin Damla Ahipasaoglu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Elnaz Shafipour, Sebastian Stein, Selin Damla Ahipasaoglu:
Personalised electric vehicle charging stop planning through online estimators. Auton. Agents Multi Agent Syst. 38(2): 45 (2024)- 2023
- [j16]Mingzhi Gao, Selin Damla Ahipasaoglu
, Kristin Schuster:
Automated poetry scoring using BERT with multi-scale poetry representation. Int. J. Intell. Syst. Technol. Appl. 21(3): 250-261 (2023) - [c4]Elnaz Shafipour, Sebastian Stein, Selin Damla Ahipasaoglu:
Personalised Electric Vehicle Routing Using Online Estimators. ECAI Workshops (2) 2023: 238-245 - 2022
- [j15]Divya Padmanabhan, Selin Damla Ahipasaoglu, Arjun Kodagehalli Ramachandra, Karthik Natarajan:
Extremal Probability Bounds in Combinatorial Optimization. SIAM J. Optim. 32(4): 2828-2858 (2022) - 2021
- [j14]Selin Damla Ahipasaoglu:
A branch-and-bound algorithm for the exact optimal experimental design problem. Stat. Comput. 31(5): 65 (2021)
2010 – 2019
- 2019
- [j13]Selin Damla Ahipasaoglu, Karthik Natarajan, Dongjian Shi:
Distributionally robust project crashing with partial or no correlation information. Networks 74(1): 79-106 (2019) - [j12]Selin Damla Ahipasaoglu, Xiaobo Li, Karthik Natarajan:
A Convex Optimization Approach for Computing Correlated Choice Probabilities With Many Alternatives. IEEE Trans. Autom. Control. 64(1): 190-205 (2019) - [j11]Selin Damla Ahipasaoglu, Ugur Arikan, Karthik Natarajan:
Distributionally Robust Markovian Traffic Equilibrium. Transp. Sci. 53(6): 1546-1562 (2019) - 2018
- [j10]Gülsah Karakaya, Murat Köksalan, Selin Damla Ahipasaoglu:
Interactive algorithms for a broad underlying family of preference functions. Eur. J. Oper. Res. 265(1): 248-262 (2018) - [j9]Bo Chai, Alberto Costa, Selin Damla Ahipasaoglu, Chau Yuen, Zaiyue Yang:
Optimal Meeting Scheduling in Smart Commercial Building for Energy Cost Reduction. IEEE Trans. Smart Grid 9(4): 3060-3069 (2018) - [j8]Tao Wang, Yunjian Xu, Chathura Withanage, Lan Lan, Selin Damla Ahipasaoglu, Costas Courcoubetis:
A Fair and Budget-Balanced Incentive Mechanism for Energy Management in Buildings. IEEE Trans. Smart Grid 9(4): 3143-3153 (2018) - 2017
- [j7]Tao Wang, Yunjian Xu, Selin Damla Ahipasaoglu, Costas Courcoubetis:
Ex-Post Max-Min Fairness of Generalized AGV Mechanisms. IEEE Trans. Autom. Control. 62(10): 5275-5281 (2017) - 2016
- [j6]Gülsah Karakaya, Stefano Galelli, Selin Damla Ahipasaoglu, Riccardo Taormina:
Identifying (Quasi) Equally Informative Subsets in Feature Selection Problems for Classification: A Max-Relevance Min-Redundancy Approach. IEEE Trans. Cybern. 46(6): 1424-1437 (2016) - 2015
- [j5]Selin Damla Ahipasaoglu:
Fast algorithms for the minimum volume estimator. J. Glob. Optim. 62(2): 351-370 (2015) - [j4]Selin Damla Ahipasaoglu:
A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach. Stat. Comput. 25(6): 1113-1127 (2015) - [c3]Tao Wang, Yunjian Xu, Selin Damla Ahipasaoglu, Costas Courcoubetis:
Max-min fairness of generalized AGV mechanisms. CDC 2015: 5170-5177 - 2014
- [c2]Bo Chai, Alberto Costa, Selin Damla Ahipasaoglu, Shisheng Huang, Chau Yuen, Zaiyue Yang:
Minimizing commercial building cost in Smart Grid: An optimal meeting scheduling approach. SmartGridComm 2014: 764-769 - 2013
- [j3]Selin Damla Ahipasaoglu, Michael J. Todd:
A modified Frank-Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: Theory and algorithms. Comput. Geom. 46(5): 494-519 (2013) - [c1]Flora S. Tsai, Karthik Natarajan, Selin Damla Ahipasaoglu, Chau Yuen, Hyowon Lee, Ngai-Man Cheung, Justin Ruths, Shisheng Huang, Thomas L. Magnanti:
From Boxes to bees: Active learning in freshmen calculus. EDUCON 2013: 59-68 - [i3]Martin Takác, Selin Damla Ahipasaoglu, Ngai-Man Cheung, Peter Richtárik:
TOP-SPIN: TOPic discovery via Sparse Principal component INterference. CoRR abs/1311.1406 (2013) - 2012
- [i2]Peter Richtárik, Martin Takác, Selin Damla Ahipasaoglu:
Alternating Maximization: Unifying Framework for 8 Sparse PCA Formulations and Efficient Parallel Codes. CoRR abs/1212.4137 (2012) - 2010
- [i1]Francis R. Bach, Selin Damla Ahipasaoglu, Alexandre d'Aspremont:
Convex Relaxations for Subset Selection. CoRR abs/1006.3601 (2010)
2000 – 2009
- 2008
- [j2]Selin Damla Ahipasaoglu, Peng Sun, Michael J. Todd:
Linear convergence of a modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoids. Optim. Methods Softw. 23(1): 5-19 (2008) - [j1]Selin Damla Ahipasaoglu, E. Alper Yildirim:
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem. SIAM J. Optim. 19(3): 1392-1396 (2008)
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-12-10 21:47 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:
