default search action
Stephen K. Wismath
- > Home > Persons > Stephen K. Wismath
Publications
- 2018
- [j32]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Ortho-polygon Visibility Representations of Embedded Graphs. Algorithmica 80(8): 2345-2383 (2018) - [j31]Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath:
Visibility representations of boxes in 2.5 dimensions. Comput. Geom. 72: 19-33 (2018) - [j29]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
New results on edge partitions of 1-plane graphs. Theor. Comput. Sci. 713: 78-84 (2018) - 2017
- [i5]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
New Results on Edge Partitions of 1-plane Graphs. CoRR abs/1706.05161 (2017) - 2016
- [j28]William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Alternating paths and cycles of minimum length. Comput. Geom. 58: 124-135 (2016) - [c32]Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath:
Visibility Representations of Boxes in 2.5 Dimensions. GD 2016: 251-265 - [c31]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Ortho-Polygon Visibility Representations of Embedded Graphs. GD 2016: 280-294 - [i4]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Ortho-polygon Visibility Representations of Embedded Graphs. CoRR abs/1604.08797 (2016) - [i2]Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath:
Visibility Representations of Boxes in 2.5 Dimensions. CoRR abs/1608.08899 (2016) - 2015
- [c28]William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Alternating Paths and Cycles of Minimum Length. GD 2015: 383-394 - 2014
- [j23]William S. Evans, Michael Kaufmann, William J. Lenhart, Tamara Mchedlidze, Stephen K. Wismath:
Bar 1-Visibility Graphs vs. other Nearly Planar Graphs. J. Graph Algorithms Appl. 18(5): 721-739 (2014) - 2013
- [j22]Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath:
On point-sets that support planar graphs. Comput. Geom. 46(1): 29-50 (2013) - [i1]William S. Evans, Michael Kaufmann, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Stephen K. Wismath:
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs. CoRR abs/1312.5520 (2013) - 2011
- [c24]Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath:
On Point-Sets That Support Planar Graphs. GD 2011: 64-74 - 2010
- [c22]Vida Dujmovic, William S. Evans, Stephen G. Kobourov, Giuseppe Liotta, Christophe Weibel, Stephen K. Wismath:
On Graphs Supported by Line Sets. GD 2010: 177-182
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-07-03 21:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint