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


201Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina Bazgan, Marek Karpinski: On the Complexity of Global Constraint Satisfaction. ISAAC 2005: 624-633
179Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski: Polynomial time approximation schemes for dense instances of minimum constraint satisfaction. Random Struct. Algorithms 23(1): 73-91 (2003)
171Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski: Approximability of Dense Instances of NEAREST CODEWORD Problem. SWAT 2002: 298-307
150Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski: Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint Satisfaction Electronic Colloquium on Computational Complexity (ECCC) 8(34): (2001)
138Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski: Approximability of Dense Instances of NEAREST CODEWORD Problem Electronic Colloquium on Computational Complexity (ECCC) 7(91): (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