A New Measure of Asymmetry of Binary Words. - Olexandr Ravsky (J. Autom. Lang. Comb., 2003)

On the Palindromic Decomposition of Binary Words. - Olexandr Ravsky (J. Autom. Lang. Comb., 2003)

Obfuscated Drawings of Planar Graphs - Mihyun Kang; Oleg Pikhurko; Alexander Ravsky; Mathias Schacht; Oleg Verbitsky 001 (CoRR, 2008)

On Collinear Sets in Straight-Line Drawings. - Alexander Ravsky; Oleg Verbitsky 001 (WG, 2011)

Untangling planar graphs from a specified vertex position - Hard cases. - Mihyun Kang; Oleg Pikhurko; Alexander Ravsky; Mathias Schacht; Oleg Verbitsky 001 (Discret. Appl. Math., 2011)

On partitions of G-spaces and G-lattices. - Taras O. Banakh; Oleksandr Ravsky; Sergiy Slobodianiuk (Int. J. Algebra Comput., 2016)

Block Crossings in Storyline Visualizations. - Thomas C. van Dijk; Martin Fink 001; Norbert Fischer; Fabian Lipp; Peter Markfelder; Alexander Ravsky; Subhash Suri; Alexander Wolff 001 (J. Graph Algorithms Appl., 2017)

Approximation Schemes for Geometric Coverage Problems. - Steven Chaplick; Minati De; Alexander Ravsky; Joachim Spoerhase (ESA, 2018)

Brief Announcement: Approximation Schemes for Geometric Coverage Problems. - Steven Chaplick; Minati De; Alexander Ravsky; Joachim Spoerhase (ICALP, 2018)

Computing Height-Optimal Tangles Faster. - Oksana Firman; Philipp Kindermann; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (GD, 2019)

Variants of the Segment Number of a Graph. - Yoshio Okamoto; Alexander Ravsky; Alexander Wolff 001 (GD, 2019)

Drawing Graphs on Few Circles and Few Spheres. - Myroslav Kryven; Alexander Ravsky; Alexander Wolff 001 (J. Graph Algorithms Appl., 2019)

Bundled Crossings Revisited. - Steven Chaplick; Thomas C. van Dijk; Myroslav Kryven; Ji-won Park; Alexander Ravsky; Alexander Wolff 001 (J. Graph Algorithms Appl., 2020)

Drawing graphs on few lines and few planes. - Steven Chaplick; Krzysztof Fleszar 001; Fabian Lipp; Alexander Ravsky; Oleg Verbitsky 001; Alexander Wolff 001 (J. Comput. Geom., 2020)

The Complexity of Finding Tangles. - Oksana Firman; Philipp Kindermann; Boris Klemz; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2023)

Deciding the Feasibility and Minimizing the Height of Tangles. - Oksana Firman; Philipp Kindermann; Boris Klemz; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2023)

The Complexity of Drawing Graphs on Few Lines and Few Planes. - Steven Chaplick; Krzysztof Fleszar 001; Fabian Lipp; Alexander Ravsky; Oleg Verbitsky 001; Alexander Wolff 001 (J. Graph Algorithms Appl., 2023)