Publications (by type)
Journal Articles
-
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. . In ACM Transactions on Algorithms. 2024.
-
Approximating Node-Weighted k-MST on Planar Graphs. . In Theory of Computing Systems. 2020.
-
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. . In Mathematical Programming, 171(1-2), pp. 433–461. 2018.
-
Approximating the Generalized Minimum {Manhattan} Network Problem. . In Algorithmica, 80(4), pp. 1170–1190. 2018.
-
An Improved Approximation Algorithm for Knapsack Median Using Sparsification. . In Algorithmica, 80(4), pp. 1093–1114. 2018.
-
Improved Approximation Algorithms for Box Contact Representations. . In Algorithmica, 77(3), pp. 902–920. 2017.
-
Approximating Minimum Manhattan Networks in Higher Dimensions. . In Algorithmica, 71(1), pp. 36–52. 2015.
-
Approximating Spanning Trees with Few Branches. . In Theory Comput. Syst., 56(1), pp. 181–196. 2015.
-
Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. . In Algorithmica, 71(4), pp. 797–811. 2015.
-
Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. . In IEEE Transactions on Visualization and Computer Graphics. 2013.
-
Algorithms for Labeling Focus Regions. . In IEEE Trans. Vis. Comput. Graph., 18(12), pp. 2583–2592. 2012.
-
Relaxed Voting and Competitive Location under Monotonous Gain Functions on Trees. . In Discrete Applied Mathematics, 158(4), pp. 361–373. 2010.
-
An {O(n (log n)^2 / log log n)} algorithm for the single maximum coverage location or the {(1,X_p)}-medianoid problem on trees. . In Information Processing Letters, 109(8), pp. 391–394. 2009.
-
(r,p)-Centroid problems on Paths and Trees. . In Theoretical Computer Science, 410(47--49), pp. 5128–5137. 2009.
-
Optimally Computing all Solutions of {S}tackelberg with Parametric Prices and of General Monotonous Gain Functions on a Tree. . In Journal of Discrete Algorithms, 7(2), pp. 256–266. 2009.
-
Multiple Voting Location and Single Voting Location on Trees. . In European Journal of Operational Research, 181(2), pp. 654–667. 2007.
Conference Articles
-
Approximating Traveling Salesman Problems Using a Bridge Lemma. . In Proc. 36th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’25). 2025.
-
Clustering to Minimize Cluster-Aware Norm Objectives. . In Proc. 36th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’25). 2025.
-
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces. . In Proc. 51st International Colloquium on Automata, Languages and Programming (ICALP’24). 2024.
-
A Constant-Factor Approximation Algorithm for Reconciliation \($k$\)-Median. . In Proc. International Conference on Artificial Intelligence and Statistics (AISTATS’23), Vol. 206, pp. 1719–1746. {PMLR}, 2023.
-
Parameterized Approximation Schemes for Clustering with General Norm Objectives. . In Proc. 64th IEEE Symposium on Foundations of Computer Science (FOCS’23). 2023.
-
Mind the Gap: Edge Facility Location Problems in Theory and Practice. . In Proc. 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM’23), Vol. 13947, pp. 321–334. 2023.
-
Independent Set in \($k$\)-Claw-Free Graphs: Conditional \($\chi$\)-Boundedness and the Power of {LP/SDP} Relaxations. . In Proc. International Workshop on Approximation and Online Algorithms (WAOA’23). 2023.
-
Coloring Mixed and Directional Interval Graphs. . In Proc. 30th International Symposium Graph Drawing and Network Visualization (GD’22), Vol. 13764, pp. 418–431. 2022.
-
Hypergraph Representation via Axis-Aligned Point-Subspace Cover. . In Proc. 16th International Conference and Workshops on Algorithms and Computation (WALCOM’22), Vol. 13174, pp. 328–339. 2022.
-
On Minimum Generalized Manhattan Connections. . In Proc. 17th Algorithms and Data Structures Symposium (WADS’21), Vol. 12808, pp. 85–100. 2021.
-
Consistent Simplification of Polyline Tree Bundles. . In Proc. 27th International Computing and Combinatorics Conference (COCOON’21). 2021.
-
PTAS for Steiner Tree on Map Graphs. . In Proc. 14th Latin American Theoretical Informatics Symposium (LATIN’20). 2020.
-
Simplification of Polyline Bundles. . In Proc. 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’20). 2020.
-
A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs. . In Proc. 26th International Computing and Combinatorics Conference (COCOON’20). 2020.
-
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. . In Proc. 46th International Colloquium on Automata, Languages and Programming (ICALP’19). 2019.
-
Approximation Schemes for Geometric Coverage Problems. . In Proc. 26th Annual European Symposium on Algorithms (ESA’18), Vol. 112, pp. 17:1–17:15. 2018.
-
Stabbing Rectangles by Line Segments -- How Decomposition Reduces the Shallow-Cell Complexity. . In Proc. 29th International Symposium on Algorithms and Computation (ISAAC’18). 2018.
-
Approximating Node-Weighted k-{MST} on Planar Graphs. . In Proc. 16th Workshop on Approximation and Online Algorithms (WAOA’18). 2018.
-
Constant-Factor Approximation for Ordered k-Median. . In Proc. 50th Annual ACM Symposium on the Theory of Computing (STOC’18), pp. 620–631. 2018.
-
New Algorithms for Disjoint Paths Based on Tree-Likeness. . In Proc. 24th European Symposium on Algorithms (ESA ’16), pp. 42:1–42:17. 2016.
-
Colored Non-Crossing Euclidean Steiner Forest. . In Proc. 26th International Symposium on Algorithms and Computation (ISAAC’15), pp. 429–441. 2015.
-
Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees. . In Proc. 32nd Symp. Theoretical Aspects of Computer Science (STACS’15). 2015.
-
An Improved Approximation Algorithm for Knapsack Median Using Sparsification. . In Proc. 23rd Annual European Symposium on Algorithms (ESA’15), pp. 275–287. 2015.
-
Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems. . In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA’15). 2015.
-
Specialized Heuristics for the Controller Placement Problem in Large Scale {SDN} Networks. . In Proc. 27th International Teletraffic Congress (ITC’15), pp. 210–218. 2015.
-
{Including Energy Efficiency Aspects in Multi-Layer Optical Network Design}. . In 5th International Conference on Communications and Electronics ({ICCE} 2014). Da Nang, Vietnam, 2014.
-
Improved Approximation Algorithms for Box Contact Representations. . In Proc. 22th Annual European Symposium on Algorithms (ESA’14), pp. 87–99. 2014.
-
Approximating the Generalized Minimum {M}anhattan Network Problem. . In Proc. 24th Int. Symp. Alg. and Comp. (ISAAC’13), Vol. 8283, pp. 722–732. 2013.
-
Approximating Spanning Trees with Few Branches. . In Proc. 10th Workshop on Approximation and Online Algorithms (WAOA’12), pp. 30–41. 2012.
-
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. . In Proc. 6th International Workshop Algorithms and Computation (WALCOM’12), pp. 186–197. 2012.
-
Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. . In Proc. 9th Workshop on Approximationand Online Algorithms (WAOA’11). 2011.
-
Approximating Minimum Manhattan Networks in Higher Dimensions. . In Proceedings of the 19th Annual European Symposium on Algorithms (ESA’11), Vol. 6942, pp. 49–60. 2011.
-
Maximum Betweenness Centrality: Approximability and Tractable Cases. . In Proc. 5th Workshop on Algorithms and Computation (WALCOM’11), pp. 9–20. 2011.
-
An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems. . In Proc. 21st International Symposium on Algorithms and Computation (ISAAC’10), pp. 440–450. 2010.
-
Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. . In Proc. 11th Algorithms and Data Structures Symposium (WADS’09), pp. 459–470. 2009.
-
Approximating (r,p)-centroid on a path. . In Proc. 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW’08). 2008.
-
Security Score, Plurality Solution, and {N}ash Equilibrium in Multiple Location Problems. . In 20th European Chapter on Combinatorial Optimization (ECCO’07). 2007.
-
Relaxed Voting and Competitive Location on Trees under Monotonuous Gain Functions. . In 6th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW’07). 2007.
Dissertation
-
Competitive and Voting Location. Technical Report (PhD dissertation), . . PhD dissertation. Universität Würzburg, 2010.
