default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 15
Volume 15, August 2012
- Marc Benkert, Joachim Gudmundsson
, Damian Merrick, Thomas Wolle:
Approximate one-to-one point pattern matching. 1-15 - Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi:
On bounded degree plane strong geometric spanners. 16-31 - Oliver Schaudt:
Efficient total domination in digraphs. 32-42 - Daniel Binkele-Raible, Henning Fernau:
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem. 43-55 - Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
On the parameterized complexity of coloring graphs in the absence of a linear forest. 56-62 - Sasanka Roy:
Near optimal algorithm for the shortest descending path on the surface of a convex terrain. 63-70
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.
last updated on 2025-01-27 20:46 CET 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:
