1 – 50 of 132
- show: 50
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2024
-
Mark
Perpetual maintenance of machines with different urgency requirements
(
- Contribution to journal › Article
- 2023
-
Mark
On parallel time in population protocols
(
- 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
-
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
Finding Small Complete Subgraphs Efficiently
2023) 34th International Workshop on Combinatorial Algorithms, IWOCA 2023 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13889 LNCS. p.185-196(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Lower Bounds for Monotone q-Multilinear Boolean Circuits
2023) 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13878 LNCS. p.301-312(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Online and Approximate Network Construction from Bounded Connectivity Constraints
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
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs
2022) 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13179 LNCS. p.140-151(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
-
Mark
Lower bounds for Boolean circuits of bounded negation width
(
- Contribution to journal › Article
-
Mark
Perpetual maintenance of machines with different urgency requirements
2022)(
- Book/Report › Report
-
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
-
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
-
Mark
Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism
2021) 11th Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021 In Procedia Computer Science 195. p.163-171(
- Contribution to journal › Article
-
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
- 2020
-
Mark
Graphs with equal domination and covering numbers
(
- Contribution to journal › Article
-
Mark
Solving Hard Problems by Protein Folding?
2020) 9th International Conference on Theory and Practice of Natural Computing, TPNC 2020 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12494 LNCS. p.36-41(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A simple approach to nondecreasing paths
(
- Contribution to journal › Article
-
Mark
Computing the boolean product of two n × n boolean matrices using o(N2) mechanical operations
(
- Contribution to journal › Article
-
Mark
Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
(
- Contribution to journal › Article
- 2019
-
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
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
(
- Contribution to journal › Article
-
Mark
On a Fire Fighter’s Problem
(
- Contribution to journal › Article
-
Mark
A fast deterministic detection of small pattern graphs in graphs without large cliques
(
- Contribution to journal › Article
-
Mark
Clearing directed subgraphs by mobile agents : Variations on covering with paths
(
- 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
-
Mark
Lower bounds for Demorgan circuits of bounded negation width
2019) 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019 In Leibniz International Proceedings in Informatics, LIPIcs 126.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2018
-
Mark
3D Rectangulations and Geometric Matrix Multiplication
(
- Contribution to journal › Article
-
Mark
Determining the consistency of resolved triplets and fan triplets
(
- Contribution to journal › Article
-
Mark
Approximation schemes for capacitated geometric network design
(
- Contribution to journal › Article
-
Mark
Extreme Witnesses and Their Applications
(
- Contribution to journal › Article
-
Mark
A QPTAS for the base of the number of crossing-free structures on a planar point set
(
- Contribution to journal › Article
-
Mark
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
(
- Contribution to journal › Article
-
Mark
Forest-like abstract Voronoi diagrams in linear time
(
- Contribution to journal › Article
-
Mark
Are unique subgraphs not easier to find?
(
- Contribution to journal › Article
- 2017
-
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
-
Mark
Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution
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.401-411(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
-
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
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)
2017) 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2017 10139. p.229-240(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Efficiently Correcting Matrix Products
(
- Contribution to journal › Article
-
Mark
The snow team problem : (Clearing Directed subgraphs by mobile agents)
2017) 21th International Symposium on Fundamentals of Computation Theory, FCT 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10472 LNCS. p.190-203(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2016
-
Mark
Efficiently Correcting Matrix Products (arXiv 2016)
2016)(
- Book/Report › Report
- 2015
-
Mark
Detecting and Counting Small Pattern Graphs
(
- Contribution to journal › Article
-
Mark
Detecting monomials with k distinct variables
(
- Contribution to journal › Article
-
Mark
Induced subgraph isomorphism: Are some patterns substantially easier than others?
(
- Contribution to journal › Article
-
Mark
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows
(
- Contribution to journal › Article