| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 6 |      | Konstantin Kutzkov: An exact exponential time algorithm for counting bipartite cliques. Inf. Process. Lett. 112(13): 535-539 (2012) |
| 2011 | ||
| 5 | | Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh: Frequent Pairs in Data Streams: Exploiting Parallelism and Skew. ICDM Workshops 2011: 145-150 |
| 2010 | ||
| 4 | | Konstantin Kutzkov, Dominik Scheder: Using CSP To Improve Deterministic 3-SAT CoRR abs/1007.1166: (2010) |
| 2007 | ||
| 3 | | Alexander S. Kulikov, Konstantin Kutzkov: New Bounds for MAX-SAT by Clause Learning. CSR 2007: 194-204 |
| 2 | | Konstantin Kutzkov: New upper bound for the #3-SAT problem. Inf. Process. Lett. 105(1): 1-5 (2007) |
| 2006 | ||
| 1 | | Konstantin Kutzkov: A Note on the Use of Independent Sets for the k-SAT Problem. JSAT 1(2): 143-145 (2006) |
| 1 | Andrea Campagna | [5] |
| 2 | Alexander S. Kulikov | [3] |
| 3 | Rasmus Pagh | [5] |
| 4 | Dominik Scheder | [4] |
Colors in the list of coauthors
Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page