Deutsch
Fabian Stehn
2.47
:
: +49 921557743
: only by appointment
| 2019 | |
| [72] | The geometric dilation of three points , In Journal of Computational Geometry (JoCG), volume 10, 2019. [bib] [pdf] [doi] |
| [71] | Covering Many Points with a Small-Area Box , In Journal of Computational Geometry (JoCG), volume 10, 2019. [bib] [pdf] [doi] |
| [70] | Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees , In International Journal of Foundations of Computer Science, volume 30, 2019. [bib] [pdf] [doi] |
| 2018 | |
| [69] | Placing your Coins on a Shelf , In Journal of Computational Geometry (JoCG), volume 9, 2018. [bib] [doi] |
| [68] | Elastic geometric shape matching for translations under the Manhattan norm , In Computational Geometry, volume 73, 2018. (Secial Issue on EuroCG2015) [bib] [pdf] [doi] |
| [67] | An FPTAS for an Elastic Shape Matching Problem with Cyclic Neighborhoods , In Computational Science and Its Applications -- ICCSA 2018 (Osvaldo Gervasi, Beniamino Murgante, Sanjay Misra, Elena Stankova, Carmelo M. Torre, Ana Maria A.C. Rocha, David Taniar, Bernady O. Apduhan, Eufemia Tarantino, Yeonseung Ryu, eds.), Springer International Publishing, 2018. (Best paper award) [bib] |
| 2017 | |
| [66] | Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons , In JoCG, volume 8, 2017. [bib] [pdf] |
| [65] | Top-k Manhattan spatial skyline queries , In Inf. Process. Lett., volume 123, 2017. [bib] [doi] |
| [64] | Minimum Cell Connection in Line Segment Arrangements , In International Journal of Computational Geometry & Applications, volume 27, 2017. [bib] [doi] |
| [63] | Placing your Coins on a Shelf , In 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand (Yoshio Okamoto, Takeshi Tokuyama, eds.), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, volume 92, 2017. [bib] [pdf] [doi] |
| 2016 | |
| [62] | Shortest path to a segment and quickest visibility queries , In JoCG, volume 7, 2016. [bib] [pdf] |
| [61] | Guest Editors' Foreword , In Int. J. Comput. Geometry Appl., volume 26, 2016. [bib] [doi] |
| [60] | Finding largest rectangles in convex polygons , In Comput. Geom., volume 51, 2016. [bib] [doi] |
| 2015 | |
| [59] | Fixed-Parameter Complexity and Approximability of Norm Maximization , In Discrete & Computational Geometry, 2015. [bib] [doi] |
| [58] | Elastic Geometric Shape Matching for Point Sets under Translations , In Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015. [bib] [doi] |
| [57] | Fast Algorithms for Diameter-Optimally Augmenting Paths , In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I, 2015. [bib] [doi] |
| [56] | Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons , In Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, 2015. [bib] [doi] |
| [55] | Shortest Path to a Segment and Quickest Visibility Queries , In 31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands, 2015. [bib] [doi] |
| 2014 | |
| [54] | Convex transversals , In Comput. Geom., volume 47, 2014. [bib] [doi] |
| [53] | Top-k Manhattan Spatial Skyline Queries , In WALCOM (Sudebkumar Prasant Pal, Kunihiko Sadakane, eds.), Springer, volume 8344, 2014. [bib] [doi] |
| 2013 | |
| [52] | Fixed-parameter tractability and lower bounds for stabbing problems , In Comput. Geom., volume 46, 2013. [bib] [doi] |
| [51] | Covering and piercing disks with two centers , In Comput. Geom., volume 46, 2013. [bib] [doi] |
| [50] | Realistic roofs over a rectilinear polygon , In Comput. Geom., volume 46, 2013. [bib] [doi] |
| [49] | On the complexity of Erdös-Szekeres and related problems in $\R^3$ , In ESA (Hans L. Bodlaender, Giuseppe F. Italiano, eds.), Springer, volume 8125, 2013. [bib] [doi] |
| [48] | Range-Aggregate Queries for Geometric Extent Problems , In CATS (Anthony Wirth, ed.), Australian Computer Society, volume 141, 2013. [bib] |
| [47] | Advantages and Disadvantages of Training based Object Detection / Classification in SAS Images , In POMA, volume 17, 2013. [bib] [doi] |
| 2012 | |
| [46] | Approximating the average stretch factor of geometric graphs , In JoCG, volume 3, 2012. [bib] |
| [45] | Largest inscribed rectangles in convex polygons , In J. Discrete Algorithms, volume 13, 2012. [bib] [doi] |
| [44] | Hardness of discrepancy computation and eps-net verification in high dimension , In J. Complexity, volume 28, 2012. [bib] [doi] |
| [43] | Computing the Discrete Fréchet Distance with Imprecise Input , In Int. J. Comput. Geometry Appl., volume 22, 2012. [bib] [doi] |
| [42] | Advantages and Disadvantages of Training based Object Detection / Classification in SAS Images , In 11th European Conference on Underwater Acoustics, volume 34, 2012. [bib] |
| 2011 | |
| [41] | The directed Hausdorff distance between imprecise point sets , In Theor. Comput. Sci., volume 412, 2011. [bib] [doi] |
| [40] | Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions , In Theor. Comput. Sci., volume 412, 2011. [bib] [doi] |
| [39] | Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension , In ACM Transactions on Algorithms, volume 7, 2011. [bib] [doi] |
| [38] | A fixed-parameter algorithm for the minimum Manhattan network problem , In JoCG, volume 2, 2011. [bib] |
| [37] | On graphs and algebraic graphs that do not contain cycles of length 4 , In Journal of Graph Theory, volume 68, 2011. [bib] [doi] |
| [36] | Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance , In Int. J. Comput. Geometry Appl., volume 21, 2011. [bib] [doi] |
| [35] | The Aligned k-Center Problem , In Int. J. Comput. Geometry Appl., volume 21, 2011. [bib] [doi] |
| [34] | Convex Transversals , In WADS (Frank Dehne, John Iacono, Jörg-Rüdiger Sack, eds.), Springer, volume 6844, 2011. [bib] [doi] |
| [33] | On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems , In STACS (Thomas Schwentick, Christoph Dürr, eds.), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, volume 9, 2011. [bib] [doi] |
| [32] | Covering and Piercing Disks with Two Centers , In ISAAC (Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto, Osamu Watanabe, eds.), Springer, volume 7074, 2011. [bib] [doi] |
| [31] | Generating Realistic Roofs over a Rectilinear Polygon , In ISAAC (Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto, Osamu Watanabe, eds.), Springer, volume 7074, 2011. [bib] [doi] |
| [30] | Non-uniform Geometric Matchings , In ICCSA (3) (Beniamino Murgante, Osvaldo Gervasi, Andrés Iglesias, David Taniar, Bernady O. Apduhan, eds.), Springer, volume 6784, 2011. [bib] [doi] |
| [29] | Efficient Dynamical Computation of Principal Components , In GRAPP (Paul Richard, José Braz, eds.), SciTePress, 2011. [bib] |
| [28] | Benefit for Classification by Automated Acoustic Data Fusion , In Underwater Acoustics Measurements: Technologies and Results, 2011. [bib] |
| [27] | Benefit for Screnning by Automated Acoustic Data Fusion , In Underwater Acoustics Measurements: Technologies and Results, 2011. [bib] |
| 2010 | |
| [26] | Dilation-Optimal Edge Deletion in Polygonal Cycles , In Int. J. Comput. Geometry Appl., volume 20, 2010. [bib] [doi] |
| [25] | Computing Geometric Minimum-Dilation Graphs is NP-Hard , In Int. J. Comput. Geometry Appl., volume 20, 2010. [bib] [doi] |
| [24] | Covering a simple polygon by monotone directions , In Comput. Geom., volume 43, 2010. [bib] [doi] |
| [23] | The Complexity of Geometric Problems in High Dimension , In TAMC (Jan Kratochvíl, Angsheng Li, Jirí Fiala, Petr Kolman, eds.), Springer, volume 6108, 2010. [bib] [pdf] [doi] |
| [22] | Approximating the Average Stretch Factor of Geometric Graphs , In ISAAC (1), 2010. [bib] [doi] |
| [21] | Computing the Discrete Fréchet Distance with Imprecise Input , In ISAAC (2) (Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park, eds.), Springer, volume 6507, 2010. [bib] [doi] |
| [20] | Computer Aided Detection and Clasification of MLOs in Side Scan Sonar Images , In UDT EUROPE 2010, 2010. [bib] |
| [19] | The effect of pre-processing on the outcome of an CAD/CAC system for underwater in SAS and conventional side scan images , In 10th European Conference on Underwater Acoustics, volume 3, 2010. [bib] |
| [18] | Performance gain by fusing classification resultes for differenet aspect angles in SAS side scan images , In 10th European Conference on Underwater Acoustics, volume 3, 2010. [bib] |
| 2009 | |
| [17] | Constructing Optimal Highways , In Int. J. Found. Comput. Sci., volume 20, 2009. [bib] [doi] |
| [16] | Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion , In Int. J. Comput. Geometry Appl., volume 19, 2009. [bib] [doi] |
| [15] | A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem , In Int. J. Comput. Geometry Appl., volume 19, 2009. [bib] [doi] |
| [14] | Bounds on the quality of the PCA bounding boxes , In Comput. Geom., volume 42, 2009. [bib] [doi] |
| [13] | Algorithms for graphs of bounded treewidth via orthogonal range searching , In Comput. Geom., volume 42, 2009. [bib] [doi] |
| [12] | Measuring the Similarity of Geometric Graphs , In SEA (Jan Vahrenhold, ed.), Springer, volume 5526, 2009. [bib] [doi] |
| [11] | The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension , In IWPEC (Jianer Chen, Fedor V. Fomin, eds.), Springer, volume 5917, 2009. [bib] [doi] |
| [10] | The Directed Hausdorff Distance between Imprecise Point Sets , In ISAAC (Yingfei Dong, Ding-Zhu Du, Oscar H. Ibarra, eds.), Springer, volume 5878, 2009. [bib] [doi] |
| [9] | Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions , In FAW (Xiaotie Deng, John E. Hopcroft, Jinyun Xue, eds.), Springer, volume 5598, 2009. [bib] [doi] |
| [8] | On Inducing Polygons and Related Problems , In ESA, 2009. [bib] [doi] |
| [7] | Image processing in side scan sonar images for object detection and classification , In Underwater Acoustic Measurments: Technologies & Results, 2009. [bib] |
| [6] | Side scan sonar image resolution and automatic object detection, classification and identification , In OCEANS 2009 - EUROPE, 2009. [bib] [doi] |
| [5] | On the dilation spectrum of paths, cycles, and trees , In Comput. Geom., volume 42, 2009. [bib] [doi] |
| 2008 | |
| [4] | Approximate Point-to-Surface Registration with a Single Characteristic Point , In VISAPP (1) (Alpesh Ranchordas, Helder Araújo, eds.), INSTICC - Institute for Systems and Technologies of Information, Control and Communication, 2008. [bib] |
| [3] | Inducing Polygons of Line Arrangements , In ISAAC, 2008. [bib] [doi] |
| [2] | Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance , In ISAAC, 2008. [bib] [doi] |
| 2007 | |
| [1] | Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation , In FAW (Franco P. Preparata, Qizhi Fang, eds.), Springer, volume 4613, 2007. [bib] [doi] |
Powered by bibtexbrowser