default search action
Michiel H. M. Smid
- > Home > Persons > Michiel H. M. Smid
Publications
- 2019
- [j117]Ulrike Große, Christian Knauer, Fabian Stehn, Joachim Gudmundsson, Michiel H. M. Smid:
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. Int. J. Found. Comput. Sci. 30(2): 293-313 (2019) - 2016
- [j101]Christian Knauer, Michiel H. M. Smid:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 26(3-4): 0-134 (2016) - [i37]Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn:
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. CoRR abs/1607.05547 (2016) - 2015
- [c99]Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn:
Fast Algorithms for Diameter-Optimally Augmenting Paths. ICALP (1) 2015: 678-688 - 2013
- [c91]Peter Brass, Christian Knauer, Chan-Su Shin, Michiel H. M. Smid, Ivo Vigan:
Range-Aggregate Queries for Geometric Extent Problems. CATS 2013: 3-10 - 2012
- [j79]Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid:
Approximating the average stretch factor of geometric graphs. J. Comput. Geom. 3(1): 132-153 (2012) - 2010
- [j72]Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang:
Dilation-Optimal Edge Deletion in Polygonal Cycles. Int. J. Comput. Geom. Appl. 20(1): 69-87 (2010) - [c77]Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid:
Approximating the Average Stretch Factor of Geometric Graphs. ISAAC (1) 2010: 37-48 - 2009
- [j65]Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid:
On the dilation spectrum of paths, cycles, and trees. Comput. Geom. 42(9): 923-933 (2009) - [e4]Gautam Das, Joachim Gudmundsson, Rolf Klein, Christian Knauer, Michiel H. M. Smid:
Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 01.11. - 06.11.2009. Dagstuhl Seminar Proceedings 09451, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i12]Gautam Das, Joachim Gudmundsson, Rolf Klein, Christian Knauer, Michiel H. M. Smid:
09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining. Geometric Networks, Metric Space Embeddings and Spatial Data Mining 2009 - 2007
- [c64]Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang:
Dilation-Optimal Edge Deletion in Polygonal Cycles. ISAAC 2007: 88-99 - 2005
- [c53]Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid:
Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles. ISAAC 2005: 849-858
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-06-25 21:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint