<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Marc Benkert | AC Group | TU Wien</title><link>https://ac.notready.eu/author/marc-benkert/</link><atom:link href="https://ac.notready.eu/author/marc-benkert/index.xml" rel="self" type="application/rss+xml"/><description>Marc Benkert</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 01 Jan 2009 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Marc Benkert</title><link>https://ac.notready.eu/author/marc-benkert/</link></image><item><title>Algorithms for Multi-Criteria Boundary Labeling</title><link>https://ac.notready.eu/publication/algorithms-for-multi-criteria-boundary-labeling/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/algorithms-for-multi-criteria-boundary-labeling/</guid><description/></item><item><title>Algorithms for Multi-Criteria One-Sided Boundary Labeling</title><link>https://ac.notready.eu/publication/algorithms-for-multi-criteria-one-sided-boundary-labeling/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/algorithms-for-multi-criteria-one-sided-boundary-labeling/</guid><description/></item><item><title>Morphing Polylines: A Step Towards Continuous Generalization</title><link>https://ac.notready.eu/publication/morphing-polylines-a-step-towards-continuous-generalization/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/morphing-polylines-a-step-towards-continuous-generalization/</guid><description/></item><item><title>Improved Algorithms for Length-Minimal One-Sided Boundary Labeling</title><link>https://ac.notready.eu/publication/improved-algorithms-for-length-minimal-one-sided-boundary-labeling/</link><pubDate>Thu, 01 Mar 2007 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/improved-algorithms-for-length-minimal-one-sided-boundary-labeling/</guid><description/></item><item><title>Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps</title><link>https://ac.notready.eu/publication/minimizing-intra-edge-crossings-in-wiring-diagrams-and-public-transportation-maps/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/minimizing-intra-edge-crossings-in-wiring-diagrams-and-public-transportation-maps/</guid><description/></item><item><title>Morphing Polygonal Lines: A Step Towards Continuous Generalization</title><link>https://ac.notready.eu/publication/morphing-polygonal-lines-a-step-towards-continuous-generalization/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/morphing-polygonal-lines-a-step-towards-continuous-generalization/</guid><description/></item></channel></rss>