Researcher Portfolio

 
   

Prof. Dr. Näher, Stefan

Algorithms and Complexity, MPI for Informatics, Max Planck Society  

 

Researcher Profile

 
Position: Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher ID: https://pure.mpg.de/cone/persons/resource/persons45100

External references

 

Publications

 
  (1 - 25 of 52)
 : Mehlhorn, K., Näher, S., & Sanders, P. (2017). Engineering DFS-Based Graph Algorithms. Retrieved from http://arxiv.org/abs/1703.10023. [PubMan] : McConnell, R. M., Mehlhorn, K., Näher, S., & Schweitzer, P. (2010). Certifying Algorithms. Computer Science Review, 5(2), 119-161. doi:10.1016/j.cosrev.2010.09.009. [PubMan] : Funke, S., Mehlhorn, K., & Näher, S. (2005). Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs. Computational Geometry, 31(3), 179-194. doi:10.1016/j.comgeo.2004.12.007. [PubMan] : Kettner, L., & Näher, S. (2004). Two Computational Geometry Libraries: LEDA and CGAL. In J. E. Goodman, & J. O'Rourke (Eds.), Handbook of Discrete and Computational Geometry (pp. 1435-1463). Boca Raton, USA: Chapman & Hall/CRC. [PubMan] : Althaus, E., Mehlhorn, K., Näher, S., & Schirra, S. (2000). Experiments on curve reconstruction. In Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00) (pp. 103-114). Albuquerque, USA: University of New Mexico. [PubMan] : Mehlhorn, K., & Näher, S. (1999). LEDA: a platform for combinatorial and geometric computing. Cambridge, MA: Cambridge University Press. [PubMan] : Mehlhorn, K., Näher, S., Seel, M., Seidel, R., Schilz, T., Schirra, S., & Uhrig, C. (1999). Checking geometric programs or verification of geometric structures. Computational Geometry: Theory and Applications, 12, 85-104. [PubMan] : Funke, S., Mehlhorn, K., & Näher, S. (1999). Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs. In Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99) (pp. 39-42). Vancouver, Canada: University of British Columbia. [PubMan] : Mehlhorn, K., & Näher, S. (1998). From Algorithms to Working Programs: On the Use of Program Checking in LEDA. In L. Brim, J. Gruska, & J. Zlatuška (Eds.), Mathematical Foundations of Computer Science 1998 (pp. 84-93). Berlin, Germany: Springer. [PubMan] : Mehlhorn, K., & Näher, S. (1998). From Algorithms to Working Programs on the Use of Program Checking in LEDA. In K. Mehlhorn (Ed.), IFIP World Computer Congress on Fundamentals - Foundations of Computer Science (pp. 81-88). Vienna, Austria: Österreichische Computer Gesellschaft (OCG) / Austrian Computer Society. [PubMan] : Mehlhorn, K., Müller, M., Näher, S., Schirra, S., Seel, M., Uhrig, C., & Ziegler, J. (1998). A computational basis for higher-dimensional computational geometry and applications. Computational Geometry: Theory and Applications, 10(4), 289-304. doi:10.1016/S0925-7721(98)00011-X. [PubMan] : Mutzel, P., Gutwenger, C., Brockenauer, R., Fialko, S., Klau, G. W., Krüger, M., Ziegler, T., Näher, S., Alberts, D., Ambras, D., Koch, G., Jünger, M., Buchheim, C., & Leipert, S. (1998). AGD: A Library of Algorithms for Graph Drawing. In S. H. Whitesides (Ed.), Proceedings of the 6th International Symposium on Graph Drawing (GD-98) (pp. 456-457). Berlin, Germany: Springer. [PubMan] : Mehlhorn, K., Müller, M., Näher, S., Schirra, S., Seel, M., Uhrig, C., & Ziegler, J. (1997). A Computational Basis for Higher-dimensional Computational Geometry and Applications. In Proceedings of the 13th Annual Symposium on Computational Geometry (pp. 254-263). New York, NY: ACM. [PubMan] : Alberts, D., Gutwenger, C., Mutzel, P., & Näher, S.(1997). AGD-Library: A Library of Algorithms for Graph Drawing (MPI-I-1997-1-019). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Mehlhorn, K., Näher, S., & Uhrig, C. (1997). The LEDA Platform for Combinatorial and Geometric Computing. In P. Degano, R. Gorrieri, & A. Mrchetti-Spaccamela (Eds.), Automata, Languages and Programming (pp. 7-16). Berlin, Germany: Springer. doi:10.1007/3-540-63165-8_161. [PubMan] : Alberts, D., Gutwenger, C., Mutzel, P., & Näher, S. (1997). AGD-Library: A Library of Algorithms for Graph Drawing. In G. Italiano, & S. Orlando (Eds.), Proceedings of the Workshop on Algorithm Engineering (WAE-97) (pp. 112-123). Venice, Italy: Università Ca' Foscari di Venezia. [PubMan] : Mehlhorn, K., Näher, S., Schirra, S., Seel, M., & Uhrig, C.(1996). A computational basis for higher-dimensional computational geometry (MPI-I-1996-1-016). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Mehlhorn, K., Näher, S., & Uhrig, C. (1996). The LEDA Platform for Combinatorial and Geometric Computing. In Beherrschung von Informationssystemen: Tagungsband der Informatik '96; GI - 26. Jahrestagung (pp. 43-50). Wien, Austria: Österreichische Computer Gesellschaft (OCG) / Austrian Computer Society. [PubMan] : Mehlhorn, K., Näher, S., Schilz, T., Schirra, S., Seel, M., Seidel, R., & Uhrig, C. (1996). Checking Geometric Programs or Verification of Geometric Structures. In Proceedings of the 12th Annual ACM Symposium on Computational Geometry (pp. 159-165). New York, NY: ACM. [PubMan] : Mehlhorn, K., & Näher, S. (1995). LEDA: A Platform for Combinatorial and Geometric Computing. Communications of the ACM, 38(1), 96-102. doi:10.1145/204865.204889. [PubMan] : Näher, S., & Uhrig, C.(1995). LEDA user manual (version R 3.2) (MPI-I-1995-1-002). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Burnikel, C., Könemann, J., Mehlhorn, K., Näher, S., Schirra, S., & Uhrig, C. (1995). Exact Geometric Computation in LEDA. In Proceedings of the 11th ACM Symposium on Computational Geometry (pp. C18-C19). New York, NY: ACM. [PubMan] : Mehlhorn, K., & Näher, S.(1995). LEDA: A Platform for Combinatorial and Geometric Computing (Local-ID: C1256428004B93B8-2798FB10F98B1B2CC12571F60051D6CF-mehlhorn95z). Halle: Universität Halle. [PubMan] : Mehlhorn, K., & Näher, S.(1994). Implementation of a sweep line algorithm for the Straight \& Line Segment Intersection Problem (MPI-I-94-160). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Buchberger, B., Mehlhorn, K., Näher, S., & Nievergelt, J. (Eds.). (1994). Special issue on algorithms: implementation, libraries and use. Journal on Symbolic Computation, 17(4). [PubMan]