Publications | Lund University Publications

1 – 5 of 5

show: 10
|
sort: year (new to old)

News feed Embed this list Save this search Mark all Export

Cancel

Embed this list

copy and paste the html snippet below into your own page:

<iframe src="https://lup.lub.lu.se/search/publication?embed=1&q=keywords+exact+%22Induced+subgraph+isomorphism%22&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

2019
Mark A fast deterministic detection of small pattern graphs in graphs without large cliques
Kowaluk, Mirosław and Lingas, Andrzej ^LU (2019) In Theoretical Computer Science 770. p.79-87
- Contribution to journal › Article
2018
Mark Are unique subgraphs not easier to find?
Kowaluk, Mirosław and Lingas, Andrzej ^LU (2018) In Information Processing Letters 134. p.57-61
- Contribution to journal › Article
2017
Mark A fast deterministic detection of small pattern graphs in graphs without large cliques
Kowaluk, Mirosław and Lingas, Andrzej ^LU (2017) 11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10167 LNCS. p.217-227
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2015
Mark Induced subgraph isomorphism: Are some patterns substantially easier than others?
Floderus, Peter ^LU ; Kowaluk, Miroslaw ; Lingas, Andrzej ^LU and Lundell, Eva-Marta ^LU (2015) In Theoretical Computer Science 605. p.119-128
- Contribution to journal › Article
2013
Mark Unique subgraphs are not easier to find
Kowaluk, Miroslaw ; Lingas, Andrzej ^LU and Lundell, Eva-Marta ^LU (2013) In International Journal of Computer Mathematics 90(6). p.1247-1253
- Contribution to journal › Article

your query:: Remove keywords: Induced subgraph isomorphism