dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Marek Karpinski (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


265Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin E. Dyer, Uriel Feige, Alan M. Frieze, Marek Karpinski: Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241). Dagstuhl Reports 1(6): 24-53 (2011)
161Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUriel Feige, Marek Karpinski, Michael Langberg: Improved approximation of Max-Cut on graphs of bounded degree. J. Algorithms 43(2): 201-219 (2002)
146Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUriel Feige, Marek Karpinski, Michael Langberg: A note on approximating Max-Bisection on regular graphs. Inf. Process. Lett. 79(4): 181-188 (2001)
143Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUriel Feige, Marek Karpinski, Michael Langberg: Improved Approximation of MAX-CUT on Graphs of Bounded Degree Electronic Colloquium on Computational Complexity (ECCC) 7(21): (2000)
142Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUriel Feige, Marek Karpinski, Michael Langberg: A Note on Approximating MAX-BISECTION on Regular Graphs Electronic Colloquium on Computational Complexity (ECCC) 7(43): (2000)

Selection of 5 from 280 records - Marek Karpinski has 122 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page