Alexander Ravsky

According to our database, Alexander Ravsky authored at least 17 papers between 2003 and 2023.

Collaborative distances:

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

2023

The Complexity of Drawing Graphs on Few Lines and Few Planes.

Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff

J. Graph Algorithms Appl., 2023

Deciding the Feasibility and Minimizing the Height of Tangles.

Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink

CoRR, 2023

The Complexity of Finding Tangles.

Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

2020

Drawing graphs on few lines and few planes.

Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff

J. Comput. Geom., 2020

Bundled Crossings Revisited.

Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff

J. Graph Algorithms Appl., 2020

2019

Drawing Graphs on Few Circles and Few Spheres.

Myroslav Kryven, Alexander Ravsky, Alexander Wolff

J. Graph Algorithms Appl., 2019

Variants of the Segment Number of a Graph.

Yoshio Okamoto, Alexander Ravsky, Alexander Wolff

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Computing Height-Optimal Tangles Faster.

Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

Brief Announcement: Approximation Schemes for Geometric Coverage Problems.

Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Approximation Schemes for Geometric Coverage Problems.

Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Block Crossings in Storyline Visualizations.

Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff

J. Graph Algorithms Appl., 2017

2016

On partitions of G-spaces and G-lattices.

Taras O. Banakh, Oleksandr Ravsky, Sergiy Slobodianiuk

Int. J. Algebra Comput., 2016

2011

Untangling planar graphs from a specified vertex position - Hard cases.

Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky

Discret. Appl. Math., 2011

On Collinear Sets in Straight-Line Drawings.

Alexander Ravsky, Oleg Verbitsky

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

2008

Obfuscated Drawings of Planar Graphs

Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky

CoRR, 2008

2003

On the Palindromic Decomposition of Binary Words.

Olexandr Ravsky

J. Autom. Lang. Comb., 2003

A New Measure of Asymmetry of Binary Words.

Olexandr Ravsky

J. Autom. Lang. Comb., 2003