Monika Steinová

According to our database, Monika Steinová authored at least 17 papers between 2008 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2019

Teaching Recursion and Dynamic Programming Before College.

Michal Anderle, Michal Forisek, Monika Steinová

Bull. EATCS, 2019

2015

Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154].

Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada

Theor. Comput. Sci., 2015

2014

Improved approximations for ordered TSP on near-metric graphs.

Hans-Joachim Böckenhauer, Monika Steinová

RAIRO Theor. Informatics Appl., 2014

On the Clique Editing Problem.

Ivan Kovác, Ivana Selecéniová, Monika Steinová

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Explaining Algorithms Using Metaphors.

Michal Forisek, Monika Steinová

Springer Briefs in Computer Science, Springer, ISBN: 978-1-4471-5019-0, 2013

Improved approximations for TSP with simple precedence constraints.

Hans-Joachim Böckenhauer, Tobias Mömke, Monika Steinová

J. Discrete Algorithms, 2013

2012

Measuring hardness of complex problems: Approximability and exact algorithms.

Monika Steinová

PhD thesis, 2012

On the approximability and hardness of minimum topic connected overlay and its special instances.

Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada

Theor. Comput. Sci., 2012

Metaphors and analogies for teaching algorithms.

Michal Forisek, Monika Steinová

Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

Advice Complexity of Online Coloring for Paths.

Michal Forisek, Lucia Keller, Monika Steinová

Proceedings of the Language and Automata Theory and Applications, 2012

2011

On the hardness and approximation of minimum topic-connected overlay.

Monika Steinová

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

On the Approximability of Minimum Topic Connected Overlay and Its Special Instances.

Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010

The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification.

Hans-Joachim Böckenhauer, Michal Forisek, Ján Oravec, Björn Steffen, Kathleen Steinhöfel, Monika Steinová

RAIRO Theor. Informatics Appl., 2010

Programming Camps: Letting Children Discover the Computer Science.

Monika Steinová, Juliana Sisková

Proceedings of the Teaching Fundamentals Concepts of Informatics, 4th International Conference on Informatics in Secondary Schools, 2010

Didactic Games for Teaching Information Theory.

Michal Forisek, Monika Steinová

Proceedings of the Teaching Fundamentals Concepts of Informatics, 4th International Conference on Informatics in Secondary Schools, 2010

Improved Approximations for TSP with Simple Precedence Constraints.

Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2008

On the Power of Local Orientations.

Monika Steinová

Proceedings of the Structural Information and Communication Complexity, 2008