Publications | Lund University Publications

1 – 10 of 12

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=issn+exact+%220304-3975%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
next »

2025
Mark Deterministic protocols for Voronoi diagrams and triangulations of planar point sets on the congested clique
Jansson, Jesper ; Levcopoulos, Christos ^LU ; Lingas, Andrzej ^LU ; Polishchuk, Valentin and Xue, Quan (2025) In Theoretical Computer Science 1055.
- Contribution to journal › Article
2020
Mark Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
Lingas, Andrzej ^LU (2020) In Theoretical Computer Science 820. p.17-25
- Contribution to journal › Article
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 A QPTAS for the base of the number of crossing-free structures on a planar point set
Karpinski, Marek ; Lingas, Andrzej ^LU and Sledneu, Dzmitry ^LU (2018) In Theoretical Computer Science 711. p.56-65
- Contribution to journal › Article
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
Mark On the proper orientation number of bipartite graphs
Araujo, Julio ; Cohen, Nathann ; de Rezende, Susanna F. ^LU ; Havet, Frédéric and Moura, Phablo F.S. (2015) In Theoretical Computer Science 566(C). p.59-75
- Contribution to journal › Article
2011
Mark Specifications for decidable hybrid games
Vladimerou, Vladimeros ^LU ; Prabhakar, Pavithra ; Viswanathan, Mahesh and Dullerud, Geir (2011) In Theoretical Computer Science 412(48). p.6770-6785
- Contribution to journal › Article
2009
Mark On the complexity of approximating the Hadwiger number
Wahlén, Martin ^LU (2009) In Theoretical Computer Science 410(8-10). p.994-1000
- Contribution to journal › Article
2007
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
Mark Approximating the maximum clique minor and some subgraph homeomorphism problems.
Alon, Noga ; Lingas, Andrzej ^LU and Wahlén, Martin ^LU (2007) In Theoretical Computer Science 374(1-3). p.149-158
- Contribution to journal › Article

« previous
1
2
next »

your query:: Remove issn: 0304-3975