default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Knauer
Person information
- affiliation: University of Bayreuth, Germany
- affiliation (former): Free University of Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c61]Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, Christian Knauer:
Geometric Matching and Bottleneck Problems. SoCG 2024: 31:1-31:15- 2023
- [i26]Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, Christian Knauer:
Geometric Assignment and Geometric Bottleneck. CoRR abs/2310.02637 (2023) - 2022
- [j54]Maximilian Reischl
, Christian Knauer, Michael Guthe:
Parallel near-optimal pathfinding based on landmarks. Comput. Graph. 102: 1-8 (2022) - 2020
- [j53]Mark de Berg, Christian Knauer:
Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons. J. Comput. Geom. 11(1): 653-655 (2020) - [c60]Lukas Strey, Christian Hein, Tom Ritter, Christian Knauer, Angelika Ganz:
Modellbasierte Methode zur Ableitung nicht-funktionaler Anforderungen im Kontext der Softwaremodernisierung. Modellierung 2020: 125-140 - [c59]Maximilian Reischl, Christian Knauer, Michael Guthe:
Using Landmarks for Near-Optimal Pathfinding on the CPU and GPU. PG (Short Papers, Posters, and Work-in-Progress Papers) 2020: 37-42
2010 – 2019
- 2019
- [j52]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) - [j51]Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer:
Covering many points with a small-area box. J. Comput. Geom. 10(1): 207-222 (2019) - [j50]Annette Ebbers-Baumann, Rolf Klein, Christian Knauer, Günter Rote:
The geometric dilation of three points. J. Comput. Geom. 10(1): 532-549 (2019) - 2018
- [j49]Christian Knauer, Luise Sommer, Fabian Stehn:
Elastic geometric shape matching for translations under the Manhattan norm. Comput. Geom. 73: 57-69 (2018) - [j48]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your coins on a shelf. J. Comput. Geom. 9(1): 312-327 (2018) - [c58]Christian Knauer, Luise Sommer, Fabian Stehn:
An FPTAS for an Elastic Shape Matching Problem with Cyclic Neighborhoods. ICCSA (2) 2018: 425-443 - [p1]Joachim Gudmundsson, Christian Knauer:
Dilation and Detours in Geometric Networks. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - 2017
- [j47]Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer:
Minimum Cell Connection in Line Segment Arrangements. Int. J. Comput. Geom. Appl. 27(3): 159-176 (2017) - [j46]Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn:
Top-k Manhattan spatial skyline queries. Inf. Process. Lett. 123: 27-35 (2017) - [j45]Helmut Alt, Mark de Berg, Christian Knauer:
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. J. Comput. Geom. 8(1): 1-10 (2017) - [c57]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your Coins on a Shelf. ISAAC 2017: 4:1-4:12 - [i25]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your Coins on a Shelf. CoRR abs/1707.01239 (2017) - 2016
- [j44]Sergio Cabello, Otfried Cheong, Christian Knauer, Lena Schlipf:
Finding largest rectangles in convex polygons. Comput. Geom. 51: 67-74 (2016) - [j43]Christian Knauer, Michiel H. M. Smid:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 26(3-4): 0-134 (2016) - [j42]Valentin Polishchuk, Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Günter Rote, Lena Schlipf, Topi Talvitie:
Shortest path to a segment and quickest visibility queries. J. Comput. Geom. 7(2): 77-100 (2016) - [i24]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) - [i23]Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer:
Covering many points with a small-area box. CoRR abs/1612.02149 (2016) - 2015
- [j41]Christian Knauer, Stefan König, Daniel Werner:
Fixed-Parameter Complexity and Approximability of Norm Maximization. Discret. Comput. Geom. 53(2): 276-295 (2015) - [c56]Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Günter Rote, Lena Schlipf, Topi Talvitie:
Shortest Path to a Segment and Quickest Visibility Queries. SoCG 2015: 658-673 - [c55]Helmut Alt, Mark de Berg, Christian Knauer:
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. ESA 2015: 25-34 - [c54]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 - [c53]Christian Knauer, Fabian Stehn:
Elastic Geometric Shape Matching for Point Sets under Translations. WADS 2015: 578-592 - [i22]Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk:
Fréchet Distance for Curves, Revisited. CoRR abs/1504.07685 (2015) - 2014
- [j40]Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang:
Convex transversals. Comput. Geom. 47(2): 224-239 (2014) - [c52]Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn:
Top-k Manhattan Spatial Skyline Queries. WALCOM 2014: 22-33 - 2013
- [j39]Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron:
Covering and piercing disks with two centers. Comput. Geom. 46(3): 253-262 (2013) - [j38]Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner:
Fixed-parameter tractability and lower bounds for stabbing problems. Comput. Geom. 46(7): 839-860 (2013) - [j37]Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron:
Realistic roofs over a rectilinear polygon. Comput. Geom. 46(9): 1042-1055 (2013) - [c51]Peter Brass, Christian Knauer, Chan-Su Shin, Michiel H. M. Smid, Ivo Vigan:
Range-Aggregate Queries for Geometric Extent Problems. CATS 2013: 3-10 - [c50]Panos Giannopoulos, Christian Knauer, Daniel Werner:
On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3. ESA 2013: 541-552 - [i21]Panos Giannopoulos, Christian Knauer:
Finding a largest empty convex subset in space is W[1]-hard. CoRR abs/1304.0247 (2013) - [i20]Christian Knauer, Stefan König, Daniel Werner:
Fixed Parameter Complexity and Approximability of Norm Maximization. CoRR abs/1307.6414 (2013) - 2012
- [j36]Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron:
Computing the Discrete FRéChet Distance with Imprecise Input. Int. J. Comput. Geom. Appl. 22(1): 27-44 (2012) - [j35]Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner:
Hardness of discrepancy computation and ε-net verification in high dimension. J. Complex. 28(2): 162-176 (2012) - [j34]Christian Knauer, Lena Schlipf, Jens M. Schmidt, Hans Raj Tiwary:
Largest inscribed rectangles in convex polygons. J. Discrete Algorithms 13: 78-85 (2012) - [j33]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) - [i19]Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron:
Covering and Piercing Disks with Two Centers. CoRR abs/1201.1198 (2012) - 2011
- [j32]Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron:
The Aligned k-Center Problem. Int. J. Comput. Geom. Appl. 21(2): 157-178 (2011) - [j31]Christian Knauer, Marc Scherfenberg:
Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance. Int. J. Comput. Geom. Appl. 21(3): 369-381 (2011) - [j30]Noga Alon, H. Tracy Hall, Christian Knauer, Rom Pinchasi, Raphael Yuster:
On graphs and algebraic graphs that do not contain cycles of length 4. J. Graph Theory 68(2): 91-102 (2011) - [j29]Christian Knauer, Andreas Spillner:
A fixed-parameter algorithm for the minimum Manhattan network problem. J. Comput. Geom. 2(1): 189-204 (2011) - [j28]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote:
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. ACM Trans. Algorithms 7(4): 43:1-43:27 (2011) - [j27]Christian Knauer, Klaus Kriegel, Fabian Stehn:
Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions. Theor. Comput. Sci. 412(4-5): 375-382 (2011) - [j26]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle:
The directed Hausdorff distance between imprecise point sets. Theor. Comput. Sci. 412(32): 4173-4186 (2011) - [c49]Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel:
Efficient Dynamical Computation of Principal Components. GRAPP 2011: 85-93 - [c48]Christian Knauer, Klaus Kriegel, Fabian Stehn:
Non-uniform Geometric Matchings. ICCSA (3) 2011: 44-57 - [c47]Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron:
Covering and Piercing Disks with Two Centers. ISAAC 2011: 50-59 - [c46]Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron:
Generating Realistic Roofs over a Rectilinear Polygon. ISAAC 2011: 60-69 - [c45]Christian Knauer, Hans Raj Tiwary, Daniel Werner:
On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems. STACS 2011: 649-660 - [c44]Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang:
Convex Transversals. WADS 2011: 49-60 - [i18]Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner:
Hardness of discrepancy computation and epsilon-net verification in high dimension. CoRR abs/1103.4503 (2011) - [i17]Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer:
Minimum cell connection and separation in line segment arrangements. CoRR abs/1104.4618 (2011) - [i16]Christian Knauer, Daniel Werner:
Erdős-Szekeres and Testing Weak epsilon-Nets are NP-hard in 3 dimensions - and what now? CoRR abs/1111.5979 (2011) - 2010
- [j25]Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin:
Covering a simple polygon by monotone directions. Comput. Geom. 43(5): 514-523 (2010) - [j24]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) - [j23]Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx:
Computing Geometric Minimum-Dilation Graphs is NP-Hard. Int. J. Comput. Geom. Appl. 20(2): 147-173 (2010) - [j22]Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote:
Acyclic Orientation of Drawings. J. Graph Algorithms Appl. 14(2): 367-384 (2010) - [c43]Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid:
Approximating the Average Stretch Factor of Geometric Graphs. ISAAC (1) 2010: 37-48 - [c42]Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron:
Computing the Discrete Fréchet Distance with Imprecise Input. ISAAC (2) 2010: 422-433 - [c41]Christian Knauer:
The Complexity of Geometric Problems in High Dimension. TAMC 2010: 40-49 - [c40]Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu:
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. WG 2010: 123-134
2000 – 2009
- 2009
- [j21]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote:
Bounds on the quality of the PCA bounding boxes. Comput. Geom. 42(8): 772-789 (2009) - [j20]Sergio Cabello, Christian Knauer:
Algorithms for graphs of bounded treewidth via orthogonal range searching. Comput. Geom. 42(9): 815-824 (2009) - [j19]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) - [j18]Marc Benkert, Joachim Gudmundsson, Christian Knauer, René van Oostrum, Alexander Wolff:
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. Int. J. Comput. Geom. Appl. 19(3): 267-288 (2009) - [j17]Sergio Cabello, Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp:
Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. Int. J. Comput. Geom. Appl. 19(6): 533-556 (2009) - [j16]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. Int. J. Found. Comput. Sci. 20(1): 3-23 (2009) - [c39]Christian Knauer, Klaus Kriegel, Fabian Stehn:
Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions. FAW 2009: 108-119 - [c38]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle:
The Directed Hausdorff Distance between Imprecise Point Sets. ISAAC 2009: 720-729 - [c37]Panos Giannopoulos, Christian Knauer, Günter Rote:
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. IWPEC 2009: 198-209 - [e1]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] - [i15]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 - [i14]Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron:
Computing k-Centers On a Line. CoRR abs/0902.3282 (2009) - [i13]Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner:
The parameterized complexity of some geometric problems in unbounded dimension. CoRR abs/0906.3469 (2009) - [i12]Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner:
Fixed-parameter tractability and lower bounds for stabbing problems. CoRR abs/0906.3896 (2009) - [i11]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle:
The directed Hausdorff distance between imprecise point sets. CoRR abs/0909.4642 (2009) - [i10]Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu:
Abstract Milling with Turn Costs. CoRR abs/0912.1050 (2009) - [i9]Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel:
Computing Principal Components Dynamically. CoRR abs/0912.5380 (2009) - 2008
- [j15]Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides:
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica 52(2): 167-176 (2008) - [j14]Panos Giannopoulos, Christian Knauer, Sue Whitesides:
Parameterized Complexity of Geometric Problems. Comput. J. 51(3): 372-384 (2008) - [j13]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching point sets with respect to the Earth Mover's Distance. Comput. Geom. 39(2): 118-133 (2008) - [j12]Esther Moet, Christian Knauer, Marc J. van Kreveld:
Visibility maps of segments and triangles in 3D. Comput. Geom. 39(3): 163-177 (2008) - [j11]Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote:
There Are Not Too Many Magic Configurations. Discret. Comput. Geom. 39(1-3): 3-16 (2008) - [j10]Pankaj K. Agarwal, Rolf Klein, Christian Knauer, Stefan Langerman, Pat Morin, Micha Sharir, Michael A. Soss:
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. Discret. Comput. Geom. 39(1-3): 17-37 (2008) - [j9]Sergio Cabello, Panos Giannopoulos, Christian Knauer:
On the parameterized complexity of d-dimensional point set pattern matching. Inf. Process. Lett. 105(2): 73-77 (2008) - [c36]Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel:
Experimental Study of Bounding Box Algorithms. GRAPP 2008: 15-22 - [c35]Christian Knauer, Marc Scherfenberg:
Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance. ISAAC 2008: 532-543 - [c34]Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin:
Covering a Simple Polygon by Monotone Directions. ISAAC 2008: 668-679 - [c33]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. SODA 2008: 836-843 - [c32]Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel:
Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms. VISIGRAPP (Selected Papers) 2008: 26-40 - [c31]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn:
Approximate Point-to-Surface Registration with a Single Characteristic Point. VISAPP (1) 2008: 188-195 - 2007
- [j8]Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff:
Configurations with few crossings in topological graphs. Comput. Geom. 37(2): 104-114 (2007) - [j7]Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Marek Karpinski, Christian Knauer, Andrzej Lingas:
Embedding Point Sets into Plane Graphs of Small Dilation. Int. J. Comput. Geom. Appl. 17(3): 201-230 (2007) - [c30]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. CATS 2007: 7-14 - [c29]Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor P. Fekete, Christian Knauer, André Schulz, Perouz Taslakian:
On Rolling Cube Puzzles. CCCG 2007: 141-144 - [c28]Trung Nguyen, Jean-Daniel Boissonnat, Frédéric Falzon, Christian Knauer:
A Disk-Covering Problem with Application in Optical Interferometry. CCCG 2007: 173-176 - [c27]Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel:
On the Number of Cycles in Planar Graphs. COCOON 2007: 97-107 - [c26]Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote:
There are not too many magic configurations. SCG 2007: 142-149 - [c25]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote:
New upper bounds on the quality of the PCA bounding boxes in r2 and r3. SCG 2007: 275-283 - [c24]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn:
Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation. FAW 2007: 26-37 - [c23]Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang:
Dilation-Optimal Edge Deletion in Polygonal Cycles. ISAAC 2007: 88-99 - [c22]Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama:
Fixed-Parameter Tractability for Non-Crossing Spanning Trees. WADS 2007: 410-421 - [r1]Joachim Gudmundsson, Christian Knauer:
Dilation and Detours in Geometric Networks. Handbook of Approximation Algorithms and Metaheuristics 2007 - [i8]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. CoRR abs/cs/0703037 (2007) - 2006
- [j6]Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin:
Guarding Art Galleries by Guarding Witnesses. Int. J. Comput. Geom. Appl. 16(2-3): 205-226 (2006) - [c21]Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff:
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. COCOON 2006: 166-175 - [c20]Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey:
Minimum-cost coverage of point sets by disks. SCG 2006: 449-458 - [c19]Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk:
Fréchet Distance for Curves, Revisited. ESA 2006: 52-63 - [c18]Esther Moet, Christian Knauer, Marc J. van Kreveld:
Visibility Maps of Segments and Triangles in 3D. ICCSA (1) 2006: 20-29 - [c17]Sergio Cabello, Panos Giannopoulos, Christian Knauer:
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching. IWPEC 2006: 175-183 - [c16]Christian Knauer, Andreas Spillner:
Approximation Algorithms for the Minimum Convex Partition Problem. SWAT 2006: 232-241 - [c15]Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote:
Acyclic Orientation of Drawings. SWAT 2006: 268-279 - [c14]Darko Dimitrov, Christian Knauer, Klaus Kriegel:
Registration of 3D - patterns and shapes with characteristic points. VISAPP (1) 2006: 393-400 - [c13]Christian Knauer, Andreas Spillner:
A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators. WG 2006: 49-57 - [i7]Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey:
Minimum-Cost Coverage of Point Sets by Disks. CoRR abs/cs/0604008 (2006) - [i6]Trung Nguyen, Jean-Daniel Boissonnat, Frédéric Falzon, Christian Knauer:
A disk-covering problem with application in optical interferometry. CoRR abs/cs/0612026 (2006) - 2005
- [c12]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching Point Sets with Respect to the Earth Mover's Distance. ESA 2005: 520-531 - [c11]Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas:
Embedding Point Sets into Plane Graphs of Small Dilation. ISAAC 2005: 5-16 - [c10]Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff:
Configurations with Few Crossings in Topological Graphs. ISAAC 2005: 604-613 - [c9]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 - [i5]Christian Knauer, Wolfgang Mulzer:
An exclusion region for minimum dilation triangulations. EuroCG 2005: 33-36 - [i4]Darko Dimitrov, Christian Knauer, Klaus Kriegel:
Matching surfaces with characteristic points. EuroCG 2005: 49-51 - [i3]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching point sets with respect to the Earth mover's distance. EuroCG 2005: 57-60 - [i2]Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff:
Spanning trees with few crossings in geometric and topological graphs. EuroCG 2005: 195-198 - 2004
- [j5]Helmut Alt, Christian Knauer, Carola Wenk:
Comparison of Distance Measures for Planar Curves. Algorithmica 38(1): 45-58 (2004) - [j4]Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk:
Covering with Ellipses. Algorithmica 38(1): 145-160 (2004) - [j3]Peter Braß, Christian Knauer:
Testing congruence and symmetry for general 3-dimensional objects. Comput. Geom. 27(1): 3-11 (2004) - [c8]Sven Schönherr, Robert Günzler, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Udo Warschewske:
Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation. Bildverarbeitung für die Medizin 2004: 229-233 - [c7]Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides:
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. ESA 2004: 311-322 - [c6]Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin:
Guarding Art Galleries by Guarding Witnesses. ISAAC 2004: 352-363 - [c5]Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp:
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion. SWAT 2004: 138-149 - 2003
- [j2]Peter Braß, Christian Knauer:
On counting point-hyperplane incidences. Comput. Geom. 25(1-2): 13-20 (2003) - [c4]Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides:
The complexity of (un)folding. SCG 2003: 164-170 - 2002
- [j1]Peter Braß, Christian Knauer:
Testing the Congruence of d-Dimensional Point Sets. Int. J. Comput. Geom. Appl. 12(1-2): 115-124 (2002) - [c3]Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk:
Covering shapes by ellipses. SODA 2002: 453-454 - 2001
- [c2]Helmut Alt, Christian Knauer, Carola Wenk:
Matching Polygonal Curves with Respect to the Fréchet Distance. STACS 2001: 63-74 - 2000
- [c1]Peter Braß, Christian Knauer:
Testing the congruence of d-dimensional point sets. SCG 2000: 310-314 - [i1]Peter Braß, Christian Knauer:
Testing the Congruence of d-Dimensional Point Sets. EuroCG 2000: 104-107
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-10-07 22:07 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:
