Christian Sohler
Orcid: 0000-0001-8990-3326Affiliations:
- University of Cologne, Germany
- Dortmund University of Technology, Germany (former)
- University of Bonn, Institute for Computer Science (former)
- University of Paderborn, Department of for Computer Science (former)
According to our database1,
Christian Sohler
authored at least 115 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on d-nb.info
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
SIAM J. Comput., 2024
CoRR, 2024
2022
CoRR, 2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
Proceedings of the Approximation, 2022
2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
2020
Turning Big Data Into Tiny Data: Constant-Size Coresets for k-Means, PCA, and Projective Clustering.
SIAM J. Comput., 2020
Sublinear time approximation of the cost of a metric <i>k</i>-nearest neighbor graph.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the Approximation, 2020
2019
Random Struct. Algorithms, 2019
A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs).
CoRR, 2019
Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 36th International Conference on Machine Learning, 2019
A Characterization of Graph Properties Testable for General Planar Graphs with one-Sided Error (It's all About Forbidden Subgraphs).
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
2017
Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017
Proceedings of the 34th International Conference on Machine Learning, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
2016
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Proceedings of the Approximation, 2015
2014
A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem.
Algorithmica, 2014
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
Proceedings of the Pattern Recognition - 36th German Conference, 2014
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014
2013
CoRR, 2013
Turning big data into tiny data: Constant-size coresets for <i>k</i>-means, PCA and projective clustering.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Algorithms - ESA 2013, 2013
2012
ACM Trans. Algorithms, 2012
Electron. Colloquium Comput. Complex., 2012
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness.
Proceedings of the Algorithms - ESA 2012, 2012
2011
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
2010
Small Space Representations for Metric Min-sum <i>k</i>-Clustering and Their Applications.
Theory Comput. Syst., 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Proceedings of the Property Testing - Current Research and Surveys, 2010
Proceedings of the Property Testing - Current Research and Surveys, 2010
Proceedings of the Property Testing - Current Research and Surveys, 2010
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010
2009
SIAM J. Comput., 2009
SIAM J. Comput., 2009
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
Proceedings of the Algorithms, 2009
2008
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Proceedings of the Algorithms, 2008
Proceedings of the Sublinear Algorithms, 17.08. - 22.08.2008, 2008
Proceedings of the Sublinear Algorithms, 17.08. - 22.08.2008, 2008
2007
Random Struct. Algorithms, 2007
Electron. Colloquium Comput. Complex., 2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
2006
Electron. Notes Discret. Math., 2006
Sublinear-Time Algorithms.
Bull. EATCS, 2006
A distributed <i>O</i>(1)-approximation algorithm for the uniform facility location problem.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006
2005
SIAM J. Comput., 2005
SIAM J. Comput., 2005
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005
Proceedings of the Sublinear Algorithms, 17.07. - 22.07.2005, 2005
2004
Reducing State Changes with a Pipeline Buffer.
Proceedings of the 9th International Fall Workshop on Vision, Modeling, and Visualization, 2004
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004
2003
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
2002
2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
2000
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000
1999
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999
1997
Encoding a triangulation as a permutation of its point set.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997