![]() | 2010 | |
---|---|---|
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: Small Space Representations for Metric Min-sum k-Clustering and Their Applications. Theory Comput. Syst. 46(3): 416-442 (2010) |
2009 | ||
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Sumit Ganguly, Christian Sohler: d-Dimensional Knapsack in the Streaming Model. ESA 2009: 468-479 |
50 | ![]() ![]() ![]() ![]() ![]() ![]() | Christiane Lammersen, Anastasios Sidiropoulos, Christian Sohler: Streaming Embeddings with Slack. WADS 2009: 483-494 |
49 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Asaf Shapira, Christian Sohler: Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs. SIAM J. Comput. 38(6): 2499-2510 (2009) |
48 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time. SIAM J. Comput. 39(3): 904-922 (2009) |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Tugkan Batu, Petra Berenbrink, Christian Sohler: A sublinear-time approximation scheme for bin packing. Theor. Comput. Sci. 410(47-49): 5082-5092 (2009) |
2008 | ||
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Christiane Lammersen, Christian Sohler: Facility Location in Dynamic Geometric Data Streams. ESA 2008: 660-671 |
45 | ![]() ![]() ![]() ![]() ![]() ![]() | Marcel R. Ackermann, Johannes Blömer, Christian Sohler: Clustering for metric and non-metric distance measures. SODA 2008: 799-808 |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: Testing Euclidean minimum spanning trees in the plane. ACM Transactions on Algorithms 4(3): (2008) |
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Gereon Frahling, Piotr Indyk, Christian Sohler: Sampling in Dynamic Data Streams and Applications. Int. J. Comput. Geometry Appl. 18(1/2): 3-28 (2008) |
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Gereon Frahling, Christian Sohler: A Fast k-Means Implementation Using Coresets. Int. J. Comput. Geometry Appl. 18(6): 605-625 (2008) |
2007 | ||
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Gereon Frahling, Christian Sohler: Efficient Kinetic Data Structures for MaxCut. CCCG 2007: 157-160 |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Christian Sohler: Estimating Clustering Indexes in Data Streams. ESA 2007: 618-632 |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: Testing Expansion in Bounded-Degree Graphs. FOCS 2007: 570-578 |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: On testable properties in bounded degree graphs. SODA 2007: 494-501 |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: Small Space Representations for Metric Min-Sum k -Clustering and Their Applications. STACS 2007: 536-548 |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Feldman, Morteza Monemizadeh, Christian Sohler: A PTAS for k-means clustering based on weak coresets. Symposium on Computational Geometry 2007: 11-18 |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Asaf Shapira, Christian Sohler: Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(083): (2007) |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: Sublinear-time approximation algorithms for clustering via random sampling. Random Struct. Algorithms 30(1-2): 226-256 (2007) |
2006 | ||
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler: Sublinear Algorithms, 17.07. - 22.07.2005 Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, Christian Sohler: Counting triangles in data streams. PODS 2006: 253-262 |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Joachim Gehweiler, Christiane Lammersen, Christian Sohler: A distributed O(1)-approximation algorithm for the uniform facility location problem. SPAA 2006: 237-243 |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Gereon Frahling, Christian Sohler: A fast k-means implementation using coresets. Symposium on Computational Geometry 2006: 135-143 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Joachim Gehweiler, Christiane Lammersen, Christian Sohler: A Distributed Algorithm for the Facility Location Problem. Electronic Notes in Discrete Mathematics 25: 91 (2006) |
2005 | ||
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Marcin Bienkowski, Valentina Damerow, Friedhelm Meyer auf der Heide, Christian Sohler: Average case complexity of Voronoi diagrams of n sites from the unit cube. EuroCG 2005: 167-170 |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler: Facility Location in Sublinear Time. ICALP 2005: 866-877 |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Gereon Frahling, Christian Sohler: Coresets in dynamic geometric data streams. STOC 2005: 209-217 |
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler: 05291 Abstracts Collection -- Sublinear Algorithms. Sublinear Algorithms 2005 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Gereon Frahling, Piotr Indyk, Christian Sohler: Sampling in dynamic data streams and applications. Symposium on Computational Geometry 2005: 142-149 |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Sohler: Fast reconstruction of Delaunay triangulations. Comput. Geom. 31(3): 166-178 (2005) |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: Abstract Combinatorial Programs and Efficient Property Testers. SIAM J. Comput. 34(3): 580-615 (2005) |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler: Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM J. Comput. 35(1): 91-109 (2005) |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: Testing hypergraph colorability. Theor. Comput. Sci. 331(1): 37-52 (2005) |
2004 | ||
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Valentina Damerow, Christian Sohler: Extreme Points Under Random Noise. ESA 2004: 264-274 |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Vikas Bansal, Friedhelm Meyer auf der Heide, Christian Sohler: Labeling Smart Dust. ESA 2004: 77-88 |
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: Sublinear-Time Approximation for Clustering Via Random Sampling. ICALP 2004: 396-407 |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: Estimating the weight of metric minimum spanning trees in sublinear-time. STOC 2004: 175-183 |
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Jens Krokowski, Harald Räcke, Christian Sohler, Matthias Westermann: Reducing State Changes with a Pipeline Buffer. VMV 2004: 217 |
2003 | ||
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler: Smoothed Motion Complexity. ESA 2003: 161-171 |
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler: Sublinear-time approximation of Euclidean minimum spanning tree. SODA 2003: 813-822 |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking: Randomized Pursuit-Evasion In Graphs. Combinatorics, Probability & Computing 12(3): (2003) |
2002 | ||
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Harald Räcke, Christian Sohler, Matthias Westermann: Online Scheduling for Sorting Buffers. ESA 2002: 820-832 |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: Abstract Combinatorial Programs and Efficient Property Testers. FOCS 2002: 83-92 |
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking: Randomized Pursuit-Evasion in Graphs. ICALP 2002: 901-912 |
2001 | ||
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: Property Testing with Geometric Queries. ESA 2001: 266-277 |
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: Testing Hypergraph Coloring. ICALP 2001: 493-505 |
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler: Soft kinetic data structures. SODA 2001: 865-872 |
2000 | ||
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Sohler, Martin Ziegler: Computing Cut Numbers. CCCG 2000 |
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Czumaj, Christian Sohler, Martin Ziegler: Property Testing in Computational Geometry. ESA 2000: 155-166 |
1999 | ||
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Sohler: Fast reconstruction of delaunay triangulations. CCCG 1999 |
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Sohler: Generating random star-shaped polygons. CCCG 1999 |
1997 | ||
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Markus Denny, Christian Sohler: Encoding a triangulation as a permutation of its point set. CCCG 1997 |