1 – 18 of 18
- show: 250
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2023
-
Mark
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products
2023) In International Journal of Foundations of Computer Science(
- Contribution to journal › Article
-
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
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products
2021) 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12601 LNCS. p.440-451(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2020
-
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
-
Mark
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
2019) 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 11651. p.322-334(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2018
-
Mark
Are unique subgraphs not easier to find?
(
- 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
- 2015
-
Mark
Detecting and Counting Small Pattern Graphs
(
- Contribution to journal › Article
-
Mark
Induced subgraph isomorphism: Are some patterns substantially easier than others?
(
- Contribution to journal › Article
- 2013
-
Mark
Counting and Detecting Small Subgraphs via Equations
(
- Contribution to journal › Article
-
Mark
Unique subgraphs are not easier to find
(
- Contribution to journal › Article
-
Mark
Detecting and Counting Small Pattern Graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2009
-
Mark
Faster multi-witnesses for Boolean matrix multiplication
(
- Contribution to journal › Article
- 2008
-
Mark
A path cover technique for LCAs in dags
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2007
-
Mark
Unique lowest common ancestors in dags are almost as easy as matrix multiplication
(
- 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