11 – 20 of 27
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2017
-
Mark
A fast deterministic detection of small pattern graphs in graphs without large cliques
2017) 11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10167 LNCS. p.217-227(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2015
-
Mark
Induced subgraph isomorphism: Are some patterns substantially easier than others?
(
- Contribution to journal › Article
-
Mark
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows
(
- Contribution to journal › Article
- 2014
-
Mark
A note on a QPTAS for maximum weight triangulation of planar point sets
(
- Contribution to journal › Article
-
Mark
Iterative merging heuristics for correlation clustering
(
- Contribution to journal › Article
-
Mark
3D Rectangulations and Geometric Matrix Multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2013
-
Mark
Unique subgraphs are not easier to find
(
- Contribution to journal › Article
- 2012
-
Mark
An Approximation Algorithm for Directed Shallow Steiner Trees
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2011
-
Mark
A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
(
- Contribution to journal › Article
- 2009
-
Mark
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
(
- Contribution to journal › Article