![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
George Rabanca
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j3]Amotz Bar-Noy, David Peleg, George Rabanca, Ivo Vigan:
Improved approximation algorithms for weighted 2-path partitions. Discret. Appl. Math. 239: 15-37 (2018) - [j2]Eden Chlamtác, Michael Dinitz
, Christian Konrad, Guy Kortsarz, George Rabanca:
The Densest k-Subhypergraph Problem. SIAM J. Discret. Math. 32(2): 1458-1477 (2018) - 2017
- [b1]George Rabanca:
Approximation Algorithms for Effective Team Formation. City University of New York, USA, 2017 - 2016
- [j1]Yanting Wu, Bhaskar Krishnamachari, George Rabanca, Amotz Bar-Noy:
Efficient Mechanism Design for Competitive Carrier Selection and Rate Allocation. IEEE Trans. Veh. Technol. 65(12): 10222-10226 (2016) - [c8]Eden Chlamtác, Michael Dinitz
, Christian Konrad, Guy Kortsarz, George Rabanca:
The Densest k-Subhypergraph Problem. APPROX-RANDOM 2016: 6:1-6:19 - [c7]Amotz Bar-Noy, George Rabanca:
Tight Approximation Bounds for the Seminar Assignment Problem. WAOA 2016: 170-182 - [i4]Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca:
The Densest k-Subhypergraph Problem. CoRR abs/1605.04284 (2016) - [i3]Amotz Bar-Noy, George Rabanca:
Tight Approximation Bounds for the Seminar Assignment Problem. CoRR abs/1610.04785 (2016) - 2015
- [c6]Ben Baumer
, George Rabanca, Amotz Bar-Noy, Prithwish Basu:
Star Search: Effective Subgroups in Collaborative Social Networks. ASONAM 2015: 729-736 - [c5]Amotz Bar-Noy, David Peleg, George Rabanca, Ivo Vigan:
Improved Approximation Algorithms for Weighted 2-Path Partitions. ESA 2015: 953-964 - 2014
- [c4]Matthew P. Johnson, Ou Liu, George Rabanca:
Secluded Path via Shortest Path. SIROCCO 2014: 108-120 - [i2]George Rabanca, Ivo Vigan:
Covering the Boundary of a Simple Polygon with Geodesic Unit Disks. CoRR abs/1407.0614 (2014) - 2012
- [c3]Yanting Wu, George Rabanca, Bhaskar Krishnamachari, Amotz Bar-Noy:
A Competitive Rate Allocation Game. GAMENETS 2012: 16-30 - [c2]Amotz Bar-Noy, Yi Gai, Matthew P. Johnson, Bhaskar Krishnamachari, George Rabanca:
Funding Games: The Truth but Not the Whole Truth. WINE 2012: 128-141 - 2011
- [i1]Amotz Bar-Noy, Yi Gai, Matthew P. Johnson, Bhaskar Krishnamachari, George Rabanca:
Knapsack Games and the Truth but not the Whole Truth. CoRR abs/1107.2432 (2011) - 2010
- [c1]Elizabeth Sklar, Simon Parsons, Susan L. Epstein, Arif Tuna Ozgelen, George Rabanca, Sam Anzaroot, Joel Gonzalez, Jesse Lopez, Mitch Lustig, Linda Ma, Mark Manashirov, Juan Pablo Muñoz, S. Bruno Salazar, Miriam Schwartz:
Developing a Framework for Team-Based Robotics Research. Enabling Intelligence through Middleware 2010
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint