default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLionov Wiratma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j4]Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen
, Frank Staals, Lionov Wiratma, Sampson Wong:
Covering a set of line segments with a few squares. Theor. Comput. Sci. 923: 74-98 (2022)- 2021
- [c9]Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong:
Covering a Set of Line Segments with a Few Squares. CIAC 2021: 286-299 - [i3]Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong:
Covering a set of line segments with a few squares. CoRR abs/2101.09913 (2021) - 2020
- [j3]Marc J. van Kreveld, Maarten Löffler, Lionov Wiratma:
On optimal polyline simplification using the Hausdorff and Fréchet distance. J. Comput. Geom. 11(1): 1-25 (2020)
2010 – 2019
- 2019
- [b1]Lionov Wiratma:
Computations and Measures of Collective Movement Patterns Based on Trajectory Data. Utrecht University, Netherlands, 2019 - [c8]Lionov Wiratma, Marc J. van Kreveld, Maarten Löffler, Frank Staals:
An Experimental Evaluation of Grouping Definitions for Moving Entities. SIGSPATIAL/GIS 2019: 89-98 - 2018
- [j2]Marc J. van Kreveld, Maarten Löffler, Frank Staals, Lionov Wiratma:
A Refined Definition for Groups of Moving Entities and Its Computation. Int. J. Comput. Geom. Appl. 28(2): 181-196 (2018) - [c7]Marc J. van Kreveld, Maarten Löffler, Lionov Wiratma:
On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance. SoCG 2018: 56:1-56:14 - [c6]Lionov Wiratma, Maarten Löffler, Frank Staals:
An Experimental Comparison of Two Definitions for Groups of Moving Entities (Short Paper). GIScience 2018: 64:1-64:6 - [c5]Vahideh Keikha, Mees van de Kerkhof, Marc J. van Kreveld, Irina Kostitsyna, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen, Lionov Wiratma:
Convex Partial Transversals of Planar Regions. ISAAC 2018: 52:1-52:12 - [i2]Marc J. van Kreveld, Maarten Löffler, Lionov Wiratma:
On Optimal Polyline Simplification using the Hausdorff and Fréchet Distance. CoRR abs/1803.03550 (2018) - [i1]Vahideh Keikha, Mees van de Kerkhof, Marc J. van Kreveld, Irina Kostitsyna, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen, Lionov Wiratma:
Convex partial transversals of planar regions. CoRR abs/1809.10078 (2018) - 2017
- [c4]Lionov Wiratma, Marc J. van Kreveld, Maarten Löffler:
On Measures for Groups of Trajectories. AGILE Conf. 2017: 311-330 - 2016
- [c3]Marc J. van Kreveld, Maarten Löffler, Frank Staals, Lionov Wiratma:
A Refined Definition for Groups of Moving Entities and its Computation. ISAAC 2016: 48:1-48:12 - 2013
- [j1]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira, Carola Wenk, Lionov Wiratma:
Median Trajectories. Algorithmica 66(3): 595-614 (2013) - 2011
- [c2]Marc J. van Kreveld, Lionov Wiratma:
Median trajectories using well-visited regions and shortest paths. GIS 2011: 241-250 - 2010
- [c1]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira, Carola Wenk, Lionov Wiratma:
Median Trajectories. ESA (1) 2010: 463-474
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-24 23:06 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:
