Computer Science
71 – 80 of 183
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2007
-
Mark
Approximate distance oracles for graphs with dense clusters
Andersson, Mattias LU ; Gudmundsson, Joachim and Levcopoulos, Christos LU
(2007)
In Computational Geometry
37(3).
p.142-154
- Contribution to journal › Article
-
Mark
On exact complexity of subgraph homeomorphism
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Finding a heaviest triangle is not harder than matrix multiplication
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Fourier meets Möbius: fast subset convolution
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
CP-LP Hybrid Method for Unique Shortest Path Routing Optimization
Wallander, Mats Petter LU ; Szymanek, Radoslaw and Kuchcinski, Krzysztof LU
(2007)
International Network Optimization Conference INOC 2007
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2006
-
Mark
Exact algorithms for exact satisfiability and number of perfect matchings
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Performing work in broadcast networks
- Contribution to journal › Article
-
Mark
Fixed-Parameter Algorithms for Optimal Convex Partitions and Other Results
(2006)
- Thesis › Doctoral thesis (compilation)
-
Mark
Approximation and Online Algorithms with Applications in Computational Biology and Computational Geometry
(2006)
- Thesis › Doctoral thesis (compilation)
-
Mark
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
Klein, Rolf ; Levcopoulos, Christos LU
and Lingas, Andrzej
LU
(2006)
In Computational Geometry
34(1).
p.28-34
- Contribution to journal › Article