Andrzej Lingas
91 – 100 of 132
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2007
-
Mark
Approximating the maximum clique minor and some subgraph homeomorphism problems.
(
- Contribution to journal › Article
-
Mark
Finding a heaviest triangle is not harder than matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
On exact complexity of subgraph homeomorphism
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
(
- Contribution to journal › Article
-
Mark
Note on covering monotone orthogonal polygons with star-shaped polygons
(
- Contribution to journal › Article
-
Mark
Approximating the maximum independent set and minimum vertex coloring on box graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2006
-
Mark
Performing work in broadcast networks
(
- Contribution to journal › Article
-
Mark
On the approximability of maximum and minimum edge clique partition problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Finding a heaviest triangle is no harder than matrix multiplication
2006) In Electronic Colloquium on Computational Complexity(
- Book/Report › Report
-
Mark
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
(
- Contribution to journal › Article