Marek Karpinski
Marek Karpinski[1] is a computer scientist and mathematician known for his research in the theory of algorithms and their applications, combinatorial optimization, computational complexity, and mathematical foundations. He is a recipient of several research prizes in the above areas.
He is currently a Professor of Computer Science, and the Head of the Algorithms Group at the University of Bonn. He is also a member of Bonn International Graduate School in Mathematics BIGS and the Hausdorff Center for Mathematics.
See also
References
- ↑ Marek Karpinski Biography at the Hausdorff Center for Mathematics, Excellence Cluster
- Karpinski's homepage with list of publications
- Computer Science Bibliographies
- Oberwolfach Photo Collection
- Fundamentals of Computation Theory, Steering Committee, Chair
- Bonn Workshop on Foundations of Computing (BFC '87), ed.: M.Karpinski, V. Strassen (proceedings)
- Max Planck Research Awards 1994
- List of Members of the Academia Europaea
- Bonn Workshop on Randomized Algorithms (RAND)
- Marek Karpinski at the Mathematics Genealogy Project
- Marek Karpinski at Scholar Wiki
- Travelling salesman problem, approximability
- Steiner tree problem, approximation algorithms
- MAX-3SAT, bounded occurrence instances
- Algorithmic Lovász local lemma
- Pancake sorting, algorithms
- Sorting by Reversals
- Gale-Berlekamp Games
External links
- Marek Karpinski at DBLP
- Marek Karpinski at Google Scholar Citations
- Marek Karpinski at Computer Science Bibliographies
- Marek Karpinski at MathSciNet
- Marek Karpinski at Zentralblatt für Mathematik (ZMATH)
- A compendium of NP optimization problems
- A Compendium on Steiner Tree Problems
- Approximation Taxonomy of Metric TSP
- Publications at ICSI, Berkeley
- Publications at EECS, UC Berkeley
- Publications at Princeton Computer Science
- Seminars, Dagstuhl Schloss, Dagstuhl
- Research CS Reports, University of Bonn
- IFIP working groups WG1.1 and WG1.4
- List of people by Erdős number
- Karpinski's Books
- The Best Nurturers in Computer Science Research
- Computational Complexity theory,notable researchers
- Publications at ACM Digital Library
This article is issued from Wikipedia - version of the 9/6/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.