| # |  | Year | Author(s) [non member] | | Title | Type | |
|---|
| 419 |
 | Mehlhorn, Kurt |
| |
| | 2013 | [Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine | | A Framework for the Verification of Certifying Computations | Unpublished/Draft | |
| | 2013 | Mehlhorn, Kurt
Neumann, A.
Schmidt, Jens M. | | Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369 | Proceedings Article | |
| | 2013 | Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M. | | Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121 | Journal Article | |
| | 2013 | Mehlhorn, Kurt
Sagraloff, Michael
Wang, Pengming | | From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870], | Electronic Journal Article | |
| | 2013 | Elbassioni, Khaled M.
Makino, Kazuhisa
Mehlhorn, Kurt
Ramezani, Fahimeh | | On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76 | Proceedings Article | |
| | 2013 | Jurkiewicz, Tomasz
Mehlhorn, Kurt | | The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments, | Proceedings Article | |
| | 2013 | [Afshani, Peyman]
[Agrawal, Manindra]
Doerr, Benjamin
Doerr, Carola
[Larsen, Kasper Green]
Mehlhorn, Kurt | | The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11 | Part of a Book | |
| | 2012 | Duan, Ran
Mehlhorn, Kurt | | A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
In: arXiv [abs/1212.0979v1], 1-8 | Electronic Journal Article | |
| | 2012 | [Elmasry, Amr]
Mehlhorn, Kurt
Schmidt, Jens M. | | An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766 | Journal Article | |
| | 2012 | Mehlhorn, Kurt
Neumann, Adrian
Schmidt, Jens M. |  | Certifying 3-Edge-Connectivity | Unpublished/Draft | |
| | 2012 | [Kane, Daniel]
Mehlhorn, Kurt
Sauerwald, Thomas
Sun, He | | Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609 | Proceedings Article | |
| | 2012 | Megow, Nicole
Mehlhorn, Kurt
[Schweitzer, Pascal] | | Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72 | Journal Article | |
| | 2012 | Bonifaci, Vincenzo
Mehlhorn, Kurt
[Varma, Girish] | | Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133 | Journal Article | |
| | 2012 | Bonifaci, Vincenzo
Mehlhorn, Kurt
[Varma, Girish] | | Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240 | Proceedings Article | |
| | 2012 | Bringmann, Karl
Mehlhorn, Kurt
Neumann, Adrian | | Remarks on Category-Based Routing in Social Networks | Unpublished/Draft | |
| | 2012 | [Afshani, Peyman]
[Agrawal, Manindra]
Doerr, Benjamin
[Green Larsen, Kasper]
Mehlhorn, Kurt
Winzen, Carola | | The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36 | Electronic Journal Article | |
| | 2011 | Mehlhorn, Kurt
Sagraloff, Michael | | A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90 | Journal Article | |
| | 2011 | Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael | | A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528 | Journal Article | |
| | 2011 | [Baswana, Surender]
[Kavitha, Telikepalli]
Mehlhorn, Kurt
[Pettie, Seth] | | Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26 | Journal Article | |
| | 2011 | Manjunath, Madhusudan
Mehlhorn, Kurt
Panagiotou, Konstantinos
Sun, He | | Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688 | Proceedings Article | |
| | 2011 | Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal | | Certifying algorithms
In: Computer Science Review [5], 119-161 | Journal Article | |
| | 2011 | [Christodoulou, George]
Mehlhorn, Kurt
[Pyrga, Evangelia] | | Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130 | Proceedings Article | |
| | 2011 | [Kavitha, Telikepalli]
Mehlhorn, Kurt
Michail, Dimitrios | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488 | Journal Article | |
| | 2011 | Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal | | Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489 | Proceedings Article | |
| | 2011 | [Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine | | Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82 | Proceedings Article | |
| | 2011 | [Shervashidze, Nino]
Schweitzer, Pascal
[van Leeuwen, Erik Jan]
Mehlhorn, Kurt
[Borgwardt, Karsten M.] | | Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561 | Journal Article | |
| | 2010 | Elmasry, Amr
Mehlhorn, Kurt
[Schmidt, Jens M.] | | An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13 | Electronic Journal Article | |
| | 2010 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron] | | Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66 | Journal Article | |
| | 2010 | [Garg, Naveen]
[Kavitha, T.]
[Kumar, Amit]
Mehlhorn, Kurt
Mestre, Julián | | Assigning Papers to Referees
In: Algorithmica [58], 119-136 | Journal Article | |
| | 2010 | McConnella, Ross M.
Mehlhorn, Kurt
[Näher, Stefan]
[Schweitzer, Pascal] | | Certifying algorithms
In: Computer Science Review [Article in Press], 1-43 | Electronic Journal Article | |
| | 2010 | Mehlhorn, Kurt
Ray, Saurabh | | Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683 | Journal Article | |
| | 2010 | Mehlhorn, Kurt
Schweitzer, Pascal | | Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5 | Proceedings Article | |
| | 2010 | Mehlhorn, Kurt | | Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11 | Proceedings Article | |
| | 2009 | [Burnikel, Christoph]
[Funke, Stefan]
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne | | A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28 | Journal Article | |
| | 2009 | [Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo] | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312 | Proceedings Article | |
| | 2009 | [Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo] | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312 | Proceedings Article | |
| | 2009 | [Shervashidze, Nino]
Vishwanathan, S .V. N.
[Petri, Tobias H.]
Mehlhorn, Kurt
[Borgwardt, Karsten M.] | | Efficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495 | Electronic Proceedings Article | |
| | 2009 | Mehlhorn, Kurt
Sagraloff, Michael | | Isolating real roots of real polynomials
In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254 | Proceedings Article | |
| | 2008 | Mehlhorn, Kurt
Sagraloff, Michael | | A deterministic Bitstream Descartes Algorithm | Report | |
| | 2008 | Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael | | A General Approach to the Analysis of Controlled Perturbation Algorithms | Report | |
| | 2008 | Mehlhorn, Kurt
[Sanders, Peter] | | Algorithms and Data Structures: The Basic Toolbox | Book | |
| | 2008 | [Garg, Naveen]
[Kavitha, T.]
[Kumar, Amit]
Mehlhorn, Kurt
Mestre, Julián | | Assigning Papers to Referees | Unpublished/Draft | |
| | 2008 | Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee] | | Classroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78 | Journal Article | |
| | 2008 | Mehlhorn, Kurt
[Kavitha, T.]
[Hariharan, R.] | | Faster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447 | Journal Article | |
| | 2007 | Kavitha, Telikepalli
Mehlhorn, Kurt | | Algorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505 | Journal Article | |
| | 2007 | Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99 | Journal Article | |
| | 2007 | [Gotsman, Craig]
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia | | Cycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464 | Journal Article | |
| | 2007 | Mehlhorn, Kurt
Michail, Dimitrios | | Implementing Minimum Cycle Basis Algorithms
In: Journal of Experimental Algorithmics [11], 1-14 | Electronic Journal Article | |
| | 2007 | Mehlhorn, Kurt | | Matchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2 | Proceedings Article | |
| | 2007 | Mehlhorn, Kurt | | Minimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14 | Proceedings Article | |
| | 2007 | [Kavitha, Telikepalli]
Mehlhorn, Kurt
Michail, Dimitrios | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523 | Proceedings Article | |
| | 2007 | [Abraham, David J.]
[Irving, Robert W.]
[Kavitha, Telikepalli]
Mehlhorn, Kurt | | Popular Matchings
In: SIAM Journal on Computing [37], 1030-1045 | Journal Article | |
| | 2007 | [Kavitha, Telikepalli]
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna E.] | | Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18 | Journal Article | |
| | 2007 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron] | | Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics | Report | |
| | 2007 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron] | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656 | Proceedings Article | |
| | 2006 | [Hariharan, Ramesh]
[Telikepalli, Kavitha]
Mehlhorn, Kurt | | A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261 | Proceedings Article | |
| | 2006 | [Kratsch, Dieter]
[McConnell, Ross]
Mehlhorn, Kurt
[Spinrad, Jeremy P.] | | Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353 | Journal Article | |
| | 2006 | Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne | | Controlled Perturbation for Delaunay Triangulations | Report | |
| | 2006 | Mehlhorn, Kurt
Michail, Dimitrios | | Implementing Minimum Cycle Basis Algorithms
In: ACM Journal of Experimental Algorithmics [11], 1-14 | Electronic Journal Article | |
| | 2006 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao] | | Matching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14 | Journal Article | |
| | 2006 | [Krandick, Werner]
Mehlhorn, Kurt | | New bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66 | Journal Article | |
| | 2006 | [Aronov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi] | | Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116 | Journal Article | |
| | 2006 | [Irving, Robert W.]
[Telikepalli, Kavitha]
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna] | | Rank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610 | Journal Article | |
| | 2006 | Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael | | Reliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310 | Proceedings Article | |
| | 2006 | Mehlhorn, Kurt | | Reliable and Efficient Geometric Computing
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2 | Proceedings Article | |
| | 2006 | Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee] | | Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60 | Proceedings Article | |
| | 2005 | Eigenwillig, Arno
Kettner, Lutz
[Krandick, Werner]
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola | | A Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149 | Proceedings Article | |
| | 2005 | Kavitha, Telikepalli
Mehlhorn, Kurt | | A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 654-665 | Proceedings Article | |
| | 2005 | Mehlhorn, Kurt
Eigenwillig, Arno
Kaligosi, Kanela
Kratsch, Dieter
McConnell, Ross
Meyer, Ulrich
Spinrad, Jeremy P. | | Certifying Algorithms (draft) | Unpublished/Draft | |
| | 2005 | Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne | | Controlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056 | Proceedings Article | |
| | 2005 | Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola | | EXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166 | Proceedings Article | |
| | 2005 | Mehlhorn, Kurt
Waldmann, Uwe
[Wilhelm, Reinhard] | | Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108 | Part of a Book | |
| | 2005 | Mehlhorn, Kurt
Michail, Dimitrios | | Implementing Minimum Cycle Basis Algorithms
In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 32-43 | Proceedings Article | |
| | 2005 | Mehlhorn, Kurt | | Minimum Cycle Bases and Surface Reconstruction
In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532 | Proceedings Article | |
| | 2005 | Mehlhorn, Kurt
Michail, Dimitrios | | Network Problems with Non-Polynomial Weights and Applications | Unpublished/Draft | |
| | 2005 | Baswana, Surender
Telikepalli, Kavitha
Mehlhorn, Kurt
Pettie, Seth | | New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681 | Proceedings Article | |
| | 2005 | [Abraham, David J.]
[Cechlárová, Katarína]
[Manlove, David]
Mehlhorn, Kurt | | Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175 | Proceedings Article | |
| | 2005 | Abraham, David
[Irving, Robert W.]
Mehlhorn, Kurt
Telikepalli, Kavitha | | Popular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432 | Proceedings Article | |
| | 2005 | Funke, Stefan
Mehlhorn, Kurt
Näher, Stefan | | Structural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194 | Journal Article | |
| | 2005 | Kaligosi, Kanela
Mehlhorn, Kurt
[Munro, J. Ian]
[Sanders, Peter] | | Towards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114 | Proceedings Article | |
| | 2004 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna] | | A Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857 | Proceedings Article | |
| | 2004 | Berberich, Eric
Eigenwillig, Arno
[Emiris, Ioannis]
[Fogel, Efraim]
[Hemmer, Michael]
[Halperin, Dan]
[Kakargias, Athanasios]
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schömer, Elmar]
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola | | An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs | Report | |
| | 2004 | Konidaris, G.
Mehlhorn, Kurt
Shell, D.A. | | An optimal algorithm for finding edge segment adjacencies in configurations of convex polygons | Unpublished/Draft | |
| | 2004 | Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
[Schirra, Stefan]
[Yap, Chee] | | Classroom Examples of Robustness Problems in Geometric Computations | Report | |
| | 2004 | Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee] | | Classroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713 | Proceedings Article | |
| | 2004 | Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Weber, Dennis
Wolpert, Nicola | | EXACUS: Efficient and Exact Algorithms for Curves and Surfaces | Report | |
| | 2004 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao] | | Matching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92 | Proceedings Article | |
| | 2004 | [Krandick, Werner]
Mehlhorn, Kurt | | New Bounds for the Descartes Method | Report | |
| | 2004 | Abraham, David
[Cechlárová, Katarina]
[Manlove, David F.]
Mehlhorn, Kurt | | Pareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15 | Proceedings Article | |
| | 2004 | Althaus, Ernst
Eisenbrand, Friedrich
Funke, Stefan
Mehlhorn, Kurt | | Point Containment in the Integer Hull of a Polyhedron
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 929-933 | Proceedings Article | |
| | 2004 | [Aranov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi] | | Polyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88 | Proceedings Article | |
| | 2004 | Mehlhorn, Kurt
Michail, Dimitrios
Telikepalli, Kavitha
[Irving, Robert W.]
[Paluch, Katarzyna] | | Rank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75 | Proceedings Article | |
| | 2004 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna] | | Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 222-233 | Proceedings Article | |
| | 2004 | Funke, Stefan
Mehlhorn, Kurt
Schmitt, Susanne
[Burnikel, Christoph]
[Fleischer, Rudolf]
[Schirra, Stefan] | | The LEDA class real number -- extended version | Report | |
| | 2003 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao | | A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88 | Journal Article | |
| | 2003 | Althaus, Ernst
[Duchier, Denys]
[Koller, Alexander]
Mehlhorn, Kurt
[Niehren, Joachim]
Thiel, Sven | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219 | Journal Article | |
| | 2003 | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | Report | |
| | 2003 | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666 | Proceedings Article | |
| | 2003 | Kratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P. | | Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 158-167 | Proceedings Article | |
| | 2003 | Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis | | Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256 | Proceedings Article | |
| | 2003 | Mehlhorn, Kurt
[Seel, Michael] | | Infimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255 | Journal Article | |
| | 2003 | [Kwek, St.]
Mehlhorn, Kurt | | Optimal Search for Rationals
In: Information Processing Letters [86], 23-26 | Journal Article | |
| | 2003 | Mehlhorn, Kurt
Sanders, Peter | | Scanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93 | Journal Article | |
| | 2003 | Banderier, Cyril
Beier, Rene
Mehlhorn, Kurt | | Smoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207 | Proceedings Article | |
| | 2003 | Mehlhorn, Kurt | | The Reliable Algorithmic Software Challenge RASC
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 222-222 | Proceedings Article | |
| | 2003 | Mehlhorn, Kurt | | The reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
In: Computer Science in Perspective : essays dedicated to Thomas Ottmann, 255-263 | Part of a Book | |
| | 2002 | Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Mehlhorn, Kurt
Schömer, Elmar | | A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186 | Proceedings Article | |
| | 2002 | Mehlhorn, Kurt
Priebe, Volker
Schäfer, Guido
Sivadasan, Naveen | | All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343 | Journal Article | |
| | 2002 | Mehlhorn, Kurt | | Exact geometric computation
In: HERCMA 2001 : proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 87-87 | Proceedings Article | |
| | 2002 | Mehlhorn, Kurt
Meyer, Ulrich | | External-Memory Breadth-First Search with Sublinear I/O
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 723-735 | Proceedings Article | |
| | 2002 | Mehlhorn, Kurt
Schäfer, Guido | | Implementation of $O(nm \log n)$ Weighted Matchings in General Graphs: The Power of Data Structures
In: Proceedings of the n?th Conference on,
In: Journal of Experimental Algorithmics [7], | Electronic Journal Article | |
| | 2002 | Funke, Stefan
Mehlhorn, Kurt | | LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118 | Journal Article | |
| | 2002 | Althaus, Ernst
[Bockmayr, Alexander]
[Elf, Matthias]
[Kasper, Thomas]
[Jünger, Michael]
Mehlhorn, Kurt | | SCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87 | Proceedings Article | |
| | 2001 | Mehlhorn, Kurt
Schäfer, Guido | | A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 242-253 | Proceedings Article | |
| | 2001 | Mehlhorn, Kurt | | A Remark on the Sign Variation Method for Real Root Isolation | Unpublished/Draft | |
| | 2001 | [Burnikel, Christoph]
Funke, Stefan
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne | | A Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265 | Proceedings Article | |
| | 2001 | Althaus, Ernst
[Duchier, Denys]
[Koller, Alexander]
Mehlhorn, Kurt
[Niehren, Joachim]
Thiel, Sven | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 815-824 | Proceedings Article | |
| | 2001 | Mehlhorn, Kurt
Ziegelmann, Mark | | CNOP - A Package for Constrained Network Optimization
In: Algorithm engineering and experimentation (ALENEX-01) :Third International Workshop ALENEX 2001 ; revised papers, 17-31 | Proceedings Article | |
| | 2001 | Mehlhorn, Kurt
Schirra, Stefan | | Exact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172 | Part of a Book | |
| | 2001 | Mehlhorn, Kurt | | From Algorithm to Program to Software Library
In: Informatics : 10 years back, 10 years ahead, 268-273 | Part of a Book | |
| | 2001 | Mehlhorn, Kurt
[Meiser, Stefan]
[Rasch, Ronald] | | Furthest site abstract Voronoi diagrams
In: International Journal of Computational Geometry & Applications [11], 583-616 | Journal Article | |
| | 2001 | Crauser, Andreas
[Ferragina, Paolo]
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A. | | Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337 | Journal Article | |
| | 2001 | Althaus, Ernst
Mehlhorn, Kurt | | Traveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66 | Journal Article | |
| | 2000 | [Kececioglu, John]
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Reinert, Knut
[Vingron, Martin] | | A polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186 | Journal Article | |
| | 2000 | Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim | | A Polynomial-Time Fragment of Dominance Constraints
In: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), 368-375 | Proceedings Article | |
| | 2000 | Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan | | A strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99 | Journal Article | |
| | 2000 | [Cooper, Colin]
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker | | Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46 | Journal Article | |
| | 2000 | Mehlhorn, Kurt | | Constraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575 | Proceedings Article | |
| | 2000 | [Dey, Tamal K.]
Mehlhorn, Kurt
Ramos, Edgar A. | | Curve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244 | Journal Article | |
| | 2000 | Mehlhorn, Kurt
[Sack, Jörg-Rüdiger] | | Editorial
In: Computational Geometry [17], 1-2 | Journal Article | |
| | 2000 | Althaus, Ernst
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan | | Experiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114 | Electronic Proceedings Article | |
| | 2000 | Mehlhorn, Kurt
Thiel, Sven | | Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
In: Principles and practice of constraint programming - CP 2000 (CP-00) : 6th international conference, CP 2000, 306-319 | Proceedings Article | |
| | 2000 | Mehlhorn, Kurt
Schirra, Stefan | | Geometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286 | Proceedings Article | |
| | 2000 | Mehlhorn, Kurt
Schäfer, Guido | | Implementation of $O(nm \log n)$ weighted matchings: The power of data structures
In: 4th International Workshop on Algorithm Engineering, 23-38 | Proceedings Article | |
| | 2000 | Funke, Stefan
Mehlhorn, Kurt | | LOOK - a Lazy Object-Oriented Kernel for Geometric Computation
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 156-165 | Proceedings Article | |
| | 2000 | Mehlhorn, Kurt
Ziegelmann, Mark | | Resource Constrained Shortest Paths
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 326-337 | Proceedings Article | |
| | 2000 | Althaus, Ernst
Mehlhorn, Kurt | | TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 686-695 | Proceedings Article | |
| | 1999 | [Arikati, Srinivasa Rao]
Mehlhorn, Kurt | | A correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254 | Journal Article | |
| | 1999 | [Cheriyan, Joseph]
Mehlhorn, Kurt | | An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242 | Journal Article | |
| | 1999 | Mehlhorn, Kurt
[Näher, Stefan]
Seel, Michael
[Seidel, Raimund]
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian | | Checking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104 | Journal Article | |
| | 1999 | Finkler, Ulrich
Mehlhorn, Kurt | | Checking Priority Queues
In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 901-902 | Proceedings Article | |
| | 1999 | [Dey, Tamal K.]
Mehlhorn, Kurt
Ramos, Edgar A. | | Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206 | Proceedings Article | |
| | 1999 | Mehlhorn, Kurt
Sack, Jörg-Rüdiger
Urrutia, Jorg | | Editorial
In: Computational Geometry [12], 153-154 | Journal Article | |
| | 1999 | Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan | | Efficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350 | Proceedings Article | |
| | 1999 | Crauser, Andreas
[Ferragina, Paolo]
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A. | | I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138 | Proceedings Article | |
| | 1999 | Crauser, Andreas
Mehlhorn, Kurt | | LEDA-SM : Extending LEDA to Secondary Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 228-242 | Proceedings Article | |
| | 1999 | Mehlhorn, Kurt
[Näher, Stefan] | | LEDA: a platform for combinatorial and geometric computing | Book | |
| | 1999 | Arya, Sunil
Golin, Mordecai J.
Mehlhorn, Kurt | | On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228 | Journal Article | |
| | 1999 | Funke, Stefan
Mehlhorn, Kurt
[Näher, Stefan] | | Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs
In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), 39-42 | Proceedings Article | |
| | 1999 | Mehlhorn, Kurt | | Ten Years of LEDA Some Thoughts (Abstract)
In: Algorithm engineering (WAE-99) : 3rd International Workshop, 14-14 | Proceedings Article | |
| | 1999 | Mehlhorn, Kurt | | The Engineering of Some Bipartite Matching Programs
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 1-3 | Proceedings Article | |
| | 1999 | Mehlhorn, Kurt | | The Engineering of Some Bipartite Matching Programs
In: Foundations of software technology and theoretical computer science : 19th conference, 446-449 | Proceedings Article | |
| | 1998 | Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim | | A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304 | Journal Article | |
| | 1998 | Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Sanders, Peter | | A Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731 | Proceedings Article | |
| | 1998 | Mehlhorn, Kurt | | Amortisierte Analyse
In: Prinzipien des Algorithmenentwurfs, 91-102 | Part of a Book | |
| | 1998 | Mehlhorn, Kurt
Näher, Stefan | | From Algorithms to Working Programs on the Use of Program Checking in LEDA
In: Fundamentals - foundations of computer science : XV. IFIP world computer congress, 81-88 | Proceedings Article | |
| | 1998 | Mehlhorn, Kurt
Näher, Stefan | | From Algorithms to Working Programs: On the Use of Program Checking in LEDA
In: Mathematical foundations of computer science (MFCS-98) : 23rd international symposium, 84-93 | Proceedings Article | |
| | 1998 | Althaus, Ernst
Mehlhorn, Kurt | | Maximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113 | Journal Article | |
| | 1998 | Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A. | | Randomized External-Memory Algorithms for some Geometric Problems
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 259-268 | Proceedings Article | |
| | 1997 | Reinert, Knut
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Kececioglu, John | | A Branch-And-Cut algorithm for multiple sequence alignment
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 241-250 | Proceedings Article | |
| | 1997 | Mehlhorn, Kurt
[Shermer, Thomas C.]
[Yap, Chee] | | A complete roundness classification procedure
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 129-138 | Proceedings Article | |
| | 1997 | Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim | | A Computational Basis for Higher-dimensional Computational Geometry and Applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 254-263 | Proceedings Article | |
| | 1997 | Mehlhorn, Kurt
Burnikel, Christoph
Fleischer, Rudolf
Schirra, Stefan | | A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 702-709 | Proceedings Article | |
| | 1997 | [Cooper, Colin]
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker | | Average-case complexity of shortest-paths problems in the vertex-potential model
In: International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 15-26 | Proceedings Article | |
| | 1997 | Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich | | Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", 113-132 | Proceedings Article | |
| | 1997 | Mehlhorn, Kurt
[Sundar, R.]
Uhrig, Christian | | Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198 | Journal Article | |
| | 1997 | Mehlhorn, Kurt
Priebe, Volker | | On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka
In: Random Structures Algorithms [10], 205-220 | Journal Article | |
| | 1997 | Finkler, Ulrich
Mehlhorn, Kurt | | Runtime Prediction of Real Programs on Real Machines
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 380-389 | Proceedings Article | |
| | 1997 | Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian | | The LEDA platform for combinatorial and geometric computing
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 7-16 | Proceedings Article | |
| | 1996 | [Alt, Helmut]
[Guibas, L.]
Mehlhorn, Kurt
[Karp, Richard M.]
[Wigderson, A.] | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547 | Journal Article | |
| | 1996 | [Cheriyan, Joseph]
Mehlhorn, Kurt | | Algorithms for Dense Graphs and Networks on the Random Access Computer
In: Algorithmica [15], 521-549 | Journal Article | |
| | 1996 | [Cheriyan, Joseph]
Hagerup, Torben
Mehlhorn, Kurt | | An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
In: SIAM Journal on Computing [25], 1144-1170 | Journal Article | |
| | 1996 | Mehlhorn, Kurt
[Näher, Stefan]
Schilz, Thomas
Schirra, Stefan
Seel, Michael
[Seidel, Raimund]
Uhrig, Christian | | Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165 | Proceedings Article | |
| | 1996 | [Mehlhorn, Kurt]
Claus, Volker
Thomas, Wolfgang | | Komplexitätstheorie und Algorithmik
In: Informatik : Grundlagen - Anwendungen - Perspektiven, 113-116 | Proceedings Article | |
| | 1996 | Mehlhorn, Kurt
Mutzel, Petra | | On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
In: Algorithmica [16], 233-242 | Journal Article | |
| | 1996 | Mehlhorn, Kurt | | Position Paper for Panel Discussion
In: Applied Computational Geormetry, Towards Geometric Engineering, FCRC'96 Workshop, WACG'96, Selected Papers, 51-52 | Proceedings Article | |
| | 1996 | Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian | | The LEDA Platform for Combinatorial and Geometric Computing
In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, 43-50 | Proceedings Article | |
| | 1996 | Mehlhorn, Kurt | | The LEDA Platform of Combinatorial and Geometric Computing
In: Proceedings of Conference on Computing: The Australian Theory Symposium, 126-126 | Proceedings Article | |
| | 1995 | Fleischer, Rudolf
[Jung, Hermann]
Mehlhorn, Kurt | | A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161 | Journal Article | |
| | 1995 | Burnikel, Christoph
Könemann, Jochen
Mehlhorn, Kurt
[Näher, Stefan]
Schirra, Stefan
Uhrig, Christian | | Exact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19 | Proceedings Article | |
| | 1995 | Mehlhorn, Kurt | | Experiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518 | Proceedings Article | |
| | 1995 | Mehlhorn, Kurt | | Guest Editor's Foreword
In: Discrete and Computational Geometry [14], 363-363 | Journal Article | |
| | 1995 | Mehlhorn, Kurt
Näher, Stefan | | LEDA : A Platform for Combinatorial and Geometric Computing | Report | |
| | 1995 | Mehlhorn, Kurt
[Näher, Stefan] | | LEDA: A Platform for Combinatorial and Geometric Computing
In: Communications of the ACM [38], 96-102 | Journal Article | |
| | 1995 | [Dietz, Paul]
Mehlhorn, Kurt
[Raman, Rajeev]
Uhrig, Christian | | Lower bounds for set intersection queries
In: Algorithmica [14], 154-168 | Journal Article | |
| | 1995 | Mehlhorn, Kurt
Priebe, Volker | | On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
In: Algorithms - ESA'95: 3rd Annual European Symposium, 185-198 | Proceedings Article | |
| | 1994 | Kaufmann, Michael
Mehlhorn, Kurt | | A linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246 | Journal Article | |
| | 1994 | Bilardi, Gianfranco
Chaudhuri, Shiva
Dubhashi, Devdatt
Mehlhorn, Kurt | | A lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105 | Journal Article | |
| | 1994 | [Dietzfelbinger, Martin]
[Karlin, Anna]
Mehlhorn, Kurt
[Meyer Auf Der Heide, Friedhelm]
[Rohnert, Hans]
[Tarjan, Robert E.] | | Dynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761 | Journal Article | |
| | 1994 | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | | Dynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380 | Journal Article | |
| | 1994 | Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan | | How to Compute the Voronoi Diagram of Line Segments:
Theoretical and Experimental Results
In: Algorithms (ESA-94) : 2nd annual European symposium, 227-239 | Proceedings Article | |
| | 1994 | Mehlhorn, Kurt
Näher, Stefan
Nievergelt, Jurg | | Introduction
In: Journal of Symbolic Computation [17], 295-295 | Journal Article | |
| | 1994 | Mehlhorn, Kurt
Sundar, R.
Uhrig, Christian | | Maintaining dynamic sequences under equality-tests in polylogarithmic time
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 213-222 | Proceedings Article | |
| | 1994 | Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan | | On degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23 | Proceedings Article | |
| | 1994 | Mehlhorn, Kurt
Näher, Stefan | | The Implementation of Geometric Algorithms
In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, 223-231 | Proceedings Article | |
| | 1993 | Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette | | A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron | Report | |
| | 1993 | Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette | | A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324 | Proceedings Article | |
| | 1993 | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | | Dynamic Interpolation Search
In: Journal of the ACM [40], 621-634 | Journal Article | |
| | 1993 | Kucera, Ludek
Mehlhorn, Kurt
Preis, B.
Schwarzenecker, E. | | Exact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322 | Proceedings Article | |
| | 1993 | Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund | | Four Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212 | Journal Article | |
| | 1993 | Dietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian | | Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201 | Proceedings Article | |
| | 1993 | Hagerup, Torben
Mehlhorn, Kurt
Munro, I. | | Maintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264 | Proceedings Article | |
| | 1993 | Klein, Rolf
Mehlhorn, Kurt
Meiser, Stefan | | Randomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184 | Journal Article | |
| | 1993 | Dubhashi, Devdatt P.
Ranjan, Desh
Mehlhorn, Kurt
Thiel, Christian | | Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, 436-443 | Proceedings Article | |
| | 1993 | Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo | | Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
In: Computational Geometry: Theory and Applications [3], 235-246 | Journal Article | |
| | 1992 | Alt, Helmut
Geffert, Viliam
Mehlhorn, Kurt | | A lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27 | Journal Article | |
| | 1992 | Mehlhorn, Kurt
Näher, Stefan | | Algorithm Design and Software Libraries: Recent Developments in the LEDA Project
In: Proceedings of the IFIP 12th World Computer Congress. Volume 1: Algorithms, Software, Architecture, 493-508 | Proceedings Article | |
| | 1992 | Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian | | Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408 | Journal Article | |
| | 1992 | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | | Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258 | Proceedings Article | |
| | 1992 | Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund | | Four Results on Randomized Incremental Constructions
In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, 463-474 | Proceedings Article | |
| | 1992 | Kaufmann, Michael
Mehlhorn, Kurt | | On local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72 | Journal Article | |
| | 1992 | Klein, Rolf
Mehlhorn, Kurt
Meiser, Stefan | | Randomized incremental construction of abstract Voronoi diagrams
In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308 | Part of a Book | |
| | 1992 | Mehlhorn, Kurt | | Recent Developments in Algorithms for the Maximum Flow Problem (Abstract)
In: Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992), 404-404 | Proceedings Article | |
| | 1992 | Fleischer, Rudolf
Fries, Otfried
Mehlhorn, Kurt
Meiser, Stefan
Näher, Stefan
Rohnert, Hans
Schirra, Stefan
Simon, Klaus
Tsakalidis, Athanasios
Uhrig, Christian | | Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43 | Part of a Book | |
| | 1992 | Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng | | Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389 | Journal Article | |
| | 1992 | Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo | | Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93 | Proceedings Article | |
| | 1992 | Mehlhorn, Kurt
[Paul, Wolfgang J.]
Uhrig, C | | $k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129 | Journal Article | |
| | 1991 | Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A. | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities | Report | |
| | 1991 | Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt | | A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401 | Proceedings Article | |
| | 1991 | Alt, Helmut
Blum, Norbert
Mehlhorn, Kurt
Paul, Markus | | Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240 | Journal Article | |
| | 1991 | Mehlhorn, Kurt
Yap, Chee-Keng | | Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
In: SIAM Journal on Computing [20], 603-621 | Journal Article | |
| | 1991 | Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E. | | Dynamic Perfect Hashing: Upper and Lower Bounds | Report | |
| | 1991 | Mehlhorn, Kurt
Meiser, Stefan
O'Dúnlaing, Colm | | On the construction of abstract Voronoi diagrams
In: Discrete & Computational Geometry [6], 211-224 | Journal Article | |
| | 1990 | Mehlhorn, Kurt
Näher, Stefan | | A faster compaction algorithm with automatic jog insertion
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 158-166 | Journal Article | |
| | 1990 | Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian | | Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289 | Proceedings Article | |
| | 1990 | Mehlhorn, Kurt
Näher, Stefan | | Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
In: Information Processing Letters [35], 183-189 | Journal Article | |
| | 1990 | Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt | | Can A Maximum Flow be Computed in o(nm) Time?
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248 | Proceedings Article | |
| | 1990 | Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt | | Can a maximum flow be computed in $o(nm)$ time? | Report | |
| | 1990 | Mehlhorn, Kurt
Rülling, W. | | Compaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397 | Journal Article | |
| | 1990 | Mehlhorn, Kurt
Tsakalidis, A. | | Data Structures
In: Handbook of Theoretical Computer Science, 301-341 | Part of a Book | |
| | 1990 | Ching, Yu-Tai
Mehlhorn, Kurt
Smid, Michiel H. M. | | Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40 | Journal Article | |
| | 1990 | Mehlhorn, Kurt
Näher, Stefan | | Dynamic Fractional Cascading
In: Algorithmica [5], 215-241 | Journal Article | |
| | 1990 | Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E. | | Faster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223 | Journal Article | |
| | 1990 | Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian | | Hidden line elimination for isooriented rectangles | Report | |
| | 1990 | Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian | | Hidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143 | Journal Article | |
| | 1990 | Näher, Stefan
Mehlhorn, Kurt | | LEDA - A Library of Efficient Data Types and Algorithms
In: GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, 35-39 | Proceedings Article | |
| | 1990 | Näher, Stefan
Mehlhorn, Kurt | | LEDA: A Library of Efficient Data Types and Algorithms
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 1-5 | Proceedings Article | |
| | 1990 | Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng | | On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224 | Proceedings Article | |
| | 1990 | Mehlhorn, Kurt
Näher, Stefan
Rauch, Monika | | On the Complexity of a Game Related to the Dictionary Problem
In: SIAM Journal on Computing [19], 902-906 | Journal Article | |
| | 1990 | Mehlhorn, Kurt
Meiser, Stefan
Ó'Dúnlaing, Colm | | On the Construction of Abstract Voronoi Diagrams
In: Theoretical aspects of computer science (STACS-90) : 7th annual symposium, 227-239 | Proceedings Article | |
| | 1990 | Klein, R.
Mehlhorn, Kurt
Meiser, Stefan | | On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154 | Proceedings Article | |
| | 1990 | Kaufmann, Morgan
Mehlhorn, Kurt | | Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184 | Part of a Book | |
| | 1989 | Mehlhorn, Kurt
Näher, S | | A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106 | Proceedings Article | |
| | 1989 | Fürer, Martin
Mehlhorn, Kurt | | AT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336 | Journal Article | |
| | 1989 | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | | Data structures | Report | |
| | 1989 | Loeckx, Jacques
Mehlhorn, Kurt
Wilhelm, Reinhard | | Foundations of Programming Languages | Book | |
| | 1989 | Mehlhorn, Kurt
Näher, Stefan | | LEDA: A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106 | Proceedings Article | |
| | 1989 | Mehlhorn, Kurt
Näher, Stefan
Rauch, Monika | | On the Complexity of a Game Related to the Dictionary Problem
In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), 546-548 | Proceedings Article | |
| | 1989 | Mehlhorn, Kurt
Meiser, Stefan
O'Dunlaing, Colm | | On the construction of abstract Voronoi diagrams | Report | |
| | 1989 | [Klein, R.]
Mehlhorn, Kurt
[Meiser, Stefan] | | On the construction of abstract Voronoi diagrams, II. | Report | |
| | 1989 | Kaufmann, Michael
Mehlhorn, Kurt | | Routing Problems in Grid Graphs | Report | |
| | 1989 | Kaufmann, Michael
Mehlhorn, Kurt | | Routing problems in grid graphs | Report | |
| | 1989 | Mehlhorn, Kurt
[Paul, Wolfgang J.] | | Two Versus One Index Register and Modifiable Versus Non-modifiable Programs
In: Automata, languages and programming (ICALP-89) : 16th international colloquium, 603-609 | Proceedings Article | |
| | 1988 | Mehlhorn, Kurt | | A faster approximation algorithm for the Steiner problem in graphs
In: Information Processing Letters [27], 125-128 | Journal Article | |
| | 1988 | Kaufmann, Michael
Mehlhorn, Kurt | | A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs | Report | |
| | 1988 | Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut | | A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102 | Journal Article | |
| | 1988 | Mehlhorn, Kurt
Rülling, W. | | Compaction on the Torus | Report | |
| | 1988 | Mehlhorn, Kurt
Rülling, W. | | Compaction on the Torus
In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, 212-225 | Proceedings Article | |
| | 1988 | Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo | | Congruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256 | Journal Article | |
| | 1988 | Mehlhorn, Kurt
Yap, Chee-Keng | | Constructive Hopf's theorem: or how to untangle closed planar curves | Report | |
| | 1988 | Mehlhorn, Kurt
Yap, Chee-Keng | | Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
In: Automata, languages and programming (ICALP-88) : 15th international colloquium, 410-423 | Proceedings Article | |
| | 1988 | Mehlhorn, Kurt | | Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen | Book | |
| | 1988 | Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E. | | Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531 | Proceedings Article | |
| | 1988 | Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E. | | Faster Algorithms for the Shortest Path Problem | Report | |
| | 1988 | Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E. | | Faster Algorithms for the Shortest Path Problem | Report | |
| | 1988 | Gao, Shaodi
Jerrum, Mark
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang | | On Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402 | Proceedings Article | |
| | 1988 | Gao, Shaodi
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
Storb, Christoph
Jerrum, Mark | | On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70 | Proceedings Article | |
| | 1988 | Jung, Hermann
Mehlhorn, Kurt | | Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236 | Journal Article | |
| | 1988 | Mehlhorn, Kurt | | SFB 124: VLSI-Entwurfsmethoden und Parallelität
In: GI - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems, 3-29 | Proceedings Article | |
| | 1988 | Dietzfelbinger, Martin
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, H. | | Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215 | Proceedings Article | |
| | 1987 | Mehlhorn, Kurt | | A Faster Approximation Algorithm for the Steiner Problem in Graphs | Report | |
| | 1987 | Mehlhorn, Kurt
Näher, Stefan | | A faster compaction algorithm with automatic jog insertion | Report | |
| | 1987 | Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut | | A Lower Bound for the Complexity of the Union-Split-Find Problem
In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, 479-488 | Proceedings Article | |
| | 1987 | Fries, O.
Mehlhorn, Kurt
Näher, Stefan
Tsakalidis, A. | | A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273 | Journal Article | |
| | 1987 | Mehlhorn, Kurt
Preparata, Franco P. | | Area-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$
In: Information and Computation [72], 270-282 | Journal Article | |
| | 1987 | [Alt, Helmut]
Mehlhorn, Kurt
[Wagener, Hubert]
[Welzl, Emo] | | Congruence, similarity and symmetries of geometric objects | Report | |
| | 1987 | Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo | | Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315 | Proceedings Article | |
| | 1987 | Alt, Helmut
Hagerup,Torben
Mehlhorn, Kurt
Preparata, Franco P. | | Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15 | Proceedings Article | |
| | 1987 | Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P. | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835 | Journal Article | |
| | 1987 | Kaufmann, Michael
Mehlhorn, Kurt | | On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52 | Proceedings Article | |
| | 1987 | Jung, Hermann
Mehlhorn, Kurt | | Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees | Report | |
| | 1986 | Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut | | A Lower Bound for the Complexity of the Union-Split-Find Problem | Report | |
| | 1986 | Becker, Michael
Mehlhorn, Kurt | | Algorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176 | Journal Article | |
| | 1986 | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | | An Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33 | Journal Article | |
| | 1986 | Mehlhorn, Kurt
Preparata, Franco P. | | Area-time Optimal Division for T=Omega(log n)$^1+epsilon$"
In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, 341-352 | Proceedings Article | |
| | 1986 | Fürer, Martin
Mehlhorn, Kurt | | AT$^2$-Optimal Galois Field Multiplier for VLSI
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 217-225 | Proceedings Article | |
| | 1986 | Mehlhorn, Kurt
Preparata, Franco P.
Sarrafzadeh, Maji | | Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221 | Journal Article | |
| | 1986 | Mehlhorn, Kurt | | Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen | Book | |
| | 1986 | Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P. | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208 | Proceedings Article | |
| | 1986 | Mehlhorn, Kurt
Näher, Stefan | | Dynamic fractional cascading | Report | |
| | 1986 | Loeckx, Jacques
Mehlhorn, Kurt
Wilhelm, Reinhard | | Grundlagen der Programmiersprachen | Book | |
| | 1986 | Mehlhorn, Kurt
Schmidt, Bernd H. | | On BF-orderable graphs
In: Discrete Applied Mathematics [15], 315-327 | Journal Article | |
| | 1986 | Kaufmann, Michael
Mehlhorn, Kurt | | On Local Routing of Two-Terminal Nets | Report | |
| | 1986 | Kaufmann, Michael
Mehlhorn, Kurt | | Routing through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531 | Journal Article | |
| | 1986 | Mehlhorn, Kurt
Preparata, F. P. | | Routing through a Rectangle
In: Journal of the ACM [33], 60-85 | Journal Article | |
| | 1986 | Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E. | | Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184 | Journal Article | |
| | 1986 | Mehlhorn, Kurt | | Über Verdrahtungsalgorithmen
In: Informatik Spektrum [9], 227-234 | Journal Article | |
| | 1986 | [Fürer, Martin]
[Mehlhorn, Kurt] | | VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328 | Proceedings | |
| | 1986 | [Fürer, Martin]
[Mehlhorn, Kurt] | | VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328 | Proceedings | |
| | 1986 | Lengauer, Thomas
Mehlhorn, Kurt | | VLSI complexity, efficient VLSI algorithms and the HILL design system
In: Algorithmics for VLSI, 33-89 | Part of a Book | |
| | 1985 | Mannila, Heikki
Mehlhorn, Kurt | | A fast algorithm for renaming a set of clauses as a Horn set
In: Information Processing Letters [21], 269-272 | Journal Article | |
| | 1985 | Mehlhorn, Kurt
Preparata, Franco P. | | Area-time optimal division for T=omega((logn)1+epsilon) | Report | |
| | 1985 | Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P. | | Deterministic simulation of idealized parallel computers on more realistic ones | Report | |
| | 1985 | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | | Dynamic Interpolation Search
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 424-434 | Proceedings Article | |
| | 1985 | Fries, O.
Mehlhorn, Kurt
Näher, Stefan | | Dynamization of geometric data structures | Report | |
| | 1985 | Fries, O.
Mehlhorn, Kurt
Näher, Stefan | | Dynamization of geometric data structures
In: Computational geometry (SCG-85) : 1st symposium, 168-176 | Proceedings Article | |
| | 1985 | Hertel, Stefan
Mehlhorn, Kurt | | Fast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76 | Journal Article | |
| | 1985 | Mehlhorn, Kurt
Simon, Klaus | | Intersecting two polyhedra one of which is convex
In: FCT '85: Fundamentals of Computation Theory, 534-542 | Proceedings Article | |
| | 1985 | Mehlhorn, Kurt
Schmidt, Bernd H. | | On BF-perfect graphs | Report | |
| | 1985 | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | | Routing Through a Generalized Switchbox
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 328-337 | Proceedings Article | |
| | 1985 | Alt, Helmut
Mehlhorn, Kurt | | Searching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848 | Journal Article | |
| | 1985 | Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E. | | Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203 | Proceedings Article | |
| | 1984 | Becker, Michael
Mehlhorn, Kurt | | Algorithms for routing in planar graphs | Report | |
| | 1984 | Mehlhorn, Kurt
Preparata, Franco P. | | Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
In: Automata, languages and programming (ICALP-84) : 11th colloquium, 347-357 | Proceedings Article | |
| | 1984 | Mehlhorn, Kurt | | Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proof | Report | |
| | 1984 | Mehlhorn, Kurt | | Data structures and algorithms. Volume 1 : Sorting and searching | Book | |
| | 1984 | Mehlhorn, Kurt | | Data structures and algorithms. Volume 2 : Graph algorithms and NP-completeness | Book | |
| | 1984 | Mehlhorn, Kurt | | Data structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometry | Book | |
| | 1984 | Lengauer, Thomas
Mehlhorn, Kurt | | Four results on the complexity of VLSI computation
In: Advances in Computing Research [2], 1-22 | Journal Article | |
| | 1984 | Hoffmann, K
Mehlhorn, Kurt | | Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121 | Journal Article | |
| | 1984 | [Kaufmann, Michael]
[Mehlhorn, Kurt] | | Local routing of two-terminal nets is easy | Report | |
| | 1984 | Mehlhorn, Kurt | | On Optimal VLSI-Circuits for the Basic Arithmetic Functions
In: 9. Colloquium on Trees in Algebra and Programming (CAAP'84), 23-30 | Proceedings Article | |
| | 1984 | Alt, Helmut
Mehlhorn, Kurt
Munro, J. | | On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65 | Journal Article | |
| | 1984 | Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian | | Partial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65 | Journal Article | |
| | 1984 | Mehlhorn, Kurt
Vishkin, Uzi | | Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
In: Acta Informatica [21], 339-374 | Journal Article | |
| | 1984 | Kaufmann, Michael
Mehlhorn, Kurt | | Routing through a generalized switchbox | Report | |
| | 1984 | Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E. | | Sorting Jordan sequences in linear time | Report | |
| | 1984 | Hertel, Stefan
Mäntylä, Martti
Mehlhorn, Kurt
Nievergelt, Jurg | | Space Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519 | Journal Article | |
| | 1984 | [Hertel, Stefan]
[Mehlhorn, Kurt]
[Mäntylä, Martti]
[Nievergelt, Jurg] | | Space sweep solves intersection of two convex polyhedra elegantly | Report | |
| | 1984 | Lengauer, Thomas
Mehlhorn, Kurt | | The HILL system: A design environment for the hierarchical spezification, compaction, and simulation of integrated circuit layouts
In: Proceedings, Conference on Advanced Research in VLSI, 139-149 | Proceedings Article | |
| | 1984 | Mehlhorn, Kurt | | Über Verdrahtungsalgorithmen
In: GI Jahrestagung (Fachgespräche), 79-89 | Proceedings Article | |
| | 1984 | Mehlhorn, Kurt | | $AT^2$-optimal VLSI integer division and integer square rooting
In: Integration, the VLSI Journal [2], 163-167 | Journal Article | |
| | 1983 | Mehlhorn, Kurt
Schmidt, Bernd H. | | A Single Shortest Path Algorithm for Graphs with Separators
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 302-309 | Proceedings Article | |
| | 1983 | Mehlhorn, Kurt
Preparata, Franco P. | | Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time | Report | |
| | 1983 | Mehlhorn, Kurt
Preparata, Franco P. | | Area-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time
In: Information and Control [58], 137-156 | Journal Article | |
| | 1983 | Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L. | | Cost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728 | Journal Article | |
| | 1983 | Hertel, Stefan
Mehlhorn, Kurt | | Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218 | Proceedings Article | |
| | 1983 | Lengauer, Thomas
Mehlhorn, Kurt | | Four results on the complexity of VLSI computations | Report | |
| | 1983 | Mehlhorn, Kurt
Vishkin, Uzi | | Granularity of parallel memories | Report | |
| | 1983 | Mehlhorn, Kurt
Preparata, F. P. | | Routing through a Rectangle | Report | |
| | 1983 | Lengauer, Thomas
Mehlhorn, Kurt | | The HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layouts | Report | |
| | 1983 | von Braunmühl, Burchard
Cook, Stephen
Mehlhorn, Kurt
Verbeek, Rutger | | The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51 | Journal Article | |
| | 1983 | Lengauer, Thomas
Mehlhorn, Kurt | | VLSI Complexity, Efficient VLSI Algorithms and the HILL Design System | Report | |
| | 1983 | Mehlhorn, Kurt | | $AT^2$-optimal VLSI for integer division and integer square rooting | Report | |
| | 1983 | Mehlhorn, Kurt
Preparata, F. P. | | $AT^2$-optimal VLSI multipliers with minimum computation time
In: Information & Control [58], 137-196 | Journal Article | |
| | 1982 | Huddleston, Scott
Mehlhorn, Kurt | | A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184 | Journal Article | |
| | 1982 | Mehlhorn, Kurt | | A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
In: SIAM Journal on Computing [11], 748-760 | Journal Article | |
| | 1982 | Becker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T. | | A Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136 | Journal Article | |
| | 1982 | Hong, Jia-Wei
Mehlhorn, Kurt | | Cost tradeoffs in graph embeddings, with applications | Report | |
| | 1982 | Mehlhorn, Kurt
Schmidt, Erik M. | | Las Vegas Is better than Determinism in VLSI and Distributed Computing
In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), 330-337 | Proceedings Article | |
| | 1982 | Mehlhorn, Kurt | | On the Program Size of Perfect and Universal Hash Functions
In: 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), 170-175 | Proceedings Article | |
| | 1982 | Eisenbarth, Bernhard
Ziviani, Nivio
Gonnet, Gaston H.
Mehlhorn, Kurt
Wood, Derick | | The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174 | Journal Article | |
| | 1981 | Mehlhorn, Kurt | | Arbitrary Weight Changes in Dynamic Trees
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO [15], 183-211 | Journal Article | |
| | 1981 | Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L. | | Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55 | Proceedings Article | |
| | 1981 | Mehlhorn, Kurt | | Lower bounds on the efficiency of transforming static data structures into dynamic structures
In: Mathematical Systems Theory [15], 1-16 | Journal Article | |
| | 1981 | Lengauer, Thomas
Mehlhorn, Kurt | | On the Complexity of VLSI-Computations
In: VLSI Systems and Computations [??], 89-99 | Journal Article | |
| | 1981 | Mehlhorn, Kurt
Overmars, Mark H. | | Optimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98 | Journal Article | |
| | 1981 | Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian | | Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161 | Proceedings Article | |
| | 1981 | Huddleston, S.
Mehlhorn, Kurt | | Robust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244 | Proceedings Article | |
| | 1980 | Mehlhorn, Kurt | | A New Data Structure for Representing Sorted Lists
In: Graph-theoretic concepts in computer science (WG-80) : 6th international workshop, 90-112 | Proceedings Article | |
| | 1980 | Mehlhorn, Kurt | | An Efficient Algorithm for Constructing Nearly Optimal Prefix Codes
In: IEEE Transactions on Information Theory [26], 513-517 | Journal Article | |
| | 1980 | Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang | | Binary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61 | Journal Article | |
| | 1980 | Altenkamp, Doris
Mehlhorn, Kurt | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427 | Journal Article | |
| | 1980 | Mehlhorn, Kurt | | Lower bounds on the efficiency of transforming static data structures into dynamic structures | Report | |
| | 1980 | Blum, Norbert
Mehlhorn, Kurt | | On the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320 | Journal Article | |
| | 1980 | Mehlhorn, Kurt
Overmars, Mark H. | | Optimal dynamization of decomposable searching problems | Report | |
| | 1980 | Mehlhorn, Kurt | | Pebbling Mountain Ranges and its Application of DCFL-Recognition
In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, 422-435 | Proceedings Article | |
| | 1979 | Alt, Helmut
Mehlhorn, Kurt | | Complexity arguments in algebraic language theory
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique [13], 217-225 | Journal Article | |
| | 1979 | Mehlhorn, Kurt | | Dynamic Binary Search
In: SIAM Journal on Computing [8], 175-198 | Journal Article | |
| | 1979 | Mehlhorn, Kurt | | Dynamic data structures
In: Mathematical Centre Tracts [108], 71-96 | Journal Article | |
| | 1979 | Mehlhorn, Kurt | | Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens
In: GI - 9. Jahrestagung, 16-22 | Proceedings Article | |
| | 1979 | Blum, Norbert
Mehlhorn, Kurt | | Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78 | Proceedings Article | |
| | 1979 | Mehlhorn, Kurt
Tsagarakis, M. | | On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs
In: Colloque de Lille `Les Arbres en Algebre et en Programmation' [??], ?? | Journal Article | |
| | 1979 | Mehlhorn, Kurt | | Parsing Macro Grammars Top Down
In: Information and Control [40], 123-143 | Journal Article | |
| | 1979 | Mehlhorn, Kurt | | Searching, Sorting and Information Theory
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 131-145 | Proceedings Article | |
| | 1979 | Mehlhorn, Kurt | | Some Remarks on Boolean Sums
In: Acta Informatica [12], 371-375 | Journal Article | |
| | 1979 | Mehlhorn, Kurt | | Some Remarks on Boolean Sums
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 375-380 | Proceedings Article | |
| | 1979 | Mehlhorn, Kurt | | Sorting Presorted Files
In: Theoretical Computer Science, 4th GI-Conference, 199-212 | Proceedings Article | |
| | 1978 | Mehlhorn, Kurt | | An efficient algorithm for constructing nearly optimal prefix codes | Report | |
| | 1978 | Mehlhorn, Kurt | | Arbitrary Weight Changes in Dynamic Trees | Report | |
| | 1978 | Altenkamp, Doris
Mehlhorn, Kurt | | Codes: Unequal Probabilities, Unequal Letter Cost | Report | |
| | | | | | | |
| | 1978 | Altenkamp, Doris
Mehlhorn, Kurt | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25 | Proceedings Article | |
| | 1978 | Alt, Helmut
Mehlhorn, Kurt | | Complexity Arguments in Algebraic Language Theory | Report | |
| | 1978 | Mehlhorn, Kurt | | Effiziente Algorithmen: Ein Beispiel | Report | |
| | 1978 | Mehlhorn, Kurt | | Effiziente Algorithmen: Ein Beispiel
In: Informatik Spektrum [1], 81-89 | Journal Article | |
| | 1978 | Blum, Norbert
Mehlhorn, Kurt | | On the Average Number of Rebalancing Operations in Weight-Balanced Trees | Report | |
| | 1978 | Mehlhorn, Kurt | | Sorting Presorted Files | Report | |
| | 1977 | Mehlhorn, Kurt | | A best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239 | Journal Article | |
| | 1977 | Mehlhorn, Kurt | | Dynamic Binary Search
In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336 | Proceedings Article | |
| | 1977 | Mehlhorn, Kurt | | Effiziente Algorithmen | Book | |
| | 1977 | Deussen, Peter
Mehlhorn, Kurt | | Van Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199 | Journal Article | |
| | 1976 | Mehlhorn, Kurt | | An improved lower bound on the formula complexity of context-free recognition | Report | |
| | 1976 | Mehlhorn, Kurt | | An Improved Lower Bound on the Formula Complexity of Context-Free Recognition
In: Elektronische Informationsverarbeitung und Kybernetik [12], 523-524 | Journal Article | |
| | 1976 | Mehlhorn, Kurt | | An O(n log n) lower bound for the synchronous circuit size of integer multiplication | Report | |
| | 1976 | Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang | | Binary Search Trees: Average and Worst Case Behavior | Report | |
| | 1976 | Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Wernet, Norbert | | Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313 | Proceedings Article | |
| | 1976 | Mehlhorn, Kurt | | Bracket-languages are recognizable in logarithmic space
In: Information Processing Letters [5], 168-170 | Journal Article | |
| | 1976 | Mehlhorn, Kurt | | Dynamic Binary Search | Report | |
| | 1976 | Mehlhorn, Kurt | | Dynamic Binary Search Trees : Extended Abstracts | Report | |
| | 1976 | Alt, Helmut
Mehlhorn, Kurt | | Lower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354 | Proceedings Article | |
| | 1976 | Mehlhorn, Kurt
Galil, Zvi | | Monotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111 | Journal Article | |
| | 1976 | Mehlhorn, Kurt | | Polynomial and abstract subrecursive classes
In: Journal of Computer and System Sciences [12], 147-178 | Journal Article | |
| | 1976 | Heydthausen, Manfred
Mehlhorn, Kurt | | Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108 | Proceedings Article | |
| | 1976 | Heydthausen, Manfred
Mehlhorn, Kurt | | Top down parsing of macro grammars (preliminary report) | Report | |
| | 1975 | Mehlhorn, Kurt | | A game on graphs | Report | |
| | 1975 | Alt, Helmut
Mehlhorn, Kurt | | A Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33 | Journal Article | |
| | 1975 | Mehlhorn, Kurt | | Best possible bounds for the weighted path length of optimum binary search trees
In: Automata Theory and Formal Languages, 2nd GI Conference, 31-41 | Proceedings Article | |
| | 1975 | Mehlhorn, Kurt | | Bracket-Languages are Recognizable in Logarithmic Space | Report | |
| | 1975 | Mehlhorn, Kurt
Galil, Zvi | | Monotone Switching Circuits and Boolean Matrix Product
In: Mathematical foundations of computer science (MFCS-75) : 4th symposium, 315-319 | Proceedings Article | |
| | 1975 | Mehlhorn, Kurt | | Nearly Optimal Binary Search Trees
In: Acta Informatica [5], 287-295 | Journal Article | |
| | 1975 | Alt, Helmut
Mehlhorn, Kurt | | Untere Schranken für den Platzbedarf bei der kontext-freien Analyse | Report | |
| | 1974 | Mehlhorn, Kurt | | Polynomial and abstract subrecursive classes
Cornell University | Thesis - PhD thesis | |
| | 1974 | Mehlhorn, Kurt | | Polynomial and abstract subrecursive classes
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 14 | Report | |
| | 1974 | Mehlhorn, Kurt | | Polynomial and Abstract Subrecursive Classes
In: Conference Record of Sixth Annual ACM Symposium on Theory of computing (STOC-74), 96-109
In: Informatik Spektrum, 96-109 | Proceedings Article | |
| | 1974 | Mehlhorn, Kurt | | The 'almost all' theory of subrecursive degrees is decidable
In: Automata, languages and programming : 2nd colloquium (ICALP-74), 317-325 | Proceedings Article | |
| | 1973 | Mehlhorn, Kurt | | On the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 190-196 | Proceedings Article | |
| | 1973 | Mehlhorn, Kurt | | On the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 22 | Report | |
| | 1973 | Mehlhorn, Kurt | | The "almost all" theory of subrecursive degrees is decidable
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 25 | Report | |
| 27 |
 | Mehlhorn, Kurt (ed.) |
| |
| 2 |
| |
| 3 |
| Mehnert, Jens |
| |
| 1 |
| |
| 5 |
| Meineche Schmidt, Erik (ed.) |
| |
| 1 |
| |
| 4 |
| Meinel, Christoph (ed.) |
| |
| 9 |
| |
| 1 |
| Mercas, Robert |
| |
| 1 |
| Merelo-Guervós, Juan J. (ed.) |
| |
| 1 |
| Merkle, Wolfgang (ed.) |
| |
| 31 |
| |
| 1 |
| Metzler, Matthias |
| |
| 1 |
| |
| 5 |
| Meyer auf der Heide, Friedhelm |
| |
| 9 |
| Meyer auf der Heide, Friedhelm (ed.) |
| |
| 1 |
| Meyerhenke, Henning |
| |
| 2 |
| |
| 1 |
| Meyer, Andreas |
| |
| 46 |
| |
| 9 |
| Meyer, Ulrich (ed.) |
| |
| 1 |
| |
| 1 |
| Michaelson, S. (ed.) |
| |
| 1 |
| |
| 15 |
| Michail, Dimitrios |
| |
| 2 |
| |
| 1 |
| Michalewicz, Zbigniew |
| |
| 1 |
| |
| 1 |
| Michel, Laurent |
| |
| 1 |
| |
| 2 |
| Mignotte, Anne (ed.) |
| |
| 1 |
| |
| 1 |
| Milano, Michela (ed.) |
| |
| 1 |
| |
| 2 |
| Miller, Julian (ed.) |
| |
| 1 |
| |
| 3 |
| Miller, Tobias |
| |
| 2 |
| |
| 1 |
| Milner, R. (ed.) |
| |
| 9 |
| |
| 2 |
| Minder, Lorenz |
| |
| 1 |
| |
| 2 |
| Mirkowska, Grazyna (ed.) |
| |
| 8 |
| |
| 2 |
| Mitchell, Joe (ed.) |
| |
| 1 |
| |
| 1 |
| Mitchell, Joseph S. B. (ed.) |
| |
| 1 |
| |
| 6 |
| Mitzenmacher, Michael |
| |
| 1 |
| |
| 1 |
| Mladenic, Dunja (ed.) |
| |
| 4 |
| |
| 1 |
| Moehring, Rolf H. |
| |
| 3 |
| |
| 1 |
| Möhring, Rolf H. |
| |
| 5 |
| |
| 1 |
| Mohri, Mehryar (ed.) |
| |
| 1 |
| |
| 1 |
| Möller, Bernhard (ed.) |
| |
| 2 |
| |
| 6 |
| Monien, Burkhard (ed.) |
| |
| 1 |
| |
| 2 |
| Montanari, Ugo (ed.) |
| |
| 3 |
| |
| 1 |
| Montresor, Alberto (ed.) |
| |
| 5 |
| |
| 2 |
| Moore, Jason (ed.) |
| |
| 3 |
| |
| 2 |
| Moran, Shay |
| |
| 1 |
| |
| 2 |
| Moreno Maza, Marc (ed.) |
| |
| 1 |
| |
| 3 |
| Moret, Bernard (ed.) |
| |
| 1 |
| |
| 1 |
| Morgenstern, Gila (ed.) |
| |
| 1 |
| |
| 1 |
| Morin, Pat (ed.) |
| |
| 1 |
| |
| 1 |
| Morozov, Dmitriy |
| |
| 1 |
| |
| 2 |
| Mortensen, Christian Worm |
| |
| 4 |
| |
| 1 |
| Moser, Hannes |
| |
| 1 |
| |
| 1 |
| Motskin, Arik |
| |
| 1 |
| |
| 10 |
| Mount, David M. |
| |
| 1 |
| |
| 4 |
| Mourrain, Bernard |
| |
| 1 |
| |
| 1 |
| Mucherino, Antonio (ed.) |
| |
| 1 |
| |
| 4 |
| Müller-Hannemann, Matthias (ed.) |
| |
| 1 |
| |
| 2 |
| Müller, Joachim |
| |
| 2 |
| |
| 3 |
| Müller, Michael |
| |
| 8 |
| |
| 2 |
| Müller, Tobias |
| |
| 1 |
| |
| 1 |
| Munro, J. |
| |
| 4 |
| |
| 1 |
| Mun, Youngsong (ed.) |
| |
| 2 |
| |
| 1 |
| Musial, Peter M. |
| |
| 1 |
| |
| 1 |
| Musser, David (ed.) |
| |
| 7 |
| |
| 3 |
| Muthukrishnan, S. |
| |
| 44 |
| |
| 4 |
| Mütze, Torsten |
| |
| 3 |
| |
| 1 |
| M. Halldórsson, Magnús (ed.) |
| |
| 2 |
| |
| 1 |
| Nagarajan, Viswanath |
| |
| 1 |
| |
| 1 |
| Näher, S |
| |
| 45 |
| |
| 4 |
| Näher, Stefan (ed.) |
| |
| 1 |
| |
| 1 |
| Nakano, S. (ed.) |
| |
| 1 |
| |
| 1 |
| Nannicini, Giacomo (ed.) |
| |
| 2 |
| |
| 1 |
| Nanongkai, Danupon |
| |
| 1 |
| |
| 1 |
| Narayanaswamy, N.S. |
| |
| 2 |
| |
| 1 |
| Nardelli, Enrico (ed.) |
| |
| 1 |
| |
| 1 |
| Narula, Vishal |
| |
| 3 |
| |
| 1 |
| Nasre, M. |
| |
| 1 |
| |
| 10 |
| Naujoks, Rouven |
| |
| 1 |
| |
| 1 |
| Nechushtan, Oren |
| |
| 1 |
| |
| 1 |
| Nedjah, Nadia (ed.) |
| |
| 3 |
| |
| 1 |
| Nemhauser, George (ed.) |
| |
| 2 |
| |
| 4 |
| Nešetřil, Jarik (ed.) |
| |
| 1 |
| |
| 2 |
| Neuhold, Erich J. (ed.) |
| |
| 1 |
| |
| 4 |
| Neumann, Adrian |
| |
| 1 |
| |
| 2 |
| Neumann, Dirk |
| |
| 67 |
| |
| 2 |
| Neumann, Frank (ed.) |
| |
| 1 |
| |
| 1 |
| Newman, I. |
| |
| 1 |
| |
| 1 |
| Neyer, Gabriele |
| |
| 1 |
| |
| 1 |
| Nguyen, An |
| |
| 2 |
| |
| 1 |
| Nicola Beume (ed.) |
| |
| 1 |
| |
| 1 |
| Nicosia, Giuseppe (ed.) |
| |
| 3 |
| |
| 1 |
| Niedermeier, Rolf (ed.) |
| |
| 1 |
| Niederreiter, Harald (ed.) |
| |
| 3 |
| Niehren, Joachim |
| |
| 1 |
| |
| 3 |
| Nievergelt, Jurg |
| |
| 2 |
| |
| 1 |
| Nikolaidis, Ioanis (ed.) |
| |
| 2 |
| |
| 5 |
| Nikoletseas, Sotiris (ed.) |
| |
| 1 |
| |
| 1 |
| Nilsson, Stefan |
| |
| 1 |
| |
| 1 |
| Nishizeki, Takao (ed.) |
| |
| 1 |
| |
| 1 |
| Noguiera, Loana Tito (ed.) |
| |
| 2 |
| Noltemeier, Hartmut (ed.) |
| |
| 1 |
| North, Stephen |
| |
| 1 |
| |
| 2 |
| Nor, Igor |
| |
| 1 |
| |
| 3 |
| Nowotka, Dirk |
| |
| 1 |
| |
| 3 |
| Nutov, Zeev |
| |
| 1 |
| |
| 3 |
| O'Dúnlaing, Colm |
| |
| 1 |
| |
| 1 |
| O'Neill, Michael (ed.) |
| |
| 3 |
| |
| 1 |
| O'Rourke, Joseph (ed.) |
| |
| 1 |
| |
| 3 |
| Odenthal, Thomas |
| |
| 1 |
| |
| 1 |
| Okamoto, Yoshio |
| |
| 1 |
| |
| 2 |
| Okhotin, Alexander |
| |
| 1 |
| Olderog, Ernst-Rüdiger (ed.) |
| |
| 2 |
| Oliveto, Pietro |
| |
| 3 |
| |
| 1 |
| Oliveto, Pietro S. |
| |
| 1 |
| |
| 1 |
| Orejas, Fernando (ed.) |
| |
| 3 |
| |
| 3 |
| Orlin, James B. |
| |
| 1 |
| |
| 6 |
| Osbild, Ralf |
| |
| 2 |
| |
| 1 |
| Ossamy, Rodrigue |
| |
| 4 |
| |
| 1 |
| Östlin, Anna |
| |
| 2 |
| |
| 3 |
| Ottmann, Thomas (ed.) |
| |
| 2 |
| |
| 1 |
| Oudalov, Vladimir |
| |
| 3 |
| |
| 1 |
| Owen, A. B. (ed.) |
| |
| 1 |
| |
| 1 |
| Pacholski, Leszek |
| |
| 1 |
| |
| 2 |
| Pagh, Rasmus |
| |
| 1 |
| |
| 1 |
| Pajarola, Renato (ed.) |
| |
| 3 |
| Palamidessi, Catuscia (ed.) |
| |
| 6 |
| Paluch, Katarzyna |
| |
| 1 |
| |
| 1 |
| Pal, Arindam |
| |
| 27 |
| |
| 2 |
| Panconesi, Alessandro |
| |
| 1 |
| Panconesi, Alessandro (ed.) |
| |
| 1 |
| Pandya, Paritosh (ed.) |
| |
| 8 |
| |
| 1 |
| Pantziou, G. E. |
| |
| 2 |
| |
| 2 |
| Papadopoulou, Vicky G. (ed.) |
| |
| 2 |
| |
| 4 |
| Papatheodorou, Theodore S. (ed.) |
| |
| 11 |
| |
| 1 |
| Pardalos, Panos M. (ed.) |
| |
| 1 |
| |
| 1 |
| Parente, Domenico |
| |
| 2 |
| |
| 1 |
| Park, Jong Hyuk (ed.) |
| |
| 1 |
| |
| 2 |
| Park, Kunsoo (ed.) |
| |
| 3 |
| |
| 2 |
| Parreira, Josiane |
| |
| 3 |
| |
| 1 |
| Parso, Alberto (ed.) |
| |
| 1 |
| |
| 1 |
| Pascual, Fanny |
| |
| 1 |
| |
| 1 |
| Pasedach, Klaus (ed.) |
| |
| 2 |
| |
| 1 |
| Pasqualone, Giulio |
| |
| 2 |
| Paterson, Michael S. (ed.) |
| |
| 2 |
| Paterson, Mike |
| |
| 4 |
| |
| 1 |
| Patrikalakis, Nicholas M. (ed.) |
| |
| 1 |
| |
| 1 |
| Paturi, Ramamohan |
| |
| 2 |
| |
| 1 |
| Pauly, Mark |
| |
| 1 |
| |
| 1 |
| Paul, Markus |
| |
| 1 |
| |
| 2 |
| Paul, Wolfgang J. |
| |
| 1 |
| |
| 1 |
| Pavone, Mario (ed.) |
| |
| 1 |
| |
| 1 |
| Pehrson, Bjoern (ed.) |
| |
| 13 |
| |
| 1 |
| Peleg, David |
| |
| 5 |
| |
| 8 |
| Pelikan, Martin (ed.) |
| |
| 1 |
| |
| 3 |
| Penczek, Wojciech (ed.) |
| |
| 1 |
| |
| 1 |
| Penninkx, Eelko |
| |
| 1 |
| |
| 1 |
| Penttonen, Martti |
| |
| 2 |
| |
| 2 |
| Pérennes, Stéphane |
| |
| 1 |
| |
| 1 |
| Persiano, Giuseppe (ed.) |
| |
| 3 |
| |
| 1 |
| Petcu, Adrian (ed.) |
| |
| 1 |
| |
| 3 |
| Petitjean, Sylvain |
| |
| 3 |
| |
| 1 |
| Petri, Tobias H. |
| |
| 8 |
| |
| 2 |
| Pevzner, Pavel A. (ed.) |
| |
| 4 |
| |
| 21 |
| Philip, Geevarghese |
| |
| 1 |
| Piccialli, Veronica (ed.) |
| |
| 5 |
| Pietracaprina, Andrea (ed.) |
| |
| 3 |
| |
| 1 |
| Pilipczuk, Micha |
| |
| 2 |
| |
| 1 |
| Pillichshammer, Friedrich |
| |
| 1 |
| |
| 1 |
| Pinotti, M. Cristina |
| |
| 1 |
| |
| 14 |
| Pion, Sylvain |
| |
| 1 |
| |
| 1 |
| Piskorski, Jakub |
| |
| 6 |
| |
| 1 |
| Pitts, Andrew (ed.) |
| |
| 1 |
| |
| 4 |
| Plandowski, Wojciech |
| |
| 1 |
| |
| 1 |
| Plesser, Theo (ed.) |
| |
| 2 |
| Poblete, Patricio V. (ed.) |
| |
| 2 |
| Pocchiola, Michel |
| |
| 1 |
| |
| 4 |
| Pogalnikova, Roza |
| |
| 1 |
| |
| 2 |
| Pohl, Sebastian |
| |
| 1 |
| |
| 1 |
| Poli, Ricardo (ed.) |
| |
| 1 |
| |
| 1 |
| Pollack, Jordan (ed.) |
| |
| 4 |
| |
| 7 |
| Polzin, Tobias |
| |
| 1 |
| |
| 1 |
| Poon, Sheung-Hung |
| |
| 1 |
| |
| 3 |
| Porkolab, Lorant |
| |
| 5 |
| |
| 1 |
| Portz, Sascha |
| |
| 1 |
| |
| 1 |
| Potikoglou, Ioannis |
| |
| 2 |
| |
| 1 |
| Pountourakis, Emmanouil |
| |
| 1 |
| |
| 1 |
| Prädel, Lars |
| |
| 3 |
| |
| 2 |
| Prasanna, Viktor K. (ed.) |
| |
| 1 |
| |
| 1 |
| Precup, Doina |
| |
| 1 |
| |
| 1 |
| Preis, B. |
| |
| 1 |
| |
| 2 |
| Preneel, Bart (ed.) |
| |
| 1 |
| |
| 11 |
| Preparata, Franco P. |
| |
| 3 |
| |
| 6 |
| Priebe, Volker |
| |
| 2 |
| |
| 1 |
| Prívara, Igor (ed.) |
| |
| 2 |
| |
| 1 |
| Proietti, Guido (ed.) |
| |
| 1 |
| |
| 1 |
| Prömel, Hans Jürgen (ed.) |
| |
| 6 |
| |
| 1 |
| Przytycka, Teresa |
| |
| 1 |
| |
| 5 |
| Pucci, Geppino (ed.) |
| |
| 2 |
| |
| 1 |
| Puglisi, Simon J. |
| |
| 9 |
| |
| 3 |
| P. Gao |
| |
| 1 |
| |
| 1 |
| Qian, Jiawei |
| |
| 1 |
| |
| 5 |
| Rabani, Yuval (ed.) |
| |
| 3 |
| |
| 3 |
| Radhakrishnan, Jaikumar |
| |
| 3 |
| Radhakrishnan, Jaikumar (ed.) |
| |
| 1 |
| Radhakrishnan, R. |
| |
| 1 |
| Radhakrishna, Jaikumar (ed.) |
| |
| 5 |
| Radzik, Tomasz (ed.) |
| |
| 1 |
| |
| 1 |
| Raghavendra Rao, B. V. |
| |
| 1 |
| |
| 1 |
| Raidl, Günther R. (ed.) |
| |
| 5 |
| |
| 1 |
| Rajaraman, Rajmohan |
| |
| 1 |
| |
| 1 |
| Ralph, Martin (ed.) |
| |
| 1 |
| |
| 1 |
| Ramakrishna, G. |
| |
| 1 |
| |
| 1 |
| Ramanujan, M. S. |
| |
| 6 |
| |
| 6 |
| Raman, Rajeev (ed.) |
| |
| 6 |
| |
| 8 |
| Raman, Venkatesh |
| |
| 3 |
| |
| 5 |
| Ramesh, Hariharan |
| |
| 1 |
| |
| 3 |
| Ramezani, Fahimeh |
| |
| 25 |
| |
| 6 |
| Randall, Dana (ed.) |
| |
| 1 |
| |
| 3 |
| Rangan, C. Pandu (ed.) |
| |
| 2 |
| |
| 2 |
| Rao, P. Srinivasa |
| |
| 1 |
| |
| 1 |
| Rao, S. Srinivasa |
| |
| 1 |
| |
| 2 |
| Rasch, Ronald |
| |
| 1 |
| |
| 1 |
| Rast, Thomas |
| |
| 1 |
| |
| 2 |
| Rauch, Monika |
| |
| 10 |
| |
| 1 |
| Rau, Stephan |
| |
| 1 |
| |
| 2 |
| Ravi, R. |
| |
| 1 |
| |
| 6 |
| Rawitz, Dror |
| |
| 1 |
| |
| 2 |
| Rawlins, Gregory J.E. |
| |
| 1 |
| |
| 9 |
| Ray, Rahul |
| |
| 18 |
| |
| 1 |
| Raza, Sarfraz |
| |
| 1 |
| |
| 2 |
| Reed, Bruce |
| |
| 2 |
| |
| 2 |
| Régin, Jean-Charles (ed.) |
| |
| 2 |
| |
| 11 |
| Reichel, Joachim |
| |
| 1 |
| |
| 1 |
| Reif, John H. (ed.) |
| |
| 4 |
| |
| 11 |
| Reinert, Knut |
| |
| 1 |
| |
| 2 |
| Reinstädtler, Martin |
| |
| 1 |
| |
| 1 |
| Rema, Anna |
| |
| 1 |
| |
| 1 |
| Reps, Thomas (ed.) |
| |
| 1 |
| |
| 1 |
| Reuter, Andreas (ed.) |
| |
| 2 |
| |
| 1 |
| Ribeiro, Celso C. (ed.) |
| |
| 1 |
| Ricardo A. Baeza-Yates (ed.) |
| |
| 1 |
| Richards, Brad |
| |
| 1 |
| |
| 1 |
| Rieger, H. |
| |
| 1 |
| |
| 2 |
| Rinaldi, Giovanni |
| |
| 1 |
| |
| 4 |
| Rizkallah, Christine |
| |
| 3 |
| |
| 1 |
| Rizzi, R. |
| |
| 2 |
| |
| 1 |
| Rochange, Christine (ed.) |
| |
| 1 |
| |
| 3 |
| Röglin, Heiko |
| |
| 4 |
| |
| 2 |
| Rohnert, H. |
| |
| 1 |
| |
| 1 |
| Röhrig, Hein |
| |
| 8 |
| |
| 9 |
| Rolim, José (ed.) |
| |
| 1 |
| |
| 1 |
| Ronchi Della Rocca, Simonetta (ed.) |
| |
| 1 |
| |
| 1 |
| Roos, Thomas (ed.) |
| |
| 1 |
| |
| 2 |
| Rosamond, Frances A. |
| |
| 2 |
| |
| 3 |
| Rosenstiehl, Pierre |
| |
| 1 |
| |
| 1 |
| Rossignac, Jarek |
| |
| 2 |
| |
| 2 |
| Rote, Günter |
| |
| 3 |
| |
| 2 |
| Rothlauf, Frank (ed.) |
| |
| 4 |
| |
| 1 |
| Rotics, Udi |
| |
| 1 |
| |
| 2 |
| Roughgarden, Tim (ed.) |
| |
| 3 |
| |
| 3 |
| Rozenberg, Grzegorz (ed.) |
| |
| 1 |
| |
| 8 |
| Rüb, Christine |
| |
| 2 |
| |
| 11 |
| Rudolph, Günter (ed.) |
| |
| 3 |
| |
| 1 |
| Rudra, Atri |
| |
| 2 |
| |
| 3 |
| Rülling, Wolfgang |
| |
| 3 |
| |
| 1 |
| Rump, Siegfried M. (ed.) |
| |
| 1 |
| Runarsson, Thomas Ph. (ed.) |
| |
| 1 |
| Ruppert, Barbara |
| |
| 1 |
| |
| 1 |
| Ruzicka, Peter (ed.) |
| |
| 5 |
| |
| 1 |
| Rybalchenko, Andrey (ed.) |
| |
| 6 |
| |
| 2 |
| Rytter, Wojciech (ed.) |
| |
| 2 |
| |
| 3 |
| Saberi, Amin (ed.) |
| |
| 1 |
| |
| 1 |
| Sabo, Holger |
| |
| 1 |
| Sack, Joerg-Ruediger (ed.) |
| |
| 2 |
| Sack, Jörg-Rüdiger |
| |
| 11 |
| |
| 1 |
| Sagot, Marie-France |
| |
| 32 |
| |
| 1 |
| Sahai, Amit (ed.) |
| |
| 6 |
| |
| 1 |
| Sahin, Erol (ed.) |
| |
| 3 |
| |
| 1 |
| Sakellariou, Rizos (ed.) |
| |
| 4 |
| |
| 5 |
| Salomaa, Arto (ed.) |
| |
| 1 |
| |
| 1 |
| Saluja, Sanjeev |
| |
| 1 |
| |
| 2 |
| Sanders, Geoff |
| |
| 74 |
| |
| 10 |
| Sanders, Peter (ed.) |
| |
| 2 |
| |
| 2 |
| Sankowski, Piotr (ed.) |
| |
| 3 |
| |
| 1 |
| Sanniti di Baja, G (ed.) |
| |
| 7 |
| |
| 2 |
| Saptharishi, Ramprasad |
| |
| 1 |
| |
| 2 |
| Sassone, Vladimir (ed.) |
| |
| 1 |
| |
| 2 |
| Sastry, Kumara (ed.) |
| |
| 1 |
| |
| 33 |
| Sauerwald, Thomas |
| |
| 13 |
| |
| 1 |
| Saurabh, Saket (ed.) |
| |
| 2 |
| |
| 4 |
| Saxena, Nitin |
| |
| 1 |
| |
| 7 |
| Schaefer, Robert (ed.) |
| |
| 16 |
| |
| 3 |
| Schalekamp, Frans |
| |
| 1 |
| |
| 1 |
| Schapira, Michael |
| |
| 2 |
| |
| 1 |
| Schehr, Gregory |
| |
| 2 |
| |
| 2 |
| Scheideler, Christian (ed.) |
| |
| 3 |
| |
| 1 |
| Schieber, Baruch |
| |
| 2 |
| |
| 3 |
| Schilz, Thomas |
| |
| 3 |
| |
| 1 |
| Schindelhauer, Christian (ed.) |
| |
| 40 |
| |
| 4 |
| Schirra, Stefan (ed.) |
| |
| 1 |
| |
| 1 |
| Schlotter, Ildikó |
| |
| 3 |
| |
| 1 |
| Schmidt, Christiane |
| |
| 1 |
| |
| 1 |
| Schmidt, Gunther (ed.) |
| |
| 14 |
| |
| 2 |
| Schmidt, Martin |
| |
| 1 |
| |
| 16 |
| Schmitt, Susanne |
| |
| 1 |
| |
| 3 |
| Schneider, Wolfgang |
| |
| 1 |
| |
| 1 |
| Schoenauer, Marc (ed.) |
| |
| 1 |
| |
| 1 |
| Schomburg, Dietmar (ed.) |
| |
| 29 |
| |
| 1 |
| Schömer, Elmar (ed.) |
| |
| 3 |
| |
| 1 |
| Schreiber, Falk |
| |
| 1 |
| Schrijver, Alexander (ed.) |
| |
| 1 |
| Schröder, Bianca |
| |
| 1 |
| |
| 1 |
| Schroeder, Ulf-Peter (ed.) |
| |
| 2 |
| |
| 1 |
| Schuierer, Sven |
| |
| 4 |
| |
