World's Best Scientists 2026 revealed!
Marek Karpinski

Marek Karpinski

D-Index & Metrics

Computer Science

D-Index
53
Citations
10065
World Ranking
4873
National Ranking
218

Mathematics

D-Index
51
Citations
9414
World Ranking
1033
National Ranking
53

Overview

Marek Karpinski is affiliated with the University of Bonn in Germany. Their research primarily contributes to the field of Computer Science, with a focus on several subfields including Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Management Science and Operations Research, Computer Networks and Communications, and Computer Vision and Pattern Recognition.

The main topics of their work encompass:

  • Advanced Graph Theory Research
  • Limits and Structures in Graph Theory
  • Graph Labeling and Dimension Problems
  • Game Theory and Applications
  • Complexity and Algorithms in Graphs
  • Computational Geometry and Mesh Generation
  • Graph theory and CDMA systems

Recent papers authored or co-authored by Marek Karpinski include:

  • "On Specific Factors in Graphs," 2020, published in Graphs and Combinatorics
  • "Domination Number of Graphs with Minimum Degree Five," 2021, published in DOAJ (DOAJ: Directory of Open Access Journals)
  • "On Grundy Total Domination Number in Product Graphs," 2021, published in DOAJ (DOAJ: Directory of Open Access Journals)
  • "On Rall's 1/2-conjecture on the domination game," 2020, published in Quaestiones Mathematicae
  • "Total mutual-visibility in Hamming graphs," 2024, published in Opuscula Mathematica

The scientist has frequently collaborated with other researchers, including:

  • Sandi Klavžar
  • Źsolt Tuza
  • Vesna Iršič
  • Pakanun Dokyeesun
  • Michael A. Henning

Their work has been published in a variety of venues, with significant contributions to:

  • arXiv (Cornell University)
  • Discrete Mathematics
  • Ars Mathematica Contemporanea
  • Discussiones Mathematicae Graph Theory
  • Graphs and Combinatorics

Best Publications

  • Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

    Sanjeev Arora;David Karger;Marek Karpinski

  • An XOR-based erasure-resilient coding scheme

    Johannes Blömer;Malik Kalfane;Richard Karp;Marek Karpinski

  • Resolution for Quantified Boolean Formulas

    H.K. Buning;M. Karpinski;A. Flogel

  • On Some Tighter Inapproximability Results

    Piotr Berman;Marek Karpinski

  • New Approximation Algorithms for the Steiner Tree Problems

    Marek Karpinski;Marek Karpinski;Alexander Zelikovsky

  • 1.375-Approximation Algorithm for Sorting by Reversals

    Piotr Berman;Sridhar Hannenhalli;Marek Karpinski

  • On Some Tighter Inapproximability Results (Extended Abstract)

    Piotr Berman;Marek Karpinski

  • Learning read-once formulas with queries

    Dana Angluin;Lisa Hellerstein;Marek Karpinski

  • Polynomial Bounds for VC Dimension of Sigmoidal and General Pfaffian Neural Networks

    Marek Karpinski;Angus Macintyre

  • Approximation schemes for clustering problems

    W. Fernandez de la Vega;Marek Karpinski;Claire Kenyon;Yuval Rabani

  • Approximation Hardness of Short Symmetric Instances of MAX-3SAT.

    Piotr Berman;Marek Karpinski;Alex D. Scott

  • 8/7-approximation algorithm for (1,2)-TSP

    Piotr Berman;Marek Karpinski

  • Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields

    Dima Yu Grigoriev;Marek Karpinski;Michael F. Singer

  • The matching problem for bipartite graphs with polynomially bounded permanents is in NC

    Dima Yu. Grigoriev;Marek Karpinski

  • Efficient algorithms for Lempel-Ziv encoding

    Leszek Gasieniec;Marek Karpinski;Wojciech Plandowski;Wojciech Rytter

  • Polynomial bounds for VC dimension of sigmoidal neural networks

    Marek Karpinski;Angus Macintyre

  • New inapproximability bounds for TSP

    Marek Karpinski;Michael Lampis;Richard Schmied

  • Random sampling and approximation of MAX-CSPs

    Noga Alon;W. Fernandez de la Vega;Ravi Kannan;Marek Karpinski

  • An exponential lower bound for depth 3 arithmetic circuits

    Dima Grigoriev;Marek Karpinski

  • Simulating Threshold Circuits by Majority Circuits

    Mikael Goldmann;Marek Karpinski

  • THE MATCHING PROBLEM FOR BIPARTITE GRAPHS WITH POLYNOMIALLY BOUNDED PERMANENTS IS IN NC (EXTENDED ABSTRACT)

    Dima Grigoriev;Marek Karpinski

Frequent Co-Authors

Piotr Berman
Piotr Berman Boston University
Alexander Zelikovsky
Alexander Zelikovsky Georgia State University
Wojciech Rytter
Wojciech Rytter University of Warsaw
Igor E. Shparlinski
Igor E. Shparlinski University of New South Wales
Martin Dyer
Martin Dyer University of Leeds
Bhaskar DasGupta
Bhaskar DasGupta University of Illinois at Chicago
Andrzej Ruciński
Andrzej Ruciński Adam Mickiewicz University in Poznań
Uriel Feige
Uriel Feige Weizmann Institute of Science
Ravi Kannan
Ravi Kannan Microsoft (United States)
Leszek Gasieniec
Leszek Gasieniec University of Liverpool

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in Mathematics in the USA, exploring related online degrees can open diverse career opportunities. Many professionals pivot to programs like 12 month mba programs to quickly gain business acumen alongside their quantitative skills. These intensive programs are designed for fast-tracking leadership roles.

Additionally, those looking to transfer credits from previous studies may find value in online mba programs that accept transfer credits. This flexibility helps save time and money while advancing education in management and analytics.

Data-driven careers are in high demand, making a data analytics masters a natural extension for math graduates. This degree sharpens skills in interpreting complex datasets, crucial for roles in tech, finance, and research.

For those seeking accessible entry points into business education, mba programs easy to get into provide options with less stringent admissions without sacrificing quality, enabling broader access to career advancement.

Best Scientists Citing Marek Karpinski

Trending Scientists