default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRastislav Srámek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j2]Joachim M. Buhmann
, Alexey Gronskiy, Matús Mihalák, Tobias Pröger, Rastislav Srámek, Peter Widmayer:
Robust optimization in the presence of uncertainty: A generic approach. J. Comput. Syst. Sci. 94: 135-166 (2018)- 2016
- [j1]Matús Mihalák, Rastislav Srámek, Peter Widmayer:
Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs. Theory Comput. Syst. 58(1): 45-59 (2016) - [c9]Katerina Böhmová, Yann Disser, Matús Mihalák, Rastislav Srámek:
Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs. LATIN 2016: 220-234 - 2014
- [c8]Barbara Geissmann, Rastislav Srámek:
Finding Robust Minimum Cuts. AAIM 2014: 124-136 - 2013
- [b1]Rastislav Srámek:
Uncertain optimization using approximation sets: An algorithimc perspective. ETH Zurich, Zürich, Switzerland, 2013 - [c7]Katerina Böhmová, Matús Mihalák, Tobias Pröger, Rastislav Srámek, Peter Widmayer:
Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations. ATMOS 2013: 27-41 - [c6]Joachim M. Buhmann, Matús Mihalák, Rastislav Srámek, Peter Widmayer:
Robust optimization in the presence of uncertainty. ITCS 2013: 505-514 - [c5]Matús Mihalák, Rastislav Srámek, Peter Widmayer:
Counting Approximately-Shortest Paths in Directed Acyclic Graphs. WAOA 2013: 156-167 - [i3]Matús Mihalák, Rastislav Srámek:
Counting approximately-shortest paths in directed acyclic graphs. CoRR abs/1304.6707 (2013) - [i2]Barbara Geissmann, Rastislav Srámek:
Counting small cuts in a graph. CoRR abs/1304.7632 (2013) - 2011
- [c4]Matús Mihalák, Marcel Schöngens, Rastislav Srámek, Peter Widmayer:
On the Complexity of the Metric TSP under Stability Considerations. SOFSEM 2011: 382-393
2000 – 2009
- 2009
- [c3]Rastislav Srámek, Bernd Fischer, Elias Vicari, Peter Widmayer:
Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection. COCOON 2009: 287-296 - 2008
- [c2]Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer:
Rendezvous of Mobile Agents When Tokens Fail Anytime. OPODIS 2008: 463-480 - 2007
- [c1]Rastislav Srámek, Brona Brejová, Tomás Vinar:
On-Line Viterbi Algorithm for Analysis of Long Biological Sequences. WABI 2007: 240-251 - [i1]Rastislav Srámek, Brona Brejová, Tomás Vinar:
On-line Viterbi Algorithm and Its Relationship to Random Walks. CoRR abs/0704.0062 (2007)
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-04-24 23:04 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:
