Items where Author is "Mehlhorn, Kurt"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 64.

Garg, Jugal and Hoefer, Martin and Mehlhorn, Kurt
(2018) Approximating the Nash Social Welfare with Budget-Additive Valuations.
In: SODA '18 Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms.
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms

Koprowski, Przemyslaw and Mehlhorn, Kurt and Ray, Saurabh
(2018) Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness".
Journal of Symbolic Computation, 87. 238–241.
(Submitted)

Mehlhorn, Kurt and Neumann, Adrian and Schmidt, Jens M.
(2017) Certifying 3-Edge-Connectivity.
Algorithmica, 77 (2). 309–335.

Bei, Xiaohui and Garg, Jugal and Hoefer, Martin and Mehlhorn, Kurt
(2017) Earning Limits in Fisher Markets with Spending-Constraint Utilities.
In: SAGT 2017 - International Symposium on Algorithmic Game Theory.

Bei, Xiaohui and Garg, Jugal and Hoefer, Martin and Mehlhorn, Kurt
(2016) Computing Equilibria in Markets with Budget-Additive Utilities.
In: ESA - European Symposium on Algorithms.
Conference: ESA European Symposium on Algorithms

Sagraloff, Michael and Mehlhorn, Kurt
(2016) Computing real roots of real polynomials.
Journal of Symbolic Computation, 73. 46–86.

Huang, Chien-Chung and Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios
(2016) Fair Matchings and Related Problems.
Algorithmica, 74 (3). 1184–1203.

Duan, Ran and Garg, Jugal and Mehlhorn, Kurt
(2016) An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market.
In: SODA 2016 - ACM/SIAM Symposium on Discrete Algorithms.
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms

Darwish, Omar and Mehlhorn, Kurt
(2016) Improved balanced flow computation using parametric flow.
Information Processing Letters, 116 (9). 560–563.

Kolev, Pavel and Mehlhorn, Kurt
(2016) A Note On Spectral Clustering.
In: ESA.
Conference: ESA European Symposium on Algorithms

Croitoru, Cosmina and Mehlhorn, Kurt
(2016) Opposition Frameworks.
In: JELIA.
Conference: JELIA Logics in Artificial Intelligence, European Conference

Elbassioni, Khaled M. and Mehlhorn, Kurt and Ramezani, Fahimeh
(2016) Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design.
Theory of Computing Systems, 59 (4). 641–663. ISSN 1432-4350

Mehlhorn, Kurt and Saxena, Sanjeev
(2016) A still simpler way of introducing interior-point method for linear programming.
Computer Science Review, 22. 1–11.

Mehlhorn, Kurt and Sagraloff, Michael and Wang, Pengming
(2015) From approximate factorization to root isolation with application to cylindrical algebraic decomposition.
Journal of Symbolic Computation, 66. 34–69.

Chalermsook, Parinya and Goswami, Mayank and Kozma, László and Mehlhorn, Kurt and Saranurak, Thatchaphol
(2015) Greedy Is an Almost Optimal Deque.
In: WADS 2015: Workshop on Algorithms and Data Structures.

Elbassioni, Khaled M. and Makino, Kazuhisa and Mehlhorn, Kurt and Ramezani, Fahimeh
(2015) On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets.
Algorithmica, 73 (2). 441–459.

Mehlhorn, Kurt
(2015) On the Implementation of Combinatorial Algorithms for the Linear Exchange Market.
In: Algorithms, Probability, Networks, and Games. Lecture Notes in Computer Science, 9295 . Springer, 87–94.

Becchetti, Luca and Bonifaci, Vincenzo and Dirnberger, Michael and Karrenbauer, Andreas and Mehlhorn, Kurt and Varma, Girish
(2015) P. polycephalum Can Compute Shortest Paths.
In: BICT 2015 - International Conference on Bio-inspired Information and Communications Technologies.

Chalermsook, Parinya and Goswami, Mayank and Kozma, László and Mehlhorn, Kurt and Saranurak, Thatchaphol
(2015) Pattern-Avoiding Access in Binary Search Trees.
In: FOCS.
Conference: FOCS IEEE Symposium on Foundations of Computer Science

Chalermsook, Parinya and Goswami, Mayank and Kozma, László and Mehlhorn, Kurt and Saranurak, Thatchaphol
(2015) Self-Adjusting Binary Search Trees: What Makes Them Tick?
In: ESA.
Conference: ESA European Symposium on Algorithms

Elbassioni, Khaled M. and Mehlhorn, Kurt and Ramezani, Fahimeh
(2015) Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design.
In: SAGT 2015 - International Symposium on Algorithmic Game Theory.

Dirnberger, Michael and Kehl, Tim and Mehlhorn, Tim and Mehlhorn, Kurt and Neumann, Adrian
(2015) Towards an open online repository of P. polycephalum networks and their corresponding graph representations.
In: BICT 2015 - International Conference on Bio-inspired Information and Communications Technologies.

Duan, Ran and Mehlhorn, Kurt
(2015) A combinatorial polynomial algorithm for the linear Arrow-Debreu market.
Information and Computation, 243. 112–132.

Noschinski, Lars and Rizkallah, Christine and Mehlhorn, Kurt
(2014) Verification of Certifying Computations through AutoCorres and Simpl.
In: Proc. 6th NASA Formal Methods Symposium (NFM 2014).

Dietzfelbinger, Martin and Mehlhorn, Kurt and Sanders, Peter
(2014) Algorithmen und Datenstrukturen - die Grundwerkzeuge.
eXamen.press . Springer.

Mehlhorn, Kurt
(2014) Algorithms for Equilibrium Prices in Linear Market Models.
In: WALCOM 2014 : Eighth International Workshop on Algorithms and Computation, February 13-15, 2014, IIT Madras, Chennai, India.

Megiddo, Nimrod and Mehlhorn, Kurt and Savani, Rahul and Vazirani, Vijay V.
(2014) Equilibrium Computation (Dagstuhl Seminar 14342).
Dagstuhl Reports, 4 (8). 73–88.

Christodoulou, Giorgos and Mehlhorn, Kurt and Pyrga, Evangelia
(2014) Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms.
Algorithmica, 69 (3). 619–640.

Bhattacharya, Sayan and Chalermsook, Parinya and Mehlhorn, Kurt and Neumann, Adrian
(2014) New Approximability Results for the Robust k-Median Problem.
In: 14th Scandinavian Symposium and Workshops, SWAT 2014.

Jurkiewicz, Tomasz and Mehlhorn, Kurt
(2014) On a Model of Virtual Address Translation.
ACM Journal of Experimental Algorithmics, 19 (1).

Elmasry, Amr and Schmidt, Jens M. and Mehlhorn, Kurt
(2013) Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge.
Journal of Graph Theory, 72 (1). pp. 112-121.

Alkassar, Eyad and Böhme, Sascha and Mehlhorn, Kurt and Rizkallah, Christine
(2013) A Framework for the Verification of Certifying Computations.
Journal of Automated Reasoning. pp. 1-33.

Mehlhorn, Kurt and Neumann, Adrian and Schmidt, Jens M.
(2013) Certifying 3-Edge-Connectivity.
Algorithmica, 8165. 358–369.

Duan, Ran and Mehlhorn, Kurt
(2013) A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market.
In: International Colloquium on Automata, Languages and Programming (ICALP'13).
Conference: ICALP International Colloquium on Automata Languages and Programming

Cheong, Otfried and Mehlhorn, Kurt and Teillaud, Monique
(2013) Computational Geometry (Dagstuhl Seminar 13101).
Dagstuhl Reports, 3 (3). 1–23.

Huang, Chien-Chung and Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios
(2013) Fair Matchings and Related Problems.
In: FSTTCS'13 Conference on Foundations of Software Technology and Theoretical Computer Science.

Mehlhorn, Kurt and Sagraloff, Michael and Wang, Pengming
(2013) From approximate factorization to root isolation.
In: ISSAC.
Conference: ISSAC International Symposium on Symbolic and Algebraic Computation

Elbassioni, Khaled M. and Makino, Kazuhisa and Mehlhorn, Kurt and Ramezani, Fahimeh
(2013) On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets.
In: COCOON.
Conference: COCOON International Conference on Computing and Combinatorics

Becchetti, Luca and Bonifaci, Vincenzo and Dirnberger, Michael and Karrenbauer, Andreas and Mehlhorn, Kurt
(2013) Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds.
In: ICALP '13 - International Colloquium on Automata Languages and Programming.
Conference: ICALP International Colloquium on Automata Languages and Programming

Mehlhorn, Kurt
(2013) Physarum Computations.
In: STACS.
Conference: STACS International Symposium on Theoretical Aspects of Computer Science

Afshani, Peyman and Agrawal, Manindra and Doerr, Benjamin and Doerr, Carola and Larsen, Kasper Green and Mehlhorn, Kurt
(2013) The Query Complexity of Finding a Hidden Permutation.
In: Space-Efficient Data Structures, Streams, and Algorithms.

Jurkiewicz, Tomasz and Mehlhorn, Kurt
(2013) The cost of address translation.
In: ALENEX'13- Workshop on Algorithm Engineering and Experiments.
Conference: ALENEX Workshop on Algorithm Engineering and Experiments

Elmasry, Amr and Mehlhorn, Kurt and Schmidt, Jens M.
(2012) An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs.
Algorithmica, 62 (3-4). pp. 754-766.

Mehlhorn, Kurt and Sack, Jörg-Rüdiger
(2012) CGTA-Awards 2011.
Computational Geometry, 45 (4). p. 139.

Kane, Daniel M. and Mehlhorn, Kurt and Sauerwald, Thomas and Sun, He
(2012) Counting Arbitrary Subgraphs in Data Streams.
In: ICALP '12 - International Colloquium on Automata Languages and Programming.
Conference: ICALP International Colloquium on Automata Languages and Programming

Afshani, Peyman and Agrawal, Manindra and Doerr, Benjamin and Winzen, Carola and Larsen, Kasper Green and Mehlhorn, Kurt
(2012) The Deterministic and Randomized Query Complexity of a Simple Guessing Game.
Electronic Colloquium on Computational Complexity (ECCC), 19. p. 87.

Megow, Nicole and Mehlhorn, Kurt and Schweitzer, Pascal
(2012) Online graph exploration: New results on old and new algorithms.
Theoretical Computer Science, 463. 62–72.

Bonifaci, Vincenzo and Mehlhorn, Kurt and Varma, Girish
(2012) Physarum can compute shortest paths.
In: SODA 2012 - ACM/SIAM Symposium on Discrete Algorithms.
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms

Mehlhorn, Kurt and Vardi, Moshe Y. and Herbstritt, Marc
(2012) Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452).
Dagstuhl Reports, 2 (11). 20–44.

