BibSonomy publications for /author/MartinTue Feb 14 00:00:00 CET 2012IEEE Communications Magazine1110-117Visualization of data for ambient assisted living services.492011dblp Tue Feb 14 00:00:00 CET 2012IEEE T. Instrumentation and Measurement3609-617A Bluetooth Radio Energy Consumption Model for Low-Duty-Cycle Applications.612012dblp Tue Feb 14 00:00:00 CET 2012SPLC Workshopsconf/splc/2010w163-170Exploring the Synergies Between Feature Models and Ontologies.2010dblp Tue Feb 14 00:00:00 CET 2012SPLC Workshopsconf/splc/2010w129-136Integrating Software Safety and Product Line Engineering using Formal Methods: Challenges and Opportunities.2010dblp Tue Feb 14 00:00:00 CET 2012WCNCconf/wcnc/20071982-1986Pilot Based Synchronization Strategy for a Coherent OFDM Receiver.2007dblp Tue Feb 14 00:00:00 CET 2012WCNCconf/wcnc/20073128-3133Is AIS Based Misbehavior Detection Suitable for Wireless Sensor Networks?2007dblp Tue Feb 14 00:00:00 CET 2012WCNCconf/wcnc/2007616-620On Antenna Diversity Exploitation for Non-Coherent Multicarrier On-Off Keying Transmission.2007dblp Tue Feb 14 00:00:00 CET 2012WCNCconf/wcnc/20072812-2818Social Distributed Hash Table.2007dblp Tue Feb 14 00:00:00 CET 2012WCNCconf/wcnc/2007452-457On the Proper Interference Protection in Wireless Multi-Hop Networks.2007dblp Tue Feb 14 00:00:00 CET 2012WCNCconf/wcnc/20072017-2021A New Hybrid Frequency-Amplitude Diversity Technique for Multicarrier On-Off Keying Transmission.2007dblp Tue Feb 14 00:00:00 CET 2012ISWC Posters&Demosconf/semweb/2010pdCEUR Workshop ProceedingsThe Catalogus Professorum Lipsiensis - Semantics-based Collaboration and Exploration for Historians.6582010dblp Tue Feb 14 00:00:00 CET 2012KDDconf/kdd/2011195-203Unbiased online active learning in data streams.2011dblp Mon Feb 13 22:12:33 CET 2012Phys. Rev. Bjun245318Strain effects on the thermal conductivity of nanostructures812010Heat-Transfer-Solids Heat-Transfer Mon Feb 13 17:04:22 CET 2012Learning Design vs. Instructional DesignCloudworks discussion2009learning instructional education design cloudworks What are the differences between learning design and instructional design? Is it the approach? The breadth? The focus? The audience? Or is a just a new term for the same thing?Mon Feb 13 15:23:25 CET 2012sepAvailable at \path|http://www.ubka.uni-karlsruhe.de/indexer-vvv/ira/2007/18|2007-18Cover Contact GraphsTechnical report2007myown Mon Feb 13 15:23:25 CET 2012Proc. 15th Int. Sympos. Graph Drawing (GD'07)171--182Lecture Notes in Computer ScienceCover Contact Graphs48752008myown gd-info1 Mon Feb 13 15:23:25 CET 2012Arxiv reportjunAvailable at http://arxiv.org/abs/0806.0920Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability2008myown Mon Feb 13 15:23:25 CET 2012Proc. 16th Int. Sympos. Graph Drawing (GD'08)324--335Lecture Notes in Computer ScienceDrawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability54172009myown Mon Feb 13 15:23:25 CET 2012Algorithmica1--2309--332Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability622012myown gd-info1 fixed-parameter_tractability binary_tanglegrams approximation_algorithm NP-hardness A \emph{binary tanglegram} is a drawing of a pair \ttree{S,T} of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example, in phylogenetics, it is essential that both trees are drawn without edge crossings and that the inter-tree edges have as few crossings as possible. It is known that finding a tanglegram with the minimum number of crossings is NP-hard and that the problem is fixed-parameter tractable with respect to that number. \par We prove that under the Unique Games Conjecture there is no constant-factor approximation for binary trees. We show that the problem is NP-hard even if both trees are complete binary trees. For this case we give an $O(n^3)$-time 2-approximation and a new, simple fixed-parameter algorithm. We show that the maximization version of the dual problem for binary trees can be reduced to a version of \textsc{MaxCut} for which the algorithm of Goemans and Williamson yields a $0.878$-approximation.Mon Feb 13 15:23:25 CET 2012Proc. 24th Annu. ACM Sympos. Comput. Geom. (SoCG'08)10--19Optimizing Active Ranges for Consistent Dynamic Map Labeling2008myown