default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBugra Çaskurlu
Person information
- unicode name: Buğra Çaşkurlu
- affiliation: TOBB University of Economics and Technology, Department of Computer Engineering, Ankara, Turkey
- affiliation (PhD): Rensselaer Polytechnic Institute (RPI), Troy, NY, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Bugra Çaskurlu
, Fatih Erdem Kizilkaya:
On hedonic games with common ranking property. Ann. Math. Artif. Intell. 92(3): 581-599 (2024)- [j14]Bugra Çaskurlu, Fatih Erdem Kizilkaya, Berkehan Ozen:
Hedonic Expertise Games. Ann. Math. Artif. Intell. 92(3): 671-690 (2024) - [j13]Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Bugra Çaskurlu:
Priority-based bin packing with subset constraints. Discret. Appl. Math. 342: 64-75 (2024) - [c18]Utku Umur Acikalin, Bugra Çaskurlu, Osman Abul:
Solving Secluded Path Problem by Heuristics and Local Search. AICCONF 2024: 95-99 - 2023
- [j12]Utku Umur Acikalin, Bugra Çaskurlu, K. Subramani:
Security-Aware Database Migration Planning. Constraints An Int. J. 28(3): 472-505 (2023) - 2022
- [j11]Bugra Çaskurlu, Utku Umur Acikalin, Fatih Erdem Kizilkaya, Özgün Ekici:
On approximate Nash equilibria of the two-source connection game. Turkish J. Electr. Eng. Comput. Sci. 30(6): 2206-2220 (2022) - [j10]Bugra Çaskurlu, Özgün Ekici, Fatih Erdem Kizilkaya:
On existence of equilibrium under social coalition structures. Math. Struct. Comput. Sci. 32(2): 216-239 (2022) - [c17]Utku Umur Acikalin, Bugra Çaskurlu:
Multilevel memetic hypergraph partitioning with greedy recombination. GECCO Companion 2022: 168-171 - [c16]Bugra Çaskurlu, Fatih Erdem Kizilkaya, Berkehan Ozen:
Hedonic Expertise Games. ISAIM 2022 - [i6]Utku Umur Acikalin, Bugra Çaskurlu:
Multilevel Memetic Hypergraph Partitioning with Greedy Recombination. CoRR abs/2204.03730 (2022) - [i5]Bugra Çaskurlu, Fatih Erdem Kizilkaya:
On Hedonic Games with Common Ranking Property. CoRR abs/2205.11939 (2022) - 2021
- [c15]Utku Umur Acikalin, Bugra Çaskurlu, Piotr Wojciechowski, K. Subramani:
New Results on Test-Cost Minimization in Database Migration. ALGOCLOUD 2021: 38-55 - [c14]Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Bugra Çaskurlu:
Algorithmic Analysis of Priority-Based Bin Packing. CALDAM 2021: 359-372 - [c13]Bugra Çaskurlu, Özgün Ekici, Fatih Erdem Kizilkaya:
On Singleton Congestion Games with Resilience Against Collusion. COCOON 2021: 37-48 - [c12]Bugra Çaskurlu, Fatih Erdem Kizilkaya, Berkehan Ozen:
Hedonic Expertise Games. SAGT 2021: 314-328 - 2020
- [j9]Bugra Çaskurlu, Özgün Ekici, Fatih Erdem Kizilkaya:
On efficient computation of equilibrium under social coalition structures. Turkish J. Electr. Eng. Comput. Sci. 28(3): 1686-1698 (2020) - [c11]Bugra Çaskurlu, Özgün Ekici, Fatih Erdem Kizilkaya:
On Existence of Equilibrium Under Social Coalition Structures. TAMC 2020: 263-274 - [i4]Bugra Çaskurlu, Fatih Erdem Kizilkaya, Berkehan Ozen:
Hedonic Expertise Games. CoRR abs/2011.01778 (2020) - [i3]Bugra Çaskurlu, Özgün Ekici, Fatih Erdem Kizilkaya:
On Singleton Congestion Games with Resilience Against Collusion. CoRR abs/2011.01791 (2020)
2010 – 2019
- 2019
- [c10]K. Subramani, Bugra Çaskurlu, Utku Umur Acikalin:
Security-Aware Database Migration Planning. ALGOCLOUD 2019: 103-121 - [c9]Bugra Çaskurlu, Fatih Erdem Kizilkaya:
On Hedonic Games with Common Ranking Property. CIAC 2019: 137-148 - [i2]Bugra Çaskurlu, Özgün Ekici, Fatih Erdem Kizilkaya:
On Existence of Equilibrium Under Social Coalition Structures. CoRR abs/1910.04648 (2019) - 2018
- [j8]Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan:
On approximating optimal weight "no"-certificates in weighted difference constraint systems. J. Comb. Optim. 36(2): 329-345 (2018) - [c8]K. Subramani, Bugra Çaskurlu, Alvaro Velasquez:
Minimization of Testing Costs in Capacity-Constrained Database Migration. ALGOCLOUD 2018: 1-12 - [c7]Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan, Piotr Wojciechowski:
A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems. CALDAM 2018: 45-58 - 2017
- [j7]Bugra Çaskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani:
Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs. SIAM J. Discret. Math. 31(3): 2172-2184 (2017) - 2014
- [j6]Elliot Anshelevich, Bugra Çaskurlu, Koushik Kar, Hang Zhang:
Capacity Allocation Games for Network-Coded Multicast Streaming. IEEE/ACM Trans. Netw. 22(2): 595-607 (2014) - [c6]Bugra Çaskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani:
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs. IFIP TCS 2014: 13-26 - 2013
- [j5]Bugra Çaskurlu, Ashish Gehani, Cemal Çagatay Bilgin, K. Subramani:
Analytical models for risk-based intrusion response. Comput. Networks 57(10): 2181-2192 (2013) - [j4]Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Strategic Multiway Cut and Multicut Games. Theory Comput. Syst. 52(2): 200-220 (2013) - [j3]Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Partition Equilibrium Always Exists in Resource Selection Games. Theory Comput. Syst. 53(1): 73-85 (2013) - [i1]Bugra Çaskurlu, K. Subramani:
On Partial Vertex Cover on Bipartite Graphs and Trees. CoRR abs/1304.5934 (2013) - 2011
- [j2]Elliot Anshelevich, Bugra Çaskurlu:
Price of Stability in Survivable Network Design. Theory Comput. Syst. 49(1): 98-138 (2011) - [j1]Elliot Anshelevich, Bugra Çaskurlu:
Exact and approximate equilibria for optimal group network formation. Theor. Comput. Sci. 412(39): 5298-5314 (2011) - [c5]Elliot Anshelevich, Bugra Çaskurlu, Koushik Kar, Hang Zhang:
Capacity Allocation Games for Network-Coded Multicast Streaming. GAMENETS 2011: 658-673 - 2010
- [b1]Bugra Çaskurlu:
Exact and approximate equilibria for network formation and cut games. Rensselaer Polytechnic Institute, USA, 2010 - [c4]Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Partition Equilibrium Always Exists in Resource Selection Games. SAGT 2010: 42-53 - [c3]Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Strategic Multiway Cut and Multicut Games. WAOA 2010: 1-12
2000 – 2009
- 2009
- [c2]Elliot Anshelevich, Bugra Çaskurlu:
Exact and Approximate Equilibria for Optimal Group Network Formation. ESA 2009: 239-250 - [c1]Elliot Anshelevich, Bugra Çaskurlu:
Price of Stability in Survivable Network Design. SAGT 2009: 208-219
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-08-05 20:24 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:
