1 – 16 of 16
- show: 50
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2023
-
Mark
Online and Approximate Network Construction from Bounded Connectivity Constraints
2023) In International Journal of Foundations of Computer Science(
- Contribution to journal › Article
-
Mark
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique.
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2022
-
Mark
Efficient Assignment of Identities in Anonymous Populations
2022) 25th International Conference on Principles of Distributed Systems (OPODIS 2021) In Leibniz International Proceedings in Informatics (LIPIcs) 217. p.1-21(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2021
-
Mark
Online and Approximate Network Construction from Bounded Connectivity Constraints
2021) 12th International Conference on Algorithms and Complexity (CIAC 2021) In Lecture Notes in Computer science 12701. p.314-325(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases
(
- Contribution to journal › Article
- 2019
-
Mark
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
(
- 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
- 2018
-
Mark
Determining the consistency of resolved triplets and fan triplets
(
- Contribution to journal › Article
- 2017
-
Mark
Determining the consistency of resolved triplets and fan triplets
2017) 21st Annual International Conference on Research in Computational Molecular Biology, RECOMB 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10229 LNCS. p.82-98(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2011
-
Mark
Approximation algorithms for buy-at-bulk geometric network design
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2007
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Contribution to journal › Article
- 2006
-
Mark
On the approximability of maximum and minimum edge clique partition problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2004
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximation algorithms for Hamming clustering problems
(
- Contribution to journal › Article
- 2003
-
Mark
A fast algorithm for optimal alignment between similar ordered trees
(
- Contribution to journal › Article
- 2001
-
Mark
A fast algorithm for optimal alignment between similar ordered trees
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding