default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMonika Steinová
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j6]Michal Anderle, Michal Forisek, Monika Steinová:
Teaching Recursion and Dynamic Programming Before College. Bull. EATCS 129 (2019)- 2015
- [j5]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono
, Monika Steinová, Koichi Wada:
Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]. Theor. Comput. Sci. 562: 660-661 (2015) - 2014
- [j4]Hans-Joachim Böckenhauer, Monika Steinová:
Improved approximations for ordered TSP on near-metric graphs. RAIRO Theor. Informatics Appl. 48(5): 479-494 (2014) - [c10]Ivan Kovác, Ivana Selecéniová, Monika Steinová:
On the Clique Editing Problem. MFCS (2) 2014: 469-480 - 2013
- [b2]Michal Forisek, Monika Steinová:
Explaining Algorithms Using Metaphors. Springer Briefs in Computer Science, Springer 2013, ISBN 978-1-4471-5018-3, pp. i-x, 1-94 - [j3]Hans-Joachim Böckenhauer, Tobias Mömke, Monika Steinová:
Improved approximations for TSP with simple precedence constraints. J. Discrete Algorithms 21: 32-40 (2013) - [c9]Hans-Joachim Böckenhauer, Monika Steinová:
Improved Approximations for Ordered TSP on Near-Metric Graphs, . SOFSEM 2013: 157-168 - 2012
- [b1]Monika Steinová:
Measuring hardness of complex problems: Approximability and exact algorithms. ETH Zurich, Zürich, Switzerland, 2012 - [j2]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
On the approximability and hardness of minimum topic connected overlay and its special instances. Theor. Comput. Sci. 429: 144-154 (2012) - [c8]Michal Forisek, Lucia Keller, Monika Steinová:
Advice Complexity of Online Coloring for Paths. LATA 2012: 228-239 - [c7]Michal Forisek, Monika Steinová:
Metaphors and analogies for teaching algorithms. SIGCSE 2012: 15-20 - 2011
- [c6]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. MFCS 2011: 376-387 - [c5]Monika Steinová:
On the hardness and approximation of minimum topic-connected overlay. PODC 2011: 295-296 - [i1]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances. CoRR abs/1107.2443 (2011) - 2010
- [j1]Hans-Joachim Böckenhauer, Michal Forisek, Ján Oravec, Björn Steffen, Kathleen Steinhöfel, Monika Steinová:
The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification. RAIRO Theor. Informatics Appl. 44(3): 363-377 (2010) - [c4]Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová:
Improved Approximations for TSP with Simple Precedence Constraints. CIAC 2010: 61-72 - [c3]Michal Forisek, Monika Steinová:
Didactic Games for Teaching Information Theory. ISSEP 2010: 86-99 - [c2]Monika Steinová, Juliana Sisková:
Programming Camps: Letting Children Discover the Computer Science. ISSEP 2010: 170-181
2000 – 2009
- 2008
- [c1]Monika Steinová:
On the Power of Local Orientations. SIROCCO 2008: 156-169
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:18 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:
