×
Compute Distance To:
Author ID: mehlhorn.kurt Recent zbMATH articles by "Mehlhorn, Kurt"
Published as: Mehlhorn, Kurt; Mehlhorn, K.; Mehlborn, Kurt
Homepage: https://people.mpi-inf.mpg.de/~mehlhorn
External Links: MGP · Wikidata · dblp · GND · IdRef · theses.fr
all top 5

Co-Authors

50 single-authored
22 Kavitha, Telikepalli
17 Näher, Stefan
15 Michail, Dimitrios
14 Alt, Helmut
12 Schirra, Stefan
9 Uhrig, Christian
8 Funke, Stefan
8 Kaufmann, Michael
7 Althaus, Ernst
7 Kettner, Lutz
7 Preparata, Franco P.
7 Sagraloff, Michael
6 Jung, Hermann
6 Paluch, Katarzyna E.
6 Sanders, Peter
6 Yap, Chee-Keng
5 Bonifaci, Vincenzo
5 Burnikel, Christoph
5 Fleischer, Rudolf
5 Hagerup, Torben
5 Halperin, Dan
5 Karrenbauer, Andreas
5 Kolev, Pavel
5 Meiser, Stefan
5 Schafer, Guido
5 Schmitt, Susanne
5 Schweitzer, Pascal
5 Seel, Michael
5 Tsakalidis, Athanasios K.
4 Abraham, David J.
4 Berberich, Eric
4 Cheriyan, Joseph
4 Dietzfelbinger, Martin
4 Elbassioni, Khaled M.
4 Garg, Jugal
4 Hertel, Stefan
4 Irving, Robert W.
4 Meyer, Ulrich
4 Munro, J. Ian
4 Ramezani, Fahimeh
4 Schmidt, Jens M.
4 Welzl, Emo
3 Bast, Hannah
3 Blum, Norbert
3 Chalermsook, Parinya
3 Crauser, Andreas
3 Duan, Ran
3 Eigenwillig, Arno
3 Hert, Susan
3 Hoefer, Martin
3 Jurkiewicz, Tomasz
3 Manlove, David F.
3 McConnell, Ross M.
3 Neumann, Adrian
3 Pion, Sylvain
3 Pyrga, Evangelia
3 Ramos, Edgar A.
3 Rohnert, Hans
3 Schömer, Elmar
3 Sharir, Micha
3 Tamaki, Hisao
3 Tarjan, Robert Endre
3 Thiel, Sven
2 Afshani, Peyman
2 Agrawal, Manindra
2 Albrecht, Andreas A.
2 Altenkamp, Doris
2 Aronov, Boris
2 Asano, Tetsuo
2 Baswana, Surender
2 Baumgarten, Hanna
2 Bei, Xiaohui
2 Cechlárová, Katarína
2 Chaudhury, Bhaskar Ray
2 Croitoru, Cosmina
2 Czumaj, Artur
2 Dietz, Paul F.
2 Doerr, Benjamin
2 Doerr, Carola
2 Dubhashi, Devdatt P.
2 Duchier, Denys
2 Elmasry, Amr
2 Facca, Enrico
2 Ferragina, Paolo
2 Finkler, Ulrich
2 Fogel, Efi
2 Fürer, Martin
2 Galil, Zvi
2 Goswami, Mayank
2 Güttler, Reiner
2 Hachenberger, Peter
2 Hariharan, Ramesh
2 Hemmer, Michael
2 Hong, Jiawei
2 Huang, Chien-Chung
2 Huddleston, Scott
2 Kaligosi, Kanela
2 Katoh, Naoki
2 Klein, Rolf-Dieter
2 Koller, Alexander
...and 158 more Co-Authors
all top 5

Serials

22 Algorithmica
20 Information Processing Letters
17 SIAM Journal on Computing
12 Computational Geometry
7 Acta Informatica
7 Lecture Notes in Computer Science
6 Information and Control
6 Theoretical Computer Science
6 Journal of Symbolic Computation
4 Journal of the Association for Computing Machinery
4 Discrete & Computational Geometry
4 Information and Computation
4 International Journal of Computational Geometry & Applications
4 ACM Journal of Experimental Algorithmics
4 ACM Transactions on Algorithms
3 Discrete Applied Mathematics
3 Journal of Algorithms
3 Theory of Computing Systems
3 Computer Science Review
3 EATCS Monographs on Theoretical Computer Science
2 RAIRO, Informatique Théorique
2 Random Structures & Algorithms
2 Elektronische Informationsverarbeitung und Kybernetik
1 IEEE Transactions on Information Theory
1 Computing
1 IEEE Transactions on Computers
1 Journal of Combinatorial Theory. Series B
1 Journal of Computer and System Sciences
1 Journal of Graph Theory
1 Kiberneticheskiĭ Sbornik. Novaya Seriya
1 Mathematical Systems Theory
1 Computer Aided Geometric Design
1 Journal of Automated Reasoning
1
1 Combinatorics, Probability and Computing
1 Bulletin of the European Association for Theoretical Computer Science EATCS
1 Journal of Machine Learning Research (JMLR)
1 Leitfäden der Angewandten Mathematik und Mechanik (LAMM)
1 Mathematics in Computer Science
1 Journal of Theoretical Biology
1 Series on Theoretical Computer Science
1 Mathematical Research

Publications by Year

Citations contained in zbMATH Open

