Page 1 from 82 hits

Sort by: Relevancy | Date newest | Title A-Z

  1.  

    Limits of CSP problems and efficient parameter testing

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

    On the approximability of independent set problem on power law graphs

    Hauptmann, Mathias / Karpinski, Marek | TIBKAT | 2015
  3.  

    Approximation hardness of graphes TSP on cubic graphs

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

    New inapproximability bounds for TSP

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

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

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

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

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

    Approximate counting of matchings in sparse hypergraphs

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

    Contextual rewriting

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

    A compendium on Steiner Tree Problems

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

    Characterisation of the state spaces of marked graph Petri nets

    Best, Eike / Devillers, Raymond | TIBKAT | 2014
  11.  

    Separability in persistent Petri nets : Bericht

    Best, Eike / Darondeau, Philippe | TIBKAT | 2009

Number of results: 10 | 20 | 50