Publications | Lund University Publications

21 – 27 of 27

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+%22Time+Complexity%22&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

« previous
1
2
3
next »

2009
Mark Faster multi-witnesses for Boolean matrix multiplication
Gasieniec, Leszek ; Kowaluk, Miroslaw and Lingas, Andrzej ^LU (2009) In Information Processing Letters 109(4). p.242-247
- Contribution to journal › Article
Mark An exact algorithm for subgraph homeomorphism
Lingas, Andrzej ^LU and Wahlén, Martin ^LU (2009) In Journal of Discrete Algorithms 7(4). p.464-468
- Contribution to journal › Article
Mark Algorithmic Graph Problems - From Computer Networks to Graph Embeddings
Wahlén, Martin ^LU (2009)
- Thesis › Doctoral thesis (compilation)
2007
Mark Polynomial-time algorithms for the ordered maximum agreement subtree problem
Dessmark, Anders ^LU ; Jansson, Jesper ^LU ; Lingas, Andrzej ^LU and Lundell, Eva-Marta ^LU (2007) In Algorithmica 48(3). p.233-248
- Contribution to journal › Article
Mark Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Czumaj, Artur ; Kowaluk, Miroslaw and Lingas, Andrzej ^LU (2007) In Theoretical Computer Science 380(1-2). p.37-46
- Contribution to journal › Article
2004
Mark A fixed parameter algorithm for the minimum number convex partition problem
Grantson Borgelt, Magdalene ^LU and Levcopoulos, Christos ^LU (2004) 3742. p.83-94
- Chapter in Book/Report/Conference proceeding › Book chapter
1998
Mark New Results on Combinatorial Algorithms
Dessmark, Anders ^LU (1998)
- Thesis › Doctoral thesis (monograph)

« previous
1
2
3
next »

your query:: Remove keywords: Time Complexity