default search action
Gábor Rudolf
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j16]Nilay Noyan
, Gábor Rudolf, Miguel A. Lejeune
Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics. INFORMS J. Comput. 34(2): 729-751 (2022) - 2020
- [j15]Noam Goldberg, Gábor Rudolf:
On the complexity and approximation of the maximum expected value all-or-nothing subset. Discret. Appl. Math. 283: 1-10 (2020)
2010 – 2019
- 2018
- [j14]Nilay Noyan
Optimization with Stochastic Preferences Based on a General Class of Scalarization Functions. Oper. Res. 66(2): 463-486 (2018) - 2017
- [i1]Noam Goldberg, Gábor Rudolf:
On the Complexity and Approximation of the Maximum Expected Value All-or-Nothing Subset. CoRR abs/1706.07406 (2017) - 2015
- [j13]Nilay Noyan
Kusuoka representations of coherent risk measures in general probability spaces. Ann. Oper. Res. 229(1): 591-605 (2015) - 2014
- [j12]Andrey Gol'berg, Vladimir Gurvich, Diogo Vieira Andrade, Konrad Borys, Gábor Rudolf:
Combinatorial games modeling seki in GO. Discret. Math. 329: 19-32 (2014) - [j11]Gábor Rudolf, Nilay Noyan
Modeling sequence scrambling and related phenomena in mixed-model production lines. Eur. J. Oper. Res. 237(1): 177-195 (2014) - 2013
- [j10]Edwin J. C. G. van den Oord, József Bukszár, Gábor Rudolf, Srilaxmi Nerella, Joseph L. McClay
Estimation of CpG coverage in whole methylome next-generation sequencing studies. BMC Bioinform. 14: 50 (2013) - [j9]Nilay Noyan
Optimization with Multivariate Conditional Value-at-Risk Constraints. Oper. Res. 61(4): 990-1013 (2013) - 2011
- [j8]Martin Milanic
Complexity results for equistable graphs and related classes. Ann. Oper. Res. 188(1): 359-370 (2011) - [j7]Gábor Rudolf, Nilay Noyan
Bilinear optimality constraints for the cone of positive polynomials. Math. Program. 129(1): 5-31 (2011)
2000 – 2009
- 2008
- [j6]Endre Boros
Generating 3-vertex connected spanning subgraphs. Discret. Math. 308(24): 6285-6297 (2008) - [j5]Farid Alizadeh, Jonathan Eckstein
Arrival Rate Approximation by Nonnegative Cubic Splines. Oper. Res. 56(1): 140-156 (2008) - [j4]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction. Theory Comput. Syst. 43(2): 204-233 (2008) - [j3]Gábor Rudolf, Andrzej Ruszczynski:
Optimization Problems with Second Order Stochastic Dominance Constraints: Duality, Compact Formulations, and Cut Generation Methods. SIAM J. Optim. 19(3): 1326-1343 (2008) - 2007
- [j2]Vadim V. Lozin, Gábor Rudolf:
Minimal Universal Bipartite Graphs. Ars Comb. 84 (2007) - [c1]Endre Boros, Konrad Borys, Khaled M. Elbassioni
Generating Minimal k-Vertex Connected Spanning Subgraphs. COCOON 2007: 222-231 - 2006
- [j1]Nilay Noyan
Relaxations of linear programming problems with first order stochastic dominance constraints. Oper. Res. Lett. 34(6): 653-659 (2006)
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-05-08 20:58 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: