M.A. in Mathematics, Poznan University, Poland
M.E.E. in Computer Science, Technical University Poznan, Poland
PhD in Computer Science and Mathematics, Polish Academy of Sciences, Warsaw, Poland
Habilitation in Computer Science and Mathematics, Polish Academy of Sciences, Warsaw, Poland
Director, Department of Computer Science, University of Bonn
Professor (C4), Department of Computer Science, University of Bonn
He has been doing research and teaching at various universities and research institutes among others in Warsaw, Pittsburgh, Berkeley, Princeton, MIT, Yale, Oxford, Cambridge, Lund, and Paris.
Main research interests are in computational complexity and design of efficient algorithms, especially randomized and approximate algorithms. Further topics in recent research include: Combinatorial and Geometric Optimization, VC Dimension and O-Minimality, Parallel and Distributed Systems, Internet Algorithms, Algorithmic Game Theory, Computational Molecular Biology.
ESPRIT BR Working Group – 7097 and 21726 on “Randomized Algorithms, RAND and RAND2”
Bonn, Edinburgh, Leeds, Lund, Oxford, Paris, Weizmann Institute, Rehovot
Principal Investigator, 1992 - 1995 and 1996 - 1999
Volkswagen-Stiftung Project (I/68055) on “Computational Complexity and Efficient Algorithms”
Principal Investigator, 1993 – 1998
NSF/ESPRIT BR Project EC-US 030 on “Randomness and Efficient Computation, RAND-REC” (with M. Luby, Berkeley)
Research Sites: Bonn, Berkeley, Edinburgh, Leeds, Lund, Oxford, and Paris
Principal Investigator, 1993 - 1997
IST BR Project 14036 (RAND-APX) on “Randomness and Approximate Computation”
Bonn, Edinburgh, Leeds, Lund, Oxford, and Paris
Principal Investigator, 1998 - 2004
Chair, Steering Committee on International Series of Conferences “Fundamentals of Computation Theory” (FCT)
Principal Investigator, since 1999
Project PROCOPE 333587 on “Design and Analysis of Randomized Approximation Algorithms for NP-Hard Optimization Problems”
Principal Investigator, 2004 - 2007
FP6 Marie Curie Research Training Network in Model Theory (512234), MODNET
Principal Investigator, since 2004
B-IT Research School, University of Bonn and RWTH Aachen, Research Area “Algorithm Design and Formal Foundations”
Principal Investigator and Project leader, since 2008
|Research Area G|
My research in the RA G evolved around the following main topics:
• Rapidly mixing Markov chains and path coupling with stopping times and general MCMC method.
• Mixing Time of Glauber Dynamics for sampling colorings.
• Efficient sampling methods for approximating selected NP-hard problems.
Several new results were obtained on the above topics, among other things, solving hitherto long time open problems in counting independent sets in hypergraphs and tree colorings.
|Research Area I (until 10/2012)|
My research area was focused on general tractability issues of algorithmic game theory and related issues, especially games on networks, rank aggregation, and feedback arc set tournament problems. On the above topics, among other things, we were able to construct the first efficient approximation scheme of the fragile minimization problems including certain constraint forms of rigidity, and correlation clustering problem. More recent results involve design of the best up to now exact algorithms for Feedback Arc Set Tournament (FAST), Kemeny Rank Aggregation and the Betweenness Tournament problems.
|Former Research Area K|
The research within that topic was concerned with selected problems of combinatorial optimization, especially the problems of network design and facility location, multicast Steiner Tree problems, general clustering and partitioning problems (related paper: ) as well as on the methods for approximating nonlinear Smooth Integer Polynomial Programs (SIPPs) and related optimization problems . One of the main trusts of our investigations was devoted to the problems of approximation tractability of TSP and Generalized Steiner Tree (GST) problems and getting better approximation ratios for those problems.
My research is planned to be continued on the above topics in the new RA KL.
|Former Research Area L|
The research within that topic was focused on fundamental problems of computational complexity of exact and approximate computation, the underlying nature of computational feasibility and intractability, and design of efficient approximation algorithms (see related papers: , , ). We focused also on new mathematical paradigms for designing efficient sublinear time approximation algorithms for CSP problems, and also some aspects of algorithmic game theory . We studied Markov Chain Monte Carlo (MCMC) based algorithms for various counting problems. We studied also the deterministic computation complexity of the well-known problem of factoring polynomial over finite field and its intimate connection to the Generalized Riemann Hypothesis (GRH).
This research will be continued on the aforementioned topics in the new RA KL.
] Marek Karpinski, Alexander Zelikovsky
New approximation algorithms for the Steiner tree problems
J. Comb. Optim. , 1: (1): 47--65
] Sanjeev Arora, David Karger, Marek Karpinski
Polynomial time approximation schemes for dense instances of NP-hard problems
J. Comput. System Sci. , 58: (1): 193--210
] Noga Alon, W. Fernandez de la Vega, Ravi Kannan, Marek Karpinski
Random sampling and approximation of MAX-CSPs
Special issue on STOC2002 (Montreal, QC)
J. Comput. System Sci. , 67: (2): 212--243
] Lars Engebretsen, Marek Karpinski
TSP with bounded metrics
J. Comput. System Sci. , 72: (4): 509--546
] M. Karpinski
Polynomial time approximation schemes for some dense instances of NP-hard optimization problems
Approximation algorithms for combinatorial optimization problems
Algorithmica , 30: (3): 386--397
] M. Karpinski, W. Schudy
Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems
Proceedings of the 41st ACM Symposium on Theory of Computing (STOC)
] Gábor Ivanyos, Marek Karpinski, Nitin Saxena
Deterministic polynomial time algorithms for matrix completion problems
SIAM J. Comput. , 39: (8): 3736--3751
] Marek Karpinski, Angus Macintyre
Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
1st Annual Dagstuhl Seminar on Neural Computing (1994)
J. Comput. System Sci. , 54: (1, part 2): 169--176
] Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski
The mixing time of Glauber dynamics for coloring regular trees
Random Structures Algorithms , 36: (4): 464--476
] Piotr Berman, Marek Karpinski, Alexander Zelikovsky
A 3/2-approximation algorithm for generalized Steiner trees in complete graphs with edge lengths 1 and 2
Algorithms and computation. Part I
of Lecture Notes in Comput. Sci. : 15--24
Publisher: Springer, Berlin
• Electronic Colloquium on Computational Complexity (since 1983)
• Fundamenta Informaticae (1994 - 2010)
• Journal of Combinatorial Optimization (since 1995)
• Compendium of NP Optimization Problems (since 1999)
Prize of the Polish Mathematical Society
Venia Legendi Annual Research Prize
Award of the Polish Academy of Sciences
Special IBM T.J. Watson Research Grant
Humboldt Research Award
Senior Visiting Research Fellow, Merton College, Oxford University, England, UK
Max Planck Research Award
IHES European Fellowship
Member of the Academia Europaea