Marek Karpiński
Impact in
- Computational Theory and Mathematics top 0.2%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
-
- Computational Geometry and Mesh Generation
Papers in
-
- Complexity and Algorithms in Graphs 75
- Advanced Graph Theory Research 56
- semigroups and automata theory 19
- Polynomial and algebraic computation 17
-
- Machine Learning and Algorithms 32
- Algorithms and Data Compression 30
- Co-authors
- Piotr Berman (19 shared papers)David R. Karger (2 shared papers)Sanjeev Arora (2 shared papers)Alex Zelikovsky (7 shared papers)Michael Luby (4 shared papers)W. Fernandez de la Véga (8 shared papers)Angus Macintyre (5 shared papers)Lisa Hellerstein (6 shared papers)
- Journals
- Theoretical Computer Science (10 papers)Journal of Computer and System Sciences (7 papers)SIAM Journal on Computing (6 papers)Information and Computation (5 papers)Computational Complexity (5 papers)
- Partner nations
- GermanyUnited StatesFrance
In The Last Decade
Marek Karpiński
170 papers receiving 2.6k citations
Peers
Comparison fields: 5 of 94
- Computational Theory and Mathematics 1.6k
- Computer Graphics and Computer-Aided Design 234
- Discrete Mathematics and Combinatorics 173
- Computational Mathematics 29
- Computer Networks and Communications 921
Countries citing papers authored by Marek Karpiński
This map shows the geographic impact of Marek Karpiński's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Marek Karpiński with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marek Karpiński more than expected).
Fields of papers citing papers by Marek Karpiński
This network shows the impact of papers produced by Marek Karpiński. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Marek Karpiński. The network helps show where Marek Karpiński may publish in the future.
Co-authors
The 25 scholars most cited alongside Marek Karpiński, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 190 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | An XOR-based erasure-resilient coding scheme | 1995 | 300 |
| 2 | 1995 | 144 | |
| 3 | 1993 | 117 | |
| 4 | On Some Tighter Inapproximability Results | 1998 | 114 |
| 5 | 1995 | 108 | |
| 6 | 1997 | 102 | |
| 7 | 1999 | 100 | |
| 8 | 1990 | 95 | |
| 9 | 1997 | 87 | |
| 10 | 2003 | 83 | |
| 11 | Approximation Hardness of Short Symmetric Instances of MAX-3SAT. | 2003 | 68 |
| 12 | 1991 | 64 | |
| 13 | 2006 | 58 | |
| 14 | 1987 | 52 | |
| 15 | 2003 | 49 | |
| 16 | 2006 | 47 | |
| 17 | 2000 | 46 | |
| 18 | 1998 | 42 | |
| 19 | An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions. | 1997 | 38 |
| 20 | 2005 | 37 |
About Marek Karpiński
Marek Karpiński is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Computer Graphics and Computer-Aided Design and Molecular Biology, having authored 190 papers that have together received 2.8k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (75 papers), Advanced Graph Theory Research (56 papers), Machine Learning and Algorithms (32 papers), Algorithms and Data Compression (30 papers), Optimization and Search Problems (26 papers), Computational Geometry and Mesh Generation (21 papers), semigroups and automata theory (19 papers) and Polynomial and algebraic computation (17 papers). The work is most often cited by research in Computational Theory and Mathematics (1.6k citations), Computer Graphics and Computer-Aided Design (234 citations), Discrete Mathematics and Combinatorics (173 citations), Computational Mathematics (29 citations) and Computer Networks and Communications (921 citations). Marek Karpiński has collaborated with scholars based in Germany, United States and France. Frequent co-authors include Piotr Berman, David R. Karger, Sanjeev Arora, Alex Zelikovsky, Michael Luby, W. Fernandez de la Véga, Angus Macintyre, Lisa Hellerstein, Johannes Blömer and Richard M. Karp. Their work appears in journals such as Theoretical Computer Science, Journal of Computer and System Sciences, SIAM Journal on Computing, Information and Computation and Computational Complexity.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.