244 Publications have been cited 2,331 times in 1,784 Documents Cited by Year
LEDA. A platform for combinatorial and geometric computing. Zbl 0976.68156
Mehlhorn, Kurt; Näher, Stefan
90
1999
Data structures and algorithms 1: Sorting and searching. Transl. from the German. Zbl 0556.68001
Mehlhorn, Kurt
74
1984
Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn. Zbl 1283.68018
Manlove, David F.
72
2013
Data structures and algorithms 2: Graph algorithms and NP-completeness. Transl. from the German. Zbl 0556.68002
Mehlhorn, Kurt
70
1984
Faster algorithms for the shortest path problem. Zbl 0696.68046
Ahuja, Ravindra K.; Mehlhorn, Kurt; Orlin, James B.; Tarjan, Robert E.
57
1990
Data structures and algorithms 3: Multi-dimensional searching and computational geometry. Transl. from the German. Zbl 0556.68003
Mehlhorn, Kurt
51
1984
Congruence, similarity, and symmetries of geometric objects. Zbl 0679.68070
Alt, Helmut; Mehlhorn, Kurt; Wagener, Hubert; Welzl, Emo
46
1988
A faster approximation algorithm for the Steiner problem in graphs. Zbl 0635.68071
Mehlhorn, Kurt
44
1988
Dynamic perfect hashing: Upper and lower bounds. Zbl 0820.68038
Dietzfelbinger, Martin; Karlin, Anna; Mehlhorn, Kurt; Meyer auf der Heide, Friedhelm; Rohnert, Hans; Tarjan, Robert E.
40
1994
Sorting Jordan sequences in linear time using level-linked search trees. Zbl 0614.68051
Hoffmann, Kurt; Mehlhorn, Kurt; Rosenstiehl, Pierre; Tarjan, Robert E.
39
1986
Randomized incremental construction of abstract Voronoi diagrams. Zbl 0797.68153
Klein, Rolf; Mehlhorn, Kurt; Meiser, Stefan
39
1993
Popular matchings. Zbl 1154.91033
Abraham, David J.; Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt
37
2007
Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\). Zbl 0714.68036
Alt, H.; Blum, N.; Mehlhorn, K.; Paul, M.
35
1991
A new data structure for representing sorted lists. Zbl 0481.68061
Huddleston, Scott; Mehlhorn, Kurt
34
1982
Certifying algorithms. Zbl 1298.68289
McConnell, R. M.; Mehlhorn, K.; Näher, S.; Schweitzer, P.
34
2011
Weisfeiler-Lehman graph kernels. Zbl 1280.68194
Shervashidze, Nino; Schweitzer, Pascal; van Leeuwen, Erik Jan; Mehlhorn, Kurt; Borgwardt, Karsten M.
34
2011
Dynamic fractional cascading. Zbl 0693.68038
Mehlhorn, Kurt; Näher, Stefan
33
1990
Pebbling mountain ranges and its application to DCFL-recognition. Zbl 0445.68033
Mehlhorn, Kurt
33
1980
Certifying algorithms for recognizing interval graphs and permutation graphs. Zbl 1113.68112
Kratsch, Dieter; McConnell, Ross M.; Mehlhorn, Kurt; Spinrad, Jeremy P.
30
2006
Nearly optimal binary search trees. Zbl 0333.68028
Mehlhorn, Kurt
30
1975
Cycle bases in graphs characterization, algorithms, complexity, and applications. Zbl 1301.05195
Kavitha, Telikepalli; Liebchen, Christian; Mehlhorn, Kurt; Michail, Dimitrios; Rizzi, Romeo; Ueckerdt, Torsten; Zweig, Katharina A.
30
2009
Pareto optimality in house allocation problems. Zbl 1116.90393
Abraham, David J.; Cechlárová, Katarína; Manlove, David F.; Mehlhorn, Kurt
29
2004
Algorithms and data structures. The basic toolbox. Zbl 1146.68069
Mehlhorn, Kurt; Sanders, Peter
29
2008
Polynomial and abstract subrecursive classes. Zbl 0329.68049
Mehlhorn, Kurt
27
1976
Additive spanners and \(({\alpha}, {\beta})\)-spanners. Zbl 1295.05094
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth
27
2010
Four results on randomized incremental constructions. Zbl 0781.68112
Clarkson, Kenneth L.; Mehlhorn, Kurt; Seidel, Raimund
25
1993
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Zbl 0548.68044
Mehlhorn, Kurt; Vishkin, Uzi
22
1984
On the construction of abstract Voronoi diagrams. Zbl 0723.68048
Mehlhorn, K.; Meiser, St.; Ó’Dúnlaing, Colm
22
1991
Resource constrained shortest paths. Zbl 0974.68215
Mehlhorn, Kurt; Ziegelmann, Mark
21
2000
Furthest site abstract Voronoi diagrams. Zbl 1074.68643
Mehlhorn, Kurt; Meiser, Stefan; Rasch, Ronald
21
2001
A faster algorithm for minimum cycle basis of graphs. Zbl 1103.05086
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna
19
2004
Simultaneous inner and outer approximation of shapes. Zbl 0760.68083
Fleischer, Rudolf; Mehlhorn, Kurt; Rote, Günter; Welzl, Emo; Yap, Chee
19
1992
Rank-maximal matchings. Zbl 1321.90116
Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E.
19
2006
A Descartes algorithm for polynomials with bit-stream coefficients. Zbl 1169.65315
Eigenwillig, Arno; Kettner, Lutz; Krandick, Werner; Mehlhorn, Kurt; Schmitt, Susanne; Wolpert, Nicola
18
2005
A best possible bound for the weighted path length of binary search trees. Zbl 0362.68072
Mehlhorn, Kurt
18
1977
Computing real roots of real polynomials. Zbl 1330.65072
Sagraloff, Michael; Mehlhorn, Kurt
18
2016
Monotone switching circuits and Boolean matrix product. Zbl 0323.94019
Mehlhorn, K.; Galil, Z.
17
1976
The theory of fringe analysis and its application to 2-3 trees and B- trees. Zbl 0561.68050
Eisenbarth, Bernhard; Ziviani, Nivio; Gonnet, Gaston H.; Mehlhorn, Kurt; Wood, Derick
16
1982
Certifying algorithms for recognizing interval graphs and permutation graphs. Zbl 1094.68615
Kratsch, Dieter; McConnell, Ross M.; Mehlhorn, Kurt; Spinrad, Jeremy P.
16
2003
Classroom examples of robustness problems in geometric computations. Zbl 1135.65311
Kettner, Lutz; Mehlhorn, Kurt; Pion, Sylvain; Schirra, Stefan; Yap, Chee
16
2008
Maintaining dynamic sequences under equality tests in polylogarithmic time. Zbl 0865.68034
Mehlhorn, K.; Sundar, R.; Uhrig, C.
15
1997
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. Zbl 0760.68082
Alt, Helmut; Fleischer, Rudolf; Kaufmann, Michael; Mehlhorn, Kurt; Näher, Stefan; Schirra, Stefan; Uhrig, Christian
15
1992
Sorting presorted files. Zbl 0395.68054
Mehlhorn, Kurt
15
1979
Certifying and repairing solutions to large LPs: How good are LP-solvers? Zbl 1176.90395
Dhiflaoui, Marcel; Funke, Stefan; Kwappik, Carsten; Mehlhorn, Kurt; Seel, Michael; Schömer, Elmar; Schulte, Ralph; Weber, Dennis
15
2003
Cost trade-offs in graph embeddings, with applications. Zbl 0627.68038
Hong, Jiawei; Mehlhorn, Kurt; Rosenberg, Arnold L.
14
1983
Bounded ordered dictionaries in O(log log N) time and O(n) space. Zbl 0702.68042
Mehlhorn, Kurt; Näher, Stefan
14
1990
New bounds for the Descartes method. Zbl 1158.12001
Krandick, Werner; Mehlhorn, Kurt
14
2006
A separation bound for real algebraic expressions. Zbl 1006.68960
Burnikel, Christoph; Funke, Stefan; Mehlhorn, Kurt; Schirra, Stefan; Schmitt, Susanne
14
2001
Curve reconstruction: Connecting dots with good reason. Zbl 0955.68113
Dey, Tamal K.; Mehlhorn, Kurt; Ramos, Edgar A.
13
2000
Faster algorithms for computing Hong’s bound on absolute positiveness. Zbl 1206.11151
Mehlhorn, Kurt; Ray, Saurabh
13
2010
Optimal search for rationals. Zbl 1173.68826
Kwek, Stephen; Mehlhorn, Kurt
13
2003
New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners. Zbl 1297.05066
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth
13
2005
Deterministic simulation of idealized parallel computers on more realistic ones. Zbl 0635.68015
Alt, Helmut; Hagerup, Torben; Mehlhorn, Kurt; Preparata, Franco P.
12
1987
Pareto optimality in house allocation problems. Zbl 1115.90049
Abraham, David J.; Cechlárová, Katarína; Manlove, David F.; Mehlhorn, Kurt
12
2005
A polyhedral approach to sequence alignment problems. Zbl 0998.92017
Kececioglu, John D.; Lenhof, Hans-Peter; Mehlhorn, Kurt; Mutzel, Petra; Reinert, Knut; Vingron, Martin
12
2000
On the average number of rebalancing operations in weight-balanced trees. Zbl 0435.68051
Blum, Norbert; Mehlhorn, Kurt
12
1980
Lower bounds for the space complexity of context-free recognition. Zbl 0368.68069
Alt, H.; Mehlhorn, K.
12
1976
Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint. Zbl 1044.68783
Mehlhorn, Kurt; Thiel, Sven
12
2000
Fast triangulation of simple polygons. Zbl 0521.68040
Hertel, Stefan; Mehlhorn, Kurt
11
1983
Some remarks on Boolean sums. Zbl 0421.94022
Mehlhorn, Kurt
11
1979
A computational basis for conic arcs and boolean operations on conic polygons. Zbl 1019.68601
Berberich, Eric; Eigenwillig, Arno; Hemmer, Michael; Hert, Susan; Mehlhorn, Kurt; Schömer, Elmar
11
2002
From approximate factorization to root isolation with application to cylindrical algebraic decomposition. Zbl 1357.68305
Mehlhorn, Kurt; Sagraloff, Michael; Wang, Pengming
11
2015
A strong and easily computable separation bound for arithmetic expressions involving radicals. Zbl 0953.68136
Burnikel, C.; Fleischer, R.; Mehlhorn, K.; Schirra, S.
10
2000
On degeneracy in geometric computations. Zbl 0873.68201
Burnikel, Christoph; Mehlhorn, Kurt; Schirra, Stefan
10
1994
Assigning papers to referees. Zbl 1203.90092
Garg, Naveen; Kavitha, Telikepalli; Kumar, Amit; Mehlhorn, Kurt; Mestre, Julián
10
2010
Minimum cycle bases, faster and simpler. Zbl 1300.05304
Mehlhorn, Kurt; Michail, Dimitrios
10
2009
Can a maximum flow be computed in \(o(nm)\) time? Zbl 0768.90020
Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt
9
1990
A deterministic algorithm for isolating real roots of a real polynomial. Zbl 1207.65048
Mehlhorn, Kurt; Sagraloff, Michael
9
2011
Self-adjusting binary search trees: what makes them tick? Zbl 1466.68032
Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol
9
2015
Checking geometric programs or verification of geometric structures. Zbl 0922.68123
Mehlhorn, Kurt; Näher, Stefan; Seel, Michael; Seidel, Raimund; Schilz, Thomas; Schirra, Stefan; Uhrig, Christian
9
1999
Smoothed analysis of three combinatorial problems. Zbl 1124.68371
Banderier, Cyril; Beier, René; Mehlhorn, Kurt
9
2003
Implementing minimum cycle basis algorithms. Zbl 1143.05310
Mehlhorn, Kurt; Michail, Dimitrios
9
2006
Channel routing in knock-knee mode: Simplified algorithms and proofs. Zbl 0622.68059
Mehlhorn, Kurt; Preparata, F. P.; Sarrafzadeh, M.
8
1986
A log log n data structure for three-sided range queries. Zbl 0653.68057
Fries, O.; Mehlhorn, K.; Näher, S.; Tsakalidis, A.
8
1987
An \(o(n^ 3)\)-time maximum-flow algorithm. Zbl 0864.68019
Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt
8
1996
Partial match retrieval in implicit data structures. Zbl 0549.68033
Alt, Helmut; Mehlhorn, Kurt; Munro, J. Ian
8
1984
Effiziente Algorithmen. Zbl 0357.68041
Mehlhorn, Kurt
8
1977
Online graph exploration: New results on old and new algorithms. Zbl 1269.05103
Megow, Nicole; Mehlhorn, Kurt; Schweitzer, Pascal
8
2012
New approximation algorithms for minimum cycle bases of graphs. Zbl 1186.68561
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios
8
2007
An amortized analysis of insertions into AVL-trees. Zbl 0589.68048
Mehlhorn, Kurt; Tsakalidis, Athanasios
8
1986
Controlled perturbation for Delaunay triangulations. Zbl 1297.68240
Funke, Stefan; Klein, Christian; Mehlhorn, Kurt; Schmitt, Susanne
8
2005
Physarum can compute shortest paths: convergence proofs and complexity bounds. Zbl 1335.68099
Becchetti, Luca; Bonifaci, Vincenzo; Dirnberger, Michael; Karrenbauer, Andreas; Mehlhorn, Kurt
8
2013
Algorithms for dense graphs and networks on the random access computer. Zbl 0848.68070
Cheriyan, J.; Mehlhorn, K.
7
1996
On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm. Zbl 0854.68075
Mehlhorn, K.; Mutzel, P.
7
1996
TSP-based curve reconstruction in polynomial time. Zbl 0954.65011
Althaus, Ernst; Mehlhorn, Kurt
7
2000
Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments. Zbl 1118.65308
Hachenberger, Peter; Kettner, Lutz; Mehlhorn, Kurt
7
2007
Dynamic data structures. Zbl 0408.68055
Mehlhorn, K.
7
1979
Optimal dynamization of decomposable searching problems. Zbl 0463.68056
Mehlhorn, Kurt; Overmars, Mark H.
7
1981
Reliable and efficient computational geometry via controlled perturbation. Zbl 1183.68671
Mehlhorn, Kurt; Osbild, Ralf; Sagraloff, Michael
7
2006
Dynamic interpolation search. Zbl 0785.68019
Mehlhorn, Kurt; Tsakalidis, Athanasios
7
1993
Dynamic point location in general subdivisions. Zbl 0820.68122
Baumgarten, Hanna; Jung, Hermann; Mehlhorn, Kurt
7
1994
On the expected depth of random circuits. Zbl 0941.68001
Arya, Sunil; Golin, Mordecai J.; Mehlhorn, Kurt
7
1999
Data structures. Zbl 0900.68256
Mehlhorn, K.; Tsakalidis, A.
7
1990
Popular matchings. Zbl 1297.68087
Abraham, David J.; Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt
7
2005
External-memory breadth-first search with sublinear I/O. Zbl 1019.68595
Mehlhorn, Kurt; Meyer, Ulrich
7
2002
Randomized external-memory algorithms for line segment intersection and other geometric problems. Zbl 1074.68669
Crauser, A.; Ferragina, P.; Mehlhorn, K.; Meyer, U.; Ramos, E. A.
7
2001
Structural filtering: a paradigm for efficient and exact geometric programs. Zbl 1078.65015
Funke, Stefan; Mehlhorn, Kurt; Näher, Stefan
7
2005
A lower bound on the complexity of the union-split-find problem. Zbl 0676.68015
Mehlhorn, Kurt; Näher, Stefan; Alt, Helmut
7
1988
Physarum can compute shortest paths. Zbl 1411.92332
Bonifaci, Vincenzo; Mehlhorn, Kurt; Varma, Girish
7
2012
From approximate factorization to root isolation. Zbl 1360.68944
Mehlhorn, Kurt; Sagraloff, Michael; Wang, Pengming
6
2013
A little charity guarantees almost envy-freeness. Zbl 07304186
Chaudhury, Bhaskar Ray; Kavitha, Telikepalli; Mehlhorn, Kurt; Sgouritsa, Alkmini
5
2020
Convergence of the non-uniform directed physarum model. Zbl 1437.90098
Facca, Enrico; Karrenbauer, Andreas; Kolev, Pavel; Mehlhorn, Kurt
1
2020
Convergence of the non-uniform physarum dynamics. Zbl 1432.68147
Karrenbauer, Andreas; Kolev, Pavel; Mehlhorn, Kurt
1
2020
The query complexity of a permutation-based variant of mastermind. Zbl 1411.91153
Afshani, Peyman; Agrawal, Manindra; Doerr, Benjamin; Doerr, Carola; Larsen, Kasper Green; Mehlhorn, Kurt
4
2019
Two results on slime mold computations. Zbl 1422.68068
Becker, Ruben; Bonifaci, Vincenzo; Karrenbauer, Andreas; Kolev, Pavel; Mehlhorn, Kurt
4
2019
Sequential and parallel algorithms and data structures. The basic toolbox. Zbl 1445.68003
Sanders, Peter; Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman
2
2019
Approximating the Nash social welfare with budget-additive valuations. Zbl 1403.91210
Garg, Jugal; Hoefer, Martin; Mehlhorn, Kurt
5
2018
On testing substitutability. Zbl 1458.68293
Croitoru, Cosmina; Mehlhorn, Kurt
1
2018
Certifying 3-edge-connectivity. Zbl 1356.05150
Mehlhorn, Kurt; Neumann, Adrian; Schmidt, Jens M.
2
2017
Computing real roots of real polynomials. Zbl 1330.65072
Sagraloff, Michael; Mehlhorn, Kurt
18
2016
An improved combinatorial polynomial algorithm for the linear Arrow-Debreu market. Zbl 1417.91326
Duan, Ran; Garg, Jugal; Mehlhorn, Kurt
5
2016
A note on spectral clustering. Zbl 1397.68144
Kolev, Pavel; Mehlhorn, Kurt
4
2016
Improved balanced flow computation using parametric flow. Zbl 1361.91050
Darwish, Omar; Mehlhorn, Kurt
2
2016
Towards more practical linear programming-based techniques for algorithmic mechanism design. Zbl 1356.91050
Elbassioni, Khaled; Mehlhorn, Kurt; Ramezani, Fahimeh
1
2016
Fair matchings and related problems. Zbl 1333.05241
Huang, Chien-Chung; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios
1
2016
Computing equilibria in markets with budget-additive utilities. Zbl 1397.91242
Bei, Xiaohui; Garg, Jugal; Hoefer, Martin; Mehlhorn, Kurt
1
2016
From approximate factorization to root isolation with application to cylindrical algebraic decomposition. Zbl 1357.68305
Mehlhorn, Kurt; Sagraloff, Michael; Wang, Pengming
11
2015
Self-adjusting binary search trees: what makes them tick? Zbl 1466.68032
Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol
9
2015
A combinatorial polynomial algorithm for the linear Arrow-Debreu market. Zbl 1329.91089
Duan, Ran; Mehlhorn, Kurt
6
2015
On randomized fictitious play for approximating saddle points over convex sets. Zbl 1330.91012
Elbassioni, Khaled; Makino, Kazuhisa; Mehlhorn, Kurt; Ramezani, Fahimeh
2
2015
Towards more practical linear programming-based techniques for algorithmic mechanism design. Zbl 1358.91058
Elbassioni, Khaled; Mehlhorn, Kurt; Ramezani, Fahimeh
2
2015
Greedy is an almost optimal deque. Zbl 1444.68056
Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol
1
2015
A framework for the verification of certifying computations. Zbl 1314.68180
Alkassar, Eyad; Böhme, Sascha; Mehlhorn, Kurt; Rizkallah, Christine
5
2014
Improving the price of anarchy for selfish routing via coordination mechanisms. Zbl 1291.91037
Christodoulou, Giorgos; Mehlhorn, Kurt; Pyrga, Evangelia
4
2014
On a model of virtual address translation. Zbl 1347.68015
Jurkiewicz, Tomasz; Mehlhorn, Kurt
1
2014
Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn. Zbl 1283.68018
Manlove, David F.
72
2013
Physarum can compute shortest paths: convergence proofs and complexity bounds. Zbl 1335.68099
Becchetti, Luca; Bonifaci, Vincenzo; Dirnberger, Michael; Karrenbauer, Andreas; Mehlhorn, Kurt
8
2013
From approximate factorization to root isolation. Zbl 1360.68944
Mehlhorn, Kurt; Sagraloff, Michael; Wang, Pengming
6
2013
The query complexity of finding a hidden permutation. Zbl 1391.68044
Afshani, Peyman; Agrawal, Manindra; Doerr, Benjamin; Doerr, Carola; Larsen, Kasper Green; Mehlhorn, Kurt
5
2013
A combinatorial polynomial algorithm for the linear Arrow-Debreu market. Zbl 1328.91198
Duan, Ran; Mehlhorn, Kurt
3
2013
Every DFS tree of a 3-connected graph contains a contractible edge. Zbl 1259.05097
Elmasry, Amr; Mehlhorn, Kurt; Schmidt, Jens M.
2
2013
Certifying 3-edge-connectivity. Zbl 1417.05226
Mehlhorn, Kurt; Neumann, Adrian; Schmidt, Jens M.
1
2013
Online graph exploration: New results on old and new algorithms. Zbl 1269.05103
Megow, Nicole; Mehlhorn, Kurt; Schweitzer, Pascal
8
2012
Physarum can compute shortest paths. Zbl 1411.92332
Bonifaci, Vincenzo; Mehlhorn, Kurt; Varma, Girish
7
2012
Counting arbitrary subgraphs in data streams. Zbl 1367.68213
Kane, Daniel M.; Mehlhorn, Kurt; Sauerwald, Thomas; Sun, He
6
2012
Physarum can compute shortest paths. Zbl 1420.68088
Bonifaci, Vincenzo; Mehlhorn, Kurt; Varma, Girish
5
2012
Certifying algorithms. Zbl 1298.68289
McConnell, R. M.; Mehlhorn, K.; Näher, S.; Schweitzer, P.
34
2011
Weisfeiler-Lehman graph kernels. Zbl 1280.68194
Shervashidze, Nino; Schweitzer, Pascal; van Leeuwen, Erik Jan; Mehlhorn, Kurt; Borgwardt, Karsten M.
34
2011
A deterministic algorithm for isolating real roots of a real polynomial. Zbl 1207.65048
Mehlhorn, Kurt; Sagraloff, Michael
9
2011
Online graph exploration: new results on old and new algorithms. Zbl 1334.68306
Megow, Nicole; Mehlhorn, Kurt; Schweitzer, Pascal
5
2011
Improving the price of anarchy for selfish routing via coordination mechanisms. Zbl 1346.91021
Christodoulou, George; Mehlhorn, Kurt; Pyrga, Evangelia
4
2011
Approximate counting of cycles in streams. Zbl 1346.68257
Manjunath, Madhusudan; Mehlhorn, Kurt; Panagiotou, Konstantinos; Sun, He
4
2011
A general approach to the analysis of controlled perturbation algorithms. Zbl 1247.65024
Mehlhorn, Kurt; Osbild, Ralf; Sagraloff, Michael
2
2011
New approximation algorithms for minimum cycle bases of graphs. Zbl 1215.68185
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios
1
2011
Additive spanners and \(({\alpha}, {\beta})\)-spanners. Zbl 1295.05094
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth
27
2010
Faster algorithms for computing Hong’s bound on absolute positiveness. Zbl 1206.11151
Mehlhorn, Kurt; Ray, Saurabh
13
2010
Assigning papers to referees. Zbl 1203.90092
Garg, Naveen; Kavitha, Telikepalli; Kumar, Amit; Mehlhorn, Kurt; Mestre, Julián
10
2010
Arrangements on parametric surfaces. I: General framework and infrastructure. Zbl 1205.68457
Berberich, Eric; Fogel, Efi; Halperin, Dan; Mehlhorn, Kurt; Wein, Ron
3
2010
Progress on certifying algorithms. Zbl 1288.68242
Mehlhorn, Kurt; Schweitzer, Pascal
1
2010
Cycle bases in graphs characterization, algorithms, complexity, and applications. Zbl 1301.05195
Kavitha, Telikepalli; Liebchen, Christian; Mehlhorn, Kurt; Michail, Dimitrios; Rizzi, Romeo; Ueckerdt, Torsten; Zweig, Katharina A.
30
2009
Minimum cycle bases, faster and simpler. Zbl 1300.05304
Mehlhorn, Kurt; Michail, Dimitrios
10
2009
Breaking the \(O(m ^{2} n)\) barrier for minimum cycle bases. Zbl 1256.68080
Amaldi, Edoardo; Iuliano, Claudio; Jurkiewicz, Tomasz; Mehlhorn, Kurt; Rizzi, Romeo
5
2009
Isolating real roots of real polynomials. Zbl 1237.68257
Mehlhorn, Kurt; Sagraloff, Michael
2
2009
A separation bound for real algebraic expressions. Zbl 1180.68304
Burnikel, Christoph; Funke, Stefan; Mehlhorn, Kurt; Schirra, Stefan; Schmitt, Susanne
1
2009
Note on the paper “K-vertex guarding simple polygons”. Zbl 1168.52005
Mehlhorn, Kurt; Sack, Jörg; Zaks, Joseph
1
2009
Algorithms and data structures. The basic toolbox. Zbl 1146.68069
Mehlhorn, Kurt; Sanders, Peter
29
2008
Classroom examples of robustness problems in geometric computations. Zbl 1135.65311
Kettner, Lutz; Mehlhorn, Kurt; Pion, Sylvain; Schirra, Stefan; Yap, Chee
16
2008
An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs. Zbl 1163.68329
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E.
4
2008
Faster algorithms for minimum cycle basis in directed graphs. Zbl 1178.68669
Hariharan, Ramesh; Kavitha, Telikepalli; Mehlhorn, Kurt
4
2008
Popular matchings. Zbl 1154.91033
Abraham, David J.; Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt
37
2007
New approximation algorithms for minimum cycle bases of graphs. Zbl 1186.68561
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios
8
2007
Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments. Zbl 1118.65308
Hachenberger, Peter; Kettner, Lutz; Mehlhorn, Kurt
7
2007
Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem. Zbl 1321.05207
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E.
5
2007
Algorithms to compute minimum cycle basis in directed graphs. Zbl 1121.68087
Kavitha, Telikepalli; Mehlhorn, Kurt
5
2007
Sweeping and maintaining two-dimensional arrangements on surfaces: A first step. Zbl 1151.68700
Berberich, Eric; Fogel, Efi; Halperin, Dan; Mehlhorn, Kurt; Wein, Ron
5
2007
Cycle bases of graphs and sampled manifolds. Zbl 1171.65334
Gotsman, Craig; Kaligosi, Kanela; Mehlhorn, Kurt; Michail, Dimitrios; Pyrga, Evangelia
1
2007
Minimum cycle bases in graphs. Algorithms and applications. Zbl 1147.68610
Mehlhorn, Kurt
1
2007
Certifying algorithms for recognizing interval graphs and permutation graphs. Zbl 1113.68112
Kratsch, Dieter; McConnell, Ross M.; Mehlhorn, Kurt; Spinrad, Jeremy P.
30
2006
Rank-maximal matchings. Zbl 1321.90116
Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E.
19
2006
New bounds for the Descartes method. Zbl 1158.12001
Krandick, Werner; Mehlhorn, Kurt
14
2006
Implementing minimum cycle basis algorithms. Zbl 1143.05310
Mehlhorn, Kurt; Michail, Dimitrios
9
2006
Reliable and efficient computational geometry via controlled perturbation. Zbl 1183.68671
Mehlhorn, Kurt; Osbild, Ralf; Sagraloff, Michael
7
2006
Polyline fitting of planar points under min-sum criteria. Zbl 1098.65011
Aronov, Boris; Asano, Tetsuo; Katoh, Naoki; Mehlhorn, Kurt; Tokuyama, Takeshi
3
2006
Matching algorithms are fast in sparse random graphs. Zbl 1104.68078
Bast, Holger; Mehlhorn, Kurt; Schafer, Guido; Tamaki, Hisao
3
2006
A faster deterministic algorithm for minimum cycle bases in directed graphs. Zbl 1223.05298
Hariharan, Ramesh; Kavitha, Telikepalli; Mehlhorn, Kurt
2
2006
Reliable and efficient geometric computing. Zbl 1183.68670
Mehlhorn, Kurt
1
2006
A Descartes algorithm for polynomials with bit-stream coefficients. Zbl 1169.65315
Eigenwillig, Arno; Kettner, Lutz; Krandick, Werner; Mehlhorn, Kurt; Schmitt, Susanne; Wolpert, Nicola
18
2005
New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners. Zbl 1297.05066
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth
13
2005
Pareto optimality in house allocation problems. Zbl 1115.90049
Abraham, David J.; Cechlárová, Katarína; Manlove, David F.; Mehlhorn, Kurt
12
2005
Controlled perturbation for Delaunay triangulations. Zbl 1297.68240
Funke, Stefan; Klein, Christian; Mehlhorn, Kurt; Schmitt, Susanne
8
2005
Popular matchings. Zbl 1297.68087
Abraham, David J.; Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt
7
2005
Structural filtering: a paradigm for efficient and exact geometric programs. Zbl 1078.65015
Funke, Stefan; Mehlhorn, Kurt; Näher, Stefan
7
2005
EXACUS: Efficient and exact algorithms for curves and surfaces. Zbl 1162.68733
Berberich, Eric; Eigenwillig, Arno; Hemmer, Michael; Hert, Susan; Kettner, Lutz; Mehlhorn, Kurt; Reichel, Joachim; Schmitt, Susanne; Schömer, Elmar; Wolpert, Nicola
6
2005
A polynomial time algorithm for minimum cycle basis in directed graphs. Zbl 1118.05314
Kavitha, Telikepalli; Mehlhorn, Kurt
5
2005
Towards optimal multiple selection. Zbl 1085.68030
Kaligosi, Kanela; Mehlhorn, Kurt; Munro, J. Ian; Sanders, Peter
4
2005
Implementing minimum cycle basis algorithms. Zbl 1121.05314
Mehlhorn, Kurt; Michail, Dimitrios
2
2005
Pareto optimality in house allocation problems. Zbl 1116.90393
Abraham, David J.; Cechlárová, Katarína; Manlove, David F.; Mehlhorn, Kurt
29
2004
A faster algorithm for minimum cycle basis of graphs. Zbl 1103.05086
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna
19
2004
Rank-maximal matchings. Zbl 1318.90060
Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna
6
2004
Classroom examples of robustness problems in geometric computations. Zbl 1111.68725
Kettner, Lutz; Mehlhorn, Kurt; Pion, Sylvain; Schirra, Stefan; Yap, Chee
5
2004
Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem. Zbl 1122.68459
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna
3
2004
Point containment in the integer hull of a polyhedron. Zbl 1318.68180
Althaus, Ernst; Eisenbrand, Friedrich; Funke, Stefan; Mehlhorn, Kurt
2
2004
Certifying algorithms for recognizing interval graphs and permutation graphs. Zbl 1094.68615
Kratsch, Dieter; McConnell, Ross M.; Mehlhorn, Kurt; Spinrad, Jeremy P.
16
2003
Certifying and repairing solutions to large LPs: How good are LP-solvers? Zbl 1176.90395
Dhiflaoui, Marcel; Funke, Stefan; Kwappik, Carsten; Mehlhorn, Kurt; Seel, Michael; Schömer, Elmar; Schulte, Ralph; Weber, Dennis
15
2003
Optimal search for rationals. Zbl 1173.68826
Kwek, Stephen; Mehlhorn, Kurt
13
2003
Smoothed analysis of three combinatorial problems. Zbl 1124.68371
Banderier, Cyril; Beier, René; Mehlhorn, Kurt
9
2003
Boolean operations on 3D selective Nef complexes: data structure, algorithms, and implementation. Zbl 1266.68201
Granados, Miguel; Hachenberger, Peter; Hert, Susan; Kettner, Lutz; Mehlhorn, Kurt; Seel, Michael
3
2003
Infimaximal frames: A technique for making lines look like segments. Zbl 1093.68131
Mehlhorn, Kurt; Seel, Michael
3
2003
The reliable algorithmic software challenge RASC. Zbl 1023.68884
Mehlhorn, Kurt
2
2003
Scanning multiple sequences via cache memory. Zbl 1026.68157
Mehlhorn, Kurt; Sanders, Peter
1
2003
...and 144 more Documents
all top 5

