Back to the CG Workshops home page
Publications of Christian Knauer
BACK TO INDEX
Publications of Christian Knauer
|
-
Helmut Alt,
Sergio Cabello,
Panos Giannopoulos,
and Christian Knauer.
Minimum cell connection and separation in line segment arrangements.
CoRR,
abs/1104.4618,
2011.
[bibtex-entry]
-
Michael R. Fellows,
Panos Giannopoulos,
Christian Knauer,
Christophe Paul,
Frances A. Rosamond,
Sue Whitesides,
and Nathan Yu.
Abstract Milling with Turn Costs.
CoRR,
abs/0912.1050,
2009.
[bibtex-entry]
-
Michael R. Fellows,
Christian Knauer,
Naomi Nishimura,
Prabhakar Ragde,
Frances A. Rosamond,
Ulrike Stege,
Dimitrios M. Thilikos,
and Sue Whitesides.
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
Algorithmica,
52(2):167-176,
2008.
[bibtex-entry]
-
Esther M. Arkin,
Hervé Brönnimann,
Jeff Erickson,
Sándor P. Fekete,
Christian Knauer,
Jonathan Lenchner,
Joseph S. B. Mitchell,
and Kim Whittlesey.
Minimum-Cost Coverage of Point Sets by Disks.
CoRR,
abs/cs/0604008,
2006.
[bibtex-entry]
-
Helmut Alt,
Mark de Berg,
and Christian Knauer.
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,
pages 25--34,
2015.
[WWW
] [bibtex-entry]
-
Mike R. Fellows,
Panos Giannopoulos,
Christian Knauer,
Christophe Paul,
Frances A. Rosamond,
Sue Whitesides,
and Nathan Yu.
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective.
In WG,
pages 123-134,
2010.
[bibtex-entry]
-
Helmut Alt,
Sergio Cabello,
Panos Giannopoulos,
and Christian Knauer.
On some connection problems in straight-line segment arrangements.
In 24th European Workshop on Computational Geometry (EuroCG'08),
2008.
[bibtex-entry]
-
Helmut Alt,
Esther M. Arkin,
Hervé Brönnimann,
Jeff Erickson,
Sándor P. Fekete,
Christian Knauer,
Jonathan Lenchner,
Joseph S. B. Mitchell,
and Kim Whittlesey.
Minimum-cost coverage of point sets by disks.
In Symposium on Computational Geometry -- SoCG'06,
pages 449-458,
2006.
[bibtex-entry]
-
Michael R. Fellows,
Christian Knauer,
Naomi Nishimura,
Prabhakar Ragde,
Frances A. Rosamond,
Ulrike Stege,
Dimitrios M. Thilikos,
and Sue Whitesides.
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
In ESA,
pages 311-322,
2004.
[bibtex-entry]
BACK TO INDEX
Disclaimer:
This material is presented to ensure timely dissemination of
scholarly and technical work. Copyright and all rights therein
are retained by authors or by other copyright holders.
All person copying this information are expected to adhere to
the terms and constraints invoked by each author's copyright.
In most cases, these works may not be reposted
without the explicit permission of the copyright holder.
Les documents contenus dans ces répertoires sont rendus disponibles
par les auteurs qui y ont contribué en vue d'assurer la diffusion
à temps de travaux savants et techniques sur une base non-commerciale.
Les droits de copie et autres droits sont gardés par les auteurs
et par les détenteurs du copyright, en dépit du fait qu'ils présentent
ici leurs travaux sous forme électronique. Les personnes copiant ces
informations doivent adhérer aux termes et contraintes couverts par
le copyright de chaque auteur. Ces travaux ne peuvent pas être
rendus disponibles ailleurs sans la permission explicite du détenteur
du copyright.
Last modified: Mon May 6 10:32:26 2019
Author: lazard.
This document was translated from BibTEX by
bibtex2html