Representation Theory 16Gxx [1] Alexander Chistov, G´abor Ivanyos, and Marek Karpinski, Polynomial time algorithms for modules over finite dimensional algebras, Proceedings of the 1997 International Symposium on Symboli

Source URL: magma.maths.usyd.edu.au

Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs Marek Karpinski∗ Richard Schmied†

Source URL: theory.cs.uni-bonn.de

On the Approximability of Independent Set Problem on Power Law Graphs Mathias Hauptmann∗ Marek Karpinski†

Source URL: theory.cs.uni-bonn.de

Limits of CSP Problems and Efficient Parameter Testing Marek Karpinski∗ Roland Mark´o†

Source URL: theory.cs.uni-bonn.de

Limits of CSP Problems and Efficient Parameter Testing (Revised Version) Marek Karpinski∗ Roland Mark´o†

Source URL: theory.cs.uni-bonn.de

Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs Magnus Bordewich∗, Martin Dyer∗ and Marek Karpinski† August 17, 2006 Abstract

Source URL: community.dur.ac.uk

• Markov processes
• Hypergraph
• Markov chain
• Stopping time
• Spectral theory

Randomized Splay Trees: Theoretical and Experimental Results Susanne Albers∗ Marek Karpinski†

Source URL: www14.in.tum.de

• Binary trees
• Splay tree
• Link/cut tree
• Optimal binary search tree

Approximability of Vertex Cover in Dense Bipartite Hypergraphs Jean Cardinal∗ Marek Karpinski‡

Source URL: theory.cs.uni-bonn.de

Approximating Vertex Cover in Dense Hypergraphs Jean Cardinal∗ Marek Karpinski‡

Source URL: theory.cs.uni-bonn.de

Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs Marek Karpinski∗ Richard Schmied†

Source URL: theory.cs.uni-bonn.de