What is he best known for?
The fields of study he is best known for:
- Algorithm
- Combinatorics
- Discrete mathematics
His primary areas of investigation include Discrete mathematics, Combinatorics, Time complexity, Bounded function and Algorithm.
The concepts of his Discrete mathematics study are interwoven with issues in Polynomial, Exponential function and Constant.
His Combinatorics study frequently draws connections to adjacent fields such as Metric.
His work on Efficient algorithm is typically connected to Betweenness centrality as part of general Algorithm study, connecting several disciplines of science.
His studies in Steiner tree problem integrate themes in fields like Vantage-point tree, Metric tree and k-minimum spanning tree.
His work on Vertex cover as part of general Approximation algorithm study is frequently linked to Bogosort, therefore connecting diverse disciplines of science.
His most cited work include:
- An XOR-based erasure-resilient coding scheme (417 citations)
- Resolution for Quantified Boolean Formulas (268 citations)
- On Some Tighter Inapproximability Results (221 citations)
What are the main themes of his work throughout his whole career to date?
Marek Karpinski mainly investigates Combinatorics, Discrete mathematics, Time complexity, Approximation algorithm and Upper and lower bounds.
His Combinatorics study combines topics in areas such as Parallel algorithm and Bounded function.
His biological study focuses on Finite field.
His Time complexity research includes elements of Binary logarithm, Optimization problem, Mathematical optimization and Maximum cut.
His studies in Vertex cover and Polynomial-time approximation scheme are all subfields of Approximation algorithm research.
Marek Karpinski integrates Upper and lower bounds and Omega in his studies.
He most often published in these fields:
- Combinatorics (69.13%)
- Discrete mathematics (64.80%)
- Time complexity (20.15%)
What were the highlights of his more recent work (between 2009-2021)?
- Combinatorics (69.13%)
- Discrete mathematics (64.80%)
- Approximation algorithm (17.60%)
In recent papers he was focusing on the following fields of study:
Marek Karpinski spends much of his time researching Combinatorics, Discrete mathematics, Approximation algorithm, Time complexity and Upper and lower bounds.
His Combinatorics research integrates issues from Bounded function and Polynomial.
In Bounded function, he works on issues like Metric, which are connected to Travelling salesman problem and Mathematical optimization.
As part of his studies on Discrete mathematics, he frequently links adjacent subjects like Class.
His Approximation algorithm course of study focuses on Function and Constant.
His Time complexity research includes themes of Binary logarithm and Dynamic programming.
Between 2009 and 2021, his most popular works were:
- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament (54 citations)
- New inapproximability bounds for TSP (52 citations)
- Top-K color queries for document retrieval (39 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Combinatorics
- Discrete mathematics
Marek Karpinski focuses on Combinatorics, Discrete mathematics, Travelling salesman problem, Bounded function and Time complexity.
Marek Karpinski frequently studies issues relating to Element and Combinatorics.
Marek Karpinski has researched Discrete mathematics in several fields, including Algorithm, Approximation algorithm and Upper and lower bounds.
His Travelling salesman problem research incorporates elements of Cubic graph and Compression.
His Bounded function study incorporates themes from Degree and Metric.
His research in Time complexity intersects with topics in Hypergraph, Riemann hypothesis and Factorization of polynomials.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
