default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Ravsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Steven Chaplick
, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
The Complexity of Drawing Graphs on Few Lines and Few Planes. J. Graph Algorithms Appl. 27(6): 459-488 (2023)- [c11]Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink:
The Complexity of Finding Tangles. SOFSEM 2023: 3-17 - [i10]Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink:
Deciding the Feasibility and Minimizing the Height of Tangles. CoRR abs/2312.16213 (2023) - 2020
- [j8]Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. J. Graph Algorithms Appl. 24(4): 621-655 (2020) - [j7]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
Drawing graphs on few lines and few planes. J. Comput. Geom. 11(1): 433-475 (2020)
2010 – 2019
- 2019
- [j6]Myroslav Kryven, Alexander Ravsky, Alexander Wolff:
Drawing Graphs on Few Circles and Few Spheres. J. Graph Algorithms Appl. 23(2): 371-391 (2019) - [c10]Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. GD 2019: 63-77 - [c9]Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink:
Computing Height-Optimal Tangles Faster. GD 2019: 203-215 - [c8]Yoshio Okamoto, Alexander Ravsky, Alexander Wolff:
Variants of the Segment Number of a Graph. GD 2019: 430-443 - [i9]Yoshio Okamoto, Alexander Ravsky, Alexander Wolff:
Variants of the Segment Number of a Graph. CoRR abs/1908.08871 (2019) - 2018
- [c7]Myroslav Kryven, Alexander Ravsky, Alexander Wolff:
Drawing Graphs on Few Circles and Few Spheres. CALDAM 2018: 164-178 - [c6]Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase:
Approximation Schemes for Geometric Coverage Problems. ESA 2018: 17:1-17:15 - [c5]Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase:
Brief Announcement: Approximation Schemes for Geometric Coverage Problems. ICALP 2018: 107:1-107:4 - [i8]Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. CoRR abs/1812.04263 (2018) - 2017
- [j5]Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff:
Block Crossings in Storyline Visualizations. J. Graph Algorithms Appl. 21(5): 873-913 (2017) - [c4]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
The Complexity of Drawing Graphs on Few Lines and Few Planes. WADS 2017: 265-276 - [i7]Myroslav Kryven, Alexander Ravsky, Alexander Wolff:
Drawing Graphs on Few Circles and Few Spheres. CoRR abs/1709.06965 (2017) - 2016
- [j4]Taras O. Banakh, Oleksandr Ravsky, Sergiy Slobodianiuk:
On partitions of G-spaces and G-lattices. Int. J. Algebra Comput. 26(2): 283-308 (2016) - [c3]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
Drawing Graphs on Few Lines and Few Planes. GD 2016: 166-180 - [c2]Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff:
Block Crossings in Storyline Visualizations. GD 2016: 382-398 - [i6]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
Drawing Graphs on Few Lines and Few Planes. CoRR abs/1607.01196 (2016) - [i5]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
The Complexity of Drawing Graphs on Few Lines and Few Planes. CoRR abs/1607.06444 (2016) - [i4]Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase:
Approximation Schemes for Geometric Coverage Problems. CoRR abs/1607.06665 (2016) - [i3]Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff:
Block Crossings in Storyline Visualizations. CoRR abs/1609.00321 (2016) - 2011
- [j3]Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky:
Untangling planar graphs from a specified vertex position - Hard cases. Discret. Appl. Math. 159(8): 789-799 (2011) - [c1]Alexander Ravsky, Oleg Verbitsky:
On Collinear Sets in Straight-Line Drawings. WG 2011: 295-306
2000 – 2009
- 2008
- [i2]Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky:
Obfuscated Drawings of Planar Graphs. CoRR abs/0803.0858 (2008) - [i1]Alexander Ravsky, Oleg Verbitsky:
On collinear sets in straight line drawings. CoRR abs/0806.0253 (2008) - 2003
- [j2]Olexandr Ravsky:
A New Measure of Asymmetry of Binary Words. J. Autom. Lang. Comb. 8(1): 71-74 (2003) - [j1]Olexandr Ravsky:
On the Palindromic Decomposition of Binary Words. J. Autom. Lang. Comb. 8(1): 75-83 (2003)
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-25 05:53 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:
