Andrzej Lingas
1 – 10 of 131
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2023
-
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
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products
2023) In International Journal of Foundations of Computer Science(
- Contribution to journal › Article
- 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
-
Mark
A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms
(
- Contribution to journal › Article
-
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
Perpetual maintenance of machines with different urgency requirements
2022)(
- Book/Report › Report
-
Mark
Lower bounds for Boolean circuits of bounded negation width
(
- 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
-
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