Monika Steinová

19 papers A* 1A 1B 3C 2Journal 7Unranked 3
YearRankTypeTitle / Venue / Authors
2019 J jnl
Teaching Recursion and Dynamic Programming Before College.
Bull. EATCS
Michal Anderle, Michal Forisek, Monika Steinová
2015 J jnl
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.
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2014 J jnl
Improved approximations for ordered TSP on near-metric graphs.
RAIRO Theor. Informatics Appl.
Hans-Joachim Böckenhauer, Monika Steinová
2014 — conf
On the Clique Editing Problem.
MFCS (2)
Ivan Kovác, Ivana Selecéniová, Monika Steinová
2013 — book
Explaining Algorithms Using Metaphors.
Michal Forisek, Monika Steinová
2013 B conf
Improved Approximations for Ordered TSP on Near-Metric Graphs, .
SOFSEM
Hans-Joachim Böckenhauer, Monika Steinová
2013 J jnl
Improved approximations for TSP with simple precedence constraints.
J. Discrete Algorithms
Hans-Joachim Böckenhauer, Tobias Mömke, Monika Steinová
2012 C conf
Advice Complexity of Online Coloring for Paths.
LATA
Michal Forisek, Lucia Keller, Monika Steinová
2012 — —
Measuring hardness of complex problems: Approximability and exact algorithms.
Monika Steinová
2012 A conf
Metaphors and analogies for teaching algorithms.
SIGCSE
Michal Forisek, Monika Steinová
2012 J jnl
On the approximability and hardness of minimum topic connected overlay and its special instances.
Theor. Comput. Sci.
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2011 J jnl
On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances
CoRR
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2011 B conf
On the Approximability of Minimum Topic Connected Overlay and Its Special Instances.
MFCS
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2011 A* conf
On the hardness and approximation of minimum topic-connected overlay.
PODC
Monika Steinová
2010 — conf
Didactic Games for Teaching Information Theory.
ISSEP
Michal Forisek, Monika Steinová
2010 C conf
Improved Approximations for TSP with Simple Precedence Constraints.
CIAC
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová
2010 — conf
Programming Camps: Letting Children Discover the Computer Science.
ISSEP
Monika Steinová, Juliana Sisková
2010 J jnl
The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification.
RAIRO Theor. Informatics Appl.
Hans-Joachim Böckenhauer, Michal Forisek, Ján Oravec, Björn Steffen, Kathleen Steinhöfel, Monika Steinová
2008 B conf
On the Power of Local Orientations.
SIROCCO
Monika Steinová