1 – 24 of 24
- show: 50
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2023
-
Mark
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
(
- Contribution to journal › Article
- 2022
-
Mark
A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms
(
- Contribution to journal › Article
- 2021
-
Mark
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases
(
- Contribution to journal › Article
- 2020
-
Mark
Computing the boolean product of two n × n boolean matrices using o(N2) mechanical operations
(
- Contribution to journal › Article
-
Mark
A simple approach to nondecreasing paths
(
- 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
3D Rectangulations and Geometric Matrix Multiplication
(
- Contribution to journal › Article
-
Mark
Are unique subgraphs not easier to find?
(
- Contribution to journal › Article
-
Mark
Extreme Witnesses and Their Applications
(
- Contribution to journal › Article
- 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
-
Mark
Bounds for semi-disjoint bilinear forms in a unit-cost computational model
2017) 14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10185 LNCS. p.412-424(
- 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
Faster multi-witnesses for Boolean matrix multiplication
(
- Contribution to journal › Article
-
Mark
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
(
- Contribution to journal › Article
-
Mark
An exact algorithm for subgraph homeomorphism
(
- Contribution to journal › Article
- 2007
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Contribution to journal › Article
-
Mark
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
(
- Contribution to journal › Article