Cited by 2,759 Authors

67 Mehlhorn, Kurt
26 Kavitha, Telikepalli
16 Sharir, Micha
14 Cechlárová, Katarína
14 Sagraloff, Michael
12 de Berg, Mark Theodoor
12 Italiano, Giuseppe Francesco
12 Overmars, Mark H.
12 Tsakalidis, Athanasios K.
11 Bose, Prosenjit K.
11 Choi, Byung-Cheon
11 Kamiyama, Naoyuki
11 Klein, Rolf-Dieter
11 Okhotin, Alexander
11 Smid, Michiel H. M.
10 Baeza-Yates, Ricardo A.
10 Huang, Chien-Chung
10 Lingas, Andrzej
10 Tarjan, Robert Endre
10 Tsigaridas, Elias P.
9 Chazelle, Bernard
9 Devillers, Olivier
9 Manlove, David F.
9 Papadopoulou, Evanthia
9 Rote, Günter
9 Salomaa, Kai T.
9 Subramani, Krishnan
9 Tsichlas, Kostas
9 van Kreveld, Marc J.
9 Yap, Chee-Keng
8 Alt, Helmut
8 Cheong, Otfried
8 Goodrich, Michael Truman
8 Hershberger, John E.
8 Kaplan, Haim
8 Kirkpatrick, David G.
8 Langerman, Stefan
8 Levcopoulos, Christos
8 Morin, Pat
8 Pettie, Seth
8 Pietracaprina, Andrea
8 Pucci, Geppino
8 Sanders, Peter
8 Schirra, Stefan
8 Schmidt, Jens M.
8 Teillaud, Monique
7 Agarwal, Pankaj Kumar
7 Aziz, Haris
7 Chan, Timothy Moon-Yew
7 Doerr, Benjamin
7 Elbassioni, Khaled M.
7 Elmasry, Amr
7 Fleiner, Tamás
7 Funke, Stefan
7 Gawrychowski, Paweł
7 Gudmundsson, Joachim
7 Halperin, Dan
7 Jeż, Artur
7 Michail, Dimitrios
7 Munro, J. Ian
7 Näher, Stefan
7 Nasre, Meghana
7 Seidel, Raimund
7 Sioutas, Spyros
7 Tamassia, Roberto
6 Aurenhammer, Franz
6 Bille, Philip
6 Bohler, Cecilia
6 Boissonnat, Jean-Daniel
6 Bonifaci, Vincenzo
6 Di Puglia Pugliese, Luigi
6 Edelsbrunner, Herbert
6 Emiris, Ioannis Z.
6 Golin, Mordecai J.
6 Guerriero, Francesca
6 Hurtado, Ferran
6 Katz, Matthew J.
6 Kaufmann, Michael
6 Larsen, Kim Skak
6 Lazard, Sylvain
6 Liebchen, Christian
6 Liu, Chih-Hung
6 Makris, Christos H.
6 Nekrich, Yakov
6 Pradella, Matteo
6 Preparata, Franco P.
6 Rizzi, Romeo
6 Snoeyink, Jack Scott
6 Stølting Brodal, Gerth
6 Welzl, Emo
6 Wood, Derick
5 Amir, Amihood
5 Barequet, Gill
5 Berberich, Eric
5 Biró, Peter
5 Blum, Norbert
5 Cheng, Siu-Wing
5 Doerr, Carola
5 Eirinakis, Pavlos
5 Gagie, Travis
...and 2,659 more Authors
all top 5

