1 – 10 of 11
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2020
-
Mark
Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
(
- Contribution to journal › Article
- 2019
-
Mark
A fast deterministic detection of small pattern graphs in graphs without large cliques
(
- Contribution to journal › Article
- 2018
-
Mark
A QPTAS for the base of the number of crossing-free structures on a planar point set
(
- Contribution to journal › Article
- 2015
-
Mark
Induced subgraph isomorphism: Are some patterns substantially easier than others?
(
- Contribution to journal › Article
-
Mark
On the proper orientation number of bipartite graphs
(
- Contribution to journal › Article
- 2011
-
Mark
Specifications for decidable hybrid games
(
- Contribution to journal › Article
- 2009
-
Mark
On the complexity of approximating the Hadwiger number
(
- Contribution to journal › Article
- 2007
-
Mark
Approximating the maximum clique minor and some subgraph homeomorphism problems.
(
- Contribution to journal › Article
-
Mark
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
(
- Contribution to journal › Article
- 2004
-
Mark
Optimal graph exploration without good maps
(
- Contribution to journal › Article