McConnell, Ross M and Mehlhorn, Kurt and Näher, Stefan and Schweitzer, Pascal
(2011) Survey: Certifying Algorithms.
Computer Science Review, 5 (2). pp. 119-161. ISSN 1574-0137

Alkassar, Eyad and Böhme, Sascha and Mehlhorn, Kurt and Rizkallah, Christine
(2011) Verification of Certifying Computations.
In: Proc. of the 23rd International Conference on Computer Aided Verification (CAV 2011).
Conference: CAV Computer Aided Verification

Manjunath, Madhusudan and Mehlhorn, Kurt and Panagiotou, Konstantinos and Sun, He
(2011) Approximate Counting of Cycles in Streams.
In: ESA '11 - European Symposium on Algorithms.
Conference: ESA European Symposium on Algorithms

McConnell, Ross M. and Mehlhorn, Kurt and Näher, Stefan and Schweitzer, Pascal
(2011) Certifying algorithms.
Computer Science Review, 5 (2). 119–161.

Agarwal, Pankaj K. and Mehlhorn, Kurt and Teillaud, Monique
(2011) Computational Geometry (Dagstuhl Seminar 11111).
Dagstuhl Reports, 1 (3). 19–41.

Halperin, Dan and Mehlhorn, Kurt
(2011) Guest Editorial: Selected Papers from European Symposium on Algorithms.
Algorithmica, 60 (1). 1–2.

Christodoulou, Giorgos and Mehlhorn, Kurt and Pyrga, Evangelia
(2011) Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms.
In: ESA.
Conference: ESA European Symposium on Algorithms

Alkassar, Eyad and Böhme, Sascha and Mehlhorn, Kurt and Rizkallah, Christine and Schweitzer, Pascal
(2011) An Introduction to Certifying Algorithms.
it - Information Technology, 53 (6). 287–293.

Eigenwillig, Arno and Mehlhorn, Kurt
(2011) Multiplication of Long Integers - Faster than Long Multiplication.
In: Algorithms Unplugged. Springer, 101–109.

Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios
(2011) New Approximation Algorithms for Minimum Cycle Bases of Graphs.
Algorithmica, 59 (4). 471–488.

Megow, Nicole and Mehlhorn, Kurt and Schweitzer, Pascal
(2011) Online Graph Exploration: New Results on Old and New Algorithms.
In: ICALP '11 - International Colloquium on Automata Languages and Programming.
Conference: ICALP International Colloquium on Automata Languages and Programming

Mehlhorn, Kurt
(2011) The Physarum Computer.
In: WALCOM 2014 : Fifth International Workshop on Algorithms and Computation.

Shervashidze, Nino and Schweitzer, Pascal and van Leeuwen, Erik Jan and Mehlhorn, Kurt and Borgwardt, Karsten M.
(2011) Weisfeiler-Lehman Graph Kernels.
Journal of Machine Learning Research, 12. 2539–2561.

Mehlhorn, Kurt and Sagraloff, Michael
(2011) A deterministic algorithm for isolating real roots of a real polynomial.
Journal of Symbolic Computation, 46 (1). 70–90.

Mehlhorn, Kurt and Osbild, Ralf and Sagraloff, Michael
(2011) A general approach to the analysis of controlled perturbation algorithms.
Computational Geometry, 44 (9). 507–528.

This list was generated on Sun Dec 22 03:23:09 2024 CET.
CISPA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.