# TODO
# - add pdfs
# - add conferences before 2008
# - add coauthor weblink

#######################################
# Co-authors
#######################################

@STRING{hp_ChristianKnauer={en/mitarbeiter/christian-knauer}}
@STRING{hp_FlorianLangner={en/ehemalige-mitarbeiter/florian-langner}}
@STRING{hp_MarcScherfenberg={en/ehemalige-mitarbeiter/marc-scherfenberg}}
@STRING{hp_LuiseSommer={en/mitarbeiter/luise-sommer}}
@STRING{hp_FabianStehn={en/mitarbeiter/fabian-stehn}}

@STRING{hp_Hee-KapAhn={http://www.postech.ac.kr/%7Eheekap/}}
@STRING{hp_HelmutAlt={coauthor/helmut-alt}}
@STRING{hp_EstherArkin={http://www.ams.sunysb.edu/%7Eestie/}}
@STRING{hp_PeterBrass={http://www-cs.ccny.cuny.edu/%7Epeter/}}
@STRING{hp_SergioCabello={http://www.fmf.uni-lj.si/%7Ecabello/}}
@STRING{hp_OtfriedCheong={http://otfried-cheong.appspot.com/index.html}}
@STRING{hp_PanosGiannopoulos={coauthor/panos-giannopoulos}}
@STRING{hp_KlausKriegel={http://www.inf.fu-berlin.de/inst/ag-ti/members/kriegel.de.html}}
@STRING{hp_RolfKlein={http://web.informatik.uni-bonn.de/I/staff/klein.html}}
@STRING{hp_GünterRote={http://page.mi.fu-berlin.de/rote/}}
@STRING{hp_WolfgangMiddelmann={http://www.iosb.fraunhofer.de}}
@STRING{hp_AlfonsEbert={http://www.iosb.fraunhofer.de}}
@STRING{hp_Chan-SuShin={http://control.hufs.ac.kr/%7Ecssin/}}
@STRING{hp_LenaSchlipf={coauthor/lena-schlipf}}
@STRING{hp_AntoineVigneron={http://algo.kaust.edu.sa/Pages/Vigneron.aspx}}
@STRING{hp_JosephMitchell={http://www.ams.sunysb.edu/%7Ejsbm/}}

#######################################
# Publications
#######################################

# Newer entries verified against the DBLP Christian Knauer author record
# https://dblp.org/pid/k/ChristianKnauer.html (checked 2026-10-25).
# The existing CMSMS bibliography below is retained without alteration.
# The 2023 arXiv preprint "Geometric Assignment and Geometric Bottleneck"
# is not listed separately here because the 2024 SoCG version supersedes it.

# 2025

@inproceedings{DBLP:conf/compgeom/AgarwalADKM25,
  author    = {Pankaj K. Agarwal and Boris Aronov and Olivier Devillers and Christian Knauer and Guillaume Moroz},
  title     = {A Subquadratic Algorithm for Computing the L₁-Distance Between Two Terrains},
  booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)},
  series    = {Leibniz International Proceedings in Informatics (LIPIcs)},
  volume    = {332},
  pages     = {4:1--4:17},
  year      = {2025},
  doi       = {10.4230/LIPIcs.SoCG.2025.4},
  url       = {https://doi.org/10.4230/LIPIcs.SoCG.2025.4}
}

@article{DBLP:journals/corr/abs-2506-03960,
  author    = {Boris Aronov and Sang Won Bae and Sergio Cabello and Otfried Cheong and David Eppstein and Christian Knauer and Raimund Seidel},
  title     = {Better Late than Never: the Complexity of Arrangements of Polyhedra},
  journal   = {CoRR},
  volume    = {abs/2506.03960},
  year      = {2025},
  doi       = {10.48550/arXiv.2506.03960},
  url       = {https://arxiv.org/abs/2506.03960}
}

# 2024

@inproceedings{DBLP:conf/compgeom/CabelloCCK24,
  author    = {Sergio Cabello and Siu-Wing Cheng and Otfried Cheong and Christian Knauer},
  title     = {Geometric Matching and Bottleneck Problems},
  booktitle = {40th International Symposium on Computational Geometry (SoCG 2024)},
  series    = {Leibniz International Proceedings in Informatics (LIPIcs)},
  volume    = {293},
  pages     = {31:1--31:15},
  year      = {2024},
  doi       = {10.4230/LIPIcs.SoCG.2024.31},
  url       = {https://doi.org/10.4230/LIPIcs.SoCG.2024.31}
}

# 2022

@article{DBLP:journals/cg/ReischlKG22,
  author    = {Maximilian Reischl and Christian Knauer and Michael Guthe},
  title     = {Parallel near-optimal pathfinding based on landmarks},
  journal   = {Computers \& Graphics},
  volume    = {102},
  pages     = {1--8},
  year      = {2022},
  doi       = {10.1016/j.cag.2021.11.007},
  url       = {https://doi.org/10.1016/j.cag.2021.11.007}
}

# 2020

@article{DBLP:journals/jocg/BergK20,
  author    = {Mark de Berg and Christian Knauer},
  title     = {Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons},
  journal   = {Journal of Computational Geometry},
  volume    = {11},
  number    = {1},
  pages     = {653--655},
  year      = {2020},
  doi       = {10.20382/jocg.v11i1a26},
  url       = {https://doi.org/10.20382/jocg.v11i1a26}
}

@inproceedings{DBLP:conf/modellierung/StreyHRKG20,
  author    = {Lukas Strey and Christian Hein and Tom Ritter and Christian Knauer and Angelika Ganz},
  title     = {Modellbasierte Methode zur Ableitung nicht-funktionaler Anforderungen im Kontext der Softwaremodernisierung},
  booktitle = {Modellierung 2020},
  series    = {Lecture Notes in Informatics (LNI)},
  volume    = {P-302},
  pages     = {125--140},
  year      = {2020},
  url       = {https://dl.gi.de/handle/20.500.12116/31851}
}

@inproceedings{DBLP:conf/pg/ReischlKG20,
  author    = {Maximilian Reischl and Christian Knauer and Michael Guthe},
  title     = {Using Landmarks for Near-Optimal Pathfinding on the {CPU} and {GPU}},
  booktitle = {28th Pacific Conference on Computer Graphics and Applications (PG 2020)},
  pages     = {37--42},
  year      = {2020},
  doi       = {10.2312/pg.20201228},
  url       = {https://doi.org/10.2312/pg.20201228}
}

# 2019

# Additional Fabian Stehn publications checked against
# https://dblp.org/pid/27/3421.html (2026-10-25).
# Published conference and journal versions have distinct entries; arXiv
# preprints of already listed works are not added a second time.

@article{DBLP:journals/comgeo/AhnOSSS19,
  author  = {Hee-Kap Ahn and Eunjin Oh and Lena Schlipf and Fabian Stehn and Darren Strash},
  title   = {On Romeo and Juliet problems: Minimizing distance-to-sight},
  journal = {Computational Geometry},
  volume  = {84},
  pages   = {12--21},
  year    = {2019},
  doi     = {10.1016/j.comgeo.2019.07.003},
  url     = {https://doi.org/10.1016/j.comgeo.2019.07.003}
}

@article{journals:The_geometric_dilation_of_three_points,
  author    = {Annette Ebbers-Baumann and Rolf Klein and Christian Knauer and G{\"{u}}nter Rote},
  title     = {The geometric dilation of three points},
  journal   = {Journal of Computational Geometry (JoCG)},
  volume    = {10},
  number    = {1},
  year      = {2019},
  url       = {https://doi.org/10.20382/jocg.v10i1a18},
  doi       = {10.20382/jocg.v10i1a18}
}

@article{journals:Covering_Many_Points_with_a_Small-Area_Box,
author    = {de Berg, Mark and Cabello, Sergio and Cheong, Otfried and Eppstein, David and Knauer, Christian},
title     = {Covering Many Points with a Small-Area Box},
journal   = {Journal of Computational Geometry (JoCG)},
volume    = {10},
number    = {1},
year      = {2019},
url       = {https://doi.org/10.20382/jocg.v10i1a8},
doi       = {10.20382/jocg.v10i1a8}
}

@article{journals:10.1142/S0129054119500060,
author = {Große, Ulrike and Knauer, Christian and Stehn, Fabian and Gudmundsson, Joachim and Smid, Michiel},
title = {Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees},
journal = {International Journal of Foundations of Computer Science},
volume = {30},
number = {02},
pages = {293-313},
year = {2019},
doi = {10.1142/S0129054119500060},
URL = { https://doi.org/10.1142/S0129054119500060},
eprint = {https://doi.org/10.1142/S0129054119500060},
    abstract = { We consider the problem of augmenting an n-vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present exact algorithms for the cases when (i) the input graph is a path, running in O(n log^3 n) time, and (ii) the input graph is a tree, running in O(n^2 log n) time. We also present an algorithm for paths that computes a (1 + 𝜀)-approximation in O(n + 1/𝜀^3) time. }
}

# 2018

@inproceedings{DBLP:conf/compgeom/BaeCCCSY18,
  author    = {Sang Won Bae and Sergio Cabello and Otfried Cheong and Yoonsung Choi and Fabian Stehn and Sang Duk Yoon},
  title     = {The Reverse Kakeya Problem},
  booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)},
  series    = {Leibniz International Proceedings in Informatics (LIPIcs)},
  volume    = {99},
  pages     = {6:1--6:13},
  year      = {2018},
  doi       = {10.4230/LIPIcs.SoCG.2018.6},
  url       = {https://doi.org/10.4230/LIPIcs.SoCG.2018.6}
}

@inproceedings{DBLP:conf/swat/Ahn0SSS18,
  author    = {Hee-Kap Ahn and Eunjin Oh and Lena Schlipf and Fabian Stehn and Darren Strash},
  title     = {On Romeo and Juliet Problems: Minimizing Distance-to-Sight},
  booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)},
  series    = {Leibniz International Proceedings in Informatics (LIPIcs)},
  volume    = {101},
  pages     = {6:1--6:13},
  year      = {2018},
  doi       = {10.4230/LIPIcs.SWAT.2018.6},
  url       = {https://doi.org/10.4230/LIPIcs.SWAT.2018.6}
}

@InProceedings{conf/10.1007/978-3-319-95165-2_30,
author="Knauer, Christian
and Sommer, Luise
and Stehn, Fabian",
editor="Gervasi, Osvaldo
and Murgante, Beniamino
and Misra, Sanjay
and Stankova, Elena
and Torre, Carmelo M.
and Rocha, Ana Maria A.C.
and Taniar, David
and Apduhan, Bernady O.
and Tarantino, Eufemia
and Ryu, Yeonseung",
title="An FPTAS for an Elastic Shape Matching Problem with Cyclic Neighborhoods",
booktitle="Computational Science and Its Applications -- ICCSA 2018",
year="2018",
publisher="Springer International Publishing",
address="Cham",
pages="425--443",
abstract="In computational geometry, the elastic geometric shape matching (EGSM) problem class is a generalisation of the well-known geometric shape matching problem class: Given two geometric shapes, the `pattern' and the `model', find a single transformation from a given transformation class that, if applied to the pattern, minimizes the distance between the transformed pattern and the model with respect to a suitable distance measure.",
isbn="978-3-319-95165-2",
note="Best paper award"
}

@article{journals/aetalpycoas18,
author    = {Helmut Alt and
               Kevin Buchin and
               Steven Chaplick and
               Otfried Cheong and
               Philipp Kindermann and
               Christian Knauer and
               Fabian Stehn},
title   = {Placing your Coins on a Shelf},
journal = {Journal of Computational Geometry (JoCG)},
volume = {9},
number = {1},
year    = {2018},
doi     = {10.20382/jocg.v9i1}
}

@article{journals/KNAUER201857,
title = "Elastic geometric shape matching for translations under the Manhattan norm",
journal = "Computational Geometry",
volume = "73",
pages = "57 - 69",
year = "2018",
note = "Secial Issue on EuroCG2015",
issn = "0925-7721",
doi = "10.1016/j.comgeo.2018.01.002",
url = "http://www.sciencedirect.com/science/article/pii/S0925772118300026",
author = "Christian Knauer and Luise Sommer and Fabian Stehn",
keywords = "Computational geometry, Exact elastic shape matching, Polygonal norms, Approximation",
abstract = "The term elastic geometric shape matching (EGSM) refers to geometric optimization problems that are a generalization of many classical and well-studied geometric shape matching problems. In a geometric shape matching problem, one seeks a single transformation that, if applied to a geometric object – the pattern – minimizes the distance of the transformed object to another geometric object – the model. In an EGSM problem, the pattern is partitioned into parts which are transformed by a collection of transformations, called a transformation ensemble, in order to minimize the distance of the individually transformed parts to the model under the constraint that specific pairs of transformations of the ensemble have to be similar. These constraints are defined by an abstract graph on the parts of the model, called the neighborhood graph. We present algorithms for an EGSM problem for point sets under translations where the neighborhood graph is a tree. We measure the similarity of the shapes by the L1-Hausdorff distance (and the Hausdorff distance induced by other polygonal metrics)."
}

 # 2017

@article{journals/ijcga/S0218195917500017,
author  = {Alt, Helmut and Cabello, Sergio and Giannopoulos, Panos and Knauer, Christian},
title   = {Minimum Cell Connection in Line Segment Arrangements},
journal = {International Journal of Computational Geometry & Applications},
volume  = {27},
number  = {03},
pages   = {159-176},
year    = {2017},
doi     = {10.1142/S0218195917500017}
}

@inproceedings{conf/isaac/AltBCCKKS17,
  author    = {Helmut Alt and
               Kevin Buchin and
               Steven Chaplick and
               Otfried Cheong and
               Philipp Kindermann and
               Christian Knauer and
               Fabian Stehn},
  title     = {Placing your Coins on a Shelf},
  booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC}
               2017, December 9-12, 2017, Phuket, Thailand},
  pages     = {4:1--4:12},
  year      = {2017},
  crossref  = {conf/isaac/2017},
  doi       = {10.4230/LIPIcs.ISAAC.2017.4}
}

@proceedings{conf/isaac/2017,
  editor    = {Yoshio Okamoto and
               Takeshi Tokuyama},
  title     = {28th International Symposium on Algorithms and Computation, {ISAAC}
               2017, December 9-12, 2017, Phuket, Thailand},
  series    = {LIPIcs},
  volume    = {92},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2017},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-054-5},
  isbn      = {978-3-95977-054-5}
}

@article{journals/ipl/SonSKA17,
  author    = {Wanbin Son and
               Fabian Stehn and
               Christian Knauer and
               Hee-Kap Ahn},
  title     = {Top-k Manhattan spatial skyline queries},
  journal   = {Inf. Process. Lett.},
  volume    = {123},
  pages     = {27--35},
  year      = {2017},
  doi       = {10.1016/j.ipl.2017.03.003}
}

@article{journals/jocg/AltBK17,
  author    = {Helmut Alt and
               Mark de Berg and
               Christian Knauer},
  title     = {Approximating Minimum-Area Rectangular and Convex Containers for Packing
               Convex Polygons},
  journal   = {JoCG},
  volume    = {8},
  number    = {1},
  pages     = {1--10},
  year      = {2017},
  url       = {http://jocg.org/index.php/jocg/article/view/289}
}

 # 2016

@article{journals/ijcga/KnauerS16,
  author    = {Christian Knauer and
               Michiel H. M. Smid},
  title     = {Guest Editors' Foreword},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {26},
  number    = {3-4},
  pages     = {0--134},
  year      = {2016},
  doi       = {10.1142/S0218195916020015}
}

@article{journals/jocg/PolishchukAEKMR16,
  author    = {Valentin Polishchuk and
               Esther M. Arkin and
               Alon Efrat and
               Christian Knauer and
               Joseph S. B. Mitchell and
               G{\"{u}}nter Rote and
               Lena Schlipf and
               Topi Talvitie and
               Valentin Polishchuk},
  title     = {Shortest path to a segment and quickest visibility queries},
  journal   = {JoCG},
  volume    = {7},
  number    = {2},
  pages     = {77--100},
  year      = {2016},
  url       = {http://jocg.org/index.php/jocg/article/view/264}
}

@article{journals/comgeo/CabelloCKS2015,
  author    = {Sergio Cabello and 
               Otfried Cheong and 
               Christian Knauer and 
               Lena Schlipf},
  title     = {Finding largest rectangles in convex polygons},
  journal   = {Comput. Geom.},
  year      = {2016},
  volume    = {51},
  pages     = {67-74},
  doi       = {10.1016/j.comgeo.2015.08.001}
}

 # 2015

@inproceedings{conf/esa/AltBK15,
  author    = {Helmut Alt and
               Mark de Berg and
               Christian Knauer},
  title     = {Approximating Minimum-Area Rectangular and Convex Containers for Packing
               Convex Polygons},
  booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
               Greece, September 14-16, 2015, Proceedings},
  pages     = {25--34},
  year      = {2015},
  doi       = {10.1007/978-3-662-48350-3_3}
}

@inproceedings{conf/wads/KnauerS15,
  author    = {Christian Knauer and
               Fabian Stehn},
  title     = {Elastic Geometric Shape Matching for Point Sets under Translations},
  booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
               2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
  pages     = {578--592},
  year      = {2015},
  doi       = {10.1007/978-3-319-21840-3_48}
}

@inproceedings{conf/icalp/GrosseGKSS15,
  author    = {Ulrike Gro{\ss}e and
               Joachim Gudmundsson and
               Christian Knauer and
               Michiel H. M. Smid and
               Fabian Stehn},
  title     = {Fast Algorithms for Diameter-Optimally Augmenting Paths},
  booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
               {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
  pages     = {678--688},
  year      = {2015},
  doi       = {10.1007/978-3-662-47672-7_55}
}

@inproceedings{conf/compgeom/ArkinEKMPRST15,
  author    = {Esther Arkin and
               Alon Efrat and
               Christian Knauer and
               Joseph Mitchell and
               Valentin Polishchuk and
               G{\"{u}}nter Rote and
               Lena Schlipf and
               Topi Talvitie},
  title     = {Shortest Path to a Segment and Quickest Visibility Queries},
  booktitle = {31st International Symposium on Computational Geometry, SoCG 2015,
               June 22-25, 2015, Eindhoven, The Netherlands},
  pages     = {658--673},
  year      = {2015},
  doi       = {10.4230/LIPIcs.SOCG.2015.658}
}

@article{journals/dcg/KnauerKW15,
year        = {2015},
journal     = {Discrete & Computational Geometry},
title       = {Fixed-Parameter Complexity and Approximability of Norm Maximization},
author      = {Christian Knauer and Stefan König and Daniel Werner},
pages       = {1-20},
doi         = {10.1007/s00454-015-9667-0}
}

# 2014

@article{journals/comgeo/ArkinDKMPSY14,
  author    = {Esther Arkin and
               Claudia Dieckmann and
               Christian Knauer and
               Joseph Mitchell and
               Valentin Polishchuk and
               Lena Schlipf and
               Shang Yang},
  title     = {Convex transversals},
  journal   = {Comput. Geom.},
  volume    = {47},
  number    = {2},
  year      = {2014},
  pages     = {224-239},
  doi       = {10.1016/j.comgeo.2012.10.009}
}

@inproceedings{conf/walcom/SonSKA14,
  author    = {Wanbin Son and
               Fabian Stehn and
               Christian Knauer and
               Hee-Kap Ahn},
  title     = {Top-k Manhattan Spatial Skyline Queries},
  booktitle = {WALCOM},
  year      = {2014},
  pages     = {22-33},
  doi       = {10.1007/978-3-319-04657-0_5},
  crossref  = {conf/walcom/2014}
}

@proceedings{conf/walcom/2014,
  editor    = {Sudebkumar Prasant Pal and
               Kunihiko Sadakane},
  title     = {Algorithms and Computation - 8th International Workshop,
               WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings},
  booktitle = {WALCOM},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {8344},
  year      = {2014},
  isbn      = {978-3-319-04656-3},
  doi       = {10.1007/978-3-319-04657-0}
}

# 2013

@inproceedings{conf/cats/BrassKSS13,
  author    = {Peter Brass and
               Christian Knauer and
               Chan-Su Shin and
               Michiel H. M. Smid},
  title     = {Range-Aggregate Queries for Geometric Extent Problems},
  booktitle = {CATS},
  year      = {2013},
  pages     = {3-10},
  crossref  = {conf/cats/2013}
}

@proceedings{conf/cats/2013,
  editor    = {Anthony Wirth},
  title     = {Nineteenth Computing: The Australasian Theory Symposium,
               CATS 2013, Adelaide, Australia, February 2013},
  booktitle = {CATS},
  publisher = {Australian Computer Society},
  series    = {CRPIT},
  volume    = {141},
  year      = {2013},
  isbn      = {978-1-921770-26-5}
}

@inproceedings{conf/esa/GiannopoulosKW13,
  author    = {Panos Giannopoulos and
               Christian Knauer and
               Daniel Werner},
  title     = {On the complexity of Erd{\"o}s-Szekeres and related problems in $\R^3$},
  booktitle = {ESA},
  year      = {2013},
  pages     = {541-552},
  doi       = {10.1007/978-3-642-40450-4_46},
  crossref  = {conf/esa/2013},
}

@proceedings{conf/esa/2013,
  editor    = {Hans L. Bodlaender and
               Giuseppe F. Italiano},
  title     = {Algorithms - ESA 2013 - 21st Annual European Symposium,
               Sophia Antipolis, France, September 2-4, 2013. Proceedings},
  booktitle = {ESA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {8125},
  year      = {2013},
  isbn      = {978-3-642-40449-8},
  doi       = {10.1007/978-3-642-40450-4},
}

@article{journals/comgeo/AhnBKLSV13,
  author    = {Hee-Kap Ahn and 
               Sang Won Bae and 
               Christian Knauer and 
               Mira Lee and 
               Chan-Su Shin and 
               Antoine Vigneron},  
  title     = {Realistic roofs over a rectilinear polygon},
  journal   = {Comput. Geom.},
  volume    = {46},
  number    = {9},
  pages     = {1042 - 1055},
  year      = {2013},
  doi       = {10.1016/j.comgeo.2013.06.002}
}

@article{journals/comgeo/GiannopoulosKRW13,
  author    = {Panos Giannopoulos and
               Christian Knauer and
               G{\"u}nter Rote and
               Daniel Werner},
  title     = {Fixed-parameter tractability and lower
               bounds for stabbing problems},
  journal   = {Comput. Geom.},
  volume    = {46},
  number    = {7},
  year      = {2013},
  pages     = {839--860},
  doi       = {10.1016/j.comgeo.2011.06.005}
}


@article{journals/comgeo/AhnKKSSV13,
  author    = {Hee-Kap Ahn and
               Sang-Sub Kim and
               Christian Knauer and
               Lena Schlipf and
               Chan-Su Shin and
               Antoine Vigneron},
  title     = {Covering and piercing disks with two centers},
  journal   = {Comput. Geom.},
  volume    = {46},
  number    = {3},
  year      = {2013},
  pages     = {253-262},
  doi       = {10.1016/j.comgeo.2012.09.002}
}

@INPROCEEDINGS{conf/POMA/FL2013,
  author    = {Wolfgang Jans and Christian Knauer and Florian Langner and Wolfgang Middelmann},
  title     = {Advantages and Disadvantages of Training based Object Detection / Classification in SAS Images},
  booktitle = {POMA},
  year      = {2013},
  volume    = {17},
  number    = {070075},
  doi       = {10.1121/1.4789403}
}

# 2012

@inproceedings{conf/ECUA/FL2012,
  author    = {Wolfgang Jans and Christian Knauer and Florian Langner and Wolfgang Middelmann},
  title     = {Advantages and Disadvantages of Training based Object Detection / Classification in SAS Images},
  booktitle = {11th European Conference on Underwater Acoustics},
  year      = {2012},
  pages     = {1629--1636},
  volume    = {34},
  isbn      = {978-1-906913-13-7}
}

@article{journals/jocg/ChengKLS12,
  author    = {Siu-Wing Cheng and
               Christian Knauer and
               Stefan Langerman and
               Michiel H. M. Smid},
  title     = {Approximating the average stretch factor of geometric graphs},
  journal   = {JoCG},
  volume    = {3},
  number    = {1},
  year      = {2012},
  pages     = {132-153}
}

@article{journals/ijcga/AhnKSSV12,
  author    = {Hee-Kap Ahn and
               Christian Knauer and
               Marc Scherfenberg and
               Lena Schlipf and
               Antoine Vigneron},
  title     = {Computing the Discrete Fr{\'e}chet Distance with Imprecise
               Input},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {22},
  number    = {1},
  year      = {2012},
  pages     = {27-44},
  doi       = {10.1142/S0218195912600023}
}

@article{journals/jc/GiannopoulosKWW12,
  author    = {Panos Giannopoulos and
               Christian Knauer and
               Magnus Wahlstr{\"o}m and
               Daniel Werner},
  title     = {Hardness of discrepancy computation and eps-net verification
               in high dimension},
  journal   = {J. Complexity},
  volume    = {28},
  number    = {2},
  year      = {2012},
  pages     = {162-176},
  doi       = {10.1016/j.jco.2011.09.001}
}

@article{journals/jda/KnauerSST12,
  author    = {Christian Knauer and
               Lena Schlipf and
               Jens M. Schmidt and
               Hans Raj Tiwary},
  title     = {Largest inscribed rectangles in convex polygons},
  journal   = {J. Discrete Algorithms},
  volume    = {13},
  year      = {2012},
  pages     = {78-85},
  doi       = {10.1016/j.jda.2012.01.002}
}

# 2011

@article{journals/jocg/KnauerS11,
  author    = {Christian Knauer and
               Andreas Spillner},
  title     = {A fixed-parameter algorithm for the minimum Manhattan network
               problem},
  journal   = {JoCG},
  volume    = {2},
  number    = {1},
  year      = {2011},
  pages     = {189-204}
}


@article{journals/jgt/AlonHKPY11,
  author    = {Noga Alon and
               H. Tracy Hall and
               Christian Knauer and
               Rom Pinchasi and
               Raphael Yuster},
  title     = {On graphs and algebraic graphs that do not contain cycles
               of length 4},
  journal   = {Journal of Graph Theory},
  volume    = {68},
  number    = {2},
  year      = {2011},
  pages     = {91-102},
  doi       = {10.1002/jgt.20542}
}

@article{journals/talg/CabelloGKMR11,
  author    = {Sergio Cabello and
               Panos Giannopoulos and
               Christian Knauer and
               D{\'a}niel Marx and
               G{\"u}nter Rote},
  title     = {Geometric clustering: Fixed-parameter tractability and lower
               bounds with respect to the dimension},
  journal   = {ACM Transactions on Algorithms},
  volume    = {7},
  number    = {4},
  year      = {2011},
  pages     = {43},
  doi       = {10.1145/2000807.2000811}
}

@inproceedings{conf/isaac/AhnBKLSV11,
  author    = {Hee-Kap Ahn and
               Sang Won Bae and
               Christian Knauer and
               Mira Lee and
               Chan-Su Shin and
               Antoine Vigneron},
  title     = {Generating Realistic Roofs over a Rectilinear Polygon},
  booktitle = {ISAAC},
  year      = {2011},
  pages     = {60-69},
  doi       = {10.1007/978-3-642-25591-5_8},
  crossref  = {conf/isaac/2011}
}

@inproceedings{conf/isaac/AhnKKSSV11,
  author    = {Hee-Kap Ahn and
               Sang-Sub Kim and
               Christian Knauer and
               Lena Schlipf and
               Chan-Su Shin and
               Antoine Vigneron},
  title     = {Covering and Piercing Disks with Two Centers},
  booktitle = {ISAAC},
  year      = {2011},
  pages     = {50-59},
  doi       = {10.1007/978-3-642-25591-5_7},
  crossref  = {conf/isaac/2011}
}

@proceedings{conf/isaac/2011,
  editor    = {Takao Asano and
               Shin-Ichi Nakano and
               Yoshio Okamoto and
               Osamu Watanabe},
  title     = {Algorithms and Computation - 22nd International Symposium,
               ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings},
  booktitle = {ISAAC},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {7074},
  year      = {2011},
  isbn      = {978-3-642-25590-8},
  doi       = {10.1007/978-3-642-25591-5}
}

@inproceedings{conf/grapp/DimitrovHKK11,
  author    = {Darko Dimitrov and
               Mathias Holst and
               Christian Knauer and
               Klaus Kriegel},
  title     = {Efficient Dynamical Computation of Principal Components},
  booktitle = {GRAPP},
  year      = {2011},
  pages     = {85-93},
  crossref  = {conf/grapp/2011}
}

@proceedings{conf/grapp/2011,
  editor    = {Paul Richard and
               Jos{\'e} Braz},
  title     = {GRAPP 2011 - Proceedings of the International Conference
               on Computer Graphics Theory and Applications, Vilamoura,
               Algarve, Portugal, March 5-7, 2011},
  booktitle = {GRAPP},
  publisher = {SciTePress},
  year      = {2011},
  isbn      = {978-989-8425-45-4}
}

@inproceedings{conf/UAM/FL2011_2,
  author    = {Alfons Ebert and Wolfgang Jans and Christian Knauer and Florian Langner},
  title     = {Benefit for Classification by Automated Acoustic Data Fusion},
  booktitle = {Underwater Acoustics Measurements: Technologies and Results},
  year      = {2011},
  pages     = {115-122},
  isbn      = {978-960-98883-5-6}
}

@inproceedings{conf/UAM/FL2011_1,
  author    = {Wolfgang Jans and Christian Knauer and Florian Langner and Wolfgang Middelmann},
  title     = {Benefit for Screnning by Automated Acoustic Data Fusion},
  booktitle = {Underwater Acoustics Measurements: Technologies and Results},
  year      = {2011},
  pages     = {139-150},
  isbn      = {978-960-98883-5-6}
}

@inproceedings{conf/iccsa/KnauerKS11,
  author    = {Christian Knauer and
               Klaus Kriegel and
               Fabian Stehn},
  title     = {Non-uniform Geometric Matchings},
  booktitle = {ICCSA (3)},
  year      = {2011},
  pages     = {44-57},
  doi       = {10.1007/978-3-642-21931-3_4},
  crossref  = {conf/iccsa/2011-3}
}

@proceedings{conf/iccsa/2011-3,
  editor    = {Beniamino Murgante and
               Osvaldo Gervasi and
               Andr{\'e}s Iglesias and
               David Taniar and
               Bernady O. Apduhan},
  title     = {Computational Science and Its Applications - ICCSA 2011
               - International Conference, Santander, Spain, June 20-23,
               2011. Proceedings, Part III},
  booktitle = {ICCSA (3)},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {6784},
  year      = {2011},
  isbn      = {978-3-642-21930-6},
  doi       = {10.1007/978-3-642-21931-3}
}

@inproceedings{conf/stacs/KnauerTW11,
  author    = {Christian Knauer and
               Hans Raj Tiwary and
               Daniel Werner},
  title     = {On the computational complexity of Ham-Sandwich cuts, Helly
               sets, and related problems},
  booktitle = {STACS},
  year      = {2011},
  pages     = {649-660},
  doi       = {10.4230/LIPIcs.STACS.2011.649},
  crossref  = {conf/stacs/2011}
}

@proceedings{conf/stacs/2011,
  editor    = {Thomas Schwentick and
               Christoph D{\"u}rr},
  title     = {28th International Symposium on Theoretical Aspects of Computer
               Science, STACS 2011, March 10-12, 2011, Dortmund, Germany},
  booktitle = {STACS},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  series    = {LIPIcs},
  volume    = {9},
  year      = {2011},
  isbn      = {978-3-939897-25-5}
}

@inproceedings{conf/wads/ArkinDKMPSY11,
  author    = {Esther Arkin and
               Claudia Dieckmann and
               Christian Knauer and
               Joseph Mitchell and
               Valentin Polishchuk and
               Lena Schlipf and
               Shang Yang},
  title     = {Convex Transversals},
  booktitle = {WADS},
  year      = {2011},
  pages     = {49-60},
  doi       = {10.1007/978-3-642-22300-6_5},
  crossref  = {conf/wads/2011}
}
@proceedings{conf/wads/2011,
  editor    = {Frank Dehne and
               John Iacono and
               J{\"o}rg-R{\"u}diger Sack},
  title     = {Algorithms and Data Structures - 12th International Symposium,
               WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings},
  booktitle = {WADS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {6844},
  year      = {2011},
  isbn      = {978-3-642-22299-3},
  doi       = {10.1007/978-3-642-22300-6}
}

@article{journals/ijcga/BrassKNSV11,
  author    = {Peter Brass and
               Christian Knauer and
               Hyeon-Suk Na and
               Chan-Su Shin and
               Antoine Vigneron},
  title     = {The Aligned k-Center Problem},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {21},
  number    = {2},
  year      = {2011},
  pages     = {157-178},
  doi       = {10.1142/S0218195911003597}
}

@article{journals/ijcga/KnauerS11,
  author    = {Christian Knauer and
               Marc Scherfenberg},
  title     = {Approximate Nearest Neighbor Search under Translation Invariant
               Hausdorff Distance},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {21},
  number    = {3},
  year      = {2011},
  pages     = {369-381},
  doi       = {10.1142/S0218195911003706}
}

@article{journals/tcs/KnauerLSW11,
  author    = {Christian Knauer and
               Maarten L{\"o}ffler and
               Marc Scherfenberg and
               Thomas Wolle},
  title     = {The directed Hausdorff distance between imprecise point
               sets},
  journal   = {Theor. Comput. Sci.},
  volume    = {412},
  number    = {32},
  year      = {2011},
  pages     = {4173-4186},
  doi       = {10.1016/j.tcs.2011.01.039}
}

@article{journals/tcs/KnauerKS11,
  author    = {Christian Knauer and
               Klaus Kriegel and
               Fabian Stehn},
  title     = {Minimizing the weighted directed Hausdorff distance between
               colored point sets under translations and rigid motions},
  journal   = {Theor. Comput. Sci.},
  volume    = {412},
  number    = {4-5},
  year      = {2011},
  pages     = {375-382},
  doi       = {10.1016/j.tcs.2010.03.020}
}

# 2010

@phdthesis{DBLP:phd/de/Stehn2010,
  author = {Fabian Stehn},
  title  = {Geometric Hybrid Registration},
  school = {Freie Universit{\"{a}}t Berlin},
  year   = {2010},
  url    = {https://dblp.org/rec/phd/de/Stehn2010},
  urn    = {urn:nbn:de:kobv:188-fudissthesis000000021577-2}
}

@inproceedings{conf/UDT/FL2010,
  author    = {Wolfgang Jans and Christian Knauer and Florian Langner and Wolfgang Middelmann},
  title     = {Computer Aided Detection and Clasification of MLOs in Side Scan Sonar Images},
  booktitle = {UDT EUROPE 2010},
  year      = {2010},
  pages     = {1-8}
}

@inproceedings{conf/ECUA/WJ2010,
  author    = {Wolfgang Jans and Christian Knauer and Florian Langner and Wolfgang Middelmann},
  title     = {The effect of pre-processing on the outcome of an CAD/CAC system for underwater in SAS and conventional side scan images},
  booktitle = {10th European Conference on Underwater Acoustics},
  year      = {2010},
  pages     = {1262-1270},
  volume    = {3}
}

@inproceedings{conf/ECUA/FL2010,
  author    = {Alfons Ebert and Wolfgang Jans and Christian Knauer and Florian Langner},
  title     = {Performance gain by fusing classification resultes for differenet aspect angles in SAS side scan images},
  booktitle = {10th European Conference on Underwater Acoustics},
  year      = {2010},
  pages     = {1272-1277},
  volume    = {3}
}

@inproceedings{conf/isaac/ChengKLS10,
  author    = {Siu-Wing Cheng and
               Christian Knauer and
               Stefan Langerman and
               Michiel H. M. Smid},
  title     = {Approximating the Average Stretch Factor of Geometric Graphs},
  booktitle = {ISAAC (1)},
  year      = {2010},
  pages     = {37-48},
  doi       = {10.1007/978-3-642-17517-6_6},
  crossref  = {conf/isaac/2010-1}
}

@inproceedings{conf/isaac/AhnKSSV10,
  author    = {Hee-Kap Ahn and
               Christian Knauer and
               Marc Scherfenberg and
               Lena Schlipf and
               Antoine Vigneron},
  title     = {Computing the Discrete Fr{\'e}chet Distance with Imprecise
               Input},
  booktitle = {ISAAC (2)},
  year      = {2010},
  pages     = {422-433},
  doi       = {10.1007/978-3-642-17514-5_36},
  crossref  = {conf/isaac/2010-2}
}

@proceedings{conf/isaac/2010-2,
  editor    = {Otfried Cheong and
               Kyung-Yong Chwa and
               Kunsoo Park},
  title     = {Algorithms and Computation - 21st International Symposium,
               ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings,
               Part II},
  booktitle = {ISAAC (2)},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {6507},
  year      = {2010},
  isbn      = {978-3-642-17513-8},
  doi       = {10.1007/978-3-642-17514-5},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

@proceedings{conf/tamc/2010,
  editor    = {Jan Kratochv\'{\i}l and
               Angsheng Li and
               Jir\'{\i} Fiala and
               Petr Kolman},
  title     = {Theory and Applications of Models of Computation, 7th Annual
               Conference, TAMC 2010, Prague, Czech Republic, June 7-11,
               2010. Proceedings},
  booktitle = {TAMC},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {6108},
  year      = {2010},
  isbn      = {978-3-642-13561-3},
  doi       = {10.1007/978-3-642-13562-0}
}

@inproceedings{conf/tamc/The_Complexity_of_Geometric_Problems_in_High_Dimension,
  author    = {Christian Knauer},
  title     = {The Complexity of Geometric Problems in High Dimension},
  booktitle = {TAMC},
  year      = {2010},
  pages     = {40-49},
  doi       = {10.1007/978-3-642-13562-0_5},
  crossref  = {conf/tamc/2010},
  url       = {http://www.ai6.uni-bayreuth.de/uploads/pdf/The_Complexity_of_Geometric_Problems_in_High_Dimension.pdf}
}

@article{journals/comgeo/Covering_a_simple_polygon_by_monotone_directions,
  author    = {Hee-Kap Ahn and
               Peter Brass and
               Christian Knauer and
               Hyeon-Suk Na and
               Chan-Su Shin},
  title     = {Covering a simple polygon by monotone directions},
  journal   = {Comput. Geom.},
  volume    = {43},
  number    = {5},
  year      = {2010},
  pages     = {514-523},
  doi       = {10.1016/j.comgeo.2009.11.002},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

@article{journals/ijcga/Dilation-Optimal_Edge_Deletion_in_Polygonal_Cycles,
  author    = {Hee-Kap Ahn and
               Mohammad Farshi and
               Christian Knauer and
               Michiel Smid and
               Yajun Wang},
  title     = {Dilation-Optimal Edge Deletion in Polygonal Cycles},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {20},
  number    = {1},
  year      = {2010},
  pages     = {69-87},
  doi       = {10.1142/S0218195910003207},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

@article{journals/ijcga/Computing_Geometric_Minimum-Dilation_Graphs_is_NP-Hard,
  author    = {Panos Giannopoulos and
               Rolf Klein and
               Christian Knauer and
               Martin Kutz and
               D{\'a}niel Marx},
  title     = {Computing Geometric Minimum-Dilation Graphs is NP-Hard},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {20},
  number    = {2},
  year      = {2010},
  pages     = {147-173},
  doi       = {10.1142/S0218195910003244},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

# 2009

@inproceedings{conf/esa/AckermanPSS09,
  author    = {Eyal Ackerman and
               Rom Pinchasi and
               Ludmila Scharf and
               Marc Scherfenberg},
  title     = {On Inducing Polygons and Related Problems},
  booktitle = {ESA},
  year      = {2009},
  pages     = {47-58},
  doi       = {10.1007/978-3-642-04128-0_5},
  crossref  = {conf/esa/2009},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

@inproceedings{conf/wea/CheongGKSS09,
  author    = {Otfried Cheong and
               Joachim Gudmundsson and
               Hyo-Sil Kim and
               Daria Schymura and
               Fabian Stehn},
  title     = {Measuring the Similarity of Geometric Graphs},
  booktitle = {SEA},
  year      = {2009},
  pages     = {101-112},
  doi       = {10.1007/978-3-642-02011-7_11},
  crossref  = {conf/wea/2009}
}

@proceedings{conf/wea/2009,
  editor    = {Jan Vahrenhold},
  title     = {Experimental Algorithms, 8th International Symposium, SEA
               2009, Dortmund, Germany, June 4-6, 2009. Proceedings},
  booktitle = {SEA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {5526},
  year      = {2009},
  isbn      = {978-3-642-02010-0},
  doi       = {10.1007/978-3-642-02011-7}
}

@inproceedings{conf/UAM/FL2009,
  author    = {Wolfgang Jans and Christian Knauer and Florian Langner and Wolfgang Middelmann},
  title     = {Image processing in side scan sonar images for object detection and classification},
  booktitle = {Underwater Acoustic Measurments: Technologies & Results},
  year      = {2009},
  pages     = {311-318},
  isbn      = {978-960-98883-4-9}
}

@inproceedings{conf/OCEANS/FL2009,
  author    = {Alfons Ebert and Wolfgang Jans and Christian Knauer and Florian Langner},
  title     = {Side scan sonar image resolution and automatic object detection, classification and identification},
  booktitle = {OCEANS 2009 - EUROPE},
  year      = {2009},
  pages     = {1-8},
  doi       = {10.1109/OCEANS.2009.5278183}
}

@proceedings{conf/faw/2009,
  editor    = {Xiaotie Deng and
               John E. Hopcroft and
               Jinyun Xue},
  title     = {Frontiers in Algorithmics, Third International Workshop,
               FAW 2009, Hefei, China, June 20-23, 2009. Proceedings},
  booktitle = {FAW},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {5598},
  year      = {2009},
  isbn      = {978-3-642-02269-2},
  doi       = {10.1007/978-3-642-02270-8}
}

@proceedings{conf/isaac/2009,
  editor    = {Yingfei Dong and
               Ding-Zhu Du and
               Oscar H. Ibarra},
  title     = {Algorithms and Computation, 20th International Symposium,
               ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009.
               Proceedings},
  booktitle = {ISAAC},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {5878},
  year      = {2009},
  isbn      = {978-3-642-10630-9},
  doi       = {10.1007/978-3-642-10631-6}
}

@proceedings{conf/iwpec/2009,
  editor    = {Jianer Chen and
               Fedor V. Fomin},
  title     = {Parameterized and Exact Computation, 4th International Workshop,
               IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009,
               Revised Selected Papers},
  booktitle = {IWPEC},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {5917},
  year      = {2009},
  isbn      = {978-3-642-11268-3},
  doi       = {10.1007/978-3-642-11269-0}
}

@inproceedings{conf/faw/Minimizing_the_Weighted_Directed_Hausdorff_Distance_between_Colored_Point_Sets_under_Translations_and_Rigid_Motions,
  author    = {Christian Knauer and
               Klaus Kriegel and
               Fabian Stehn},
  title     = {Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions},
  booktitle = {FAW},
  year      = {2009},
  pages     = {108-119},
  doi       = {10.1007/978-3-642-02270-8_13},
  crossref  = {conf/faw/2009},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

@inproceedings{conf/isaac/The_Directed_Hausdorff_Distance_between_Imprecise_Point_Sets,
  author    = {Christian Knauer and
               Maarten L{\"o}ffler and
               Marc Scherfenberg and
               Thomas Wolle},
  title     = {The Directed Hausdorff Distance between Imprecise Point Sets},
  booktitle = {ISAAC},
  year      = {2009},
  pages     = {720-729},
  doi       = {10.1007/978-3-642-10631-6_73},
  crossref  = {conf/isaac/2009},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

@inproceedings{conf/iwpec/The_Parameterized_Complexity_of_Some_Geometric_Problems_in_Unbounded_Dimension,
  author    = {Panos Giannopoulos and
               Christian Knauer and
               G{\"u}nter Rote},
  title     = {The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension},
  booktitle = {IWPEC},
  year      = {2009},
  pages     = {198-209},
  doi       = {10.1007/978-3-642-11269-0_16},
  crossref  = {conf/iwpec/2009},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

@article{journals/comgeo/Bounds_on_the_quality_of_the_PCA_bounding_boxes,
  author    = {Darko Dimitrov and
               Christian Knauer and
               Klaus Kriegel and
               G{\"u}nter Rote},
  title     = {Bounds on the quality of the PCA bounding boxes},
  journal   = {Comput. Geom.},
  volume    = {42},
  number    = {8},
  year      = {2009},
  pages     = {772-789},
  doi       = {10.1016/j.comgeo.2008.02.007},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

@article{journals/comgeo/Algorithms_for_graphs_of_bounded_treewidth_via_orthogonal_range_searching,
  author    = {Sergio Cabello and
               Christian Knauer},
  title     = {Algorithms for graphs of bounded treewidth via orthogonal range searching},
  journal   = {Comput. Geom.},
  volume    = {42},
  number    = {9},
  year      = {2009},
  pages     = {815-824},
  doi       = {10.1016/j.comgeo.2009.02.001},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

@article{journals/comgeo/On_the_dilation_spectrum_of_paths,_cycles,_and_trees,
  author    = {Rolf Klein and
               Christian Knauer and
               Giri Narasimhan and
               Michiel Smid},
  title     = {On the dilation spectrum of paths, cycles, and trees},
  journal   = {Comput. Geom.},
  volume    = {42},
  number    = {9},
  year      = {2009},
  pages     = {923-933},
  doi       = {10.1016/j.comgeo.2009.03.004},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

@article{journals/ijcga/A_Polynomial-Time_Approximation_Algorithm_for_a_Geometric_Dispersion_Problem,
  author    = {Marc Benkert and
               Joachim Gudmundsson and
               Christian Knauer and
               Ren{\'e} van Oostrum and
               Alexander Wolff},
  title     = {A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {19},
  number    = {3},
  year      = {2009},
  pages     = {267-288},
  doi       = {10.1142/S0218195909002952},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

@article{journals/ijcga/Maximizing_the_Area_of_Overlap_of_Two_Unions_of_Disks_under_Rigid_Motion,
  author    = {Sergio Cabello and
               Mark de Berg and
               Panos Giannopoulos and
               Christian Knauer and
               Ren{\'e} van Oostrum and
               Remco C. Veltkamp},
  title     = {Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {19},
  number    = {6},
  year      = {2009},
  pages     = {533-556},
  doi       = {10.1142/S0218195909003118},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

@article{journals/ijfcs/Constructing_Optimal_Highways,
  author    = {Hee-Kap Ahn and
               Helmut Alt and
               Tetsuo Asano and
               Sang Won Bae and
               Peter Brass and
               Otfried Cheong and
               Christian Knauer and
               Hyeon-Suk Na and
               Chan-Su Shin and
               Alexander Wolff},
  title     = {Constructing Optimal Highways},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {20},
  number    = {1},
  year      = {2009},
  pages     = {3-23},
  doi       = {10.1142/S0129054109006425},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

# 2008

@inproceedings{conf/visapp/DimitrovKKS08,
  author    = {Darko Dimitrov and
               Christian Knauer and
               Klaus Kriegel and
               Fabian Stehn},
  title     = {Approximate Point-to-Surface Registration with a Single
               Characteristic Point},
  booktitle = {VISAPP (1)},
  year      = {2008},
  pages     = {188-195},
  crossref  = {conf/visapp/2008-1}
}

@proceedings{conf/visapp/2008-1,
  editor    = {Alpesh Ranchordas and
               Helder Ara{\'u}jo},
  title     = {VISAPP 2008: Proceedings of the Third International Conference
               on Computer Vision Theory and Applications, Funchal, Madeira,
               Portugal, January 22-25, 2008 - Volume 1},
  booktitle = {VISAPP (1)},
  publisher = {INSTICC - Institute for Systems and Technologies of Information,
               Control and Communication},
  year      = {2008},
  isbn      = {978-989-8111-21-0}
}

@inproceedings{conf/isaac/Approximate_Nearest_Neighbor_Search_under_Translation_Invariant_Hausdorff_Distance,
  author    = {Christian Knauer and
               Marc Scherfenberg},
  title     = {Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance},
  booktitle = {ISAAC},
  year      = {2008},
  pages     = {532-543},
  doi       = {10.1007/978-3-540-92182-0_48},
  crossref  = {conf/isaac/2008},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

@inproceedings{conf/isaac/ScharfS08,
  author    = {Ludmila Scharf and
               Marc Scherfenberg},
  title     = {Inducing Polygons of Line Arrangements},
  booktitle = {ISAAC},
  year      = {2008},
  pages     = {507-519},
  doi       = {10.1007/978-3-540-92182-0_46},
  crossref  = {conf/isaac/2008},
  urlx      = {http://www.ai6.uni-bayreuth.de/uploads/pdf/.pdf}
}

# 2007

@inproceedings{conf/faw/DimitrovKKS07,
  author    = {Darko Dimitrov and
               Christian Knauer and
               Klaus Kriegel and
               Fabian Stehn},
  title     = {Approximation Algorithms for a Point-to-Surface Registration
               Problem in Medical Navigation},
  booktitle = {FAW},
  year      = {2007},
  pages     = {26-37},
  doi       = {10.1007/978-3-540-73814-5_3},
  crossref  = {conf/faw/2007}
}

@proceedings{conf/faw/2007,
  editor    = {Franco P. Preparata and
               Qizhi Fang},
  title     = {Frontiers in Algorithmics, First Annual International Workshop,
               FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings},
  booktitle = {FAW},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {4613},
  year      = {2007},
  isbn      = {978-3-540-73813-8}
}