Cited in 234 Serials

186 Theoretical Computer Science
164 Algorithmica
126 Information Processing Letters
114 Computational Geometry
73 Discrete Applied Mathematics
40 Journal of Computer and System Sciences
34 Information and Computation
33 Discrete & Computational Geometry
33 International Journal of Computational Geometry & Applications
32 Theory of Computing Systems
27 Journal of Symbolic Computation
26 Acta Informatica
26 SIAM Journal on Computing
26 European Journal of Operational Research
24 Computers & Operations Research
21 Journal of Combinatorial Optimization
14 Discrete Mathematics
14 Journal of Discrete Algorithms
13 Computer Aided Geometric Design
13 International Journal of Foundations of Computer Science
13 Mathematical Programming. Series A. Series B
12 Computing
12 Annals of Operations Research
11 Artificial Intelligence
11 BIT
11 Journal of Computational and Applied Mathematics
11 SIAM Journal on Discrete Mathematics
11 International Journal of Computer Mathematics
10 Mathematical Systems Theory
9 Networks
9 Designs, Codes and Cryptography
9 Mathematics in Computer Science
8 Operations Research Letters
8 Pattern Recognition
8 Constraints
8 Discrete Optimization
7 Journal of Complexity
7 Machine Learning
7 Random Structures & Algorithms
7 Computer Science Review
6 Information Sciences
6 RAIRO, Informatique Théorique
6 Distributed Computing
6 Journal of Graph Algorithms and Applications
6 Logical Methods in Computer Science
6 Mathematical Programming Computation
5 Computers & Mathematics with Applications
5 Mathematics of Computation
5 Applied Mathematics and Computation
5 Mathematics of Operations Research
5 Mathematical Social Sciences
5 Journal of Automated Reasoning
5 Asia-Pacific Journal of Operational Research
5 Computational Optimization and Applications
5 SIAM Journal on Scientific Computing
5 Annals of Mathematics and Artificial Intelligence
5 Data Mining and Knowledge Discovery
5 CEJOR. Central European Journal of Operations Research
5 ACM Journal of Experimental Algorithmics
5 Optimization Letters
5 Algorithms
4 ACM Computing Surveys
4 Journal of Combinatorial Theory. Series B
4 The Visual Computer
4 Linear Algebra and its Applications
4 Journal of Mathematical Imaging and Vision
4 Cybernetics and Systems Analysis
4 Computational Complexity
3 Journal of Statistical Physics
3 Calcolo
3 Journal of Combinatorial Theory. Series A
3 Kybernetika
3 Operations Research
3 European Journal of Combinatorics
3 Combinatorica
3 Optimization
3 Applied Mathematics Letters
3 Formal Methods in System Design
3 INFORMS Journal on Computing
3 Parallel Algorithms and Applications
3 RAIRO. Operations Research
2 Advances in Applied Probability
2 Computer Physics Communications
2 Mathematical Biosciences
2 Nuclear Physics. B
2 Physica A
2 Journal of Graph Theory
2 Journal of Optimization Theory and Applications
2 Science of Computer Programming
2 SIAM Journal on Algebraic and Discrete Methods
2 Graphs and Combinatorics
2 Journal of Computer Science and Technology
2 Mathematical and Computer Modelling
2 SIAM Journal on Matrix Analysis and Applications
2 Journal of Scientific Computing
2 Neural Networks
2 International Journal of Algebra and Computation
2 Games and Economic Behavior
2 Elemente der Mathematik
2 RAIRO. Informatique Théorique et Applications
...and 134 more Serials
all top 5

