71 – 80 of 470
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2019
-
Mark
A fast deterministic detection of small pattern graphs in graphs without large cliques
(
- Contribution to journal › Article
-
Mark
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
(
- Contribution to journal › Article
-
Mark
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
(
- Contribution to journal › Article
-
Mark
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Multivariate Analysis of Orthogonal Range Searching and Graph Distances
2019) 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). In LIPIcs 115. p.1-13(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
-
Mark
Preface
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 LNCS.(
- Chapter in Book/Report/Conference proceeding › Preface to conference proceeding
-
Mark
Fundamentals of Computation Theory : 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings
(2019) 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14 In Lecture Notes in Computer Science 11651.
- Book/Report › Book
-
Mark
Approximate counting of K-paths : Deterministic and in polynomial space
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors
2019) 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 In Leibniz International Proceedings in Informatics (LIPIcs) 132. p.1-25(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding