Page 1 from 38 hits

Sort by: Relevancy | Currentness | Title

  1.  

    Limits of CSP problems and efficient parameter testing

    Karpinski, Marek / Marko, Roland | TIBKAT | 2014
  2.  

    New inapproximability bounds for TSP

    Karpiński, Marek / Lampis, Michael / Schmied, Richard | TIBKAT | 2013
  3.  

    Approximation hardness of graphes TSP on cubic graphs

    Karpiński, Marek / Schmied, Richard | TIBKAT | 2014
  4.  

    Analysis of hypergraph transformation systems in AGG based on M-functors : extended version

    Maximova, Maria / Ehrig, Hartmut / Ermel, Claudia | TIBKAT | 2013
  5.  

    Improved approximation lower bounds for vertex cover on power law graphs and some generalizations

    Gast, Mikael / Hauptmann, Mathias / Karpiński, Marek | TIBKAT | 2012
  6.  

    Approximate counting of matchings in sparse hypergraphs

    Karpiński, Marek / Ruciński, Andrzej / Szymańska, Eliza | TIBKAT | 2012
  7.  

    Contextual rewriting

    Weidenbach, Christoph / Wischnewski, Patrick | TIBKAT | 2009
  8.  

    A compendium on Steiner Tree Problems

    Hauptmann, Mathias / Karpiński, Marek | TIBKAT | 2013
  9.  

    Separability in persistent Petri nets : Bericht

    Best, Eike / Darondeau, Philippe | TIBKAT | 2009
  10.  

    From gestalt theory to image analysis : a probabilistic approach

    Desolneux, Agnès / Moisan, Lionel / Morel, Jean-Michel | TIBKAT | 2008
  11.  

    Methods in the local theory of packing and covering lattices

    Schürmann, Achill / Vallentin, Frank | TIBKAT | 2004
  12.  

    Finite and infinite lattice packings

    Henk, Martin | TIBKAT | 2004

Number of results: 10 | 20 | 50