Cited in 46 Fields

1,240 Computer science (68-XX)
397 Combinatorics (05-XX)
289 Operations research, mathematical programming (90-XX)
171 Numerical analysis (65-XX)
108 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
82 Convex and discrete geometry (52-XX)
66 Information and communication theory, circuits (94-XX)
35 Mathematical logic and foundations (03-XX)
28 Biology and other natural sciences (92-XX)
23 Algebraic geometry (14-XX)
23 Statistics (62-XX)
20 Number theory (11-XX)
19 Probability theory and stochastic processes (60-XX)
15 Real functions (26-XX)
13 Statistical mechanics, structure of matter (82-XX)
11 Order, lattices, ordered algebraic structures (06-XX)
11 Field theory and polynomials (12-XX)
9 Commutative algebra (13-XX)
9 Geometry (51-XX)
7 Functions of a complex variable (30-XX)
6 Linear and multilinear algebra; matrix theory (15-XX)
6 Quantum theory (81-XX)
6 Systems theory; control (93-XX)
5 Functional analysis (46-XX)
4 Group theory and generalizations (20-XX)
4 Partial differential equations (35-XX)
4 Dynamical systems and ergodic theory (37-XX)
4 Mechanics of particles and systems (70-XX)
3 Associative rings and algebras (16-XX)
3 Ordinary differential equations (34-XX)
3 Calculus of variations and optimal control; optimization (49-XX)
3 Manifolds and cell complexes (57-XX)
3 Fluid mechanics (76-XX)
2 General and overarching topics; collections (00-XX)
2 Approximations and expansions (41-XX)
2 Operator theory (47-XX)
2 Differential geometry (53-XX)
2 Algebraic topology (55-XX)
1 History and biography (01-XX)
1 Category theory; homological algebra (18-XX)
1 Topological groups, Lie groups (22-XX)
1 Measure and integration (28-XX)
1 Special functions (33-XX)
1 Difference and functional equations (39-XX)
1 Mechanics of deformable solids (74-XX)
1 Optics, electromagnetic theory (78-XX)

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.